arXiv Machine Learning
Hessian Rank Constraint for Learning Structure of Nonlinear Latent Variable Models
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 17
Provable Guarantees and Efficient Learning of Structural Equation Models with Latent Confounders
arXiv:2609. 18535v1 Announce Type: new Abstract: Causal discovery aims to recover causal relationships from observed data.
arXiv Machine Learning
Jul 21
Unveiling Invariant and Transferable Latent Factors Across Heterogeneous Environments via ATLAS
arXiv:2607. 18209v1 Announce Type: cross Abstract: This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments.
arXiv Machine Learning
Jul 17
Causal Inference for Sequential Settings under Interference and Latent Confounding
arXiv:2607. 14940v1 Announce Type: new Abstract: We study causal inference under outcome interference for sequential, observational settings.
arXiv Machine Learning
Jul 7
MDL Meets Latent Confounders: LNML-based Causal Discovery
arXiv:2607. 04133v1 Announce Type: new Abstract: Causal discovery with nonlinear mechanisms and latent confounders remains challenging.
arXiv AI
3d ago
Differentiable Structure Learning for Cyclic Linear Gaussian Models with Latent Confounders
The paper introduces a method for learning causal structures in linear Gaussian models that may contain directed cycles and an unknown number of latent confounders, bounded by a maximum. It derives the covariance of observed variables, defines marginal quasi-equivalence to identify when different models produce the same observational distributions, and formulates structure learning as a minimization of Gaussian negative log-likelihood with a complexity penalty counting edges and latent variables. Using Bernoulli gates to parameterize edge and latent inclusion, the authors obtain a closed‑form differentiable objective whose expected value shares the same global optimum as the discrete problem, and demonstrate experimentally that this approach yields lower recovery error than prior methods.
arXiv Machine Learning
Sep 1
Jigsaw-CRL: Recovering Global Latent Causal Order from Fragmented Multi-Client Interventions
arXiv:2608.28991v1 Announce Type: cross Abstract: Causal representation learning (CRL) aims to recover latent causal variables and their structural relations from high-dimensional observations. Exist...