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

推荐订阅源

阮一峰的网络日志
阮一峰的网络日志
J
Java Code Geeks
Martin Fowler
Martin Fowler
宝玉的分享
宝玉的分享
V
Visual Studio Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
M
MIT News - Artificial intelligence
U
Unit 42
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
I
InfoQ
WordPress大学
WordPress大学
H
Help Net Security
D
Docker
B
Blog
腾讯CDC
A
About on SuperTechFans
Recent Announcements
Recent Announcements
雷峰网
雷峰网
有赞技术团队
有赞技术团队
C
Check Point Blog
Y
Y Combinator Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

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
Parameter Estimation for a partially observed Ornstein-Uh...
Brahim El Onsy, Khalifa Es-Sebaiy, Frederi G. Viens · 2015-01-21 · via math.ST updates on arXiv.org

\noindent \textbf{Abstract}: We consider the parameter estimation problem for the Ornstein-Uhlenbeck process $X$ driven by a fractional Ornstein-Uhlenbeck process $V$, i.e. the pair of processes defined by the non-Markovian continuous-time long-memory dynamics $dX_{t}=-θX_{t}dt+dV_{t};\ t\geq 0$, with $dV_{t}=-ρV_{t}dt+dB_{t}^{H};\ t\geq 0$, where $θ>0$ and $ρ>0$ are unknown parameters, and $B^{H}$ is a fractional Brownian motion of Hurst index $H\in (\frac{1}{2},1)$. We study the strong consistency as well as the asymptotic normality of the joint least squares estimator $(\hatθ_{T},\widehat{ρ}% _{T}) $ of the pair $( θ,ρ) $, based either on continuous or discrete observations of $\{X_{s};\ s\in \lbrack 0,T]\}$ as the horizon $T$ increases to +$\infty $. Both cases qualify formally as partial-hbobservation questions since $V$ is unobserved. In the latter case, several discretization options are considered. Our proofs of asymptotic normality based on discrete data, rely on increasingly strict restrictions on the sampling frequency as one reduces the extent of sources of observation. The strategy for proving the asymptotic properties is to study the case of continuous-time observations using the Malliavin calculus, and then to exploit the fact that each discrete-data estimator can be considered as a perturbation of the continuous one in a mathematically precise way, despite the fact that the implementation of the discrete-time estimators is distant from the continuous estimator. In this sense, we contend that the continuous-time estimator cannot be implemented in practice in any naïve way, and serves only as a mathematical tool in the study of the discrete-time estimators' asymptotics.