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.

Maxime Cauchois

dblp:263/7790 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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.

Artificial intelligence
2 papers
Trustworthy machine learning · 80% Learning paradigms · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction
1.322024
Predictive Inference with Weak Supervision · J. Mach. Learn. Res. 2024
Knowing what You Know: valid and validated confidence sets in multiclass and multilabel prediction · J. Mach. Learn. Res. 2021
Machine learning › Trustworthy machine learning
uncertainty estimation
1.322024
Predictive Inference with Weak Supervision · J. Mach. Learn. Res. 2024
Knowing what You Know: valid and validated confidence sets in multiclass and multilabel prediction · J. Mach. Learn. Res. 2021
Machine learning › Learning paradigms
weakly supervised learning
0.812024
Predictive Inference with Weak Supervision · J. Mach. Learn. Res. 2024
Machine learning › Trustworthy machine learning › uncertainty estimation › conformal prediction
conditional coverage
0.512021
Knowing what You Know: valid and validated confidence sets in multiclass and multilabel prediction · J. Mach. Learn. Res. 2021

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

structured prediction · 0.8conformal prediction · 0.8tree-structured classifier · 0.5quantile regression · 0.5
YearPublicationVenuePosition
2024 Predictive Inference with Weak Supervision
abstract
The expense of acquiring labels in large-scale statistical machine learning makes partially and weakly-labeled data attractive, though it is not always apparent how to leverage such data for model fitting or validation. We present a methodology to bridge the gap between partial supervision and validation, developing a conformal prediction framework to provide valid predictive confidence sets---sets that cover a true label with a prescribed probability, independent of the underlying distribution---using weakly labeled data. To do so, we introduce a (necessary) new notion of coverage and predictive validity, then develop several application scenarios, providing efficient algorithms for classification and several large-scale structured prediction problems. We corroborate the hypothesis that the new coverage definition allows for tighter and more informative (but valid) confidence sets through several experiments.
Maxime Cauchois, Suyash Gupta 0002, Alnur Ali, John C. Duchi
J. Mach. Learn. Res.1
2021 Knowing what You Know: valid and validated confidence sets in multiclass and multilabel prediction
abstract
We develop conformal prediction methods for constructing valid predictive confidence sets in multiclass and multilabel problems without assumptions on the data generating distribution. A challenge here is that typical conformal prediction methods---which give marginal validity (coverage) guarantees---provide uneven coverage, in that they address easy examples at the expense of essentially ignoring difficult examples. By leveraging ideas from quantile regression, we build methods that always guarantee correct coverage but additionally provide (asymptotically consistent) conditional coverage for both multiclass and multilabel prediction problems. To address the potential challenge of exponentially large confidence sets in multilabel prediction, we build tree-structured classifiers that efficiently account for interactions between labels. Our methods can be bolted on top of any classification model---neural network, random forest, boosted tree---to guarantee its validity. We also provide an empirical evaluation, simultaneously providing new validation methods, that suggests the more robust coverage of our confidence sets.
Maxime Cauchois, Suyash Gupta 0002, John C. Duchi
J. Mach. Learn. Res.1