Germain Kolossov
Germain Kolossov is a machine learning researcher whose work studies training-data selection and diffusion-based generation. In 2023, he coauthored a paper with Andrea Montanari and Pulkit Tandon on data selection under weak supervision. The work was presented orally at ICLR and received an Honorable Mention in 2024; their experiments found cases where training on 40% of a dataset had a lower error rate than training on the full dataset. In 2026, he coauthored research on generating random solutions to k-SAT and k-XORSAT formulas. By September 2026, he is a researcher affiliated with Granica Computing Inc.
Timeline
-
2023
A theory of data selection
In 2023, he coauthors “Towards a statistical theory of data selection under weak supervision” with Andrea Montanari and Pulkit Tandon. The paper selects a smaller sample, acquires its labels, and uses them to train a model.
-
2024
An oral ICLR presentation
In 2024, his data-selection paper is presented orally at ICLR.
-
2024
Training on less data
In 2024, he and his coauthors test their selection method on a real autonomous-vehicle dataset; in some cases, training on 40% of the original data yields a lower error rate than training on the full set.
-
2024
An ICLR honorable mention
ICLR gives an Honorable Mention in 2024 to the data-selection paper he coauthors with Andrea Montanari and Pulkit Tandon.
-
2026
Diffusion for discrete generation
In 2026, he coauthors “Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems.” The paper studies generating uniformly random solutions to random k-SAT and k-XORSAT formulas.
-
By September 2026
Research at Granica
By September 2026, he is a researcher affiliated with Granica Computing Inc.
Sources and credits
Photo: We have no published photo of Germain Kolossov yet. Send us a free-licensed photo.
- [2309.14563] Towards a statistical theory of data selection under weak supervision
- Improving AI via optimal selection of training samples
- ICLR 2024 Awards
- [2603.20589] Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems
- Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems