论文检索

利用切片 Gibbs 采样器高效快速地从任意概率核采样AI 解读

An Automated Sliced Gibbs framework is proposed for fully automated Markov chain Monte Carlo sampling from arbitrary finite dimensional probability kernels. The method targets unnormalized, non-smooth, heavy tailed, and highly multimodal densities. A Cauchy transformation based effective support estimator is combined with slice driven Gibbs updates. This construction removes the need for user specified truncation bounds, proposal scales, step-size tuning, or conditional…

多维速度变化检测中惩罚最大似然估计的一致性AI 解读

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…

贝叶斯算子学习：高斯先验下后验存在性与点估计收敛AI 解读

We develop a Bayesian framework for learning nonlinear operators between infinite-dimensional spaces. Given a map $g_0:\mathcal{X}\to\mathcal{Y}$ between separable Hilbert spaces, we study the recovery of $g_0$ from $n\in\mathbb{N}$ noisy input-output pairs $(\boldsymbol{X},\boldsymbol{Z})=(X_i,Z_i)_{i=1}^n$ with $Z_i= g_0 (X_i ) + E_i$. Here the $X_i\in\mathcal{X}$ are randomly drawn 'design' points in a compact subset of $\mathcal X$, and the $E_i$ are assumed to be i.i.d.…

空间符号协方差矩阵的高维正则化与稳健形状估计AI 解读

Covariance estimation is a key component of many applications in system identification and data-driven control. Although heavy-tailed distributions may lack a covariance matrix to estimate, the shape matrix provides a well-defined, scale-free generalization for the broad family of elliptical distributions. In this setting, practitioners often employ Tyler's M-estimator (TME), which is defined implicitly and is computed using a fixed-point iteration. The spatial sign…

用于贝叶斯推断的正则化指数倾斜经验似然AI 解读

Bayesian inference with empirical likelihood faces a challenge as the posterior domain is a proper subset of the original parameter space due to the convex hull constraint. We propose a regularized exponentially tilted empirical likelihood to address this issue. Our method removes the convex hull constraint using a novel regularization technique, incorporating a continuous exponential family distribution to satisfy a Kullback--Leibler divergence criterion. The regularization…

面向超高维数据的贝叶斯单变量引导稀疏回归AI 解读

Ultra-high-dimensional genomic studies require simultaneous identification of sparse signals, control of spurious discoveries, and computationally feasible inference when the number of predictors can reach hundreds of thousands or more. We propose Bayesian Univariate-Guided Sparse Regression (BUGS), a global--local shrinkage framework that incorporates marginal association information directly into the prior through continuous modulation of shrinkage. By embedding univariate…

Copula主动子空间（一）：非高斯密度降维估计的得分协方差方法AI 解读

In Bayesian inference problems with non-Gaussian observation noise, the posterior is only as accurate as the noise density, and gradient-based samplers need that density and its gradient evaluable pointwise, whether from an explicit expression or from code, and without an inner solve. We propose Copula Active Subspaces (CAS) to represent this noise density. A componentwise rank transform isolates the noise law's dependence in its copula, and a rank-$r$ reduction keeps only…

随机正规算子近似下Landweber迭代的不确定性量化AI 解读

Iterative methods are extremely popular for solving linear ill-posed inverse problems. While deterministic convergence, or more precisely, semi-convergence of such methods is widely studied, the problem of quantifying uncertainty in the resulting reconstructions due to random noise in the observed data has received far less attention. In this work, we study uncertainty quantification for the Landweber iteration in linear inverse problems using the Radon transform as a…

半连续结果的潜在空间统计学习框架：正则化偏差与边界稳定优化AI 解读

Semicontinuous outcomes characterized by an exact zero mass and heavy-tailed continuous distributions challenge empirical risk modeling and machine learning. Compound Poisson-Gamma Tweedie processes impose a rigid mean-variance coupling that distorts zero-mass probabilities under extreme tail dispersion, flattening continuous density and reducing extreme-risk discrimination. Furthermore, heuristic post-hoc target capping introduces systematic bias while leaving loss…

扰动效用模型的 Fenchel–Young 估计量AI 解读

Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…

商品风险的构成：微观、市场与全经济来源AI 解读

We study the anatomy of commodity risk by distinguishing micro, market-level, and economy-wide sources. We develop a two-stage "divide-and-conquer" framework that allows sensitivities to these risk sources to vary across commodities while treating economy-wide risk as latent. The first stage uses defactored instrumental-variable estimation to recover commodity-specific sensitivities to micro and market conditions. The second combines principal components with…

熵正则化最优传输下的部分识别AI 解读

In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In such cases, one can only identify sets which are guaranteed to contain the true parameters. These are often characterized through linear programs that optimize over models compatible with the observed data. These programs can be infinite-dimensional in the optimizer and the number of constraints. We provide a unified way to…

谱正则化下均值与协方差函数的极小极大最优估计AI 解读

Estimation of the mean and covariance functions is a fundamental problem in functional data analysis, particularly for discretely observed functional data. In this work, we study a regularization-based framework for estimating the mean and the covariance functions within a reproducing kernel Hilbert space (RKHS) setting. Our approach utilizes a spectral regularization technique under Hölder-type source conditions, allowing for a broad class of regularization schemes and…

