Demo Data from EDBT 2026 / reviewers in the wild / expert
Quentin Cormier
dblp:191/6655
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1
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
1 paper |
Trustworthy machine learning · 44% Probabilistic and Bayesian machine learning · 44% Deep learning architectures and training · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo |
0.2 | 1 | 2016 | Launch and Iterate: Reducing Prediction Churn · NIPS 2016 |
Machine learning › Deep learning architectures and training › regularization
classifier regularization |
0.1 | 1 | 2016 | Launch and Iterate: Reducing Prediction Churn · NIPS 2016 |
Methods — techniques the papers use, named apart from their topics
regularization · 0.2markov chain monte carlo · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Launch and Iterate: Reducing Prediction ChurnabstractPractical applications of machine learning often involve successive training iterations with changes to features and training examples. Ideally, changes in the output of any new model should only be improvements (wins) over the previous iteration, but in practice the predictions may change neutrally for many examples, resulting in extra net-zero wins and losses, referred to as unnecessary churn. These changes in the predictions are problematic for usability for some applications, and make it harder and more expensive to measure if a change is statistically significant positive. In this paper, we formulate the problem and present a stabilization operator to regularize a classifier towards a previous classifier. We use a Markov chain Monte Carlo stabilization operator to produce a model with more consistent predictions without adversely affecting accuracy. We investigate the properties of the proposal with theoretical analysis. Experiments on benchmark datasets for different classification algorithms demonstrate the method and the resulting reduction in churn. Mahdi Milani Fard, Quentin Cormier, Kevin Robert Canini, Maya R. Gupta |
NIPS | 2 |