Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Geert-Jan Huizing

dblp:285/6658 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0001-5208-7855ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 70% Computational science and engineering · 30%
Artificial intelligence
1 paper
Optimization for machine learning · 50% Representation and self-supervised learning · 50%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
optimal transport
0.612022
Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors · ICML 2022
Bioinformatics and computational biology › single-cell analysis
cell clustering
0.612022
Optimal transport improves cell-cell similarity inference in single-cell omics data · Bioinform. 2022
Computational science and engineering
optimal transport
0.612022
Optimal transport improves cell-cell similarity inference in single-cell omics data · Bioinform. 2022
Bioinformatics and computational biology › single-cell analysis
single-cell omics
0.612022
Optimal transport improves cell-cell similarity inference in single-cell omics data · Bioinform. 2022
Bioinformatics and computational biology › single-cell analysis
single-cell RNA sequencing
0.212022
Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors · ICML 2022

Methods — techniques the papers use, named apart from their topics

entropic regularization · 1.7stochastic approximation · 1.1singular value decomposition · 1.1unsupervised clustering · 0.6optimal transport · 0.6
YearPublicationVenuePosition
2022 Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors
abstract
Defining meaningful distances between samples in a dataset is a fundamental problem in machine learning. Optimal Transport (OT) lifts a distance between features (the "ground metric") to a geometrically meaningful distance between samples. However, there is usually no straightforward choice of ground metric. Supervised ground metric learning approaches exist but require labeled data. In absence of labels, only ad-hoc ground metrics remain. Unsupervised ground metric learning is thus a fundamental problem to enable data-driven applications of OT. In this paper, we propose for the first time a canonical answer by simultaneously computing an OT distance between samples and between features of a dataset. These distance matrices emerge naturally as positive singular vectors of the function mapping ground metrics to OT distances. We provide criteria to ensure the existence and uniqueness of these singular vectors. We then introduce scalable computational methods to approximate them in high-dimensional settings, using stochastic approximation and entropic regularization. Finally, we showcase Wasserstein Singular Vectors on a single-cell RNA-sequencing dataset.
Geert-Jan Huizing, Laura Cantini, Gabriel Peyré
ICML1
2022 Optimal transport improves cell-cell similarity inference in single-cell omics data
abstract
MOTIVATION: High-throughput single-cell molecular profiling is revolutionizing biology and medicine by unveiling the diversity of cell types and states contributing to development and disease. The identification and characterization of cellular heterogeneity are typically achieved through unsupervised clustering, which crucially relies on a similarity metric. RESULTS: We here propose the use of Optimal Transport (OT) as a cell-cell similarity metric for single-cell omics data. OT defines distances to compare high-dimensional data represented as probability distributions. To speed up computations and cope with the high dimensionality of single-cell data, we consider the entropic regularization of the classical OT distance. We then extensively benchmark OT against state-of-the-art metrics over 13 independent datasets, including simulated, scRNA-seq, scATAC-seq and single-cell DNA methylation data. First, we test the ability of the metrics to detect the similarity between cells belonging to the same groups (e.g. cell types, cell lines of origin). Then, we apply unsupervised clustering and test the quality of the resulting clusters. OT is found to improve cell-cell similarity inference and cell clustering in all simulated and real scRNA-seq data, as well as in scATAC-seq and single-cell DNA methylation data. AVAILABILITY AND IMPLEMENTATION: All our analyses are reproducible through the OT-scOmics Jupyter notebook available at https://github.com/ComputationalSystemsBiology/OT-scOmics. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Geert-Jan Huizing, Gabriel Peyré, Laura Cantini
Bioinform.1