arXiv Machine Learning

Geometric Causal Models

arXiv:2607. 05153v1 Announce Type: cross Abstract: Scientists often seek to draw causal inferences from structured data that is not independently and identically distributed, such as spatial data, network data, or molecular data.

arXiv Machine Learning
Jun 9

Causal Representation Learning from Network Data

arXiv:2509. 01916v2 Announce Type: replace Abstract: Causal disentanglement from soft interventions is identifiable under the assumptions of linear interventional faithfulness and availability of both observational and interventional data.

By Jifan Zhang, Michelle M. Li, Elena Zheleva
arXiv AI
Jun 30

Representation Learning for Equivariant Inference with Guarantees

arXiv:2505. 19809v3 Announce Type: replace-cross Abstract: In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency.

By Daniel Ordo\~nez-Apraez, Vladimir Kosti\'c, Alek Fr\"ohlich, Vivien Brandt, Karim Lounici, Massimiliano Pontil
arXiv Machine Learning
Jul 10

Structure Learning on Clustered Data

arXiv:2607. 08238v1 Announce Type: new Abstract: Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery.

By Ryan Thompson, Matt P. Wand, Veerabhadran Baladandayuthapani
arXiv AI
Aug 25

Joint Causal Structure and Cluster Discovery Using Variational Inference

The paper introduces a variational inference framework that jointly discovers latent clusters of variables and the causal relationships among those clusters. It models clusters with categorical distributions and graph structures with Bernoulli distributions, deriving variational lower bounds and estimation techniques for learning both cluster assignments and causal links. The method’s effectiveness is shown on synthetic and real datasets.

By Avni Rajpal, Anubhav Kumar, Rishabh Karnad, Mohammad Emtiyaz Khan, P. K. Srijith
arXiv Machine Learning
2d ago

RW-Flow: One-Step Generation on Compact Manifolds via Wasserstein Gradient Flows

RW-Flow presents a new one‑step generative framework for data on compact manifolds, leveraging Wasserstein gradient flows. The authors derive a necessary and sufficient identifiability condition for velocity fields on compact, connected Riemannian manifolds, showing that a symmetric, Lipschitz‑continuous cost function yields identifiability iff its Gibbs kernel is nondegenerate. Experiments on geospatial events, protein and RNA torsion angles, and discretized manifolds demonstrate that RW‑Flow surpasses existing one‑step methods across most benchmark settings.

By Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn, Minhyuk Sung