Multi-modal Differentiable Unsupervised Feature Selection
Not on the map. Why?
Abstract (arXiv)
Multi-modal high throughput biological data presents a great scientific opportunity and a significant computational challenge. In multi-modal measurements, every sample is observed simultaneously by two or more sets of sensors. In such settings, many observed variables in both modalities are often nuisance and do not carry information about the phenomenon of interest. Here, we propose a multi-modal unsupervised feature selection framework: identifying informative variables based on coupled high-dimensional measurements. Our method is designed to identify features associated with two types of latent low-dimensional structures: (i) shared structures that govern the observations in both modalities and (ii) differential structures that appear in only one modality. To that end, we propose two Laplacian-based scoring operators. We incorporate the scores with differentiable gates that mask nuisance features and enhance the accuracy of the structure captured by the graph Laplacian. The performance of the new scheme is illustrated using synthetic and real datasets, including an extended biological application to single-cell multi-omics.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 13 of its 43 references that are in the map. First posted on arXiv 16 Mar 2023.
Builds on
13 of 43 references.
References · 13
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021AudioCLIP: Extending CLIP to Image, Text and Audiocited by 335
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2017Efficient Algorithms for t-distributed Stochastic Neighborhood Embeddingcited by 75
- 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
- 2021Locally Sparse Neural Networks for Tabular Biomedical Datacited by 34
- 2021Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolationcited by 24
- 2020LOCA: LOcal Conformal Autoencoder for standardized data coordinatescited by 19
- 2020Product Manifold Learningcited by 16
- 2021Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Featurescited by 11
- 2018Recovering Hidden Components in Multimodal Data with Composite Diffusion Operatorscited by 10
- 2022DiSC: Differential Spectral Clustering of Featurescited by 4
1 more
Built on by
Citing papers per year: 2024: 3; 2025: 0; 2026: 2.
5 papers.
- 2024FineGates: LLMs Finetuning with Compression using Stochastic Gatescited by 3
- 2024Spectral Self-supervised Feature Selectioncited by 1
- 2024Generalizable and Robust Spectral Method for Multi-view Representation Learningcited by 1
- 2026Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsitycited by 1
- 2026Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gatescited by 0
- 2026Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gates9 Mar 2026
- 2026Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsity9 Feb 2026
- 2024FineGates: LLMs Finetuning with Compression using Stochastic Gates17 Dec 2024
- 2024Generalizable and Robust Spectral Method for Multi-view Representation Learning4 Nov 2024
- 2024Spectral Self-supervised Feature Selection12 Jul 2024