paper-with-me

Papers

Sparsity regularization via tree-structured environments for disentangled representations

2024-05-30 · Elliot Layne, Jason Hartford, Sébastien Lachapelle, Mathieu Blanchette, Dhanya Sridhar

Many causal systems such as biological processes in cells can only be observed indirectly via measurements, such as gene expression. Causal representation learning -- the task of correctly mapping low-level observations to latent causal variables -- could advance scientific understanding by enabling inference of latent variables such as pathway activation. In this paper, we develop methods for inferring latent variables from multiple related datasets (environments) and tasks. As a running example, we consider the task of predicting a phenotype from gene expression, where we often collect data from multiple cell types or organisms that are related in known ways. The key insight is that the mapping from latent variables driven by gene expression to the phenotype of interest changes sparsely across closely related environments. To model sparse changes, we introduce Tree-Based Regularization (TBR), an objective that minimizes both prediction error and regularizes closely related environments to learn similar predictors. We prove that under assumptions about the degree of sparse changes, TBR identifies the true latent variables up to some simple transformations. We evaluate the theory empirically with both simulations and ground-truth gene expression data. We find that TBR recovers the latent causal variables better than related methods across these settings, even under settings that violate some assumptions of the theory.

📄 PDF Abstract BibTeX arXiv:2405.20482

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Similar Papers 제목 키워드 기반

Moreau-Yosida Regularization for Grouped Tree Structure Learning

2010-12-01 · NeurIPS 2010 12 · Jun Liu, Jieping Ye

We consider the tree structured group Lasso where the structure over the features can be represented as a tree with leaf nodes as features and internal nodes as clusters of the features. The structured regularization wit…

Informative GANs via Structured Regularization of Optimal Transport

2019-12-04 · Pierre Bréchet, Tao Wu, Thomas Möllenhoff, Daniel Cremers

We tackle the challenge of disentangled representation learning in generative adversarial networks (GANs) from the perspective of regularized optimal transport (OT). Specifically, a smoothed OT loss gives rise to an impl…

Representation Learning

Compressive Sensing MRI with Wavelet Tree Sparsity

2012-12-01 · NeurIPS 2012 12 · Chen Chen, Junzhou Huang

In Compressive Sensing Magnetic Resonance Imaging (CS-MRI), one can reconstruct a MR image with good quality from only a small number of measurements. This can significantly reduce MR scanning time. According to structur…

Compressive Sensing

Learning Structured Sparsity in Deep Neural Networks

2016-08-12 · NeurIPS 2016 12 · Wei Wen, Chunpeng Wu, Yandan Wang, Yiran Chen 외

High demand for computation resources severely hinders deployment of large-scale Deep Neural Networks (DNN) in resource constrained devices. In this work, we propose a Structured Sparsity Learning (SSL) method to regular…

CPUGPU

When Structured Sparse Autoencoders Learn Consistent Concepts Across Modalities

2026-07-09 · Weiduo Liao, Yunqiao Yang, Ying Wei arxiv

Sparse autoencoders (SAEs) have emerged as a promising technique for mechanistic interpretability by learning a set of sparse latent features in large models, each of which encodes a distinct concept. However, in vision-…