Papers › Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions,...

Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies

10 Jan 2024arXiv:2401.04890archive 2025-07-28

Sébastien Lachapelle, Pau Rodríguez López, Yash Sharma, Katie Everett, Rémi Le Priol, Alexandre Lacoste, Simon Lacoste-Julien

This work introduces a novel principle for disentanglement we call mechanism sparsity regularization, which applies when the latent factors of interest depend sparsely on observed auxiliary variables and/or past latent factors. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors and the sparse causal graphical model that explains them. We develop a nonparametric identifiability theory that formalizes this principle and shows that the latent factors can be recovered by regularizing the learned causal graph to be sparse. More precisely, we show identifiablity up to a novel equivalence relation we call "consistency", which allows some latent factors to remain entangled (hence the term partial disentanglement). To describe the structure of this entanglement, we introduce the notions of entanglement graphs and graph preserving functions. We further provide a graphical criterion which guarantees complete disentanglement, that is identifiability up to permutations and element-wise transformations. We demonstrate the scope of the mechanism sparsity principle as well as the assumptions it relies on with several worked out examples. For instance, the framework shows how one can leverage multi-node interventions with unknown targets on the latent factors to disentangle them. We further draw connections between our nonparametric results and the now popular exponential family assumption. Lastly, we propose an estimation procedure based on variational autoencoders and a sparsity constraint and demonstrate it on various synthetic datasets. This work is meant to be a significantly extended version of Lachapelle et al. (2022).

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2401.04890")

Code

Syntology Ran 9 of 12 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

cooper-org/cooper officialmentioned in papermentioned on GitHubpytorchMIT report
slachapelle/disentanglement_via_mechanism_sparsity officialmentioned in papermentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 9 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

9ran
3unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from slachapelle/disentanglement_via_mechanism_sparsity. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

MIG slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/metric_helpers/mi_metric.py official repository ran fingerprinted Apache-2.0 (permissive) · 223acfe09c0cf307 · report
analytical_NLL slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/elbo_decomposition.py official repository ran Apache-2.0 (permissive) · 4ebef74ecd436d41 · report
compute_nll slachapelle/disentanglement_via_mechanism_sparsity/optimization.py official repository ran Apache-2.0 (permissive) · 1234a1b8db3b7662 · report
estimate_entropies slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/elbo_decomposition.py official repository ran Apache-2.0 (permissive) · 90c6b85fc73eaff7 · report
get_z_z_hat slachapelle/disentanglement_via_mechanism_sparsity/metrics.py official repository ran Apache-2.0 (permissive) · 94b6cedb5f7e3107 · report
logsumexp slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/elbo_decomposition.py official repository ran Apache-2.0 (permissive) · fca04e40e0d22d1e · report
plot_matrix slachapelle/disentanglement_via_mechanism_sparsity/plot.py official repository ran Apache-2.0 (permissive) · b6467967b5103c2a · report
plot_weighted_adjacency_vs_steps slachapelle/disentanglement_via_mechanism_sparsity/plot.py official repository ran Apache-2.0 (permissive) · 36c18134426cf72b · report
test_consistency slachapelle/disentanglement_via_mechanism_sparsity/metrics.py official repository ran Apache-2.0 (permissive) · 2718ed7bc7052230 · report
compute_metric_faces slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/metric_helpers/mi_metric.py official repository unverified Apache-2.0 (permissive) · c6b4e17ded1255db · report
compute_metric_shapes slachapelle/disentanglement_via_mechanism_sparsity/baseline_models/beta-tcvae/metric_helpers/mi_metric.py official repository unverified Apache-2.0 (permissive) · f1bd7b98a30a255d · report
mean_corr_coef_np slachapelle/disentanglement_via_mechanism_sparsity/metrics.py official repository unverified Apache-2.0 (permissive) · a83f8c46ef72bb82 · report

Tasks

DisentanglementRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections