Yuan Zhou

Orcid: 0009-0008-1706-6539

Affiliations:
  • Tsinghua University, Yau Mathematical Sciences Center, Beijing, China
  • University of Illinois at Urbana-Champaign, Department of Industrial and Enterprise Systems Engineering, IL, USA (former)
  • Indiana University at Bloomington, IN, USA (former)
  • Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, MA, USA (former)
  • Carnegie Mellon University, Pittsburgh, PA, USA (former, PhD)


According to our database1, Yuan Zhou authored at least 80 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits.
IEEE Trans. Inf. Theory, January, 2024

Asymptotic optimality of base-stock policies for lost-sales inventory systems with stochastic lead times.
Oper. Res. Lett., 2024

Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands.
Manag. Sci., 2024

A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy.
CoRR, 2024

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems.
CoRR, 2024

2023
Robust Situational Reinforcement Learning in Face of Context Disturbances.
Proceedings of the International Conference on Machine Learning, 2023

Learning Sparse Group Models Through Boolean Relaxation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Personalized Pricing with Group Fairness Constraint.
Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

2022
Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information.
Manag. Sci., 2022

Assortment Optimization Under the Multivariate MNL Model.
CoRR, 2022

Bayesian-Nash-Incentive-Compatible Mechanism for Blockchain Transaction Fee Allocation.
CoRR, 2022

Fairness-aware Network Revenue Management with Demand Learning.
CoRR, 2022

Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Proximal Exploration for Model-guided Protein Sequence Design.
Proceedings of the International Conference on Machine Learning, 2022

Off-Policy Reinforcement Learning with Delayed Rewards.
Proceedings of the International Conference on Machine Learning, 2022

Learning Long-Term Reward Redistribution via Randomized Return Decomposition.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Imitation Learning from Observations under Transition Model Disparity.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models.
Math. Oper. Res., 2021

Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits.
CoRR, 2021

Coordinate-wise Control Variates for Deep Policy Gradients.
CoRR, 2021

Linear bandits with limited adaptivity and learning distributional optimal design.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity.
Proceedings of the 38th International Conference on Machine Learning, 2021

Tight Regret Bounds for Infinite-armed Linear Contextual Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Near-Optimal MNL Bandits Under Risk Criteria.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Dynamic Assortment Optimization with Changing Contextual Information.
J. Mach. Learn. Res., 2020

Efficient Competitive Self-Play Policy Optimization.
CoRR, 2020

Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition.
CoRR, 2020

Collaborative Top Distribution Identifications with Limited Interaction.
CoRR, 2020

Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning Guidance Rewards with Trajectory-space Smoothing.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning Structural Genetic Information via Graph Neural Embedding.
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

Multinomial Logit Bandit with Low Switching Cost.
Proceedings of the 37th International Conference on Machine Learning, 2020

Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract).
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity.
Proceedings of the 4th Conference on Robot Learning, 2020

Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank.
Proceedings of the Conference on Learning Theory, 2020

A PTAS for the Bayesian Thresholding Bandit Problem.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Adaptive Double-Exploration Tradeoff for Outlier Detection.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Optimal Design of Process Flexibility for General Production Systems.
Oper. Res., 2019

√n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank.
CoRR, 2019

Tight Regret Bounds for Infinite-armed Linear Contextual Bandits.
CoRR, 2019

Thresholding Bandit with Optimal Aggregate Regret.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Exploration via Hindsight Goal Generation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy.
Proceedings of the 7th International Conference on Learning Representations, 2019

Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Dynamic Assortment Selection under the Nested Logit Models.
CoRR, 2018

Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Best Arm Identification in Linear Bandits with Linear Dimension Dependency.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Adaptive Multiple-Arm Identification.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Approximation Algorithms and Hardness of the <i>k</i>-Route Cut Problem.
ACM Trans. Algorithms, 2016

2015
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups.
ACM Trans. Comput. Theory, 2015

Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders.
Oper. Res., 2015

Satisfiability of Ordering CSPs Above Average.
CoRR, 2015

Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems.
SIAM J. Optim., 2014

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Hypercontractive inequalities via SOS, and the Frankl-Rödl graph.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing.
Proceedings of the 31th International Conference on Machine Learning, 2014

Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Deterministic Coupon Collection and Better Strong Dispersers.
Proceedings of the Approximation, 2014

2013
Locally Testable Codes and Cayley Graphs.
Electron. Colloquium Comput. Complex., 2013

Approximability and proof complexity.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Approximating Bounded Occurrence Ordering CSPs.
Electron. Colloquium Comput. Complex., 2012

Hypercontractive inequalities via SOS, with an application to Vertex-Cover
CoRR, 2012

Hypercontractivity, sum-of-squares proofs, and their applications.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Polynomial integrality gaps for strong SDP relaxations of Densest <i>k</i>-subgraph.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Linear programming, width-1 CSPs, and robust satisfaction.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Approximation Algorithms and Hardness of the k-Route Cut Problem
CoRR, 2011

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
CoRR, 2011

Finding Almost-Perfect Graph Bisections.
Proceedings of the Innovations in Computer Science, 2011

The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Black-Box Reductions in Mechanism Design.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem.
SIAM J. Discret. Math., 2010

Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}.
Electron. Colloquium Comput. Complex., 2010

2009
Optimal lower bounds for locality sensitive hashing (except when q is tiny).
Electron. Colloquium Comput. Complex., 2009

Tighter Bounds for Facility Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009


  Loading...