On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. - Wei Chen 013; Shang-Hua Teng; Yajun Wang 001; Yuan Zhou 007 (FAW, 2009)

Tighter Bounds for Facility Games. - Pinyan Lu; Yajun Wang 001; Yuan Zhou 007 (WINE, 2009)

Optimal lower bounds for locality sensitive hashing (except when q is tiny). - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (Electron. Colloquium Comput. Complex., 2009)

Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set\

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. - Leizhen Cai; Yongxi Cheng; Elad Verbin; Yuan Zhou 007 (SIAM J. Discret. Math., 2010)

Black-Box Reductions in Mechanism Design. - Zhiyi Huang 002; Lei Wang 010; Yuan Zhou 007 (APPROX-RANDOM, 2011)

The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. - Ryan O'Donnell; John Wright 004; Yuan Zhou 007 (ICALP (1), 2011)

Finding Almost-Perfect Graph Bisections. - Venkatesan Guruswami; Yury Makarychev; Prasad Raghavendra; David Steurer; Yuan Zhou 007 (ICS, 2011)

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph - Aditya Bhaskara; Moses Charikar; Venkatesan Guruswami; Aravindan Vijayaraghavan; Yuan Zhou 007 (CoRR, 2011)

Approximation Algorithms and Hardness of the k-Route Cut Problem - Julia Chuzhoy; Yury Makarychev; Aravindan Vijayaraghavan; Yuan Zhou 007 (CoRR, 2011)

Linear programming, width-1 CSPs, and robust satisfaction. - Gábor Kun; Ryan O'Donnell; Suguru Tamaki; Yuichi Yoshida; Yuan Zhou 007 (ITCS, 2012)

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. - Aditya Bhaskara; Moses Charikar; Aravindan Vijayaraghavan; Venkatesan Guruswami; Yuan Zhou 007 (SODA, 2012)

Hypercontractivity, sum-of-squares proofs, and their applications. - Boaz Barak; Fernando G. S. L. Brandão; Aram W. Harrow; Jonathan A. Kelner; David Steurer; Yuan Zhou 007 (STOC, 2012)

Hypercontractive inequalities via SOS, with an application to Vertex-Cover - Manuel Kauers; Ryan O'Donnell; Li-Yang Tan; Yuan Zhou 007 (CoRR, 2012)

Approximating Bounded Occurrence Ordering CSPs. - Venkatesan Guruswami; Yuan Zhou 007 (Electron. Colloquium Comput. Complex., 2012)

Approximability and proof complexity. - Ryan O'Donnell; Yuan Zhou 007 (SODA, 2013)

Locally Testable Codes and Cayley Graphs. - Parikshit Gopalan; Salil P. Vadhan; Yuan Zhou 007 (Electron. Colloquium Comput. Complex., 2013)

Deterministic Coupon Collection and Better Strong Dispersers. - Raghu Meka; Omer Reingold; Yuan Zhou 007 (APPROX-RANDOM, 2014)

Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. - Madhur Tulsiani; John Wright 004; Yuan Zhou 007 (ICALP (1), 2014)

Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing. - Yuan Zhou 007; Xi Chen 010; Jian Li 015 (ICML, 2014)

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. - Yuichi Yoshida; Yuan Zhou 007 (ITCS, 2014)

Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. - Manuel Kauers; Ryan O'Donnell; Li-Yang Tan; Yuan Zhou 007 (SODA, 2014)

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs. - Ryan O'Donnell; John Wright 004; Chenggang Wu 003; Yuan Zhou 007 (SODA, 2014)

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. - Venkatesan Guruswami; Ali Kemal Sinop; Yuan Zhou 007 (SIAM J. Optim., 2014)

Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. - Konstantin Makarychev; Yury Makarychev; Yuan Zhou 007 (FOCS, 2015)

Satisfiability of Ordering CSPs Above Average. - Konstantin Makarychev; Yury Makarychev; Yuan Zhou 007 (CoRR, 2015)

Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders. - Xi Chen 010; Jiawei Zhang 006; Yuan Zhou 007 (Oper. Res., 2015)

Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (ACM Trans. Comput. Theory, 2015)

Approximation Algorithms and Hardness of the k-Route Cut Problem. - Julia Chuzhoy; Yury Makarychev; Aravindan Vijayaraghavan; Yuan Zhou 007 (ACM Trans. Algorithms, 2016)