多输出系统辨识的有限样本界AI 解读

This paper presents uniform-in-time error bounds for regularized linear regression with vector-valued outputs and conditionally zero-mean subgaussian noise. By revisitileveraging self-normalized martingale arguments, we obtain bounds that apply directly to multi-output regression. These bounds are tighter and hold in more general settings than commonly used methods in finite-sample system identification. Furthermore, because of a novel treatment of the regularization bias,…

WEIRDO：以弱残差正则化估计 Doob h 变换的扩散引导AI 解读

We study the problem of estimating the guidance that steers the distribution learned by a diffusion generative model toward a tilted target $q_0 \propto w\,p_0$ at inference time. Relying on the stochastic optimal control approach, we observe that the exact drift correction is the gradient of the logarithm of Doob's $h$-function, and we study the problem of estimating it from a sample. In the present paper, we assume that the score of the pretrained model is available, that…

利用投影核与惩罚过拟合比较的自适应密度估计AI 解读

In this work, we study wavelet projection estimators for density estimation, based on compactly supported $\mathcal S$-regular scaling functions. The main issue is the choice of the resolution level, which determines the bias--variance trade-off. We select this level by a Penalized Comparison to Overfitting (PCO) criterion: each candidate estimator is compared in $Ł^2(\R)$ with a single overfitting reference, and the additional stochastic fluctuation is corrected by an…

正则非光滑模型的归一化最大似然：测度论基础与几何采样AI 解读

The Normalized Maximum Likelihood (NML) codelength, or stochastic complexity, represents a principled criterion for universal coding. While recent coarea-based formulations provided a calculation method for smooth models, this framework collapses for the non-smooth estimators ubiquitous in modern machine learning (e.g., Lasso, Sparse SVMs). In this work, we provide a rigorous framework for computing the NML for regular path-differentiable Lipschitz (PDL) estimators. By…

从最小范数插值理解延迟泛化AI 解读

Grokking shows that fitting the training data and learning the underlying signal can occur at very different stages. However, existing theories offer limited quantitative insight into how this delayed generalization depends on inductive bias and signal structure. Our work addresses the gap by developing a statistical theory that characterizes how regularization geometry and signal sparsity govern generalization near interpolation. In particular, we focus on the prototypical…

不可观测异质性的去偏机器学习：高维面板与测量误差模型AI 解读

Developing robust inference for models with nonparametric Unobserved Heterogeneity (UH) is both important and challenging. We propose novel Debiased Machine Learning (DML) procedures for valid inference on functionals of UH, allowing for partial identification of multivariate target and high-dimensional nuisance parameters. Our main contribution is a full characterization of all relevant Neyman-orthogonal moments in models with nonparametric UH, where relevance means…

基于残差化 Walsh–Hadamard 得分的异质析因效应修饰因子去偏与同时推断AI 解读

In factorial randomized experiments with $K$ binary treatment components, we study which baseline covariates modify component main effects and interactions. We define effect-modifier cells $(j,S)$, $j\in[p]$ and $\emptyset\neq S\subseteq[K]$, through the coefficients $θ^\ast_{jS}$ of population linear projections of conditional Walsh--Hadamard contrasts $τ_{S}$ onto standardized covariates. Using baseline-robust direct scores, we develop frequentist inference for all $p(2^K-1)$…

谁驱动系统？根据轨迹数据分类平均场粒子系统AI 解读

We study the supervised classification problem for interacting particle systems (IPS) from trajectory observations. The IPS belongs to one of K classes, each characterized by a distinct interaction drift. Given a learning dataset, the goal is then to predict the class label of a newly observed system based on the trajectory of a single particle. This setting raises several statistical challenges. First, the particles within each system interact and are therefore dependent.…

BRP-GABLE：适用于多种结果类型的可解释规则预测框架AI 解读

Interpretable prediction models are important in biomedical research, where predictive accuracy must often be balanced against the ability to examine predictor-outcome relationships. Automatic Binary Logistic Estimation (ABLE) provides interpretable rule-based representations by constructing additive models using threshold rules. However, the original method is restricted to binary outcomes, and its greedy forward construction follows a search path, making candidate rules…

工具变量回归中维度自适应的自助法 Anderson–Rubin 检验AI 解读

Weak-identification-robust tests for instrumental variable (IV) regressions are typically developed separately depending on whether the number of IVs is treated as fixed or increasing with the sample size, forcing researchers to make a stance on the asymptotic behavior, which is often ambiguous in practice. This paper proposes a bootstrap-based, dimension-agnostic Anderson-Rubin (AR) test that achieves correct asymptotic size regardless of whether the number of IVs is fixed…

核设定检验的数据驱动调参：选择渐近理论、有效性与功效AI 解读

We develop model checks for conditional moment restrictions whose tuning parameters, the kernel bandwidth and the regularization level, are selected by cross-validation. The tests regress the estimated residuals on the covariates via kernel ridge regression (KRR), yielding a coefficient function in a reproducing kernel Hilbert space (RKHS) that vanishes under the null and is nonzero for any misspecification not annihilated by the Neyman projection. Our central contribution…