论文检索

基于正则化对抗重加权的前验知情可泛化低秩表示学习AI 解读

Modern learning problems increasingly leverage data from heterogeneous sources to improve robustness and generalizability under distribution shift, often with high-dimensional parameters admitting low-rank structure. Existing group distributionally robust optimization (group-DRO) approaches optimize against adverse source mixtures, but extending this principle to low-rank matrix estimation with a broad class of losses leads to a challenging nonconvex-concave problem for…

比例高维线性模型中的最优线性泛函估计AI 解读

We study estimation of a linear functional in random-design linear models when $γ=p/n \in (1, \infty)$ under the dense regime where the design covariance is unknown, and neither the regression vector nor the precision matrix is assumed sparse. Suppose the spectrum of the design covariance belongs to $[\ell,L]$, we establish the minimax mean squared rate for the linear functional has the order $n^{-α(κ,γ)}$, where the exponent $α(κ,γ)$ has an explicit elliptic-integral…

基于中位数后验推断的可扩展高斯过程回归：估计多污染物混合健康效应AI 解读

Humans are exposed to complex mixtures of environmental pollutants rather than single chemicals, necessitating methods to quantify the health effects of such mixtures. Research on environmental mixtures provides insights into realistic exposure scenarios, informing regulatory policies that better protect public health. However, statistical challenges, including complex correlations among pollutants and nonlinear multivariate exposure-response relationships, complicate such…

具有统计保证的分布式估计与推断AI 解读

This paper studies hypothesis testing and parameter estimation in the context of the divide and conquer algorithm. In a unified likelihood based framework, we propose new test statistics and point estimators obtained by aggregating various statistics from $k$ subsamples of size $n/k$, where $n$ is the sample size. In both low dimensional and high dimensional settings, we address the important question of how to choose $k$ as $n$ grows large, providing a theoretical upper…