Adaptive Multiple-Arm Identification. - Jiecao Chen; Xi Chen 010; Qin Zhang 001; Yuan Zhou 007 (ICML, 2017)

Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. - Xue Chen; Yuan Zhou 007 (SODA, 2017)

Best Arm Identification in Linear Bandits with Linear Dimension Dependency. - Chao Tao 003; Saúl A. Blanco; Yuan Zhou 007 (ICML, 2018)

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. - Jiecao Chen; Qin Zhang 001; Yuan Zhou 007 (NeurIPS, 2018)

Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models. - Yining Wang 001; Xi Chen 010; Yuan Zhou 007 (NeurIPS, 2018)

Dynamic Assortment Selection under the Nested Logit Models. - Xi Chen 010; Yining Wang 001; Yuan Zhou 007 (CoRR, 2018)

Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. - Chao Tao 003; Qin Zhang 001; Yuan Zhou 007 (FOCS, 2019)

Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy. - Yuan Xie 005; Boyi Liu 001; Qiang Liu 001; Zhaoran Wang 001; Yuan Zhou 007; Jian Peng 001 (ICLR (Poster), 2019)

Exploration via Hindsight Goal Generation. - Zhizhou Ren; Kefan Dong; Yuan Zhou 007; Qiang Liu 001; Jian Peng 001 (NeurIPS, 2019)

Thresholding Bandit with Optimal Aggregate Regret. - Chao Tao 003; Saúl A. Blanco; Jian Peng 001; Yuan Zhou 007 (NeurIPS, 2019)

Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. - Yingkai Li; Yining Wang 001; Yuan Zhou 007 (CoRR, 2019)

√n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. - Kefan Dong; Jian Peng 001; Yining Wang 001; Yuan Zhou 007 (CoRR, 2019)

Optimal Design of Process Flexibility for General Production Systems. - Xi Chen 010; Tengyu Ma 001; Jiawei Zhang 006; Yuan Zhou 007 (Oper. Res., 2019)

Adaptive Double-Exploration Tradeoff for Outlier Detection. - Xiaojin Zhang 002; Honglei Zhuang; Shengyu Zhang; Yuan Zhou 007 (AAAI, 2020)

A PTAS for the Bayesian Thresholding Bandit Problem. - Yue Qin; Jian Peng 001; Yuan Zhou 007 (AISTATS, 2020)

Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. - Kefan Dong; Jian Peng 001; Yining Wang 001; Yuan Zhou 007 (COLT, 2020)

Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity. - Tanmay Gangwani; Jian Peng 001; Yuan Zhou 007 (CoRL, 2020)

Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). - Nikolai Karpov; Qin Zhang 001; Yuan Zhou 007 (FOCS, 2020)

Multinomial Logit Bandit with Low Switching Cost. - Kefan Dong; Yingkai Li; Qin Zhang 001; Yuan Zhou 007 (ICML, 2020)

Learning Structural Genetic Information via Graph Neural Embedding. - Yuan Xie 005; Yulong Pei; Yun Lu; Haixu Tang; Yuan Zhou 007 (ISBRA, 2020)

Learning Guidance Rewards with Trajectory-space Smoothing. - Tanmay Gangwani; Yuan Zhou 007; Jian Peng 001 (NeurIPS, 2020)

Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition. - Zihan Zhang; Yuan Zhou 007; Xiangyang Ji (NeurIPS, 2020)

Collaborative Top Distribution Identifications with Limited Interaction. - Nikolai Karpov; Qin Zhang 001; Yuan Zhou 007 (CoRR, 2020)

Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition. - Zihan Zhang; Yuan Zhou 007; Xiangyang Ji (CoRR, 2020)

Efficient Competitive Self-Play Policy Optimization. - Yuanyi Zhong; Yuan Zhou 007; Jian Peng 001 (CoRR, 2020)

Dynamic Assortment Optimization with Changing Contextual Information. - Xi Chen 010; Yining Wang 001; Yuan Zhou 007 (J. Mach. Learn. Res., 2020)

Near-Optimal MNL Bandits Under Risk Criteria. - Guangyu Xi; Chao Tao 003; Yuan Zhou 007 (AAAI, 2021)

Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. - Yingkai Li; Yining Wang 001; Xi Chen 010; Yuan Zhou 007 (AISTATS, 2021)

Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity. - Zihan Zhang; Yuan Zhou 007; Xiangyang Ji (ICML, 2021)

