arXiv:2402. 13425v3 Announce Type: replace-cross Abstract: It is becoming increasingly common in regression to train neural networks that model the entire distribution even if only the mean is required for prediction.
arXiv:2209. 01754v5 Announce Type: replace-cross Abstract: 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.
arXiv:2606. 01002v1 Announce Type: cross Abstract: Engression is a recently proposed and effective framework for conditional distribution learning.
The paper introduces BROT, a two‑step approach for estimating optimal transport maps. First, it computes the unregularized OT plan, then fits a deep neural network to the resulting barycentric targets using least‑squares regression. The authors prove that, under standard regularity conditions, BROT achieves the minimax convergence rate when the true OT map is Lipschitz, and demonstrate its effectiveness on synthetic data, images, and downstream tasks such as single‑cell perturbation prediction and unsupervised domain adaptation.
arXiv:2506. 14194v2 Announce Type: replace Abstract: We present a theory for the construction of out-of-distribution (OOD) detection features for neural networks.
arXiv:2503. 18314v5 Announce Type: replace-cross Abstract: We present LoTUS, a novel Machine Unlearning (MU) method that eliminates the influence of training samples from pre-trained models, avoiding retraining from scratch.
arXiv:2606. 06772v1 Announce Type: cross Abstract: Understanding the generalization performance of over-parameterized neural networks has become a central topic in deep learning theory.
arXiv:2607. 26562v1 Announce Type: cross Abstract: We study optimization under performative prediction, where deploying a model affects the future data distribution.
arXiv:2607. 13550v1 Announce Type: cross Abstract: Boosting is one of the most successful learning techniques for standard classification and regression tasks.
Sufficiently Reduced Distributional Regression (SRDR) is a generative approach that merges conditional distribution estimation with nonlinear sufficient dimension reduction (SDR). By framing SDR as a risk minimization problem using strictly proper scoring rules, SRDR jointly learns a dimension reduction map and a generative prediction model through minimization of the energy score, which can be estimated via sampling. The method extends to multi‑environment data and classification, and theoretical results show convergence of estimated conditional distributions in energy distance, implying asymptotic sufficiency. In experiments on CT slice localization, superconductivity data, and digit classification, SRDR recovers low‑dimensional sufficient structure and matches or surpasses state‑of‑the‑art nonlinear SDR methods in representation quality and predictive performance.
arXiv:2607. 14306v1 Announce Type: new Abstract: In this paper, we study the connection between an LLM's output distribution and the data used to train it.
arXiv:2606. 06764v1 Announce Type: cross Abstract: Recent progress has been made in understanding the statistical generalization performance of gradient descent methods for overparameterized neural networks within the neural tangent kernel (NTK) regime.
arXiv:2503. 08038v2 Announce Type: replace-cross Abstract: In this paper, we delve deeper into the Kullback-Leibler (KL) Divergence loss and mathematically prove that it is equivalent to the Decoupled Kullback-Leibler (DKL) Divergence loss that consists of (1) a weighted Mean Square Error (wMSE) loss and (2) a Cross-Entropy loss incorporating soft labels.