Yujia Jin

18 papers · 2019–2025 · 4 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (4) 🏃 Academic Marathon (6) 🐝 Cross-Pollinator (12) 🌈 Renaissance Researcher (5) 🗺️ Taxonomy Completionist (24) 🧬 Topic Evolution 🤝 Dynamic Duo (14) 🗃️ Keyword Collector (79) 💎 Century Club (18) 📈 Trend Setter 🔥 Unstoppable (7)

Conferences

NIPS (6) COLT (5) ICML (5) INTERSPEECH (2)

Top co-authors

Aaron Sidford (14) Yair Carmon (6) Arun Jambulapati (5) Kevin Tian (4) Jinsong Zhang (2) Alekh Agarwal (2) Ishani Karmarkar (2) Apoorv Vikram Singh (2) Christopher Musco (2) Yanlu Xie (2)

Keywords

convex optimization (4) oracle complexity (2) accelerated gradient (2) sample complexity (2) markov decision process (2) stochastic optimization (2) lipschitz function (2) average-reward mdp (2) policy optimization (2) minimax optimization (2) generative model (2) variance reduction (2) value iteration (1) random walk (1) nash equilibrium (1) interactive learning (1) stochastic gradient (1) optimal policy (1) matrix approximation (1) primal-dual optimization (1)

Papers

Catoni Contextual Bandits are Robust to Heavy-tailed Rewards ICML 2025

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm (Extended Abstract) COLT 2024

Truncated Variance Reduced Value Iteration NIPS 2024

Moments, Random Walks, and Limits for Spectrum Approximation COLT 2023

Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling ICML 2023

VO$Q$L: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation COLT 2023

A VR Interactive 3D Mandarin Pronunciation Teaching Model INTERSPEECH 2022

Optimal and Adaptive Monteiro-Svaiter Acceleration NIPS 2022

Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods COLT 2022

RECAPP: Crafting a More Efficient Catalyst for Convex Optimization ICML 2022

Stochastic Bias-Reduced Gradient Methods NIPS 2021

Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021

Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021

Acceleration with a Ball Optimization Oracle NIPS 2020

Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020

A Mandarin L2 Learning APP with Mispronunciation Detection and Feedback INTERSPEECH 2020

Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG NIPS 2019

Variance Reduction for Matrix Games NIPS 2019