Hiring in life sciences? Share your open positions with our professional community. Read more Close

Advertisement

A generative model for dimensionality reduction with millions of features and few samples

Created on 10 Aug 2026

Authors

Pancotti, C., Fariselli, P., Meisner, J., Krogh, A.

Abstract

In this paper, we demonstrate that it is feasible to train a deep generative model for dimensionality reduction with millions of features using relatively few samples, making this type of generative model a more versatile alternative to standard dimensionality reduction methods. Specifically, we hypothesize that, for a decoder-only model, the number of training samples required is almost independent of feature dimensionality across most network architectures. Through an extensive set of experiments on synthetic nonlinear data, we validate this hypothesis. We further train the model on a downsampled version of the 1000 Genomes Project (1KGP) dataset to assess its behavior under controlled reductions in sample size. Finally, we train a Deep Generative Decoder (DGD) on a curated dataset from the International Cancer Genome Consortium (ICGC) containing 4.4 million features, using approximately 4,000 training samples and 1,000 test samples. The resulting latent representation exhibits clear clustering and, when compared at the same latent dimensionality, outperforms PCA and variational autoencoders (VAEs) for tumor type classification. In addition, the DGD is computationally efficient and can be trained on a single 16 GB GPU. The implementation is available at https://github.com/cpancott/ReceptiveDGD.

Preprint server: bioRxiv
The authors list and abstract were imported from bioRxiv on 10 Aug 2026.

Advertisement

Stats

  • Community rating n/a 0 votes
  • Your rating

1-terrible, 9-excellent. How would you rate this preprint? Sign in in to submit your rating.

  • Recommendations n/a n/a positive of 0 vote(s)
  • Views 4
  • Comments 0

Recommended by

  • No recommendations yet.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.

Advertisement