paper-with-me

Papers

DEFT: Distilling Entangled Factors by Preventing Information Diffusion

2021-02-08 · Jiantao Wu, Lin Wang, Bo Yang, Fanqi Li, Chunxiuzi Liu, Jin Zhou

Disentanglement is a highly desirable property of representation owing to its similarity to human understanding and reasoning. Many works achieve disentanglement upon information bottlenecks (IB). Despite their elegant mathematical foundations, the IB branch usually exhibits lower performance. In order to provide an insight into the problem, we develop an annealing test to calculate the information freezing point (IFP), which is a transition state to freeze information into the latent variables. We also explore these clues or inductive biases for separating the entangled factors according to the differences in the IFP distributions. We found the existing approaches suffer from the information diffusion problem, according to which the increased information diffuses in all latent variables. Based on this insight, we propose a novel disentanglement framework, termed the distilling entangled factor (DEFT), to address the information diffusion problem by scaling backward information. DEFT applies a multistage training strategy, including multigroup encoders with different learning rates and piecewise disentanglement pressure, to disentangle the factors stage by stage. We evaluate DEFT on three variants of dSprite and SmallNORB, which show low-variance and high-level disentanglement scores. Furthermore, the experiment under the correlative factors shows incapable of TC-based approaches. DEFT also exhibits a competitive performance in the unsupervised setting.

📄 PDF Abstract BibTeX arXiv:2102.03986

Code (0)

등록된 구현이 없습니다.

Tasks

Disentanglement

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Efficient Detection of Exchangeable Factors in Factor Graphs

2024-03-15 · Malte Luttermann, Johann Machemer, Marcel Gehrke

To allow for tractable probabilistic inference with respect to domain sizes, lifted probabilistic inference exploits symmetries in probabilistic graphical models. However, checking whether two factors encode equivalent s…

Diffusion-Based Generation of Neural Activity from Disentangled Latent Codes

2024-07-30 · Jonathan D. McCart, Andrew R. Sedler, Christopher Versteeg, Domenick Mifsud 외

Recent advances in recording technology have allowed neuroscientists to monitor activity from thousands of neurons simultaneously. Latent variable models are increasingly valuable for distilling these recordings into com…

Mutual Information Minimization Based Disentangled Learning Framework For Causal Effect Estimation

2021-09-29 · Mingyuan Cheng

Learning treatment effect from observational data is a fundamental problem in causal inference. Recently, disentangled representation learning methods, such as DR-CFR and DeR-CFR, have witnessed great success in treatmen…

Causal InferenceRepresentation Learning

Disentangled Graph Collaborative Filtering

2020-07-03 · Xiang Wang, Hongye Jin, An Zhang, Xiangnan He 외

Learning informative representations of users and items from the interaction data is of crucial importance to collaborative filtering (CF). Present embedding functions exploit user-item relationships to enrich the repres…

Collaborative FilteringDisentanglement

Participation de l'IRISA \`a DeFT2012 : recherche d'information et apprentissage pour la g\'en\'eration de mots-cl\'es (IRISA participation to DeFT2012: information retrieval and machine-learning for keyword generation) [in French]

2012-06-01 · JEPTALNRECITAL 2012 6 · Vincent Claveau, Christian Raymond
Information RetrievalRetrieval