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

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

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

Bayesian Bridge Gaussian Process Regression

贝叶斯桥高斯过程回归

The performance of Gaussian Process (GP) regression is often hampered by the curse of dimensionality, which inflates computational cost and reduces predictive power in high-dimensional problems. Variable selection is thus crucial for building efficient and accurate GP models. Inspired by Bayesian bridge regression, we propose the Bayesian Bridge Gaussian Process Regression (B\textsuperscript{2}GPR) model. This framework places $\ell_q$-norm constraints on key GP parameters…

AI 解读阅读原文 ↗BibTeX ↓

The $\ell$-test: leveraging sparsity in the Gaussian linear model for improved inference

ℓ检验:利用高斯线性模型中的稀疏性改进推断

We develop novel LASSO-based methods for coefficient testing and confidence interval construction in the Gaussian linear model with $n\ge d$. Our methods' finite-sample validity is identical to that of their ubiquitous ordinary-least-squares-$t$-test-based analogues, yet have substantially higher power when the true coefficient vector is sparse. In particular, under sparsity our coefficient test, which we call the $\ell$-test, performs like the \emph{one-sided} $t$-test…

AI 解读阅读原文 ↗BibTeX ↓

Exponential Lasso: robust sparse penalization under heavy-tailed noise and outliers with exponential-type loss

指数 Lasso:重尾噪声与离群点下的稳健稀疏惩罚

In high-dimensional statistics, the Lasso is a cornerstone method for simultaneous variable selection and parameter estimation. However, its reliance on the squared loss function renders it highly sensitive to outliers and heavy-tailed noise, potentially leading to unreliable model selection and biased estimates. To address this limitation, we introduce the Exponential Lasso, a novel robust method that integrates an exponential-type loss function within the Lasso framework.…

AI 解读阅读原文 ↗BibTeX ↓

Consistent Group selection using Global-local prior in High dimensional setup

高维分组模型选择中的全局-局部先验一致性方法

We consider the problem of model selection when grouping structure is inherent within the regressors. Using a Bayesian approach, we model the mean vector by a one-group global-local shrinkage prior belonging to a broad class of such priors that includes the horseshoe prior. In the context of variable selection, this class of priors was studied by Tang et al. (2018). A modified form of the usual class of global-local shrinkage priors with polynomial tail on the group…

AI 解读阅读原文 ↗BibTeX ↓

Estimation of Latent Group Structures in Time-Varying Panel Data Models

时变面板数据模型中潜在分组结构的估计

We consider panel data models where coefficients change smoothly over time and follow a latent group structure, being homogeneous within but heterogeneous across groups. To jointly estimate the group membership and group-specific coefficient trajectories, we propose FUSE-TIME, a pairwise adaptive group fused-Lasso estimator combined with polynomial spline sieves. We establish consistency, derive the asymptotic distributions of the penalized sieve estimator and its…

AI 解读阅读原文 ↗BibTeX ↓

Minimax Analysis of Estimation Problems in Coherent Imaging

相干成像中估计问题的极小极大分析

Unlike conventional imaging modalities, such as magnetic resonance imaging, which are often well described by a linear regression framework, coherent imaging systems follow a significantly more complex model. In these systems, the task is to estimate the unknown image ${\boldsymbol x}_o \in \mathbb{R}^n$ from observations ${\boldsymbol y}_1, \ldots, {\boldsymbol y}_L \in \mathbb{R}^m$ of the form \[ {\boldsymbol y}_l = A_l X_o {\boldsymbol w}_l + {\boldsymbol z}_l, \quad l = 1, \ldots, L, \]…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic Distribution of Low-Dimensional Patterns Induced by Non-Differentiable Regularizers under General Loss Functions

非可微正则化下低维模式在一般损失函数中的渐近分布

