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
Why an Embedded Game Fails on Some Phones, and How to Debug It
0dev.to
Microsoft 365 vs Office 2024: The Break-Even Math
0dev.to
Master AI Evals: Build Reliable, Scalable Model Evaluation Pipelines
0dev.to
What to give someone who misses a place
0dev.to
Google is pushing OEMs against GrapheneOS and bootloader unlocking
0Hacker News
VESTA: Visual Exploration with Statistical Tool Agents
0arXiv stat.CO