Belted Engression: Sufficient Dimension Reduction for Generative Distributional Regression
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
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. 16725v1 Announce Type: cross Abstract: Conditional generative modeling remains a challenging problem in semi-supervised settings where labeled data is scarce but unlabeled samples are abundant.
arXiv:2607. 24983v1 Announce Type: cross Abstract: Generative models are increasingly adopted in distributionally robust optimization (DRO), but existing approaches trade off model compatibility and adversarial structure: methods that accept arbitrary samplers do not restrict worst-case laws to a generator family, while generator-parameterized adversaries rely on model-specific access such as likelihoods, scores, or training data.
The paper introduces Conditional-Independence-Regularized Distributional Autoencoders, a framework for learning low-dimensional representations of mixed-type data that includes both numerical and categorical variables. It uses an energy-score objective for numerical variables, a likelihood objective for categorical variables, and an auxiliary conditional independence regularization term to capture dependencies between variable types. The authors provide theoretical analysis and demonstrate that the method improves categorical distribution recovery, achieves competitive overall conditional distribution recovery, and preserves mixed-type dependence structure on synthetic and real-world datasets.
arXiv:2609.37381v1 Announce Type: new Abstract: Neural simulation-based inference (SBI) has been widely successful in inferring a relatively small number of interpretable parameters from potentially...
The paper introduces the transport Neural Tangent Kernel (tNTK) to enable active learning for conditional generative models that produce distributional outputs. By decomposing the Wasserstein test risk into mean and shape components, the authors show that mean‑based active learning misses distributional shape, and propose tNTK as a tractable kernel that captures sensitivity of the predicted distribution to model parameters. Using tNTK as a Gaussian process covariance, they greedily select inputs that minimize posterior variance, and demonstrate that this distribution‑aware strategy outperforms mean‑based NTK baselines across several generative model types and datasets.