惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Google DeepMind News
Google DeepMind News
L
LangChain Blog
H
Help Net Security
博客园_首页
T
Tailwind CSS Blog
Microsoft Security Blog
Microsoft Security Blog
T
The Blog of Author Tim Ferriss
雷峰网
雷峰网
Recent Announcements
Recent Announcements
D
DataBreaches.Net
U
Unit 42
Vercel News
Vercel News
I
InfoQ
Martin Fowler
Martin Fowler
Microsoft Azure Blog
Microsoft Azure Blog
Apple Machine Learning Research
Apple Machine Learning Research
S
SegmentFault 最新的问题
Jina AI
Jina AI
博客园 - 叶小钗
博客园 - 【当耐特】
罗磊的独立博客
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
Last Week in AI
Last Week in AI

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Uniformly and strongly consistent estimation for the Hurs...
Antoine Ayache, Julien Hamonier · 2014-07-12 · via math.ST updates on arXiv.org

Since the middle of the 90's, multifractional processes have been introduced for overcoming some limitations of the classical Fractional Brownian Motion model. In their context, the Hurst parameter becomes a Holder continuous function H(?) of the time variable t. Linear Multifractional Stable Motion (LMSM) is the most known one of them with heavy-tailed distributions. Generally speaking, global and local sample path roughness of a multifractional process are determined by values of its parameter $H(\cdot)$; therefore, since about two decades, several authors have been interested in their statistical estimation, starting from discrete variations of the process. Because of complex dependence structures of variations, in order to show consistency of estimators one has to face challenging problems. The main goal of our article is to introduce, in the setting of the symmetric alpha-stable non-anticipative moving average LMSM, where $α\in (1; 2)$, a new strategy for dealing with such kind of problems. It can also be useful in other contexts. In contrast with previously developed strategies, this new one does not require to look for sharp estimates of covariances related to functionals of variations. Roughly speaking, it consists of expressing variations in such a way that they become independent random variables up to negligible remainders. Thanks to it, we obtain, an almost surely and $L^p(Ω), p\in(0; 4]$, consistent estimator of the whole function $H(\cdot)$, which converges, uniformly in t, and even for some Holder norms. Also, we obtain estimates for the rates of convergence. Such kind of strong consistency results in uniform and Holder norms are rather unusual in the literature on statistical estimation of functions.