A Bayesian Nonparametric Framework For Learning Disentangled Representations
Vaishnavi Patil, Siddhi Patil, Matthew Evanusa, Amit Kumar Kundu, Cornelia Fermüller, Joseph F. JáJá
摘要
Disentangled representation learning aims to identify and organize the underlying sources of variation in observed data. However, learning disentangled representations from observational data alone without any additional supervision necessitates inductive biases to solve the fundamental identifiability problem of uniquely recovering the true latent structure and parameters of the data-generating process. Existing methods address this by imposing heuristic inductive biases that typically lack these theoretical identifiability guarantees. Additionally, these methods rely on strong regularization to impose these inductive biases, creating an inherent trade-off in which stronger regularization improves disentanglement but limits the latent capacity to represent underlying variations. To address both challenges, we propose a principled generative model with a Bayesian nonparametric hierarchical mixture prior that embeds inductive biases within a provably identifiable framework for unsupervised disentanglement. Specifically, the hierarchical mixture prior imposes the structural constraints necessary for identifiability guarantees, while the nonparametric formulation allows the latent representation to scale with infinite capacity to faithfully represent the complete set of underlying variations without violating these structural constraints. To enable tractable inference under this nonparametric hierarchical prior, we develop a structured variational inference framework with a nested variational family that both preserves the hierarchical structure of the identifiable generative model and approximates the expressiveness of the nonparametric prior. We evaluate our proposed probabilistic model on standard disentanglement benchmarks, 3DShapes and MPI3D datasets characterized by diverse source variation distributions, to demonstrate that our method consistently outperforms strong baseline models through structural biases and a unified objective function, obviating the need for auxiliary regularization constraints or careful hyperparameter tuning.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper13
- Weakly-Supervised Disentanglement Without CompromisesFrancesco Locatello, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf 等ICML 2020 · 被引用 361 次
- Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse CodingDavid A. Klindt, Lukas Schott, Yash Sharma, Ivan Ustyuzhaninov 等ICLR 2021 · 被引用 156 次
- Weakly Supervised Disentanglement with GuaranteesRui Shu, Yining Chen, Abhishek Kumar, Stefano Ermon 等ICLR 2020 · 被引用 148 次
- Posterior Collapse and Latent Variable Non-identifiabilityYixin Wang, David M. Blei, John P. CunninghamNeurIPS 2021 · 被引用 97 次
- Identifiability of deep generative models without auxiliary informationBohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon AragamNeurIPS 2022 · 被引用 87 次
相关 Paper
- An Identifiable Double VAE For Disentangled RepresentationsGraziano Mita, Maurizio Filippone, Pietro MichiardiICML 2021 · 被引用 39 次
- Bayes-Factor-VAE: Hierarchical Bayesian Deep Auto-Encoder Models for Factor DisentanglementMinyoung Kim, Yuting Wang, Pritish Sahu, Vladimir PavlovicICCV 2019 · 被引用 29 次
- VDSM: Unsupervised Video Disentanglement With State-Space Modeling and Deep Mixtures of ExpertsMatthew J. Vowels, Necati Cihan Camgöz, Richard BowdenCVPR 2021
- Continual Unsupervised Disentangling of Self-Organizing RepresentationsZhiyuan Li, Xiajun Jiang, Ryan Missel, Prashnna Kumar Gyawali 等ICLR 2023
- Geometric Inductive Biases for Identifiable Unsupervised Learning of Disentangled RepresentationsZiqi Pan, Li Niu, Liqing ZhangAAAI 2023 · 被引用 3 次
