AI & ML
Fast rates for the classification of Ornstein-Uhlenbeck paths
arXiv stat.TH0 views
arXiv:2610.39726v2 Announce Type: replace Abstract: In binary classification problems, plug-in classifiers can sometimes achieve faster excess risk rates than the underlying estimation rate. In this work, we study a supervised classification problem based on repeated independent observations of Ornstein-Uhlenbeck paths, with both time-homogeneous and time-inhomogeneous drifts. We show that, under a suitable separation condition on the class-dependent drifts, a plug-in classifier attains an excess risk of quadratic order in the corresponding parametric or nonparametric estimation error. The theoretical approach utilizes the Wiener chaos representation and spectral theory to characterize the log-likelihood ratio as a quadratic form of Gaussian random variables, enabling a precise analysis of margin behaviour and deviation results. This extends the fast-rate results from classification problems with linear discriminant models and Gaussian white noise models to dynamical diffusion systems with Gaussian structure.
Source:https://arxiv.org/abs/2610.39726PreviousAt least seven modes in a heteroscedastic three-component bivariate Gaussian mixtureNextAsymptotic efficiency of tests for quantum statistical models
Related posts
Hydra · Coeziune OM–IA — the complete DOI registry (2026-11-20): 8 published works
0dev.to OpenSource
Stop Renting Cloud GPUs & VPS: 4 Legitimate Free Compute Tiers in 2026 (Plus Billing Pitfalls)
0dev.to OpenSource
How to Decode a Wall of Wingdings Without a Key
0dev.to Programming
Beyond the Hype: How Modern Businesses Can Actually Benefit from AI Today
0dev.to Programming
How to Free Up Space on Android Without Deleting Anything
0dev.to Programming

All my git repos in one file: manage them day to day, rebuild them on a new machine
0dev.to Git