Demo Data from VLDB 2026 / reviewers in the wild / expert
Martin Bringmann
dblp:135/3041
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · unresolved
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 |
Information extraction and text analysis · 87% Trustworthy machine learning · 13% | |
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
relation extraction |
0.3 | 1 | 2018 | Training Classifiers with Natural Language Explanations · ACL (1) 2018 |
Natural language and speech › Information extraction and text analysis › relation extraction
weakly supervised relation extraction |
0.3 | 1 | 2018 | Training Classifiers with Natural Language Explanations · ACL (1) 2018 |
Machine learning › Trustworthy machine learning › interpretability
natural language explanation |
0.1 | 1 | 2018 | Training Classifiers with Natural Language Explanations · ACL (1) 2018 |
Methods — techniques the papers use, named apart from their topics
weak supervision · 0.7semantic parsing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Training Classifiers with Natural Language ExplanationsabstractTraining accurate classifiers requires many labels, but each label provides only limited information (one bit for binary classification). In this work, we propose BabbleLabble, a framework for training classifiers in which an annotator provides a natural language explanation for each labeling decision. A semantic parser converts these explanations into programmatic labeling functions that generate noisy labels for an arbitrary amount of unlabeled data, which is used to train a classifier. On three relation extraction tasks, we find that users are able to train classifiers with comparable F1 scores from 5-100× faster by providing explanations instead of just labels. Furthermore, given the inherent imperfection of labeling functions, we find that a simple rule-based semantic parser suffices. Braden Hancock, Paroma Varma, Stephanie Wang, Martin Bringmann, Percy Liang, Christopher Ré |
ACL (1) | 4 |