← Authors

Yinyu Ye

23 papers · 2017–2025 · 8 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (8) πŸƒ Academic Marathon (8) 🐝 Cross-Pollinator (14) 🌈 Renaissance Researcher (5) πŸ—ΊοΈ Taxonomy Completionist (39) πŸ† Grand Slam πŸ”₯ Unstoppable (5) ❓ The Questioner ⚑ Prolific Year (7) πŸ—ƒοΈ Keyword Collector (82) πŸ“ˆ Trend Setter πŸ’Ž Century Club (23)

Conferences

ICML (8) NIPS (7) AAAI (3) AISTATS (1) COLT (1) ICLR (1) JMLR (1) UAI (1)

Top co-authors

DongDong Ge (7) Wenzhi Gao (5) Mengdi Wang (4) Qi Deng (4) Chunlin Sun (4) Chenyu Xue (3) Chuwen Zhang (2) Yichen Chen (2) Xiaocheng Li (2) Lin Yang (2)

Keywords

linear programming (4) sample complexity (3) regret bound (3) reinforcement learning (2) nonconvex optimization (2) markov decision process (2) resource allocation (2) sparse optimization (2) newton method (2) distributionally robust optimization (2) imitation learning (1) primal-dual optimization (1) convergence analysis (1) optimal transport (1) online learning (1) game theory (1) column generation (1) convex optimization (1) value iteration (1) discount factor (1)

Papers

Gradient Methods with Online Scaling COLT 2025
Wait-Less Offline Tuning and Re-solving for Online Decision Making ICML 2025
Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent ICML 2025
Adam-mini: Use Fewer Learning Rates To Gain More ICLR 2025
A Homogenization Approach for Gradient-Dominated Stochastic Optimization UAI 2024
Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process NIPS 2024
Learning to Pivot as a Smart Expert AAAI 2024
Sketched Newton Value Iteration for Large-Scale Markov Decision Processes AAAI 2024
Trust Region Methods for Nonconvex Stochastic Optimization beyond Lipschitz Smoothness AAAI 2024
Decoupling Learning and Decision-Making: Breaking the $\mathcalO(\sqrtT)$ Barrier in Online Resource Allocation with First-Order Methods ICML 2024
A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes ICML 2024
Solving Linear Programs with Fast Online Learning Algorithms ICML 2023
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks ICML 2021
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity AISTATS 2020
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices NIPS 2020
Distributionally Robust Local Non-parametric Conditional Estimation NIPS 2020
Simple and Fast Algorithm for Binary Integer and Online Linear Programming NIPS 2020
Approximation Hardness for A Class of Sparse Optimization Problems JMLR 2019
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem NIPS 2019
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model NIPS 2018
Learning in Games with Lossy Feedback NIPS 2018
Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go? ICML 2018
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions ICML 2017