Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryan Welch

dblp:391/6798 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 67% Probabilistic and Bayesian machine learning · 33%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
causal disentanglement
0.812024
Identifiability Guarantees for Causal Disentanglement from Purely Observational Data · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal model
0.812024
Identifiability Guarantees for Causal Disentanglement from Purely Observational Data · NeurIPS 2024
Machine learning › Representation and self-supervised learning › causal representation learning
identifiability
0.812024
Identifiability Guarantees for Causal Disentanglement from Purely Observational Data · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

score estimation · 0.8quadratic programming · 0.8
YearPublicationVenuePosition
2024 Identifiability Guarantees for Causal Disentanglement from Purely Observational Data
abstract
Causal disentanglement aims to learn about latent causal factors behind data, hold- ing the promise to augment existing representation learning methods in terms of interpretability and extrapolation. Recent advances establish identifiability results assuming that interventions on (single) latent factors are available; however, it re- mains debatable whether such assumptions are reasonable due to the inherent nature of intervening on latent variables. Accordingly, we reconsider the fundamentals and ask what can be learned using just observational data. We provide a precise characterization of latent factors that can be identified in nonlinear causal models with additive Gaussian noise and linear mixing, without any interventions or graphical restrictions. In particular, we show that the causal variables can be identified up to a _layer_-wise transformation and that further disen- tanglement is not possible. We transform these theoretical results into a practical algorithm consisting of solving a quadratic program over the score estimation of the observed data. We provide simulation results to support our theoretical guarantees and demonstrate that our algorithm can derive meaningful causal representations from purely observational data.
Ryan Welch, Jiaqi Zhang 0006, Caroline Uhler
NeurIPS1