Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

13253850 · May 202619922001200920172026
48 results for cell-type discovery

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.

GraphDINO learns neuronal morphologies from unlabeled data.

problem Unsupervised learning of neuronal morphologies from unlabeled data.
method Transformer-based approach with novel attention mechanism and data augmentation.
result GraphDINO yields morphological clusterings on par with expert classification.

New method extracts biological concepts from cell microscopy images.

problem Extracting meaningful concepts from vision foundation models trained on cell microscopy images.
method Sparse dictionary learning (DL) combined with PCA whitening pre-processing.
result Successfully retrieved biologically meaningful concepts like cell types and genetic perturbations.

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

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.

We develop a latent variable model and an efficient spectral algorithm motivated by the recent emergence of very large data sets of chromatin marks from multiple human cell types. A natural model for chromatin data in one cell type is a Hidden Markov Model (HMM); we model the relationship between multiple cell types by…

2015-06-04abs ↗pdf ↗

New system constructs cell-type taxonomy across multiple samples.

problem Challenges in matching clusters from different datasets.
method Combines Optimal Transport with Relaxed Marginal Constraints (OT-RMC) for simultaneous alignment of clusters across multiple samples.
result Highly accurate annotation of cell types and sample-level feature extraction.

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.

Recent developments in high throughput profiling of individual neurons have spurred data driven exploration of the idea that there exist natural groupings of neurons referred to as cell types. The promise of this idea is that the immense complexity of brain circuits can be reduced, and effectively studied by means of i…

2019-11-06abs ↗pdf ↗

Donor-aware scRNA-seq benchmarks improve classification accuracy in inflammatory bowel disease.

problem Influenza disease classification from scRNA-seq data is prone to donor-level confounding.
method Developed and evaluated three feature representations across two IBD cohorts.
result Compartment-stratified CLR composition and GatedStructuralCFN embeddings outperform linear models in classification accuracy.

Networks capture our intuition about relationships in the world. They describe the friendships between Facebook users, interactions in financial markets, and synapses connecting neurons in the brain. These networks are richly structured with cliques of friends, sectors of stocks, and a smorgasbord of cell types that go…

2015-07-12abs ↗pdf ↗

Deep learning identifies transcriptomic patterns and cell types associated with SARS-CoV-2 infection and COVID-19 severity.

problem Understanding how SARS-CoV-2 varies in infecting and causing severe COVID-19.
method Developed a new approach to generating self-supervised edge features, using Graph Attention Networks (GAT) and Set Transformer.
result Achieved state-of-the-art performance in predicting disease state of individual cells using single-cell RNA sequencing data.

TIMELY improves consistency in labeling blood cell images.

problem Inconsistent labeling of blood cells in microscopy images leads to unreliable diagnoses.
method TIMELY combines pseudotime inference and hidden Markov trees to correct labeling mistakes.
result TIMELY outperforms baseline methods in identifying and correcting inconsistent labels.

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.

New methods detect continuous variation in single-cell data.

problem Continuous variation within and between cell types not detected by discrete analyses.
method Three topologically motivated mathematical methods for unsupervised feature selection.
result Detect additional biologically meaningful genes with coherent expression patterns.

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 model predicts drug effects across various cell types using causal imputation.

problem Predict drug effects across different cell types given limited data.
method Introduces a novel SCM-based model class with latent factor structure and uses Synthetic Interventions estimator.
result Method outperforms other matrix completion approaches in drug repurposing dataset.

Robust machine learning models improve DNA regulatory sequence prediction under various shifts.

problem Real-world applications of DNA regulatory sequence prediction involve shifts not captured by standard i.i.d. assumptions.
method Introduces a robustness framework combining simulation benchmarks and real data analysis.
result Models remain accurate and calibrated under mild shifts but show higher error and miscalibration under strong shifts.

Differentiable causal discovery methods perform robustly under model violations.

problem Causal discovery algorithms struggle with real-world data due to unverifiable causal assumptions.
method Benchmarked differentiable causal discovery methods under eight model assumption violations.
result Differentiable causal discovery methods exhibit robust performance under Structural Hamming Distance and Structural Intervention Distance metrics.

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.

Nucleosome positioning is an important process required for proper genome packing and its accessibility to execute the genetic program in a cell-specific, timely manner. In the recent years hundreds of papers have been devoted to the bioinformatics, physics and biology of nucleosome positioning. The purpose of this rev…

2015-08-27abs ↗pdf ↗

LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.

problem Hard causal discovery in nonparametric settings with exponential complexity.
method Local Discovery by Partitioning (LDP) for causal inference around exposure-outcome pairs.
result LDP yields less biased and more precise estimates than baseline methods.

L2D-CD learns to defer expert recommendations in causal discovery.

problem Combining expert knowledge with data-driven results in causal discovery when expert recommendations may contradict data.
method Adapting learning-to-defer algorithms for pairwise causal discovery, L2D-CD learns a deferral function to select between expert recommendations and data-driven methods.
result L2D-CD outperforms both causal discovery methods and the expert used in isolation, identifying domains where the expert's performance is strong or weak.