arXiv Machine Learning By Mikhail Persiianov, Arip Asadulaev, Nikita Andreev, Nikita Starodubcev, Dmitry Baranchuk, Anastasis Kratsios, Evgeny Burnaev, Alexander Korotin

Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization

Read the original on arXiv Machine Learning →

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^*$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Jul 7

Machine Unlearning via Information Theoretic Regularization

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?

By Shizhou Xu, Thomas Strohmer
arXiv AI
Sep 10

Deep Barycentric Regression for Optimal Transport Map Estimation and its Statistical Optimality

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.

By Kunwoong Kim, Insung Kong, Yongdai Kim
arXiv Computer Vision
Sep 2

Diffusion Based Unpaired Data Learning for Inverse Problems

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.

By Chenglong Bao, Yiming Dang, Chenguang Duan, Yuling Jiao, Defeng Sun
arXiv Machine Learning
Sep 24

Inverse Problems Conditioned on Observation Ensembles: Applications and Methods

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.

By Zhengyan Huan, Camila Pazos, Martin Klassen, Vincent Croft, Pierre-Hugues Beauchemin, Shuchin Aeron