mlsanityData to 14 Oct 2026

Learning Generalized Gumbel-max Causal Mechanisms

arXiv 2111.06888 ↗First posted 11 Nov 2021cs.LG stat.CO stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

To perform counterfactual reasoning in Structural Causal Models (SCMs), one needs to know the causal mechanisms, which provide factorizations of conditional distributions into noise sources and deterministic functions mapping realizations of noise to samples. Unfortunately, the causal mechanism is not uniquely identified by data that can be gathered by observing and interacting with the world, so there remains the question of how to choose causal mechanisms. In recent work, Oberst & Sontag (2019) propose Gumbel-max SCMs, which use Gumbel-max reparameterizations as the causal mechanism due to an intuitively appealing counterfactual stability property. In this work, we instead argue for choosing a causal mechanism that is best under a quantitative criteria such as minimizing variance when estimating counterfactual treatment effects. We propose a parameterized family of causal mechanisms that generalize Gumbel-max. We show that they can be trained to minimize counterfactual effect variance and other losses on a distribution of queries of interest, yielding lower variance estimates of counterfactual treatment effect than fixed alternatives, also generalizing to queries not seen at training time.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 18 of its 35 references that are in the map. First posted on arXiv 11 Nov 2021.

Builds on

18 of 35 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  5. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  6. 2017Wasserstein GANcited by 639
  7. 2015Optimal Transport for Domain Adaptationcited by 463
  8. 2015Learning with a Wasserstein Losscited by 196
  9. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  10. 2014A* Samplingcited by 151
  11. 2019Counterfactual Off-Policy Evaluation with Gumbel-Max Structural Causal Modelscited by 117
  12. 2017Backpropagation through the Void: Optimizing control variates for black-box gradient estimationcited by 106
6 more
  1. 2017Smooth and Sparse Optimal Transportcited by 83
  2. 2018Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Searchcited by 82
  3. 2020Sample-Efficient Reinforcement Learning via Counterfactual-Based Data Augmentationcited by 59
  4. 2018Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distancecited by 56
  5. 2017Structured Optimal Transportcited by 31
  6. 2017Learning Wasserstein Embeddingscited by 26

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 4; 2023: 4; 2024: 5; 2025: 2; 2026: 1.

16 papers.

Sort:

By area: