( en | de | ru )

 

Disambiguation of "Erven, Tim van"

Author of the publication

copydeleteadd this publication to your clipboard
Catching up faster by switching sooner: a predictive approach to adaptive estimation with an application to the AIC–BIC dilemma

, , and . Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74 (3): 361--417 (June 2012)
DOI: 10.1111/j.1467-9868.2011.01025.x

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthias Erven

Joachim Erven

Gabriele Erven

Matthias Erven

Tobias Erven

 

Other publications of authors with the same name

Lipschitz Adaptivity with Multiple Learning Rates in Online Learning., , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 2490-2511. PMLR, (2019)Follow the Leader with Dropout Perturbations., and . COLT, volume 35 of JMLR Workshop and Conference Proceedings, page 949-974. JMLR.org, (2014)Learning the Learning Rate for Prediction with Expert Advice., , and . NIPS, page 2294-2302. (2014)Catching Up Faster in Bayesian Model Selection and Model Averaging., , and . NIPS, page 417-424. Curran Associates, Inc., (2007)Distributed Online Learning for Joint Regret with Communication Constraints., , and . ALT, volume 167 of Proceedings of Machine Learning Research, page 1003-1042. PMLR, (2022)Adaptive Selective Sampling for Online Prediction with Experts., , and . CoRR, (2023)Follow the leader if you can, hedge if you must., , , and . J. Mach. Learn. Res., 15 (1): 1281-1316 (2014)Catching up faster by switching sooner: a predictive approach to adaptive estimation with an application to the AIC–BIC dilemma, , and . Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74 (3): 361--417 (June 2012)Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness., , , and . NeurIPS, (2022)Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning., , and . NIPS, page 4457-4465. (2016)