AI & ML
Maximal Inequalities for Empirical Processes under General Mixing Conditions
arXiv stat.TH0 views
arXiv:2402.11394v5 Announce Type: replace-cross Abstract: This paper provides a bound for the supremum of sample averages over a class of functions for a general class of mixing stochastic processes with arbitrary mixing rates. Regardless of the speed of mixing, the bound is comprised of a concentration rate and a novel measure of complexity. The speed of mixing, however, affects the former quantity implying a phase transition. Fast mixing leads to the standard root-n concentration rate, while slow mixing leads to a slower concentration rate whose speed depends on the mixing structure. Our findings are applied to obtain new Glivenko-Cantelli type results.
Source:https://arxiv.org/abs/2402.11394PreviousThe Geometry of Latent Spaces: Projective Invariants, Structural Identification, and Ratio-Scale MeasurementNextNon-Gaussian Uncertainty Estimation via Semi-nonparametric Density
Related posts
Show HN: Reges Town – a 3D city run by AI citizens, in the browser
0Hacker News Show
Show HN: Codend – Build and publish web apps with AI agents
0Hacker News Show

The AI Brain: SageMaker BGE Cross-Encoder Reranking & Sub-100ms Bedrock ConverseStream SSE (Part 4)
0dev.to

Catch the Risk Before the First Dose - Building an AI Drug Safety Reviewer That Remembers
0dev.to
The same small trial is read as "no effect" at post-test and "an effect" at six weeks
0dev.to Data
Cristiano Ronaldo và cột mốc giã từ ĐT Bồ Đào Nha: Thống kê hiệu suất sau 24 năm cống hiến
0dev.to Data