arXiv Machine Learning By Tom\`as Garriga, Valentyn Melnychuk, Konstantin Hess, Eduard Serrahima de Cambra, Axel Brando, Gerard Sanz, Stefan Feuerriegel

OrthoGen: A Generative Orthogonal Learner for Time-Varying Treatments

Read the original on arXiv Machine Learning →

OrthoGen introduces a generative orthogonal learner for estimating conditional distributional potential outcomes (CDPOs) under time‑varying treatments, addressing challenges of time‑varying confounding. It combines a generative recursive g‑computation adjustment strategy with Neyman‑orthogonal, doubly robust learning, achieving rate double robustness and quasi‑oracle efficiency. The method is flexible, supporting various generative backbones, and demonstrates strong performance on synthetic, semi‑synthetic, and real‑world 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
Jun 4

Orthogonal Learner for Estimating Heterogeneous Long-Term Treatment Effects

arXiv:2604. 00915v2 Announce Type: replace Abstract: Estimation of heterogeneous long-term treatment effects (HLTEs) is relevant for personalized decision-making in marketing, economics, and medicine, where short-term observational datasets are often combined with long-term observational datasets.

By Haorui Ma, Dennis Frauen, Valentyn Melnychuk, Stefan Feuerriegel
arXiv Machine Learning
Oct 28

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

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.

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

ProximalFM: Amortized Proximal Causal Inference under Hidden Confounding

ProximalFM is a transformer‑based model that uses prior‑data fitted networks (PFNs) to perform Bayesian proximal causal inference under hidden confounding. By training on synthetic data generated from structural causal models with oracle counterfactuals, it amortizes the Bayesian operator inversion into a single forward pass, producing posterior estimates of the conditional average treatment effect (CATE). The approach consistently outperforms prior methods across various proximal regimes, especially when latent confounding is strong and proxy variables are weakly informative, and it requires no dataset‑specific tuning.

By Christophe Muller, Ayub Kharel, Alex Luedtke, Chan Park, Eric Tchetgen Tchetgen, Juan L. Gamella, Rahul Krishnan, Ricardo Silva, Jakob Zeitler
arXiv AI
Jun 10

MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidance

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.

By Matina Mahdizadeh Sani, Nima Jamali, Mohammad Jalali, Farzan Farnia