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

推荐订阅源

V
Visual Studio Blog
A
About on SuperTechFans
J
Java Code Geeks
G
Google Developers Blog
L
LangChain Blog
小众软件
小众软件
宝玉的分享
宝玉的分享
云风的 BLOG
云风的 BLOG
P
Proofpoint News Feed
博客园 - 【当耐特】
IT之家
IT之家
F
Fortinet All Blogs
aimingoo的专栏
aimingoo的专栏
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
博客园 - Franky
博客园_首页
雷峰网
雷峰网
Microsoft Security Blog
Microsoft Security Blog
Vercel News
Vercel News
B
Blog
月光博客
月光博客
酷 壳 – CoolShell
酷 壳 – CoolShell

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Low-Rank and Sparse Drift Estimation for High-Dimensional...
[Submitted on 12 Mar 2026 (v1), last revised 31 Aug 2026 (this v · 2026-03-12 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study drift estimation for discretely observed high-dimensional Lévy-driven Ornstein--Uhlenbeck processes when the drift admits a low-rank-plus-sparse approximation. A localized, increment-truncated pseudo-likelihood is regularized by nuclear and entrywise $\ell_1$ norms. A weighted joint-cone argument and restricted cancellation condition yield non-asymptotic Frobenius oracle inequalities for exact and approximate structure. The stochastic complexity is $rd+s\log d$, with explicit discretization, truncation, and Lévy-regime sample-complexity terms. We derive operator- and infinity-norm score bounds from a Gaussian-width inequality and give a proximal-gradient algorithm. In 100-replicate experiments with mixed low-rank-plus-sparse drift, the estimator reduces mean relative Frobenius error by 4.4--5.9\% versus localized Lasso and wins 89--92\% of paired paths. Component diagnostics show that these gains concern recovery of the total drift rather than exact identification of its low-rank and sparse components.

Submission history

From: Marina Palaisti Prof Dr [view email]
[v1] Thu, 12 Mar 2026 15:26:35 UTC (12 KB)
[v2] Mon, 23 Mar 2026 22:28:41 UTC (14 KB)
[v3] Mon, 31 Aug 2026 20:20:12 UTC (17 KB)