activity
20052026
most citedContinuous invertibility and stable QML estimation of the EGARCH(1,1) model

75 citations · 235 across the 62 of their papers we have counts for

collaborators
Showing math.STShow all

28 papers · 1 filter

math.ST2026

High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch

Paul Liautaud, Pierre Gaillard, Olivier Wintenberger

We study nonparametric regression over Besov spaces from noisy observations under sub-exponential noise, aiming to achieve minimax-optimal guarantees on the integrated squared erro…

math.ST2025

Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate

Ferdinand Genans, Antoine Godichon-Baggioni, François-Xavier Vialard +1

We investigate the semi-discrete Optimal Transport (OT) problem, where a continuous source measure is transported to a discrete target measure , with particular attention to…

math.ST2025

Minimax Adaptive Online Nonparametric Regression over Besov Spaces

Paul Liautaud, Pierre Gaillard, Olivier Wintenberger

We study online adversarial regression with convex losses against a rich class of continuous yet highly irregular prediction rules, modeled by Besov spaces with general…

math.ST2025

Power comparison of sequential testing by betting procedures

Amaury Durand, Olivier Wintenberger

In this paper, we derive power guarantees of some sequential tests for bounded mean under general alternatives. We focus on testing procedures using nonnegative supermartingales wh…

math.ST2024

Minimax-optimal and Locally-adaptive Online Nonparametric Regression

Paul Liautaud, Pierre Gaillard, Olivier Wintenberger

We study adversarial online nonparametric regression with general convex losses and propose a parameter-free learning algorithm that achieves minimax optimal rates. Our approach le…

math.ST2024

Infinite random forests for imbalanced classification tasks

Moria Mayala, Olivier Wintenberger, Charles Tillier +1

We study predictive probability inference in classification tasks using random forests under class imbalance. We focus on two simplified variants of Breiman's algorithm, namely sub…