Tomer Koren

Orcid: 0000-0002-9061-0448

Affiliations:
  • Tel Aviv University, Tel Aviv, Israel
  • Google Brain, Mountain View, CA, USA (former)
  • Technion, Haifa, Israel (former)


According to our database1, Tomer Koren authored at least 84 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Note on High-Probability Analysis of Algorithms with Exponential, Sub-Gaussian, and General Light Tails.
CoRR, 2024

How Free is Parameter-Free Stochastic Optimization?
CoRR, 2024

The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization.
CoRR, 2024

2023
Faster Convergence with Multiway Preferences.
CoRR, 2023

Locally Optimal Descent for Dynamic Stepsize Scheduling.
CoRR, 2023

Rate-Optimal Policy Optimization for Linear Markov Decision Processes.
CoRR, 2023

Tight Risk Bounds for Gradient Descent on Separable Data.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation.
Proceedings of the International Conference on Machine Learning, 2023

Regret Minimization and Convergence to Equilibria in General-sum Markov Games.
Proceedings of the International Conference on Machine Learning, 2023

SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance.
Proceedings of the International Conference on Machine Learning, 2023

Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime.
Proceedings of the International Conference on Machine Learning, 2023

Private Online Prediction from Experts: Separations and Faster Rates.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Dueling Convex Optimization with General Preferences.
CoRR, 2022

Benign Underfitting of Stochastic Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Rate-Optimal Online Convex Optimization in Adaptive Linear Control.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Better Best of Both Worlds Bounds for Bandits with Switching Costs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Stability vs Implicit Bias of Gradient Methods on Separable Data and Beyond.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Uniform Stability for First-Order Empirical Risk Minimization.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs.
CoRR, 2021

Private Stochastic Convex Optimization: Optimal Rates in 𝓁<sub>1</sub> Geometry.
CoRR, 2021

Multiplicative Reweighting for Robust Neural Network Optimization.
CoRR, 2021

The Instability of Accelerated Gradient Descent.
CoRR, 2021

Optimal Rates for Random Order Online Optimization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Towards Best-of-All-Worlds Online Learning with Feedback Graphs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Asynchronous Stochastic Optimization Robust to Arbitrary Delays.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Algorithmic Instabilities of Accelerated Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Never Go Full Batch (in Stochastic Convex Optimization).
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Dueling Convex Optimization.
Proceedings of the 38th International Conference on Machine Learning, 2021

Adversarial Dueling Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions.
Proceedings of the 38th International Conference on Machine Learning, 2021

Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with √T Regret.
Proceedings of the 38th International Conference on Machine Learning, 2021

Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry.
Proceedings of the 38th International Conference on Machine Learning, 2021

Lazy OCO: Online Convex Optimization on a Switching Budget.
Proceedings of the Conference on Learning Theory, 2021

Online Markov Decision Processes with Aggregate Bandit Feedback.
Proceedings of the Conference on Learning Theory, 2021

SGD Generalizes Better Than GD (And Regularization Doesn't Help).
Proceedings of the Conference on Learning Theory, 2021

2020
Holdout SGD: Byzantine Tolerant Federated Learning.
CoRR, 2020

Disentangling Adaptive Gradient Methods from Learning Rates.
CoRR, 2020

Second Order Optimization Made Practical.
CoRR, 2020

Private stochastic convex optimization: optimal rates in linear time.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Bandit Linear Control.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Prediction with Corrupted Expert Advice.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stochastic Optimization with Laggard Data Pipelines.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently.
Proceedings of the 37th International Conference on Machine Learning, 2020

Open Problem: Tight Convergence of SGD in Constant Dimension.
Proceedings of the Conference on Learning Theory, 2020

2019
Learning Linear-Quadratic Regulators Efficiently with only $\sqrt{T}$ Regret.
CoRR, 2019

Memory-Efficient Adaptive Optimization for Large-Scale Learning.
CoRR, 2019

Memory Efficient Adaptive Optimization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Robust Bi-Tempered Logistic Loss Based on Bregman Divergences.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Semi-Cyclic Stochastic Gradient Descent.
Proceedings of the 36th International Conference on Machine Learning, 2019

Learning Linear-Quadratic Regulators Efficiently with only √T Regret.
Proceedings of the 36th International Conference on Machine Learning, 2019

Better Algorithms for Stochastic Bandits with Adversarial Corruptions.
Proceedings of the Conference on Learning Theory, 2019

2018
Online Linear Quadratic Control.
Proceedings of the 35th International Conference on Machine Learning, 2018

Shampoo: Preconditioned Stochastic Tensor Optimization.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Chasing Ghosts: Competing with Stateful Policies.
SIAM J. Comput., 2017

A Unified Approach to Adaptive Regularization in Online and Stochastic Optimization.
CoRR, 2017

Multi-Armed Bandits with Metric Movement Costs.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Affine-Invariant Online Optimization and the Low-rank Experts Problem.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Bandits with Movement Costs and Adaptive Pricing.
Proceedings of the 30th Conference on Learning Theory, 2017

Tight Bounds for Bandit Combinatorial Optimization.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
A linear-time algorithm for trust region problems.
Math. Program., 2016

The computational power of optimization in online learning.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Online Pricing with Strategic and Patient Buyers.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

The Limits of Learning with Missing Data.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Online Learning with Feedback Graphs Without the Graphs.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Online Learning with Low Rank Experts.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Oracle-Based Robust Optimization via Online Learning.
Oper. Res., 2015

Fast Rates for Exp-concave Empirical Risk Minimization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Bandit Convex Optimization: \(\sqrt{T}\) Regret in One Dimension.
Proceedings of The 28th Conference on Learning Theory, 2015

Online Learning with Feedback Graphs: Beyond Bandits.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Bandits with switching costs: <i>T</i><sup>2/3</sup> regret.
Proceedings of the Symposium on Theory of Computing, 2014

The Blinded Bandit: Learning with Adaptive Feedback.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Logistic Regression: Tight Bounds for Stochastic and Online Optimization.
Proceedings of The 27th Conference on Learning Theory, 2014

Online Learning with Composite Loss Functions.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Bandits with Switching Costs: T^{2/3} Regret.
CoRR, 2013

Distributed Exploration in Multi-Armed Bandits.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Almost Optimal Exploration in Multi-Armed Bandits.
Proceedings of the 30th International Conference on Machine Learning, 2013

Open Problem: Fast Stochastic Exp-Concave Optimization.
Proceedings of the COLT 2013, 2013

2012
Linear Regression with Limited Observation.
Proceedings of the 29th International Conference on Machine Learning, 2012

Supervised system identification based on local PCA models.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes
CoRR, 2011

Beating SGD: Learning SVMs in Sublinear Time.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011


  Loading...