Pith. sign in

REVIEW 2 cited by

Concept-free Causal Disentanglement with Variational Graph Auto-Encoder

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.10638 v1 pith:VGJTSZER submitted 2023-11-17 cs.LG cs.AIstat.ME

classification cs.LGcs.AIstat.ME
keywords causalconcept-freedisentanglementauto-encoderconceptdatagraphvariational
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In disentangled representation learning, the goal is to achieve a compact representation that consists of all interpretable generative factors in the observational data. Learning disentangled representations for graphs becomes increasingly important as graph data rapidly grows. Existing approaches often rely on Variational Auto-Encoder (VAE) or its causal structure learning-based refinement, which suffer from sub-optimality in VAEs due to the independence factor assumption and unavailability of concept labels, respectively. In this paper, we propose an unsupervised solution, dubbed concept-free causal disentanglement, built on a theoretically provable tight upper bound approximating the optimal factor. This results in an SCM-like causal structure modeling that directly learns concept structures from data. Based on this idea, we propose Concept-free Causal VGAE (CCVGAE) by incorporating a novel causal disentanglement layer into Variational Graph Auto-Encoder. Furthermore, we prove concept consistency under our concept-free causal disentanglement framework, hence employing it to enhance the meta-learning framework, called concept-free causal Meta-Graph (CC-Meta-Graph). We conduct extensive experiments to demonstrate the superiority of the proposed models: CCVGAE and CC-Meta-Graph, reaching up to $29\%$ and $11\%$ absolute improvements over baselines in terms of AUC, respectively.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Causal Representation Learning from Network Data

    cs.LG 2025-09 conditional novelty 6.0 of 10

    GRACE-VAE couples a graph neural network encoder with a causal discrepancy VAE decoder so that known pathway and protein networks improve learning of latent causal programs and prediction of CRISPR perturbation effects.

  2. Causal-Inspired Multi-Agent Decision-Making via Graph Reinforcement Learning

    cs.MA 2025-07 reject novelty 4.0 of 10

    A graph-RL driving agent using VGAE-based causal feature extraction achieves lower collision rates and higher rewards at a simulated unsignalized intersection than graph-RL baselines.

Pith tools