Gaussian and non-Gaussian universality of data augmentation
数据增强的高斯与非高斯普适性AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用机器学习数据增强理论,未涉及宏观预测、收益预测或其他所列具体方向。
数据增强的高斯与非高斯普适性AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We provide universality results that quantify how data augmentation affects the variance and limiting distribution of estimates through simple surrogates, and analyze several specific models in detail. The results confirm some observations made in machine learning practice, but also lead to unexpected findings: Data augmentation may increase rather than decrease the uncertainty of estimates, such as the empirical prediction risk. It can act as a regularizer, but fails to do so in certain high-dimensional problems, and it may shift the double-descent peak of an empirical risk. Overall, the analysis shows that several properties attributed to data augmentation are not either true or false, but rather depend on a combination of factors—notably the data distribution, the properties of the estimator, and the interplay of sample size, number of augmentations and dimension. As our main theoretical tool, we develop an adaptation of Lindeberg’s technique for block dependence. The resulting universality regime may be Gaussian or non-Gaussian.
跨疾病临床治疗指标的关联:基于 SEER-Medicare 的深度神经网络分析
In outcomes research, clinical treatment measures are routinely analyzed. Most existing studies focus on individual diseases, and increasing recent evidence suggests that clinical treatment measures of different diseases can be “correlated” (or interconnected). Existing studies on such interconnections are usually limited to a small number of diseases. In this study, for U.S. older patients with common cancers, we complement the existing literature and conduct a pan-disease…
相关任务间的经验贝叶斯谱部分汇聚
Spectral methods are central to high-dimensional statistics and machine learning, underlying procedures for covariance estimation, matrix denoising, representation learning, clustering, and latent variable modeling. In this work, we focus primarily on spectral estimators for high-dimensional factor models, where leading singular vectors of the data matrix are used to estimate latent structure and covariance parameters. In many modern applications, however, data are collected…
半连续结果的潜在空间统计学习框架:正则化偏差与边界稳定优化
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…
正则非光滑模型的归一化最大似然:测度论基础与几何采样
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…
不可观测异质性的去偏机器学习:高维面板与测量误差模型
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…
谁驱动系统?根据轨迹数据分类平均场粒子系统
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.…