In recent years, the advances in single-cell RNA-seq techniques have enabled us to perform large-scale transcriptomic profiling at single-cell resolution in a high-throughput manner. Unsupervised learning such as data clustering has become the central component to identify and characterize novel cell types and gene exp…
Improved GPLVM model for single-cell RNA-seq data.
problem Lack of effective scalable models for clustering cell types in large-scale single-cell RNA-seq data.
method Introduces amortized stochastic variational Bayesian GPLVM (BGPLVM) tailored for single-cell RNA-seq.
result Matches the performance of scVI on synthetic and real-world datasets and reveals more interpretable latent structures.
HSSE framework embeds single-cell RNA-seq data at multiple scales.
problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.
MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.
problem Selecting informative genes from large single-cell RNA-seq datasets is challenging and computationally intensive.
method MarkerMap is a generative model that identifies minimal gene sets explaining cell type variability.
result MarkerMap outperforms existing methods in both supervised and unsupervised marker selection.
DiffKnock improves feature selection in neural networks with complex dependencies and non-linear associations.
problem Selecting important features in neural networks with complex dependencies and non-linear associations.
method DiffKnock uses diffusion models to generate knockoffs and neural network statistics to measure feature importance.
result DiffKnock outperforms existing methods in detecting non-linear associations and preserving feature dependencies.
Super-OT combines GANs and optimal transport for lineage tracing.
problem Lineage tracing in single-cell RNA-seq data.
method Supervised learning framework with GANs for optimal transport.
result Super-OT outperforms Waddington-OT in predicting cell differentiation outcomes.
Sources of variability in experimentally derived data include measurement error in addition to the physical phenomena of interest. This measurement error is a combination of systematic components, originating from the measuring instrument, and random measurement errors. Several novel biological technologies, such as ma…
The paper improves Fisher-Pitman tests for Poisson mixtures, detecting autism-related genes.
problem Detecting differentially expressed genes between autism and control subjects.
method Nonparametric Poisson mixtures and Fisher-Pitman permutation tests.
result The tests reveal genes missed by common methods, demonstrating rate optimality.
Until recently, transcriptomics was limited to bulk RNA sequencing, obscuring the underlying expression patterns of individual cells in favor of a global average. Thanks to technological advances, we can now profile gene expression across thousands or millions of individual cells in parallel. This new type of data has …
spex-LVM infers interpretable latent factors from biomedical data.
problem Inability to learn sparse and interpretable hidden states.
method Factorial latent variable model with sparse priors and domain-relevant annotations.
result Robustly identifies relevant structure in RNA-seq datasets.
Causal methods for GRN inference from single-cell data often fail in real-world benchmarks.
problem Understanding when and why causal methods for GRN inference from single-cell data fail in real-world benchmarks.
method Introduced a controlled diagnostic framework to isolate and measure seven pathologies.
result Causal methods dominate in clean and structurally favorable regimes but fail in specific pathologies.
DISCoVeR learns disentangled representations by separating shared and condition-specific factors.
problem Learning disentangled representations for multi-condition data.
method Dual-latent architecture, parallel reconstructions, max-min objective.
result DISCoVeR achieves improved disentanglement on various datasets.
Random small feature subsets outperform FS in diverse datasets.
problem The significance of selected features in high-dimensional datasets is questionable.
method Analysis of 28 diverse datasets (microarray, RNA-Seq, etc.).
result Any arbitrary set of features performs as well as or better than selected features across datasets.
Single-cell RNA sequencing (scRNA-seq) is a fast growing approach to measure the genome-wide transcriptome of many individual cells in parallel, but results in noisy data with many dropout events. Existing methods to learn molecular signatures from bulk transcriptomic data may therefore not be adapted to scRNA-seq data…
Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which uses O(n log n) distance evaluations to compute the medoid with high probability. Med-dit is based on a connection with the multi-armed band…
Large datasets represented by multidimensional data point clouds often possess non-trivial distributions with branching trajectories and excluded regions, with the recent single-cell transcriptomic studies of developing embryo being notable examples. Reducing the complexity and producing compact and interpretable repre…
Proposes GFMMD for comparing signals on graphs.
problem Computing distances between distributions on graphs.
method Graph Fourier MMD (GFMMD) using optimal witness functions.
result Analytical solution and embedding of distributions.
Scalable GPLVM reduces complexity in scRNA-seq data, accounting for technical and biological confounders.
problem Complexity and confounders in scRNA-seq data hamper interpretation.
method Extended Gaussian process latent variable model (GPLVM) to handle large datasets.
result Framework reconstructs latent signatures and captures disease-specific gene expression.
We introduce principal differences analysis (PDA) for analyzing differences between high-dimensional distributions. The method operates by finding the projection that maximizes the Wasserstein divergence between the resulting univariate populations. Relying on the Cramer-Wold device, it requires no assumptions about th…
Learning to align multiple datasets is an important problem with many applications, and it is especially useful when we need to integrate multiple experiments or correct for confounding. Optimal transport (OT) is a principled approach to align datasets, but a key challenge in applying OT is that we need to specify a tr…
New model clusters cells and individuals, revealing genetic influences on cell types.
problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.
Extracting an understanding of the underlying system from high dimensional data is a growing problem in science. Discovering informative and meaningful features is crucial for clustering, classification, and low dimensional data embedding. Here we propose to construct features based on their ability to discriminate bet…
Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…
EB-PCA reduces noise in high-dimensional PCA by estimating a joint prior distribution.
problem High-dimensional PCA noise in samples comparable to or larger than data.
method Empirical Bayes PCA using Kiefer-Wolfowitz MLE, random matrix theory, and AMP algorithm.
result EB-PCA achieves Bayes-optimal accuracy in spiked models and significantly improves over PCA in simulations and real data.
New model detects communities in networks with signed, continuous weights.
problem Detect communities in networks with signed, continuous weights.
method Heterogeneous Block Covariance Model (HBCM) with variational EM algorithm.
result Provable consistent estimates of group memberships.
Long non-coding RNAs (lncRNAs) are a class of non-coding RNAs which play a significant role in several biological processes. RNA-seq based transcriptome sequencing has been extensively used for identification of lncRNAs. However, accurate identification of lncRNAs in RNA-seq datasets is crucial for exploring their char…
In this work we propose a method to compute continuous embeddings for kmers from raw RNA-seq data, without the need for alignment to a reference genome. The approach uses an RNN to transform kmers of the RNA-seq reads into a 2 dimensional representation that is used to predict abundance of each kmer. We report that our…
Unified framework for large-scale hypothesis testing with confounders.
problem Bias in large-scale hypothesis testing due to unmeasured confounders.
method Unified statistical estimation and inference framework that disentangles confounding effects and jointly estimates latent and primary effects.
result Effective Type-I error control and power in hypothesis testing.
Kernel testing compares cell states in single-cell data.
problem Comparing non-linear cell states in single-cell data.
method Kernel-based testing framework for non-linear distribution comparison.
result Identifies subtle population variations in cell states.
SMAI framework tests and integrates single-cell data alignability.
problem Lack of a rigorous statistical test for alignability and distortion during alignment.
method Spectral manifold alignment and inference (SMAI) framework.
result SMAI outperforms existing methods in alignability testing and integration.
Study compares single vs ensemble feature selection for cancer diagnosis.
problem Identifying relevant variables for cancer diagnosis and prognosis.
method Comparison of single feature selection algorithms and ensemble of diverse algorithms.
result Ensemble approach did not improve predictive performance over individual algorithms.
LMI approximates mutual information in high dimensions using learned low-dimensional representations.
problem Estimating mutual information between high-dimensional variables is challenging due to sample size limitations.
method Developed a method called latent MI (LMI) approximation that applies a nonparametric MI estimator to low-dimensional representations learned by a simple model architecture.
result LMI can approximate MI well for variables with >10^3 dimensions if their dependence structure has low intrinsic dimensionality.
Forest Fire Clustering discovers cell types from single-cell data.
problem Discovering cell types from large-scale single-cell sequencing data.
method Iterative label propagation and parallelized Monte Carlo simulation.
result Forest Fire Clustering outperforms state-of-the-art methods on diverse benchmarks.
NESS improves neighbor embedding for smooth cell-state transitions in single-cell data.
problem Challenges in extracting smooth, low-dimensional representations from noisy single-cell data.
method Builds on PCS framework to develop NESS, a stable machine learning approach.
result NESS consistently yields useful biological insights across diverse single-cell datasets.
Proposes CCCVAE for better single-cell clustering with cell-cell communication.
problem Improving single-cell RNA sequencing clustering by incorporating cell-cell communication.
method Integrates cell-cell communication into a variational autoencoder framework.
result Empirical results show CCCVAE outperforms standard VAEs in clustering performance.
New model generates realistic single-cell gene expression data.
problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.
Graph Attention Networks predict disease state from single-cell data.
problem Predicting disease state from single-cell data.
method Graph Attention Networks (GAT) for learning from both features and graph structures.
result Achieved 92% accuracy in predicting MS from single-cell data.
Motivation: Single cell transcriptome sequencing (scRNA-Seq) has become a revolutionary tool to study cellular and molecular processes at single cell resolution. Among existing technologies, the recently developed droplet-based platform enables efficient parallel processing of thousands of single cells with direct coun…
ChemCPA predicts cellular responses to novel drugs using transfer learning.
problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.
Tutorial on using neural networks for single cell data analysis.
problem Handling large sequencing datasets efficiently.
method Single cell variational inference using variational auto-encoder.
result Model learns data distribution for insights.
With ongoing developments and innovations in single-cell RNA sequencing methods, advancements in sequencing performance could empower significant discoveries as well as new emerging possibilities to address biological and medical investigations. In the study, we will be using the dataset collected by the authors of Sys…
scICML integrates multi-omics data from single cells using co-clustering.
problem High noise and sparsity in multi-omics data from single cells.
method Information-theoretic co-clustering-based multi-view learning.
result Improves clustering performance and provides biological insights.
Single-cell gene expression data provide invaluable resources for systematic characterization of cellular hierarchy in multi-cellular organisms. However, cell lineage reconstruction is still often associated with significant uncertainty due to technological constraints. Such uncertainties have not been taken into accou…
Clustering with variable selection is a challenging yet critical task for modern small-n-large-p data. Existing methods based on sparse Gaussian mixture models or sparse K-means provide solutions to continuous data. With the prevalence of RNA-seq technology and lack of count data modeling for clustering, the current pr…
Elastic co-clustering improves clustering of single-cell genomic data.
problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.
New method improves clustering accuracy in noisy single-cell data.
problem Challenges in clustering single-cell RNA sequencing data due to noise and variability.
method Latent plug-and-play diffusion framework with input-space steering.
result Improved clustering accuracy on synthetic and real-world single-cell data.
New methods improve analysis of single cell RNA sequencing data.
problem High dimensionality and complexity of scRNA-seq data.
method Topological Nonnegative Matrix Factorization (TNMF) and Robust Topological NMF (rTNMF).
result TNMF and rTNMF significantly outperform other NMF-based methods.
sgdGMF efficiently estimates generalized matrix factorization models for single-cell RNA sequencing data.
problem Challenges in dimensionality reduction for large single-cell RNA sequencing datasets.
method Scalable adaptive stochastic gradient descent algorithm for generalized matrix factorization models.
result sgdGMF outperforms existing methods in scalability and accuracy for large datasets.