跳到正文
收录说明
收录范围
保留计量方法研究、相关统计基础,以及实质涉及计量方法的应用、教程、比较和综述。书评、刊务及明确无关内容不公开;身份或相关性证据不足的记录保留待核,补充可靠材料后可重新判断。
预印本来自 arXiv 计量经济学及相关统计、金融分类和主题检索。主题检索从 2021 年起回补;关注作者追溯更早年份,部分历史文献按已核验编号补录。收录不表示通过同行评审,仍可能遗漏。
本库首次提交范围:2004-06-23 — 2026-10-14。
阅读范围
默认显示本库全部预印本。可选“优先阅读”:至少一位作者同时满足有可核验的本站覆盖期刊正式发表记录,且 OpenAlex 总引用超过 1,000 次。按同一作者身份匹配,两项缺一不可。此筛选提供阅读线索,不作为论文质量判断。
日期与排序
默认按最近修订排序;年份和日期筛选使用首次提交时间。同一 arXiv 编号的修订会合并。仅有月份或年份时,日期区间相交也会纳入。

日期精度:到日 4 篇 · 到月 0 篇 · 到年 0 篇

分类与引用
领域和方法依据题名、摘要初步分类,可人工修正;分类不代表论文质量。引用数采用 OpenAlex 单条关联记录,不合计版本。
更新与 AI 解读
正常题录、可靠摘要与引用同步继续;日、周、月简报按核实的发表与修订日期汇总,历史补录保留在文献库。AI 解读依据可靠摘要或已核实原文片段,已有解读保留供阅读参考;缺少可靠材料的条目保持待解读,浏览页面不会触发生成。
4 篇论文
导出

Sliding-Window Signatures for Time Series: Application to Electricity Demand Forecasting

时间序列的滑动窗口签名特征:电力需求预测应用

Nonlinear and delayed effects of covariates often render time series forecasting challenging. To this end, we propose a novel forecasting framework based on ridge regression with signature features calculated on sliding windows. These features capture complex temporal dynamics without relying on learned or hand-crafted representations. Focusing on the discrete-time setting, we establish theoretical guarantees, namely universality of approximation and stationarity of…

AI 解读阅读原文 ↗BibTeX ↓

On the asymptotics of extremal lp-blocks cluster inference

极端 ℓp 块聚簇推断的渐近分析

Extremes occur in stationary regularly varying time series as short periods with several large observations, known as extremal blocks. We study cluster statistics summarizing the behavior of functions acting on these extremal blocks. Examples of cluster statistics are the extremal index, cluster size probabilities, and other cluster indices. The purpose of our work is twofold. First, we state the asymptotic normality of block estimators for cluster inference based on…

AI 解读阅读原文 ↗BibTeX ↓

Stochastic Online Convex Optimization. Application to probabilistic time series forecasting

随机在线凸优化及其概率时间序列预测应用

We introduce a general framework of stochastic online convex optimization to obtain fast-rate stochastic regret bounds. We prove that algorithms such as online newton steps and a scale-free 10 version of Bernstein online aggregation achieve best-known rates in unbounded stochastic settings. We apply our approach to calibrate parametric probabilistic forecasters of non-stationary sub-gaussian time series. Our fast-rate stochastic regret bounds are any-time valid. Our proofs…

AI 解读阅读原文 ↗BibTeX ↓

Self-normalized partial sums of heavy-tailed time series

重尾时间序列的自归一化部分和

We study the joint limit behavior of sums, maxima and $\ell^p$-type moduli for samples taken from an $\mathbb{R}^d$-valued regularly varying stationary sequence with infinite variance. As a consequence, we can determine the distributional limits for ratios of sums and maxima, studentized sums, and other self-normalized quantities in terms of hybrid characteristic functions and Laplace transforms. These transforms enable one to calculate moments of the limits and to…

AI 解读阅读原文 ↗BibTeX ↓