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

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

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

Optimal Transport with Heterogeneously Missing Data

异质缺失数据下的最优传输

We consider the problem of solving the optimal transport problem between two empirical distributions with missing values. Our main assumption is that the data is missing completely at random (MCAR), but we allow for heterogeneous missingness probabilities across features and across the two distributions. As a first contribution, we show that the Wasserstein distance between empirical Gaussian distributions and linear Monge maps between arbitrary distributions can be debiased…

AI 解读阅读原文 ↗BibTeX ↓

hmmTMB: hidden Markov models with flexible covariate effects in R

hmmTMB:在 R 中实现灵活协变量效应的隐马尔可夫模型

Hidden Markov models (HMMs) are widely applied in studies where a discrete-valued process of interest is observed indirectly. They have for example been used to model behaviour from human and animal tracking data, disease status from medical data, and financial market volatility from stock prices. The model has two main sets of parameters: transition probabilities, which drive the latent state process, and observation parameters, which characterise the state-dependent…

AI 解读阅读原文 ↗BibTeX ↓

SplitWise Regression: Stepwise Modeling with Adaptive Dummy Encoding

SplitWise 回归:采用自适应虚拟变量编码的逐步建模

Capturing nonlinear relationships without sacrificing interpretability remains a persistent challenge in regression modeling. We introduce SplitWise, a novel framework that enhances stepwise regression. It adaptively transforms numeric predictors into threshold-based binary features using shallow decision trees, but only when such transformations improve model fit, as assessed by the Akaike Information Criterion (AIC) or Bayesian Information Criterion (BIC). This approach…

AI 解读阅读原文 ↗BibTeX ↓

Modeling and prediction of mutation fitness on protein functionality with structural information using high-dimensional Potts model

基于高维 Potts 模型与结构信息的蛋白质突变适应度建模与预测

Quantifying the effects of amino acid mutations in proteins presents a significant challenge due to the vast combinations of residue sites and amino acid types, making experimental approaches costly and time-consuming. The Potts model has been used to address this challenge, with parameters capturing evolutionary dependency between residue sites within a protein family. However, existing methods often use the mean-field approximation to reduce computational demands, which…

AI 解读阅读原文 ↗BibTeX ↓

The Post Double LASSO for Efficiency Analysis

效率分析中的后双重 LASSO

