arXiv Machine Learning By Jayoung Ryu, Kyunghyun Cho, Romain Lopez

Active Learning of Conditional Generative Models via the Transport Neural Tangent Kernel

Read the original on arXiv Machine Learning →

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.

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 Machine Learning
Oct 9

Barron Optimal Transport I: Generative Modeling

The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.

By Evan Dogariu, Joan Bruna
arXiv Machine Learning
Sep 29

Distribution-Conditioned Transport

The paper introduces Distribution‑Conditioned Transport (DCT), a framework that learns transport maps conditioned on embeddings of source and target distributions, allowing generalization to unseen distribution pairs. DCT supports semi‑supervised learning for distributional forecasting by leveraging distributions observed at only one condition. It is agnostic to the transport mechanism and is demonstrated on synthetic benchmarks and four biological applications, including batch effect transfer in single‑cell genomics and modeling T‑cell receptor sequence evolution.

By Nic Fishman, Gokul Gowri, Paolo L. B. Fischer, Marinka Zitnik, Omar Abudayyeh, Jonathan Gootenberg
arXiv Machine Learning
Oct 12

Transformer-based In-Context Score Operator Learning for Diffusion Models

The paper introduces a transformer-based framework that learns an in‑context score operator for diffusion models, allowing the model to perform reverse‑diffusion sampling on unseen target distributions specified by a small empirical context set. By representing the task‑dependent score as a Gaussian‑kernel conditional mean and approximating it with a transformer‑based query‑dependent attention architecture, the method can adapt to new tasks without retraining or parameter updates. The authors provide theoretical generalization‑error bounds and evaluate the approach on scientific and visual datasets, noting strong performance on simple task families and limitations as task complexity grows.

By Wuzhe Xu, Zhaiming Shen, Yulong Lu, Wenjing Liao, Rongjie Lai