Yuan Zhou

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 62

Top Venues

Publications

Boxiao Chen, Yining Wang, Yuan Zhou
Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands. Manag. Sci. 70 (5) (2024)
Yingkai Li, Yining Wang, Yuan Zhou
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. IEEE Trans. Inf. Theory 70 (1) (2024)
Jiameng Lyu, Shilin Yuan, Bingkun Zhou, Yuan Zhou
Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems. CoRR (2024)
Beining Han, Zhizhou Ren, Zuofan Wu, Yuan Zhou, Jian Peng
Off-Policy Reinforcement Learning with Delayed Rewards. ICML (2022)
Tanmay Gangwani, Yuan Zhou, Jian Peng
Imitation Learning from Observations under Transition Model Disparity. ICLR (2022)
Zhizhou Ren, Jiahan Li, Fan Ding, Yuan Zhou, Jianzhu Ma, Jian Peng
Proximal Exploration for Model-guided Protein Sequence Design. ICML (2022)
Zihan Zhang, Yuhang Jiang, Yuan Zhou, Xiangyang Ji
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning. CoRR (2022)
Zhizhou Ren, Ruihan Guo, Yuan Zhou, Jian Peng
Learning Long-Term Reward Redistribution via Randomized Return Decomposition. ICLR (2022)
Tanmay Gangwani, Yuan Zhou, Jian Peng
Imitation Learning from Observations under Transition Model Disparity. CoRR (2022)
Yufei Ruan, Jiaqi Yang, Yuan Zhou
Linear bandits with limited adaptivity and learning distributional optimal design. STOC (2021)
Zihan Zhang, Xiangyang Ji, Yuan Zhou
Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits. CoRR (2021)
Zihan Zhang, Yuan Zhou, Xiangyang Ji
Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity. ICML (2021)
Yuanyi Zhong, Yuan Zhou, Jian Peng
Coordinate-wise Control Variates for Deep Policy Gradients. CoRR (2021)
Guangyu Xi, Chao Tao, Yuan Zhou
Near-Optimal MNL Bandits Under Risk Criteria. AAAI (2021)
Beining Han, Zhizhou Ren, Zuofan Wu, Yuan Zhou, Jian Peng
Off-Policy Reinforcement Learning with Delayed Rewards. CoRR (2021)
Yingkai Li, Yining Wang, Xi Chen, Yuan Zhou
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. AISTATS (2021)
Zhizhou Ren, Ruihan Guo, Yuan Zhou, Jian Peng
Learning Long-Term Reward Redistribution via Randomized Return Decomposition. CoRR (2021)
Yufei Ruan, Jiaqi Yang, Yuan Zhou
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design. CoRR (2020)
Yuan Xie, Yulong Pei, Yun Lu, Haixu Tang, Yuan Zhou
Learning Structural Genetic Information via Graph Neural Embedding. ISBRA (2020)
Zihan Zhang, Yuan Zhou, Xiangyang Ji
Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity. CoRR (2020)
Tanmay Gangwani, Yuan Zhou, Jian Peng
Learning Guidance Rewards with Trajectory-space Smoothing. NeurIPS (2020)
Yue Qin, Jian Peng, Yuan Zhou
A PTAS for the Bayesian Thresholding Bandit Problem. AISTATS (2020)
Zihan Zhang, Yuan Zhou, Xiangyang Ji
Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition. CoRR (2020)
Tanmay Gangwani, Jian Peng, Yuan Zhou
Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity. CoRL (2020)
Nikolai Karpov, Qin Zhang, Yuan Zhou
Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). FOCS (2020)
Yuanyi Zhong, Yuan Zhou, Jian Peng
Efficient Competitive Self-Play Policy Optimization. CoRR (2020)
Guangyu Xi, Chao Tao, Yuan Zhou
Near-Optimal MNL Bandits Under Risk Criteria. CoRR (2020)
Xiaojin Zhang, Honglei Zhuang, Shengyu Zhang, Yuan Zhou
Adaptive Double-Exploration Tradeoff for Outlier Detection. AAAI (2020)
Zihan Zhang, Yuan Zhou, Xiangyang Ji
Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition. NeurIPS (2020)
Kefan Dong, Jian Peng, Yining Wang, Yuan Zhou
Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. COLT (2020)
Tanmay Gangwani, Yuan Zhou, Jian Peng
Learning Guidance Rewards with Trajectory-space Smoothing. CoRR (2020)
Xi Chen, Yining Wang, Yuan Zhou
Dynamic Assortment Optimization with Changing Contextual Information. J. Mach. Learn. Res. 21 (2020)
Xiaojin Zhang, Honglei Zhuang, Shengyu Zhang, Yuan Zhou
Adaptive Double-Exploration Tradeoff for Outlier Detection. CoRR (2020)
Nikolai Karpov, Qin Zhang, Yuan Zhou
Collaborative Top Distribution Identifications with Limited Interaction. CoRR (2020)
Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou
Multinomial Logit Bandit with Low Switching Cost. CoRR (2020)
Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou
Multinomial Logit Bandit with Low Switching Cost. ICML (2020)
Tanmay Gangwani, Jian Peng, Yuan Zhou
Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity. CoRR (2020)
Kefan Dong, Jian Peng, Yining Wang, Yuan Zhou
√n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. CoRR (2019)
Chao Tao, Qin Zhang, Yuan Zhou
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Bandits. CoRR (2019)
Chao Tao, Saúl A. Blanco, Jian Peng, Yuan Zhou
Thresholding Bandit with Optimal Aggregate Regret. CoRR (2019)
Chao Tao, Qin Zhang, Yuan Zhou
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. FOCS (2019)
Zhizhou Ren, Kefan Dong, Yuan Zhou, Qiang Liu, Jian Peng
Exploration via Hindsight Goal Generation. NeurIPS (2019)
Yingkai Li, Yining Wang, Yuan Zhou
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. COLT (2019)
Zhizhou Ren, Kefan Dong, Yuan Zhou, Qiang Liu, Jian Peng
Exploration via Hindsight Goal Generation. CoRR (2019)
Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou
Optimal Design of Process Flexibility for General Production Systems. Oper. Res. 67 (2) (2019)
Yingkai Li, Yining Wang, Yuan Zhou
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. CoRR (2019)
Chao Tao, Saúl A. Blanco, Jian Peng, Yuan Zhou
Thresholding Bandit with Optimal Aggregate Regret. NeurIPS (2019)
Yingkai Li, Yining Wang, Yuan Zhou
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. CoRR (2019)
Yuan Xie, Boyi Liu, Qiang Liu, Zhaoran Wang, Yuan Zhou, Jian Peng
Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy. ICLR (Poster) (2019)
Yining Wang, Xi Chen, Yuan Zhou
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models. CoRR (2018)
Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou
Optimal Design of Process Flexibility for General Production Systems. CoRR (2018)
Chao Tao, Saúl A. Blanco, Yuan Zhou
Best Arm Identification in Linear Bandits with Linear Dimension Dependency. ICML (2018)
Xi Chen, Yining Wang, Yuan Zhou
Dynamic Assortment Selection under the Nested Logit Models. CoRR (2018)
Jiecao Chen, Qin Zhang, Yuan Zhou
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. NeurIPS (2018)
Xi Chen, Yining Wang, Yuan Zhou
Dynamic Assortment Optimization with Changing Contextual Information. CoRR (2018)
Yining Wang, Xi Chen, Yuan Zhou
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models. NeurIPS (2018)
Jiecao Chen, Qin Zhang, Yuan Zhou
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. CoRR (2018)
Yuan Xie, Boyi Liu, Qiang Liu, Zhaoran Wang, Yuan Zhou, Jian Peng
Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy. CoRR (2018)
Xue Chen, Yuan Zhou
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. SODA (2017)
Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou
Adaptive Multiple-Arm Identification. CoRR (2017)
Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou
Adaptive Multiple-Arm Identification. ICML (2017)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
-Route Cut Problem. ACM Trans. Algorithms 12 (1) (2016)
Xi Chen, Jiawei Zhang, Yuan Zhou
Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders. Oper. Res. 63 (5) (2015)
Xue Chen, Yuan Zhou
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. CoRR (2015)
Konstantin Makarychev, Yury Makarychev, Yuan Zhou
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. FOCS (2015)
Ryan O'Donnell, Yi Wu, Yuan Zhou
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. ACM Trans. Comput. Theory 7 (2) (2015)
Konstantin Makarychev, Yury Makarychev, Yuan Zhou
Satisfiability of Ordering CSPs Above Average. CoRR (2015)
Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou
Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs. CoRR (2014)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally testable codes and cayley graphs. ITCS (2014)
Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou
Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs. SODA (2014)
Ryan O'Donnell, Yi Wu, Yuan Zhou
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny). ACM Trans. Comput. Theory 6 (1) (2014)
Raghu Meka, Omer Reingold, Yuan Zhou
Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM (2014)
Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. SIAM J. Optim. 24 (4) (2014)
Madhur Tulsiani, John Wright, Yuan Zhou
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. ICALP (1) (2014)
Yuichi Yoshida, Yuan Zhou
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. ITCS (2014)
Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. SODA (2014)
Yuan Zhou, Xi Chen, Jian Li
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing. ICML (2014)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. 20 (2013)
Ryan O'Donnell, Yuan Zhou
Approximability and proof complexity. SODA (2013)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally Testable Codes and Cayley Graphs. CoRR (2013)
Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou
Hypercontractive inequalities via SOS, with an application to Vertex-Cover CoRR (2012)
Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou
-subgraph. SODA (2012)
Ryan O'Donnell, Yuan Zhou
Approximability and proof complexity CoRR (2012)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
-route cut problem. SODA (2012)
Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou
Hypercontractivity, sum-of-squares proofs, and their applications. STOC (2012)
Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou
Hypercontractivity, Sum-of-Squares Proofs, and their Applications CoRR (2012)
Venkatesan Guruswami, Yuan Zhou
Approximating Bounded Occurrence Ordering CSPs. APPROX-RANDOM (2012)
Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems CoRR (2012)
Venkatesan Guruswami, Yuan Zhou
Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set. Theory Comput. 8 (1) (2012)
Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou
Linear programming, width-1 CSPs, and robust satisfaction. ITCS (2012)
Venkatesan Guruswami, Yuan Zhou
Approximating Bounded Occurrence Ordering CSPs. Electron. Colloquium Comput. Complex. 19 (2012)
Ryan O'Donnell, Yi Wu, Yuan Zhou
Optimal lower bounds for locality sensitive hashing (except when q is tiny). ICS (2011)
Ryan O'Donnell, Yi Wu, Yuan Zhou
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. Computational Complexity Conference (2011)
Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph CoRR (2011)
Venkatesan Guruswami, Yuan Zhou
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set. SODA (2011)
Ryan O'Donnell, John Wright, Yuan Zhou
The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. ICALP (1) (2011)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
Approximation Algorithms and Hardness of the k-Route Cut Problem CoRR (2011)
Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou
Finding Almost-Perfect Graph Bisections. ICS (2011)
Zhiyi Huang, Lei Wang, Yuan Zhou
Black-Box Reductions in Mechanism Design. APPROX-RANDOM (2011)
Venkatesan Guruswami, Yuan Zhou
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}. Electron. Colloquium Comput. Complex. 17 (2010)

Yuan Zhou.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yuan Zhou