Big data and machine learning methods have become commonplace across economic milieus. One area that has not seen as much attention to these important topics yet is efficiency analysis. We show how the availability of big (wide) data can actually make detection of inefficiency more challenging. We then show how machine learning methods can be leveraged to adequately estimate the primitives of the frontier itself as well as inefficiency using the `post double LASSO' by…

AI 解读阅读原文 ↗BibTeX ↓

Nonlinear Meta-Learning Can Guarantee Faster Rates

非线性元学习可保证更快收敛速率

Many recent theoretical works on \emph{meta-learning} aim to achieve guarantees in leveraging similar representational structures from related tasks towards simplifying a target task. The main aim of theoretical guarantees on the subject is to establish the extent to which convergence rates -- in learning a common representation -- \emph{may scale with the number $N$ of tasks} (as well as the number of samples per task). First steps in this setting demonstrate this property…

AI 解读阅读原文 ↗BibTeX ↓

Regularized Fingerprinting with Linearly Optimal Weight Matrix in Detection and Attribution of Climate Change

气候变化检测与归因中的正则化指纹法:线性最优权重矩阵

Climate change detection and attribution play a central role in establishing the causal influence of human activities on global warming. The dominant framework, optimal fingerprinting, is a linear errors-in-variables model in which each covariate is subject to measurement error with covariance proportional to that of the regression error. The reliability of such analyses depends critically on accurate inference of the regression coefficients. The optimal weight matrix for…

AI 解读阅读原文 ↗BibTeX ↓

Machine learning the first stage in 2SLS: Practical guidance from bias decomposition and simulation

在 2SLS 第一阶段使用机器学习:来自偏差分解与模拟的实践指导

Machine learning (ML) primarily evolved to solve "prediction problems." The first stage of two-stage least squares (2SLS) is a prediction problem, suggesting potential gains from ML first-stage assistance. However, little guidance exists on when ML helps 2SLS$\unicode{x2014}$or when it hurts. We investigate the implications of inserting ML into 2SLS, decomposing the bias into three informative components. Mechanically, ML-in-2SLS procedures face issues common to prediction…

AI 解读阅读原文 ↗BibTeX ↓

BLOG: Bayesian Longitudinal Omics with Group Constraints

BLOG:带组约束的贝叶斯纵向组学

Clinical investigators are increasingly interested in discovering computational biomarkers from short-term longitudinal omics data sets. This work focuses on Bayesian regression and variable selection for longitudinal omics datasets, which can quantify uncertainty and control false discovery. In our univariate approach, Zellner's $g$ prior is used with two different options of the tuning parameter $g$: $g=\sqrt{n}$ and a $g$ that minimizes Stein's unbiased risk estimate…

AI 解读阅读原文 ↗BibTeX ↓

Lasso and Partially-Rotated Designs

Lasso 与部分旋转设计

We consider the sparse linear regression model $\mathbf{y} = X β+\mathbf{w}$, where $X \in \mathbb{R}^{n \times d}$ is the design, $β\in \mathbb{R}^{d}$ is a $k$-sparse secret, and $\mathbf{w} \sim N(0, I_n)$ is the noise. Given input $X$ and $\mathbf{y}$, the goal is to estimate $β$. In this setting, the Lasso estimate achieves prediction error $O(k \log d / γn)$, where $γ$ is the restricted eigenvalue (RE) constant of $X$ with respect to $\mathrm{support}(β)$. In this…

AI 解读阅读原文 ↗BibTeX ↓

Welfare Analysis in Dynamic Models

动态模型中的福利分析

This paper introduces metrics for welfare analysis in dynamic models. We develop estimation and inference for these parameters even in the presence of a high-dimensional state space. Examples of welfare metrics include average welfare, average marginal welfare effects, and welfare decompositions into direct and indirect effects similar to Oaxaca (1973) and Blinder (1973). We derive dual and doubly robust representations of welfare metrics that facilitate debiased inference.…

AI 解读阅读原文 ↗BibTeX ↓

High-dimensional Bayesian Tobit regression for censored response with Horseshoe prior

高维贝叶斯Tobit回归:带删失响应与马蹄先验

Censored response variables--where outcomes are only partially observed due to known bounds--arise in numerous scientific domains and present serious challenges for regression analysis. The Tobit model, a classical solution for handling left-censoring, has been widely used in economics and beyond. However, with the increasing prevalence of high-dimensional data, where the number of covariates exceeds the sample size, traditional Tobit methods become inadequate. While…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotically Efficient Data-adaptive Penalized Shrinkage Estimation with Application to Causal Inference

渐近有效的数据自适应惩罚收缩估计及其因果推断应用

A rich literature exists on constructing non-parametric estimators with optimal asymptotic properties. In addition to asymptotic guarantees, it is often of interest to design estimators with desirable finite-sample properties; such as reduced mean-squared error of a large set of parameters. We provide examples drawn from causal inference where this may be the case, such as estimating a large number of group-specific treatment effects. We show how finite-sample properties of…

AI 解读阅读原文 ↗BibTeX ↓

Doublethink: simultaneous Bayesian-frequentist model-averaged hypothesis testing

双思:贝叶斯与频率派模型平均假设检验的同时实现

Establishing the frequentist properties of Bayesian approaches widens their appeal and offers new understanding. In hypothesis testing, Bayesian model averaging addresses the problem that conclusions are sensitive to variable selection. But Bayesian false discovery rate (FDR) guarantees are sensitive to subjective prior assumptions. Here we show that Bayesian model-averaged hypothesis testing is a closed testing procedure that controls the frequentist familywise error rate…

AI 解读阅读原文 ↗BibTeX ↓

Change-Point Detection in Time Series Using Mixed Integer Programming

利用混合整数规划检测时间序列变点

We use cutting-edge mixed integer optimization (MIO) methods to develop a framework for detection and estimation of structural breaks in time series regression models. The framework is constructed based on the least squares problem subject to a penalty on the number of breakpoints. We restate the $l_0$-penalized regression problem as a quadratic programming problem with integer- and real-valued arguments and show that MIO is capable of finding provably optimal solutions…

AI 解读阅读原文 ↗BibTeX ↓

Extending the Scope of Inference About Predictive Ability to Machine Learning Methods

将预测能力推断拓展至机器学习方法

The use of machine learning methods for predictive purposes has increased dramatically over the past two decades, but uncertainty quantification for predictive comparisons remains elusive. This paper addresses this gap by extending the classic inference theory for predictive ability in time series to modern machine learners, such as the Lasso or Deep Learning. We investigate under which conditions such extensions are possible. For standard out-of-sample asymptotic inference…

AI 解读阅读原文 ↗BibTeX ↓

Low-Rank Regularization of Global Fréchet Regression Models for Distributional Responses

分布响应的全局Fréchet回归低秩正则化

Fréchet regression has emerged as a useful tool for modeling non-Euclidean response variables associated with Euclidean covariates. In this work, we propose a global Fréchet regression estimation method that incorporates low-rank regularization. Focusing on distribution function responses, we demonstrate that leveraging the low-rank structure of the model parameters enhances both the efficiency and accuracy of model fitting. Through theoretical analysis of the large-sample…

AI 解读阅读原文 ↗BibTeX ↓

Sparse Regularized Optimal Transport without Curse of Dimensionality

无维数灾难的稀疏正则化最优传输

Entropic optimal transport -- the optimal transport problem regularized by KL diver\-gence -- is highly successful in statistical applications. Thanks to the smoothness of the entropic coupling, its sample complexity avoids the curse of dimensionality suffered by unregularized optimal transport. The flip side of smoothness is overspreading: the entropic coupling always has full support, whereas the unregularized coupling that it approximates is usually sparse, even given by…

AI 解读阅读原文 ↗BibTeX ↓

Beyond entropic regularization: Debiased Gaussian estimators for discrete optimal transport and general linear programs

超越熵正则化:离散最优传输与一般线性规划的去偏高斯估计

This work proposes new estimators for discrete optimal transport plans that enjoy Gaussian limits centered at the true solution. This behavior stands in stark contrast with the performance of existing estimators, including those based on entropic regularization, which are asymptotically biased and only satisfy a CLT centered at a regularized version of the population-level plan. We develop a new regularization approach based on a different class of penalty functions, which…

AI 解读阅读原文 ↗BibTeX ↓

A Computationally Efficient Approach to False Discovery Rate Control and Power Maximisation via Randomisation and Mirror Statistic

基于随机化与镜像统计量的高效错误发现率控制与功效最大化方法

Simultaneously performing variable selection and inference in high-dimensional regression models is an open challenge in statistics and machine learning. The increasing availability of vast amounts of variables requires the adoption of specific statistical procedures to accurately select the most important predictors in a high-dimensional space, while controlling the false discovery rate (FDR) associated with the variable selection procedure. In this paper, we propose the…

AI 解读阅读原文 ↗BibTeX ↓

Robust Variable Selection in High-dimensional Nonparametric Additive Model

高维非参数可加模型中的稳健变量选择

Additive models belong to the class of structured nonparametric regression models that do not suffer from the curse of dimensionality. Finding the additive components that are nonzero when the true model is assumed to be sparse is an important problem, and it is well studied in the literature. The majority of the existing methods focused on using the $L_2$ loss function, which is sensitive to outliers in the data. We propose a new variable selection method for additive…

AI 解读阅读原文 ↗BibTeX ↓

A Graphical Global Optimization Framework for Parameter Estimation of Statistical Models with Nonconvex Regularization Functions

非凸正则化统计模型参数估计的图形化全局优化框架

Optimization problems with norm-bounding constraints arise in a variety of applications, including portfolio optimization, machine learning, and feature selection. A common approach to these problems involves relaxing the norm constraint via Lagrangian relaxation, transforming it into a regularization term in the objective function. A particularly challenging class includes the zero-norm function, which promotes sparsity in statistical parameter estimation. Most existing…

AI 解读阅读原文 ↗BibTeX ↓

Strong Screening Rules for Group-based SLOPE Models

组基SLOPE模型的强筛选规则

Tuning the regularization parameter in penalized regression models is an expensive task, requiring multiple models to be fit along a path of parameters. Strong screening rules drastically reduce computational costs by lowering the dimensionality of the input prior to fitting. We develop strong screening rules for group-based Sorted L-One Penalized Estimation (SLOPE) models: Group SLOPE and Sparse-group SLOPE. The developed rules are applicable to the wider family of…

AI 解读阅读原文 ↗BibTeX ↓

Nonparametric learning of covariate-based Markov jump processes using RKHS techniques

基于RKHS的协变量驱动马尔可夫跳过程非参数学习

We propose a novel nonparametric approach for linking covariates to Continuous Time Markov Chains (CTMCs) using the mathematical framework of Reproducing Kernel Hilbert Spaces (RKHS). CTMCs provide a robust framework for modeling transitions across clinical or behavioral states, but traditional multistate models often rely on linear relationships. In contrast, we use a generalized Representer Theorem to enable tractable inference in functional space. For the Frequentist…

AI 解读阅读原文 ↗BibTeX ↓