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…
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.
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.
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.
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.
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.
The paper develops methods for causal inference from single-cell RNA sequencing data with multiple outcomes.
problem Causal inference from single-cell RNA sequencing data with multiple heterogeneous outcomes.
method Generic semiparametric inference framework for doubly robust estimation with multiple derived outcomes.
result Demonstrates the use of semiparametric inferential results for estimating causal effects in genomics.
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.
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.
Paper proposes a new method for sparse spectral clustering on Stiefel manifold.
problem Sparse spectral clustering on Stiefel manifold with nonsmooth and nonconvex objective.
method Proposes a manifold proximal linear method (ManPL) to solve the original SSC formulation.
result Demonstrates the advantage of ManPL over existing methods on single-cell RNA sequencing data.
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.
JojoSCL improves scRNA-seq clustering by reducing intra-cluster dispersion.
problem High dimensionality and sparsity of scRNA-seq data challenge clustering models.
method Integrates shrinkage estimator and contrastive learning for improved clustering.
result JojoSCL outperforms existing methods on ten scRNA-seq datasets.
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…
New algorithm optimizes matrix reordering for noisy disordered matrices.
problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.
Develops a method to infer cell trajectories from RNA sequencing data.
problem Inferring cell trajectories from single cell RNA-sequencing data.
method Entropy-regularized optimal transport for global optimization.
result Proves and implements a method to recover ground truth trajectories from limited samples.
In this paper, we explore the limitations of PCA as a dimension reduction technique and study its extension, projection pursuit (PP), which is a broad class of linear dimension reduction methods. We first discuss the relevant concepts and theorems and then apply PCA and PP (with negative standardized Shannon's entropy …
Cataloging the neuronal cell types that comprise circuitry of individual brain regions is a major goal of modern neuroscience and the BRAIN initiative. Single-cell RNA sequencing can now be used to measure the gene expression profiles of individual neurons and to categorize neurons based on their gene expression profil…
We propose a probabilistic model for interpreting gene expression levels that are observed through single-cell RNA sequencing. In the model, each cell has a low-dimensional latent representation. Additional latent variables account for technical effects that may erroneously set some observations of gene expression leve…
Single-cell RNA sequencing (scRNA-seq) has revolutionized biological discovery, providing an unbiased picture of cellular heterogeneity in tissues. While scRNA-seq has been used extensively to provide insight into both healthy systems and diseases, it has not been used for disease prediction or diagnostics. Graph Atten…
We propose a probabilistic model for interpreting gene expression levels that are observed through single-cell RNA sequencing. In the model, each cell has a low-dimensional latent representation. Additional latent variables account for technical effects that may erroneously set some observations of gene expression leve…
The paper proposes a method to infer differentiation trees from RNA velocity data.
problem Reconstructing dynamic cellular processes from sequencing data.
method Defining varifold distances between RNA velocity curves to approximate shortest-path distances in a tree.
result The varifold distance method approximates the shortest-path distance in a tree isomorphic to the target differentiation tree.
GENOT matches cells across data modalities using neural OT solvers.
problem Scalability, privacy, and out-of-sample estimation issues in traditional OT solvers.
method Learn stochastic maps, parameterize OT maps, relax mass conservation, integrate quadratic solvers.
result Demonstrates significant potential for enhancing therapeutic strategies.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
Proposes selective inference for testing differences in means between clusters.
problem Inflated type I error rate when testing differences in means between clusters.
method Selective inference approach to control selective type I error rate.
result Controls selective type I error rate by accounting for data-driven cluster definition.
New method uses dendrograms for better mixture model selection and clustering.
problem Selecting the correct number of components in finite mixture models.
method Hierarchical clustering tree derived from overfitted latent mixing measures.
result Consistently selects the true number of mixing components and optimal convergence rate for parameter estimation.
MSBM extends SB for multi-marginal trajectory inference.
problem Trajectory inference from multiple discrete snapshots.
method Multi-Marginal Schrödinger Bridge Matching (MSBM) using iterative Markovian fitting (IMF).
result MSBM effectively captures complex trajectories and respects intermediate distributions.
Data thinning splits observations into independent parts for convolution-closed distributions.
problem Validation of unsupervised learning results in settings with limited data.
method Data thinning, splitting observations into independent parts following the same distribution.
result Data thinning provides an attractive alternative to cross-validation in settings with limited sample splitting.
New method learns cell trajectories from multiple snapshots.
problem Inferring cell trajectories from limited, single-time-point data.
method Multi-marginal Schrödinger Bridges with iterative reference refinement.
result Effective in capturing long-term dependencies and learning from multiple time points.
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…
We propose a novel framework for combining datasets via alignment of their intrinsic geometry. This alignment can be used to fuse data originating from disparate modalities, or to correct batch effects while preserving intrinsic data structure. Importantly, we do not assume any pointwise correspondence between datasets…
A novel multi-resolution cluster detection (MCD) method is proposed to identify irregularly shaped clusters in space. Multi-scale test statistic on a single cell is derived based on likelihood ratio statistic for Bernoulli sequence, Poisson sequence and Normal sequence. A neighborhood variability measure is defined to …
A new method improves data representation for diverse tasks.
problem Learning meaningful representations for tasks like batch correction and counterfactual inference.
method Contrastive Mixture of Posteriors (CoMP) method using misalignment penalties.
result CoMP achieves state-of-the-art performance on challenging tasks.
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.
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.
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…
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 …
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.
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.
IMPACC improves consensus clustering for bioinformatics data.
problem Consensus clustering's inefficiency and lack of interpretability for large-scale data.
method Ensemble minipatch co-occurrences, adaptive sampling of observations and features.
result Significantly improved accuracy and interpretability with substantial computational savings.
Doubly-stochastic normalization improves robustness to heteroskedastic noise.
problem Robustness to heteroskedastic noise in affinity matrix construction.
method Doubly-stochastic normalization of the Gaussian kernel.
result Doubly-stochastic normalization converges to clean matrix with rate m−1/2 under heteroskedastic noise. A new tree-Wasserstein distance for high-dimensional data with latent feature hierarchy.
problem Finding meaningful distances between high-dimensional data samples with latent feature hierarchy.
method Proposes a new tree-Wasserstein distance (TWD) for high-dimensional data with a latent feature hierarchy, using diffusion geometry and tree decoding.
result The proposed TWD effectively recovers the latent feature hierarchy and is efficient and scalable.
Establishes a link between heat diffusion and manifold distances in data.
problem No theoretical link between diffusion-based manifold learning and geodesic distances.
method Formulates heat geodesic embeddings based on Riemannian geometry.
result Method outperforms state-of-the-art in preserving manifold distances and cluster structure.
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.
Paper develops statistical tests for covariance matrix regression on manifold.
problem Regression with random covariance matrices in Fréchet space.
method Develops Wasserstein F-tests for Bures-Wasserstein manifold.
result Asymptotic null distribution and power of the test.
CLSB models system dynamics from cross-sectional data with population-level regularization.
problem Challenges in modeling system dynamics from limited cross-sectional samples and heterogeneous individual behaviors.
method Introduces CLSB framework for learning dynamics, regularized for population-level temporal variations.
result Empirically superior in single-cell sequencing data analyses, e.g., simulating cell development and drug response.
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.
Active learning selects optimal measurement times for inferring continuous paths from sparse data.
problem Inferring continuous probability paths from sparse snapshots in high-fidelity domains like single-cell biology.
method Extends active experimentation to the space of measures using Linearized Optimal Transport (LOT) for probabilistic surrogate modeling.
result Empirical results show that the proposed strategy outperforms uncertainty-agnostic baselines.