Olivier Wintenberger

According to our database1, Olivier Wintenberger authored at least 21 papers between 2017 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation.
CoRR, February, 2026

2025
Asymptotic Normality of Infinite Centered Random Forests -Application to Imbalanced Classification.
CoRR, June, 2025

Minimax Adaptive Online Nonparametric Regression over Besov spaces.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Minimax-optimal and Locally-adaptive Online Nonparametric Regression.
Proceedings of the International Conference on Algorithmic Learning Theory, 2025

2024
Online Learning Approach for Survival Analysis.
CoRR, 2024

2023
Learning from time-dependent streaming data with online stochastic algorithms.
Trans. Mach. Learn. Res., 2023

Optimistic Dynamic Regret Bounds.
CoRR, 2023

2021
Stochastic Online Optimization using Kalman Recursion.
J. Mach. Learn. Res., 2021

Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Streaming Data.
CoRR, 2021

Recursive Estimation of State-Space Noise Covariance Matrix by Approximate Variational Bayes.
CoRR, 2021

Stochastic Online Convex Optimization; Application to probabilistic time series forecasting.
CoRR, 2021

2020
Kalman Recursions Aggregated Online.
CoRR, 2020

2019
Sparse regular variation.
CoRR, 2019

Logarithmic Regret for parameter-free Online Logistic Regression.
CoRR, 2019

2018
Rule Induction Partitioning Estimator.
CoRR, 2018

Efficient online algorithms for fast-rate regret bounds under sparsity.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Rule Induction Partitioning Estimator - A New Deterministic Algorithm for Data Dependent Partitioning Estimate.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2018

2017
Optimal learning with Bernstein online aggregation.
Mach. Learn., 2017

A Strongly Quasiconvex PAC-Bayesian Bound.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

Sparse Accelerated Exponential Weights.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017


  Loading...