Tim van Erven

Orcid: 0000-0002-9200-1451

Affiliations:
  • University of Paris-Sud, Department of Mathematics


According to our database1, Tim van Erven authored at least 38 papers between 2007 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems.
CoRR, 2024

The Risks of Recourse in Binary Classification.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Attribution-based Explanations that Provide Recourse Cannot be Robust.
J. Mach. Learn. Res., 2023

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization.
CoRR, 2023

First- and Second-Order Bounds for Adversarial Linear Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Adaptive Selective Sampling for Online Prediction with Experts.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalization Guarantees via Algorithm-dependent Rademacher Complexity.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Modifying Squint for Prediction with Expert Advice in a Changing Environment.
CoRR, 2022

Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Scale-free Unconstrained Online Learning for Curved Losses.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Distributed Online Learning for Joint Regret with Communication Constraints.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning.
J. Mach. Learn. Res., 2021

Robust Online Convex Optimization in the Presence of Outliers.
Proceedings of the Conference on Learning Theory, 2021

2020
Explaining Predictions by Approximating the Local Decision Boundary.
CoRR, 2020

Open Problem: Fast and Optimal Online Portfolio Selection.
Proceedings of the Conference on Learning Theory, 2020

2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning.
Proceedings of the Conference on Learning Theory, 2019

2018
The Many Faces of Exponential Weights in Online Learning.
Proceedings of the Conference On Learning Theory, 2018

2016
Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

MetaGrad: Multiple Learning Rates in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Fast rates in statistical and online learning.
J. Mach. Learn. Res., 2015

Second-order Quantile Methods for Experts and Combinatorial Games.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Rényi Divergence and Kullback-Leibler Divergence.
IEEE Trans. Inf. Theory, 2014

Follow the leader if you can, hedge if you must.
J. Mach. Learn. Res., 2014

Learning the Learning Rate for Prediction with Expert Advice.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

A second-order bound with excess losses.
Proceedings of The 27th Conference on Learning Theory, 2014

Follow the Leader with Dropout Perturbations.
Proceedings of The 27th Conference on Learning Theory, 2014

2012
Mixability is Bayes Risk Curvature Relative to Log Loss.
J. Mach. Learn. Res., 2012

Mixability in Statistical Learning.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Adaptive Hedge.
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

2010
Freezing and Sleeping: Tracking Experts that Learn by Evolving Past Posteriors
CoRR, 2010

Switching between Hidden Markov Models using Fixed Share
CoRR, 2010

Rényi Divergence and Its Properties
CoRR, 2010

Rényi divergence and majorization.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Learning the Switching Rate by Discretising Bernoulli Sources Online.
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009

2008
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
CoRR, 2008

The Catch-Up Phenomenon.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007
Catching Up Faster in Bayesian Model Selection and Model Averaging.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007


  Loading...