Sparse estimation for the drift of high-dimensional Ornstein--Uhlenbeck processes with i.i.d. paths
高维 Ornstein–Uhlenbeck 过程漂移项的稀疏估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究高维 Ornstein–Uhlenbeck 过程的漂移参数估计,属于连续时间随机过程与时间序列建模范畴,故归入时间序列方向。
高维 Ornstein–Uhlenbeck 过程漂移项的稀疏估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study sparsity-regularized maximum likelihood estimation for the drift parameter of high-dimensional non-stationary Ornstein--Uhlenbeck processes given repeated measurements of i.i.d. paths. In particular, we show that Lasso and Slope estimators can achieve the minimax optimal rate of convergence. We exhibit numerical experiments for sparse estimation methods and show their performance.
多维速度变化检测中惩罚最大似然估计的一致性
We establish statistical consistency for the penalized maximum-likelihood estimator underlying CPLASS, a method for detecting changes in velocity in $d$-dimensional time-series data. The signal is modeled as a continuous piecewise-linear trajectory observed with independent Gaussian noise. Unlike classical change-in-mean models, continuity across adjacent segments couples their parameters and prevents direct application of standard segmentation arguments. Under compact…
拟最大似然断点估计的锐信噪比阈值
We establish a sharp pathwise signal-to-noise criterion for quasi-maximum-likelihood (QML) estimation of a dominant breakpoint in the second-moment structure of a multivariate time series: the QML estimator is consistent whenever the between-regime contrast exceeds the within-regime fluctuation by an explicit factor, and below this threshold global recovery can fail. Two innovations drive the result. First, the framework is pathwise: no stochastic model is imposed on the…
可扩展的 VARMA 模型估计
Vector autoregressive moving-average (VARMA) models have long been considered impractical beyond moderate dimensions: the likelihood is non-convex, the parametrization is identified only up to equivalence, and every evaluation costs a pass over the entire series. Yet their moving-average term captures with a few parameters what a pure autoregression matches only with many lags. We introduce an estimation framework that removes this computational barrier: each optimization…
可扩展 ARMA 模型的拟极大似然估计
The recently proposed scalable ARMA model preserves the parsimony of traditional VARMA models while achieving greater computational tractability. However, existing studies are limited to regularized least squares estimation (LSE) for high-dimensional settings, which is not only statistically less efficient but also requires the sub-Gaussian assumption for its theoretical guarantees. Moreover, it still lacks inference tool for real applications. To fill this gap, we develop a…
含向量时间序列协变量的时空矩阵自回归模型
We develop a new methodology for forecasting matrix-valued time series with historical matrix data and auxiliary vector time series data. We focus on a time series of matrices defined on a static 2-D spatial grid and an auxiliary time series of non-spatial vectors. The proposed model, Matrix AutoRegression with Auxiliary Covariates (MARAC), contains an autoregressive component for the historical matrix predictors and an additive component that maps the auxiliary vector…
基数正则化的 Hawkes–Granger 模型
We propose a new sparse Granger-causal learning framework for temporal event data. We focus on a specific class of point processes called the Hawkes process. We begin by pointing out that most of the existing sparse causal learning algorithms for the Hawkes process suffer from a singularity in maximum likelihood estimation. As a result, their sparse solutions can appear only as numerical artifacts. In this paper, we propose a mathematically well-defined sparse causal…