Geometry-Aware Normalizing Wasserstein Flows for Optimal Causal Inference

2023-11-30 · Kaiwen Hou

This paper presents a groundbreaking approach to causal inference by integrating continuous normalizing flows (CNFs) with parametric submodels, enhancing their geometric sensitivity and improving upon traditional Targeted Maximum Likelihood Estimation (TMLE). Our method employs CNFs to refine TMLE, optimizing the Cram\'er-Rao bound and transitioning from a predefined distribution $p_0$ to a data-driven distribution $p_1$. We innovate further by embedding Wasserstein gradient flows within Fokker-Planck equations, thus imposing geometric structures that boost the robustness of CNFs, particularly in optimal transport theory. Our approach addresses the disparity between sample and population distributions, a critical factor in parameter estimation bias. We leverage optimal transport and Wasserstein gradient flows to develop causal inference methodologies with minimal variance in finite-sample settings, outperforming traditional methods like TMLE and AIPW. This novel framework, centered on Wasserstein gradient flows, minimizes variance in efficient influence functions under distribution $p_t$. Preliminary experiments showcase our method's superiority, yielding lower mean-squared errors compared to standard flows, thereby demonstrating the potential of geometry-aware normalizing Wasserstein flows in advancing statistical modeling and inference.

📄 PDF Abstract BibTeX arXiv:2311.18826

Code (0)

등록된 구현이 없습니다.

Tasks

Causal Inferenceparameter estimation

Methods 이 논문이 사용한 방법론

ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…

Causal inference Causal inference is the process of drawing a conclusion about a causal connection based on the conditions of the occurrence of an effect. The main difference between causal…

Normalizing Flows Normalizing Flows are a method for constructing complex distributions by transforming a probability density through a series of invertible mappings. By repeatedly applying…

Radon--Wasserstein Gradient Flows for Interacting-Particle Sampling in High Dimensions

2026-02-05 · Elias Hess-Childs, Dejan Slepčev, Lantian Xu arxiv

Gradient flows of the Kullback--Leibler (KL) divergence, such as the Fokker--Planck equation and Stein Variational Gradient Descent, evolve a distribution toward a target density known only up to a normalizing constant. …

A mean-field games laboratory for generative modeling

2023-04-26 · Benjamin J. Zhang, Markos A. Katsoulakis

We demonstrate the versatility of mean-field games (MFGs) as a mathematical framework for explaining, enhancing, and designing generative models. In generative flows, a Lagrangian formulation is used where each particle …

Flow Models for Unbounded and Geometry-Aware Distributional Reinforcement Learning

2025-05-07 · Simo Alami C., Rim Kaddah, Jesse Read, Marie-Paule Cani

We introduce a new architecture for Distributional Reinforcement Learning (DistRL) that models return distributions using normalizing flows. This approach enables flexible, unbounded support for return distributions, in …

Distributional Reinforcement Learning

Sliced-Wasserstein normalizing flows: beyond maximum likelihood training

2022-07-12 · Florentin Coeurdoux, Nicolas Dobigeon, Pierre Chainais

Despite their advantages, normalizing flows generally suffer from several shortcomings including their tendency to generate unrealistic data (e.g., images) and their failing to detect out-of-distribution data. One reason…

Riemannian Continuous Normalizing Flows

2020-06-18 · NeurIPS 2020 12 · Emile Mathieu, Maximilian Nickel

Normalizing flows have shown great promise for modelling flexible probability distributions in a computationally tractable way. However, whilst data is often naturally described on Riemannian manifolds such as spheres, t…