Graphical models for multivariate count data are widely used to characterize conditional dependence structures. For count variables with unbounded support, however, ensuring a finite normalizing constant typically imposes restrictive constraints on interaction parameters. We propose bounded discrete graphical models for multivariate discrete responses with finite support, which remove such constraints by construction while retaining interpretable dependence on the observed…
Anna Guo · Lin Liu · David Benkeser · Razieh Nabi·首次提交 2025-12-22 · 修订 2026-06-25 · v2·arXiv预印本
Napkin 因果图下的因果推断AI 解读
Unmeasured confounding can render identification strategies based on adjustment functionals invalid. We study the "Napkin" graph, a causal structure that encapsulates features of M-bias, instrumental variables, and classical back-door and front-door settings, yet identifies the average treatment effect through a nonstandard ratio of two g-formulas. We develop influence-function-based estimators for this functional, including doubly-robust one-step and targeted minimum…
Empirical Bayes (EB) estimators can match the first-order asymptotic risk of maximum likelihood (ML) while behaving very differently at second order: recent excess mean squared error (XMSE) analysis shows that kernel-based EB estimation may be worse than ML when the kernel is poorly aligned with the true parameter. This paper turns that diagnostic into a design principle. We propose an XMSE-aware mixed estimator that interpolates between ML and EB shrinkage. Its fixed-weight…
Roshni Sahoo · Lihua Lei · Stefan Wager·首次提交 2022-09-05 · 修订 2026-06-25 · v5·arXiv预印本
从有偏样本中学习AI 解读
The empirical risk minimization approach to data-driven decision making requires access to training data drawn under the same conditions as those that will be faced when the decision rule is deployed. However, in a number of settings, we may be concerned that our training sample is biased in the sense that some groups (characterized by either observable or unobservable attributes) may be under- or over-represented relative to the general population; and in this setting…
Joseph Fry·首次提交 2025-06-30 · 修订 2026-06-25 · v3·arXiv预印本
正交化合成控制AI 解读
When conducting inference for the average treatment effect on the treated with a Synthetic Control Estimator, the vector of control weights is a nuisance parameter that is often constrained, high-dimensional, and may be only partially identified even when the average treatment effect on the treated is point-identified. All three of these features of a nuisance parameter can lead to failure of asymptotic normality for the estimate of the parameter of interest when using…
Siqi Wei · David Kepplinger · Anand N. Vidyashankar·首次提交 2026-06-24 · 修订 2026-06-24 · v1·arXiv预印本
复杂抽样设计下多分格相关的稳健最小散度估计AI 解读
Standard maximum likelihood estimation of polychoric correlations is highly sensitive to contamination in survey data, including response errors, interviewer effects, and careless responding, yet assigns equal weight to all observations regardless of data quality. We develop robust estimators for polychoric correlation under complex survey designs based on two minimum divergence criteria -- Hellinger distance (HD) and negative exponential disparity (NED) -- incorporating…
Least absolute shrinkage and selection operator or Lasso is one of the widely used regularization methods in regression. Statisticians usually implement Lasso in practice by choosing the penalty parameter in a data-dependent way, the most popular being the $K-$fold cross-validation (or $K-$fold CV). However, inferential properties, such as the variable selection consistency and $n^{1/2}-$consistency, of the $K-$fold CV based Lasso estimator and validity of the Bootstrap…
Matrix completion seeks to recover a low-rank matrix from a sparse and noisy subset of its entries. In many applications, such as recommendation systems and urban mobility, the observed matrix is accompanied by auxiliary covariates on its rows and columns and exhibits dependence across them. We propose Incomplete Matrix Regression (IMR), a distribution-free penalized regression framework that integrates such information into matrix completion. The target matrix is modeled as…
Brian D. Williamson · Erica E. M. Moodie · Gregory E. Simon · Rebecca C. Rossom · Susan M. Shortreed·首次提交 2023-11-02 · 修订 2026-06-24 · v3·arXiv预印本
模型无关的纵向变量重要性轨迹摘要推断及其自杀预防应用AI 解读
Risk of suicide attempt varies over time. Understanding the importance of risk factors measured at a mental health visit can help clinicians evaluate future risk and provide appropriate care during the visit. In prediction settings where data are collected over time, such as in mental health care, it is often of interest to understand both the importance of variables for predicting the response at each time point and the importance summarized over the time series. Building…
Alberto González-Sanz · Marcel Nutz · Austin J. Stromme·首次提交 2026-06-24 · 修订 2026-06-24 · v1·arXiv预印本
正则化最优传输的有限样本界AI 解读
We study the sample complexity of regularized optimal transport for general convex regularizations including the Kullback--Leibler divergence and $L^p$ penalties. Our main results are non-asymptotic bias and variance bounds for the empirical cost, with explicit dependence on the regularization parameter and on the intrinsic dimension of the marginals. Our approach simultaneously improves, unifies, and extends existing finite-sample bounds. In particular, we improve the state…
Long Feng · Le Zhou · Xiaoyi Wang·首次提交 2026-06-24 · 修订 2026-06-24 · v1·arXiv预印本
高维数据的椭圆正则化Hotelling检验AI 解读
We consider one-sample testing of a high-dimensional location parameter under elliptically symmetric distributions with heavy tails and pervasive cross-sectional dependence. We propose an elliptical regularized Hotelling test with Cauchy combination (ERHT--CC), based on the sample spatial median and the spatial-sign covariance matrix centered at that median. We derive its null asymptotic normality, consistent estimators of the centering and variance, and an explicit local…
R. Labouriau·首次提交 2026-04-26 · 修订 2026-06-24 · v2·arXiv预印本
弱矩方法用于统计推断:兼论稳健估计应用AI 解读
A companion paper develops a generalised framework in which a probability law is represented by a tempered distribution $T\in\mathcal{S}'$ - on the same footing as a density or characteristic function - and information is extracted by pairing $T$ with a positive Schwartz kernel $\varphi$ that acts as a measurement instrument rather than as part of the law; the resulting weak moments of all orders exist unconditionally. The present paper turns this into a methodology for…
Hien Duy Nguyen · Jacob Westerhout·首次提交 2026-06-24 · 修订 2026-06-24 · v1·arXiv预印本
若干广义变分推断问题的闭式解AI 解读
The Donsker--Varadhan formula characterizes the ordinary Bayesian posterior as the solution of an unrestricted $\mathsf{KL}$-regularized variational problem. Generalized variational inference replaces this regularizer by other divergences, but the resulting measure-valued optimization problem is often studied only after restriction to a parametric variational family. This paper studies the unrestricted measure-level problem. Given a measurable space $(\mathcal{Z},\mathfrak{Z})$…
Degui Li · Yuying Sun · Boyao Wu·首次提交 2026-06-24 · 修订 2026-06-24 · v1·arXiv预印本
多层网络向量自回归的时变模型平均AI 解读
In this paper, we introduce a flexible time-varying multi-layer network vector autoregression (VAR) model framework for large-scale time series, allowing agents in dynamic systems to interact through multiple channels and incorporating multiple adjacency matrices to capture network spillover effects. We propose a penalized model averaging method to determine a time-varying optimal combination of multi-layer network VAR candidate models whose number may be divergent. Under…
Nora Bearth · Nadja van 't Hoff · Torben S. D. Johansen·首次提交 2026-06-23 · 修订 2026-06-23 · v1·arXiv预印本
双重差分中的组间处理效应异质性:一种平衡方法AI 解读
Understanding how treatment effects vary across groups is central to policy evaluation. In Difference-in-Differences designs, heterogeneity is often studied using subgroup or triple-difference analyses, which can suffer from conservative inference, reliance on parametric interaction structures, and sensitivity to differences in covariate distributions across groups. We propose the Balanced Group Average Treatment Effect on the Treated (BGATT), a new estimand that isolates…
High-dimensional economic datasets often display strong co-movement driven by a small number of latent factors, which are typically modeled using approximate factor models. When the number of variables is large relative to the sample size, the eigenvalues and eigenvectors of the sample covariance matrix are severely distorted, which in turn makes principal component based estimators of the factor structure unstable. To address the high-dimensional problem, we propose a…
Francisco Andrade · Gabriel Peyré · Clarice Poon·首次提交 2026-06-23 · 修订 2026-06-23 · v1·arXiv预印本
非平衡熵正则最优传输的样本复杂度AI 解读
Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed mass and subject to unfavorable high-dimensional sample complexity. Entropic regularization and unbalanced relaxations address these limitations in complementary ways. Entropy smooths the geometry, improves statistical behavior, and enables fast Sinkhorn-type algorithms, while unbalanced marginal…
We develop Partial Wavelet Canonical Coherence for measuring the direct canonical association between two multivariate nonstationary time series after adjustment for possibly high-dimensional confounders. To the best of our knowledge, this is the first method that establishes a frequency-domain formulation of the partial canonical correlation analysis for time series. Through a wavelet approach, the proposed method yields a scale-specific, time-varying measure of association…
Models with dimension more than the available sample size are now commonly used in various applications. A sensible inference is possible using a lower-dimensional structure. In regression problems with a large number of predictors, the model is often assumed to be sparse, with only a few predictors active. Interdependence between a large number of variables is succinctly described by a graphical model, where variables are represented by nodes on a graph and an edge between…
R. Labouriau·首次提交 2026-04-22 · 修订 2026-06-23 · v3·arXiv预印本
分布统计模型:弱矩、累积量与中心极限定理AI 解读
Many important statistical models fall outside classical moment-based methods due to the non-existence of moments or moment generating functions. We propose a generalised probabilistic framework in which a probability law is represented by a tempered distribution $T \in \mathcal{S}'$, on the same footing as a density, a distribution function, or a characteristic function. Information about the law is extracted by evaluating $T$ on test functions regularised by a given…
Matrix-valued time series data are frequently observed in a broad range of areas and have attracted great attention recently. In this work, we model network effects for high dimensional matrix-valued time series data in a matrix autoregression framework. To characterize the potential heterogeneity of the subjects and handle the high dimensionality simultaneously, we assume that each subject has a latent group label, which enables us to cluster the subject into the…
Ziyun Chen · Jerry Li · Kevin Tian · Yusong Zhu·首次提交 2026-02-18 · 修订 2026-06-22 · v2·arXiv预印本
稀疏恢复中遗忘模型与自适应模型的可分离性AI 解读
Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics. In this work, we investigate the statistical and computational landscapes of sparse recovery with $\ell_\infty$ error guarantees. This variant of the problem is motivated by \emph{variable selection} tasks, where the goal is to estimate the support of a $k$-sparse signal in $\mathbb{R}^d$. Our main contribution is a provable separation between the \emph{oblivious}…
From climate teleconnections to gene regulation, modern time-series datasets encompass tens or hundreds of interacting variables, making causal discovery increasingly challenging. Constraint-based methods offer statistical rigor but their nonlinear CI tests are infeasible at scale, while score-based alternatives avoid CI testing but require arbitrary thresholds to binarize continuous edge scores. We propose GRACE ($\textbf{G}$ated $\textbf{R}$efinement for $\textbf{A}$ccurate…
Trenton Lau · Gary P. T. Choi·首次提交 2026-06-22 · 修订 2026-06-22 · v1·arXiv预印本
非光滑随机复杂度的精确 Schur-Sylvester 降维与流形采样AI 解读
The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.g., Lasso) has been historically limited by the cubic scaling walls of manifold-constrained projection and volume integration. At each step of the geometric Propose-and-Project Metropolis--Hastings (PPMH) sampler, evaluating the projection operator requires inverting an $(N+k) \times (N+k)$ generalized KKT matrix, while calculating the volume factor requires the…
Asymptotic Theory of K-fold Cross-validation in Lasso and the validity of Bootstrap
Least absolute shrinkage and selection operator or Lasso is one of the widely used regularization methods in regression. Statisticians usually implement Lasso in practice by choosing the penalty parameter in a data-dependent way, the most popular being the K−fold cross-validation (or K−fold CV). However, inferential properties, such as the variable selection consistency and n1/2−consistency, of the K−fold CV based Lasso estimator and validity of the Bootstrap…
We study the sample complexity of regularized optimal transport for general convex regularizations including the Kullback--Leibler divergence and Lp penalties. Our main results are non-asymptotic bias and variance bounds for the empirical cost, with explicit dependence on the regularization parameter and on the intrinsic dimension of the marginals. Our approach simultaneously improves, unifies, and extends existing finite-sample bounds. In particular, we improve the state…
A companion paper develops a generalised framework in which a probability law is represented by a tempered distribution T∈S′ - on the same footing as a density or characteristic function - and information is extracted by pairing T with a positive Schwartz kernel φ that acts as a measurement instrument rather than as part of the law; the resulting weak moments of all orders exist unconditionally. The present paper turns this into a methodology for…
The Donsker--Varadhan formula characterizes the ordinary Bayesian posterior as the solution of an unrestricted KL-regularized variational problem. Generalized variational inference replaces this regularizer by other divergences, but the resulting measure-valued optimization problem is often studied only after restriction to a parametric variational family. This paper studies the unrestricted measure-level problem. Given a measurable space (Z,Z)…
Many important statistical models fall outside classical moment-based methods due to the non-existence of moments or moment generating functions. We propose a generalised probabilistic framework in which a probability law is represented by a tempered distribution T∈S′, on the same footing as a density, a distribution function, or a characteristic function. Information about the law is extracted by evaluating T on test functions regularised by a given…
Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics. In this work, we investigate the statistical and computational landscapes of sparse recovery with ℓ∞ error guarantees. This variant of the problem is motivated by \emph{variable selection} tasks, where the goal is to estimate the support of a k-sparse signal in Rd. Our main contribution is a provable separation between the \emph{oblivious}…
From climate teleconnections to gene regulation, modern time-series datasets encompass tens or hundreds of interacting variables, making causal discovery increasingly challenging. Constraint-based methods offer statistical rigor but their nonlinear CI tests are infeasible at scale, while score-based alternatives avoid CI testing but require arbitrary thresholds to binarize continuous edge scores. We propose GRACE (Gated Refinement for Accurate…
The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.g., Lasso) has been historically limited by the cubic scaling walls of manifold-constrained projection and volume integration. At each step of the geometric Propose-and-Project Metropolis--Hastings (PPMH) sampler, evaluating the projection operator requires inverting an (N+k)×(N+k) generalized KKT matrix, while calculating the volume factor requires the…