Regularized Learning for Fractional Brownian Motion via Path Signatures
基于路径签名的分数布朗运动正则化学习AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确讨论依赖增量过程的时间序列特征构造与学习,未提供金融应用依据。
基于路径签名的分数布朗运动正则化学习AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Fractional Brownian motion (fBm) extends classical Brownian motion by introducing dependence between increments, governed by the Hurst parameter $H\in (0,1)$. Unlike traditional Brownian motion, the increments of an fBm are not independent. Paths generated by fractional Brownian motions can exhibit significant irregularity, particularly when the Hurst parameter is small. As a result, classical regression methods may not perform effectively. Signatures, defined as iterated path integrals of continuous and discrete-time processes, offer a universal nonlinearity property that simplifies the challenge of feature selection in time series data analysis by effectively linearizing it. Consequently, we employ Lasso regression techniques for regularization when handling irregular data. To evaluate the performance of signature Lasso on fractional Brownian motion (fBM), we study its consistency when the Hurst parameter $ H \ne \frac{1}{2} $. This involves deriving bounds on the first and second moments of the signature. For the case $ H > \frac{1}{2} $, we use the signature defined in the Young sense, while for $ H < \frac{1}{2} $, we use the Stratonovich interpretation. Simulation results indicate that signature Lasso can outperform traditional regression methods for synthetic data as well as for real-world datasets.
利用信息增强自适应 Lasso 选择平稳与非平稳自回归模型
We propose a novel approach to elicit the weight of a potentially non-stationary regressor in the consistent and oracle-efficient estimation of autoregressive models using the adaptive Lasso. The enhanced weight builds on a statistic that exploits distinct orders in probability of the OLS estimator in time series regressions when the degree of integration differs. We provide theoretical results on the benefit of our approach for detecting stationarity when a tuning criterion…
协整回归变量:折叠凹惩罚何时超越 LASSO
LASSO is one of the most popular regularization methods for high-dimensional regression models. While cointegration is common in practical applications of predictive regressions with many regressors, the convex penalty of LASSO overly suppresses the coefficients of cointegrated regressors and therefore fails to deliver consistent parameter estimation. We employ folded concave penalties (FCP), including the well-known SCAD and MCP, to address this issue. Using FCP, we…
高维 Ornstein–Uhlenbeck 过程漂移项的稀疏估计
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…
用收缩先验建模动态相关矩阵
Estimating time-varying correlation matrices is challenging because existing methods may adapt slowly to structural changes, impose insufficient regularization, or produce diffuse posterior uncertainty. In moderate dimensions, an additional difficulty is summarizing the estimated evolving dependence structure for downstream decision-making tasks. We propose a Bayesian approach based on a low-rank factor representation, with latent states evolving under a dynamic shrinkage…
通过条件中心化进行非线性 Granger 因果的 RKHS 推断
Granger causality is commonly formulated through linear prediction in vector autoregressive models, limiting its ability to detect nonlinear predictive relationships. We propose a reproducing kernel Hilbert space (RKHS)-based test for nonlinear Granger non-causality in conditional mean for nonlinear autoregressive processes. The key idea is a conditional-centering decomposition of the target regression function into an own-history component and an orthogonal component…