arXiv Statistics ML

Mixed Engression: Distributional Regression for Multivariate Mixed-Type Responses

arXiv Machine Learning
Sep 1

Prediction-Powered Conditional Inference

arXiv:2603.05575v2 Announce Type: replace-cross Abstract: We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a blac...

By Yang Sui, Jin Zhou, Hua Zhou, Xiaowu Dai
arXiv Machine Learning
Sep 25

Sufficiently Reduced Distributional Regression

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.

By Alexander Henzi, Tiange Liu, Xinwei Shen
arXiv Machine Learning
Oct 16

Complete or Sparse: A Tale of Two Identifiabilities

The paper investigates when supervised learning can recover the true latent variables that generate data, focusing on two causal settings: generative (labels cause latents) and discriminative (latents cause labels). It shows that if the representation space has at least as many dimensions as the latent space, optimal encoders are linear; otherwise, identifiability fails and encoders become nonlinear. Additional constraints—such as non‑negative activations in the generative case or sparsity and spark conditions in the discriminative case—enable recovery of individual latent variables, linking nonlinear ICA, compressed sensing, and neural network interpretability.

By Junze Zhou, David Klindt
arXiv Machine Learning
Oct 5

When Is Accuracy Evidence? A Unified Theory of Generalisation, Validation, and Information Fusion

The paper introduces a unified exponential framework for generalising K‑fold cross‑validation (CV) accuracy into conservative risk bounds, called gamma‑CUBV. It models dependence between folds via a joint sub‑Gaussian proxy matrix, yielding an effective number of folds and showing that more folds do not always increase evidence when data are strongly correlated. The framework extends to posterior predictor distributions and weighted multi‑source fusion, and is empirically evaluated on linear classifiers trained on heterogeneous multimodal Gaussian mixtures, demonstrating that corrected resubstitution can be tighter than K‑fold CV in low‑sample, high‑heterogeneity settings.

By JM Gorriz