CytOpT: Optimal transport with domain adaptation for interpreting flow cytometry data
Abstract
Domain fit: Niche / domain-specific · No strong AI-core implementation/artifact signals were detected from current providers.
The automated analysis of flow cytometry measurements is an active research field. We introduce a new algorithm, referred to as CytOpT, using regularized optimal transport to directly estimate the different cell population proportions from a biological sample characterized with flow cytometry measurements. We rely on the regularized Wasserstein metric to compare cytometry measurements from different samples, thus accounting for possible misalignment of a given cell population across samples (due to technical variability from the technology of measurements). In this work we rely on a supervised learning technique, based on the Wasserstein metric, that is used to estimate an optimal reweighting of class proportions in a mixture model from a source distribution (with known segmentation into cell sub-populations) to fit a target distribution with unknown segmentation. Due to the high dimensionality of flow cytometry data, we use stochastic algorithms to approximate the regularized Wasserstein metric to solve the optimization problem involved in the estimation of optimal weights representing the cell population proportions in the target distribution. Several flow cytometry data sets are used to illustrate the performances of CytOpT that are also compared to those of existing algorithms for automatic gating based on supervised learning.
Results and benchmarks
The automated analysis of flow cytometry measurements is an active research field.
Benchmark evidence is limited
Evidence graph: 2 refs, 1 links.
Utility signals: depth 60/100, grounding 58/100, status medium.
Implementation
No direct implementation yet
Maintained implementation evidence is not confirmed for this paper yet.
Use the implementation status and reproduction sections for the current action plan.
No verified maintained repo yet
There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.
- This is primarily a method paper. Reproduce it within a maintained framework baseline instead of chasing paper-specific repos.
- Start with framework-native implementations (e.g. PyTorch optimizer module, Optax, or Transformers training loops).
- Replicate the paper ablation settings first, then compare against modern baselines.
Time to first repro: a few hours
This is primarily a method paper. Reproduce it within a maintained framework baseline instead of chasing paper-specific repos.
- No maintained paper-verified implementation is currently available
Reproduction readiness
No repo
No verified implementation available
- No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.
Validation caveat
Hugging Face artifacts
No trustworthy direct or curated related Hugging Face artifacts were found yet. Use targeted searches to quickly locate candidate models, datasets, and demos.
Models
Tip: start with models, then check datasets and spaces if you need evaluation data or demos.
Research context
6
Citations
30
References
Tasks
Population, Metric (unit), Computer science, Wasserstein metric, Segmentation, Pattern recognition (psychology), Molecular Biology, Life Sciences
Methods
Algorithm
Domains
Artificial intelligence, Mathematics, Biochemistry, Genetics and Molecular Biology
Related papers
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26Search on Paper2Code
1961 · Semantic similarity
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t -distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of varianceSearch on Paper2Code
1970 · Semantic similarity
- Gradient flow formulation of diffusion equations in the Wasserstein space over a metric graphSearch on Paper2Code
2021 · Semantic similarity
- Remarks on algorithms 372 [A1]: An algorithm to produce complex primes, csieve and Algorithm 401 [A1]: an improved algorithm to produce complex primesSearch on Paper2Code
1970 · Semantic similarity
- Gradient flow formulation of diffusion equations in the Wasserstein space over a Metric graphSearch on Paper2Code
2022 · Semantic similarity
Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.
Open in HFEPXJump to Paper2Code search queries derived from this paper's research context.