This article investigates the asymptotic distribution of penalized estimators with non-differentiable penalties designed to recover low-dimensional pattern structures. Patterns play a central role in estimation, as they reveal the underlying structure of the parameter -- which coefficients are zero, which are equal, and how they are clustered. The main technical challenge stems from the discontinuous nature of these patterns (such as the sign function in the case of the…

AI 解读阅读原文 ↗BibTeX ↓

Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning

通过神经对抗不变性学习从异质环境中探寻因果关系

Pursuing causality from data is a fundamental problem in scientific discovery, treatment intervention, and transfer learning. This paper introduces a novel algorithmic method for addressing nonparametric invariance and causality learning in regression models across multiple environments, where the joint distribution of response variables and covariates varies, but the conditional expectations of outcome given an unknown set of quasi-causal variables are invariant. The…

AI 解读阅读原文 ↗BibTeX ↓

Regularised Canonical Correlation Analysis: graphical lasso, biplots and beyond

正则化典型相关分析:图套索、双标图及其他

Recent developments in regularized Canonical Correlation Analysis (CCA) promise powerful methods for high-dimensional, multiview data analysis. However, justifying the structural assumptions behind many popular approaches remains a challenge, and features of realistic biological datasets pose practical difficulties that are seldom discussed. We propose a novel CCA estimator rooted in an assumption of conditional independencies and based on the Graphical Lasso. Our method has…

AI 解读阅读原文 ↗BibTeX ↓

Group Identification and Variable Selection in Multivariable Mendelian Randomization with Highly-Correlated Exposures

高度相关暴露下多变量孟德尔随机化的分组识别与变量选择

Multivariable Mendelian Randomization (MVMR) estimates the direct causal effects of multiple risk factors on an outcome using genetic variants as instruments. The growing availability of summary-level genetic data has created opportunities to apply MVMR in high-dimensional settings with many strongly correlated candidate risk factors. However, existing methods face three major limitations: weak instrument bias, limited interpretability, and the absence of valid…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic Theory for Regularized Estimation in Functional Time Series Models

函数型时间序列模型中正则化估计的渐近理论

Functional autoregressive (FAR) models provide a fundamental framework for analyzing temporally dependent functional data. However, the infinite-dimensional nature of the underlying Hilbert space introduces intrinsic ill-posedness, as the autocovariance operators are compact and lack bounded inverses. This paper develops a new theoretical framework for the regularized estimation and asymptotic analysis of FAR models. Leveraging Hilbert space theory, we rigorously…

AI 解读阅读原文 ↗BibTeX ↓

Sample Complexity of Quadratically Regularized Optimal Transport

二次正则化最优传输的样本复杂度

It is well known that optimal transport suffers from the curse of dimensionality: when the prescribed marginals are approximated by i.i.d. samples, the convergence of the empirical optimal transport problem to the population counterpart slows exponentially with increasing dimension. Entropically regularized optimal transport (EOT) has become the standard bearer in many statistical applications as it avoids this curse. Indeed, EOT has parametric sample complexity, as has been…

AI 解读阅读原文 ↗BibTeX ↓

Modelos Empiricos de Pos-Dupla Selecao por LASSO: Discussoes para Estudos do Transporte Aereo

Lasso 后双重选择的实证模型:航空运输研究讨论

This paper presents and discusses forms of estimation by regularized regression and model selection using the LASSO method - Least Absolute Shrinkage and Selection Operator. LASSO is recognized as one of the main supervised learning methods applied to high-dimensional econometrics, allowing work with large volumes of data and multiple correlated controls. Conceptual issues related to the consequences of high dimensionality in modern econometrics and the principle of…

AI 解读阅读原文 ↗BibTeX ↓

Convex Clustering Redefined: Robust Learning with the Median of Means Estimator

凸聚类再定义:基于均值中位数估计的稳健学习

Clustering approaches that utilize convex loss functions have recently attracted growing interest in the formation of compact data clusters. Although classical methods like k-means and its wide family of variants are still widely used, all of them require the number of clusters k to be supplied as input, and many are notably sensitive to initialization. Convex clustering provides a more stable alternative by formulating the clustering task as a convex optimization problem,…

AI 解读阅读原文 ↗BibTeX ↓

Optimal and computationally tractable lower bounds for logistic log-likelihoods

logistic 对数似然的最优且可计算下界

The logit transform is arguably the most widely-employed link function beyond linear settings. This transformation routinely appears in regression models for binary data and provides a central building-block in popular methods for both classification and regression. Its widespread use, combined with the lack of analytical solutions for the optimization of objective functions involving the logit transform, still motivates active research in computational statistics. Among the…

AI 解读阅读原文 ↗BibTeX ↓

Valid and efficient possibilistic structure learning in Gaussian linear regression

高斯线性回归中有效且可能性的结构学习

A crucial step in fitting a regression model to data is determining the model's structure, i.e., the subset of explanatory variables to be included. However, the uncertainty in this step is often overlooked due to a lack of satisfactory methods. Frequentists have no broadly applicable confidence set constructions for a model's structure, and Bayesian posterior credible sets do not achieve the desired finite-sample coverage. In this paper, we propose an extension of the…

AI 解读阅读原文 ↗BibTeX ↓

rfBLT: Random Feature Bayesian Lasso Takens Model for time series forecasting

rfBLT:用于时间序列预测的随机特征贝叶斯 Lasso Takens 模型

Time series prediction is challenging due to our limited understanding of the underlying dynamics. Conventional models such as ARIMA and Holt's linear trend model experience difficulty in identifying nonlinear patterns in time series. In contrast, machine learning models excel at learning complex patterns and handling high-dimensional data; however, they are unable to quantify the uncertainty associated with their predictions, as statistical models do. To overcome these…

AI 解读阅读原文 ↗BibTeX ↓

Factor-Driven Network Informed Restricted Vector Autoregression

因子驱动、网络信息约束的向量自回归

High-dimensional financial time series often exhibit complex dependence relations driven by both common market structures and latent connections among assets. To capture these characteristics, this paper proposes Factor-Driven Network Informed Restricted Vector Autoregression (FNIRVAR), a model for the common and idiosyncratic components of high-dimensional time series with an underlying unobserved network structure. The common component is modelled by a static factor model,…

AI 解读阅读原文 ↗BibTeX ↓

Selective inference after convex clustering with $\ell_1$ penalization

ℓ1 惩罚凸聚类的选择性推断

Classical inference methods notoriously fail when applied to data-driven test hypotheses or inference targets. Instead, dedicated methodologies are required to obtain statistical guarantees for these selective inference problems. Selective inference is particularly relevant post-clustering, typically when testing a difference in mean between two clusters. In this paper, we address convex clustering with $\ell_1$ penalization, by leveraging related selective inference tools…

AI 解读阅读原文 ↗BibTeX ↓

Collapsing Categories for Regression with Mixed Predictors

混合预测变量回归中的类别合并

Categorical predictors are omnipresent in everyday regression practice: in fact, most regression data involve some categorical predictors, and this tendency is increasing in modern applications with more complex structures and larger data sizes. However, including too many categories in a regression model would seriously hamper accuracy, as the information in the data is fragmented by the multitude of categories. In this paper, we introduce a systematic method to reduce the…

AI 解读阅读原文 ↗BibTeX ↓

Regularized Estimation of Sparse Spectral Precision Matrices

稀疏频谱精度矩阵的正则化估计

Estimation of a sparse spectral precision matrix, the inverse of a spectral density matrix, is a canonical problem in frequency-domain analysis of high-dimensional time series (HDTS), with applications in neurosciences and environmental sciences. Existing estimators use off-the-shelf optimizers for complex variables that limit scalability, uniform (non-adaptive) penalization that is not tailored to handle heterogeneity across time series components, and lack a formal…

AI 解读阅读原文 ↗BibTeX ↓

Going With the Flow: Normalizing Flows for Gaussian Process Regression under Hierarchical Shrinkage Priors

分层收缩先验下高斯过程回归的归一化流方法

Gaussian Process Regression (GPR) is a powerful tool for nonparametric regression, but its application in a fully Bayesian fashion in high-dimensional settings is hindered by two primary challenges: the difficulty of variable selection and the computational burden, which is particularly acute in fully Bayesian inference. This paper introduces a novel methodology that combines hierarchical global-local shrinkage priors with normalizing flows to address these challenges. The…

AI 解读阅读原文 ↗BibTeX ↓

Non-Negative Stiefel Approximating Flow: Orthogonalish Matrix Optimization for Interpretable Embeddings

非负Stiefel近似流:面向可解释嵌入的正交化矩阵优化

Interpretable representation learning is a central challenge in modern machine learning, particularly in high-dimensional settings such as neuroimaging, genomics, and text analysis. Current methods often struggle to balance the competing demands of interpretability and model flexibility, limiting their effectiveness in extracting meaningful insights from complex data. We introduce Non-negative Stiefel Approximating Flow (NSA-Flow), a general-purpose matrix estimation…

AI 解读阅读原文 ↗BibTeX ↓

Doubly robust and computationally efficient high-dimensional variable selection

双重稳健且计算高效的高维变量选择

Variable selection can be performed by testing conditional independence (CI) between each predictor and the response, given the other predictors. A doubly robust and powerful option for these CI tests is the projected covariance measure (PCM) test. However, directly deploying PCM for variable selection brings computational challenges: testing a single variable involves a few machine learning fits, so testing $p$ variables requires $O(p)$ fits. Inspired by model-X ideas, we…

AI 解读阅读原文 ↗BibTeX ↓