arXiv:2410. 02628v5 Announce Type: replace Abstract: Learning conditional distributions $\pi^*(\cdot|x)$ is a central problem in machine learning, which is typically approached via supervised methods with paired data $(x,y) \sim \pi^*$.
arXiv:2502. 05684v5 Announce Type: replace-cross Abstract: How can we effectively remove or ``unlearn'' undesirable information, such as specific features or the influence of individual data points, from a learning outcome while minimizing utility loss and ensuring rigorous guarantees?
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.
The paper introduces LUD-DIF, a diffusion-based method that solves inverse problems using unpaired data. By deriving the evidence lower bound of the joint distribution and decoupling it into two independent diffusion processes under a weak‑coupling assumption, the authors provide a variational inference framework, a loss function, and an error‑bound analysis. Experiments show that LUD‑DIF performs well across multiple image inverse problems, demonstrating its effectiveness and generalization in unpaired settings.
arXiv:2608.22746v1 Announce Type: new Abstract: This paper studies the Sinkhorn distributionally robust hypothesis testing (SDRHT) problem, seeking a robust detector against least-favorable distribut...
The paper introduces the Ensemble-conditioned Inverse Problem (EIP), a multivariate statistical framework for inferring an ensemble that follows the pushforward of a prior through a forward process. It applies to fields such as high‑energy physics, full waveform inversion, and inverse imaging, and proposes non‑iterative inference‑time methods using ensemble inverse generative models that avoid explicit forward model use during inference. The authors demonstrate the approach on synthetic and real datasets and provide code for replication.
arXiv:2601. 08379v2 Announce Type: replace-cross Abstract: Pre-trained diffusion models have emerged as powerful generative priors for both unconditional and conditional sample generation, yet their outputs often deviate from the characteristics of user-specific target data.
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. 30230v1 Announce Type: cross Abstract: Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training.
Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite-dimensional spaces. Functional Flow Matching (FF...
arXiv:2602. 02241v2 Announce Type: replace Abstract: Entropic optimal transport (EOT) in continuous spaces with quadratic cost is a classical tool for solving the domain translation problem.
arXiv:2608. 09074v1 Announce Type: cross Abstract: We develop a new approach to Personalized Federated Learning across heterogeneous clients using Nonparametric Empirical Bayes (NPEB).