Skip to content
conftrace_

Uri Sherman

10 papers · 2021–2026 · 4 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓
+3 more ↓ πŸŒ‰ Interdisciplinary Bridge Β· Silver 🌍 Conference Polyglot Β· Bronze πŸƒ Academic Marathon Β· Sprint 🐣 Hot Topic Early Bird πŸ—ΊοΈ Taxonomy Completionist (15)
🀝 Dynamic Duo (10) πŸ’Ž Century Club Β· Bronze πŸ”₯ Unstoppable Β· Bronze

Venues

ICML (4) ALT (2) COLT (2) NeurIPS (2)

Top co-authors

Tomer Koren (10) Yishay Mansour (7) Matan Schliserman (2) Ran Levinstein (1) Tal Lancewicki (1) Nathan Srebro (1) Liad Erez (1) Roi Livni (1) Daniel Soudry (1) Alon Cohen (1)

Research topics

Machine Learning (8) Optimization & Theory Β· Machine Learning (8) Mathematics & Optimization (6) Optimization (6) Reinforcement Learning (4) Methods (4) Learning Types (3) Deep Learning (1) Optimization & Theory Β· Deep Learning (1)

Keywords

stochastic gradient descent (3) regret bound (3) online learning (2) online convex optimization (2) regret minimization (2) policy optimization (2) generalization bound (2) convex optimization (1) algorithmic stability (1) catastrophic forgetting (1) multi-agent learning (1) online mirror descent (1) convergence (1) linear function approximation (1) gradient descent (1) smoothness (1) mirror descent (1) bandit feedback (1) stochastic convex optimization (1) sample complexity (1)

Papers

From Continual Learning to SGD and Back: Better Rates for Continual Linear Models ALT 2026 The Hidden Cost of Approximation in Online Mirror Descent COLT 2026 Convergence of Policy Mirror Descent Beyond Compatible Function Approximation ICML 2025 The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization ALT 2025 Rate-Optimal Policy Optimization for Linear Markov Decision Processes ICML 2024 Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation ICML 2023 Regret Minimization and Convergence to Equilibria in General-sum Markov Games ICML 2023 Benign Underfitting of Stochastic Gradient Descent NeurIPS 2022 Lazy OCO: Online Convex Optimization on a Switching Budget COLT 2021 Optimal Rates for Random Order Online Optimization NeurIPS 2021