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

推荐订阅源

GbyAI
GbyAI
D
Docker
F
Fortinet All Blogs
MongoDB | Blog
MongoDB | Blog
月光博客
月光博客
罗磊的独立博客
N
Netflix TechBlog - Medium
Y
Y Combinator Blog
博客园 - 司徒正美
T
Tailwind CSS Blog
C
Check Point Blog
V
V2EX
Microsoft Azure Blog
Microsoft Azure Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
P
Proofpoint News Feed
L
LangChain Blog
D
DataBreaches.Net
酷 壳 – CoolShell
酷 壳 – CoolShell
有赞技术团队
有赞技术团队
腾讯CDC
Last Week in AI
Last Week in AI
Jina AI
Jina AI
博客园 - Franky
量子位

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
Low Frequency Lévy Copula Estimation
Christian Palmes · 2014-10-01 · via math.ST updates on arXiv.org

Let $X$ be a $d$-dimensional Lévy process with Lévy triplet $(Σ,ν,α)$ and $d\geq 2$. Given the low frequency observations $(X_t)_{t=1,\ldots,n}$, the dependence structure of the jumps of $X$ is estimated. The Lévy measure $ν$ describes the average jump behavior in a time unit. Thus, the aim is to estimate the dependence structure of $ν$ by estimating the Lévy copula $\mathfrak{C}$ of $ν$, cf. Kallsen and Tankov \cite{KalTan}. We use the low frequency techniques presented in a one dimensional setting in Neumann and Reiß \cite{NeuRei} and Nickl and Reiß \cite{NicRei} to construct a Lévy copula estimator $\widehat{\mathfrak{C}}_n$ based on the above $n$ observations. In doing so we prove $$\widehat{\mathfrak{C}}_n\to \mathfrak{C},\quad n\to\infty$$ uniformly on compact sets bounded away from zero with the convergence rate $\sqrt{\log n}$. This convergence holds under quite general assumptions, which also include Lévy triplets with $Σ\neq 0$ and $ν$ of arbitrary Blumenthal-Getoor index $0\leqβ\leq 2$. Note that in a low frequency observation scheme, it is statistically difficult to distinguish between infinitely many small jumps and a Brownian motion part. Hence, the rather slow convergence rate $\sqrt{\log n}$ is not surprising. In the complementary case of a compound Poisson process (CPP), an estimator $\widehat{C}_n$ for the copula $C$ of the jump distribution of the CPP is constructed under the same observation scheme. This copula $C$ is the analogue to the Lévy copula $\mathfrak{C}$ in the finite jump activity case, i.e. the CPP case. Here we establish $$\widehat{C}_n \to C,\quad n\to\infty$$ with the convergence rate $\sqrt{n}$ uniformly on compact sets bounded away from zero. Both convergence rates are optimal in the sense of Neumann and Reiß.