Linear bandits with limited adaptivity and learning distributional optimal design. - Yufei Ruan; Jiaqi Yang 001; Yuan Zhou 007 (STOC, 2021)

Coordinate-wise Control Variates for Deep Policy Gradients. - Yuanyi Zhong; Yuan Zhou 007; Jian Peng 001 (CoRR, 2021)

Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models. - Xi Chen 010; Yining Wang 001; Yuan Zhou 007 (Math. Oper. Res., 2021)

Imitation Learning from Observations under Transition Model Disparity. - Tanmay Gangwani; Yuan Zhou 007; Jian Peng 001 (ICLR, 2022)

Learning Long-Term Reward Redistribution via Randomized Return Decomposition. - Zhizhou Ren; Ruihan Guo; Yuan Zhou 007; Jian Peng 001 (ICLR, 2022)

Off-Policy Reinforcement Learning with Delayed Rewards. - Beining Han; Zhizhou Ren; Zuofan Wu; Yuan Zhou 007; Jian Peng 001 (ICML, 2022)

Proximal Exploration for Model-guided Protein Sequence Design. - Zhizhou Ren; Jiahan Li; Fan Ding; Yuan Zhou 007; Jianzhu Ma; Jian Peng 001 (ICML, 2022)

Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms. - Zishuo Zhao; Xi Chen 010; Xuefeng Zhang; Yuan Zhou 007 (IJCAI, 2022)

Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning. - Zihan Zhang; Yuhang Jiang; Yuan Zhou 007; Xiangyang Ji (NeurIPS, 2022)

Fairness-aware Network Revenue Management with Demand Learning. - Xi Chen 010; Jiameng Lyu; Yining Wang 001; Yuan Zhou 007 (CoRR, 2022)

Bayesian-Nash-Incentive-Compatible Mechanism for Blockchain Transaction Fee Allocation. - Zishuo Zhao; Xi Chen 010; Yuan Zhou 007 (CoRR, 2022)

Assortment Optimization Under the Multivariate MNL Model. - Xin Chen 026; Jiachun Li; Menglong Li; Tiancheng Zhao; Yuan Zhou 007 (CoRR, 2022)

Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information. - Boxiao Chen; David Simchi-Levi; Yining Wang 001; Yuan Zhou 007 (Manag. Sci., 2022)

Personalized Pricing with Group Fairness Constraint. - Xin Chen 026; Zexing Xu; Zishuo Zhao; Yuan Zhou 007 (FAccT, 2023)

Learning Sparse Group Models Through Boolean Relaxation. - Yijie Wang; Yuan Zhou 007; Xiaoqing Huang; Kun Huang; Jie Zhang; Jianzhu Ma (ICLR, 2023)

Robust Situational Reinforcement Learning in Face of Context Disturbances. - Jinpeng Zhang; Yufeng Zheng; Chuheng Zhang; Li Zhao 007; Lei Song 001; Yuan Zhou 007; Jiang Bian 002 (ICML, 2023)

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems. - Jiameng Lyu; Shilin Yuan; Bingkun Zhou; Yuan Zhou 007 (CoRR, 2024)

A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy. - Jiameng Lyu; Jinxing Xie; Shilin Yuan; Yuan Zhou 007 (CoRR, 2024)

Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands. - Boxiao Chen; Yining Wang 001; Yuan Zhou 007 (Manag. Sci., 2024)

Asymptotic optimality of base-stock policies for lost-sales inventory systems with stochastic lead times. - Shilin Yuan; Jiameng Lyu; Jinxing Xie; Yuan Zhou 007 (Oper. Res. Lett., 2024)

Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. - Yingkai Li; Yining Wang 001; Yuan Zhou 007 (IEEE Trans. Inf. Theory, 2024)

Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits. - Zihan Zhang; Xiangyang Ji; Yuan Zhou 007 (ICLR, 2025)

Bayesian Mechanism Design for Blockchain Transaction Fee Allocation. - Xi Chen 010; David Simchi-Levi; Zishuo Zhao; Yuan Zhou 007 (Oper. Res., 2025)

A Minibatch Stochastic Gradient Descent-Based Learning Metapolicy for Inventory Systems with Myopic Optimal Policy. - Jiameng Lyu; Jinxing Xie; Shilin Yuan; Yuan Zhou 007 (Manag. Sci., 2025)