Skip to content
conftrace_

Yuan Zhou

62 papers · 2014–2026 · 14 venues · across top CS/AI venues

This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 19 separate collaboration groups - the largest holds only 42% of them. Pick the group below that matches the researcher you mean. How a shared name is split.

Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.

Which Yuan Zhou?

8 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.

with Jian Peng, Xi Chen, Yining Wang 26 papers · 2014–2025 · ICML, NeurIPS, ICLR Hide ▲
An LLM-Empowered Adaptive Evolutionary Algorithm for Multi-Component Deep Learning Systems AAAI 2025 Safety-Polarized and Prioritized Reinforcement Learning ICML 2025 Learning Sparse Group Models Through Boolean Relaxation ICLR 2023 Robust Situational Reinforcement Learning in Face of Context Disturbances ICML 2023 Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms IJCAI 2022 Imitation Learning from Observations under Transition Model Disparity ICLR 2022 Learning Long-Term Reward Redistribution via Randomized Return Decomposition ICLR 2022 Off-Policy Reinforcement Learning with Delayed Rewards ICML 2022 Proximal Exploration for Model-guided Protein Sequence Design ICML 2022 Near-Optimal MNL Bandits Under Risk Criteria AAAI 2021 Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021 A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020 Dynamic Assortment Optimization with Changing Contextual Information JMLR 2020 Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity CoRL 2020 Learning Guidance Rewards with Trajectory-space Smoothing NeurIPS 2020 Multinomial Logit Bandit with Low Switching Cost ICML 2020 Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank COLT 2020 Exploration via Hindsight Goal Generation NeurIPS 2019 Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019 Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy ICLR 2019 Thresholding Bandit with Optimal Aggregate Regret NeurIPS 2019 Best Arm Identification in Linear Bandits with Linear Dimension Dependency ICML 2018 Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NeurIPS 2018 Tight Bounds for Collaborative PAC Learning via Multiplicative Weights NeurIPS 2018 Adaptive Multiple-Arm Identification ICML 2017 Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing ICML 2014
11 papers whose co-authors appear nowhere else under this name