Learning Representations without Compositional Assumptions

Tennison Liu, Jeroen Berrevoets, Zhaozhi Qian, M. Schaar
2/12/2026

No confident code implementation found for this paper.

Abstract

This paper addresses unsupervised representation learning on tabular data containing multiple views generated by distinct sources of measurement. Traditional methods, which tackle this problem using the multi-view framework, are constrained by predefined assumptions that assume feature sets share the same information and representations should learn globally shared factors. However, this assumption is not always valid for real-world tabular datasets with complex dependencies between feature sets, resulting in localized information that is harder to learn. To overcome this limitation, we propose a data-driven approach that learns feature set dependencies by representing feature sets as graph nodes and their relationships as learnable edges. Furthermore, we introduce LEGATO, a novel hierarchical graph autoencoder that learns a smaller, latent graph to aggregate information from multiple views dynamically. This approach results in latent graph components that specialize in capturing localized information from different regions of the input, leading to superior downstream performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{liu2026learning,
  title  = {Learning Representations without Compositional Assumptions},
  author = {Tennison Liu and Jeroen Berrevoets and Zhaozhi Qian and M. Schaar},
  year   = {2026},
  eprint = {2305.19726},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2305.19726},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.19726.svg)](https://codeofpaper.com/paper/2305.19726)

Discussion