Demo Data from EDBT 2026 / reviewers in the wild / expert
Christoph Sawade
dblp:62/3712
· DBLP profile ↗
12ranked-venue papers
6as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 12 · 6 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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
6 papers |
Information extraction and text analysis · 55% Trustworthy machine learning · 19% Learning theory · 14% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Databases, data mining, and information retrieval
3 papers |
Information retrieval · 60% Web and social media mining · 40% |
Topics — the 9 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
pattern learning |
0.4 | 2 | 2015 | Learning to identify concise regular expressions that describe email campaigns · J. Mach. Learn. Res. 2015 Learning to Identify Regular Expressions that Describe Email Campaigns · ICML 2012 |
Natural language and speech › Information extraction and text analysis › pattern learning
regular expression learning |
0.4 | 2 | 2015 | Learning to identify concise regular expressions that describe email campaigns · J. Mach. Learn. Res. 2015 Learning to Identify Regular Expressions that Describe Email Campaigns · ICML 2012 |
Information retrieval › retrieval evaluation
ranking evaluation |
0.2 | 1 | 2013 | Active Evaluation of Ranking Functions Based on Graded Relevance (Extended Abstract) · IJCAI 2013 |
Algorithmic game theory and mechanism design › incomplete information
bayesian game |
0.2 | 1 | 2013 | Bayesian Games for Adversarial Regression Problems · ICML (3) 2013 |
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
bayes-nash equilibrium |
0.2 | 1 | 2013 | Bayesian Games for Adversarial Regression Problems · ICML (3) 2013 |
Machine learning › Learning theory › statistical estimation
risk estimation |
0.1 | 1 | 2010 | Active Risk Estimation · ICML 2010 |
Machine learning › Transfer learning and domain adaptation
distribution matching |
0.1 | 1 | 2008 | Transfer Learning by Distribution Matching for Targeted Advertising · NIPS 2008 |
Machine learning › Learning theory
hypothesis testing |
0.0 | 1 | 2012 | Active Comparison of Prediction Models · NIPS 2012 |
Machine learning › Learning theory
statistical estimation |
0.0 | 1 | 2010 | Active Estimation of F-Measures · NIPS 2010 |
Methods — techniques the papers use, named apart from their topics
grammatical inference · 0.3active learning · 0.3active sampling · 0.3hypothesis testing · 0.1statistical estimation · 0.1instrumental sampling distribution · 0.1covariate shift correction · 0.1classifier learning · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Varying-coefficient models for geospatial transfer learning
Matthias Bussas, Christoph Sawade, Nicolas Kühn, Tobias Scheffer, Niels Landwehr |
Mach. Learn. | 2 |
| 2015 | Learning to identify concise regular expressions that describe email campaigns
Paul Prasse, Christoph Sawade, Niels Landwehr, Tobias Scheffer |
J. Mach. Learn. Res. | 2 |
| 2014 | Joint Prediction of Topics in a URL Hierarchy
Michael Großhans, Christoph Sawade, Tobias Scheffer, Niels Landwehr |
ECML/PKDD (1) | 2 |
| 2013 | Bayesian Games for Adversarial Regression ProblemsabstractWe study regression problems in which an adversary can exercise some control over the data generation process. Learner and adversary have conflicting but not necessarily perfectly antagonistic objectives. We study the case in which the learner is not fully informed about the adversary’s objective; instead, any knowledge of the learner about parameters of the adversary’s goal may be reflected in a Bayesian prior. We model this problem as a Bayesian game, and characterize conditions under which a unique Bayesian equilibrium point exists. We experimentally compare the Bayesian equilibrium strategy to the Nash equilibrium strategy, the minimax strategy, and regular linear regression. Michael Großhans, Christoph Sawade, Michael Brückner, Tobias Scheffer |
ICML (3) | 2 |
| 2013 | Active Evaluation of Ranking Functions Based on Graded Relevance (Extended Abstract)
Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr |
IJCAI | 1 |
| 2013 | Active evaluation of ranking functions based on graded relevance
Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr |
Mach. Learn. | 1 |
| 2012 | Learning to Identify Regular Expressions that Describe Email Campaigns
Paul Prasse, Christoph Sawade, Niels Landwehr, Tobias Scheffer |
ICML | 2 |
| 2012 | Active Comparison of Prediction ModelsabstractWe address the problem of comparing the risks of two given predictive models - for instance, a baseline model and a challenger - as confidently as possible on a fixed labeling budget. This problem occurs whenever models cannot be compared on held-out training data, possibly because the training data are unavailable or do not reflect the desired test distribution. In this case, new test instances have to be drawn and labeled at a cost. We devise an active comparison method that selects instances according to an instrumental sampling distribution. We derive the sampling distribution that maximizes the power of a statistical test applied to the observed empirical risks, and thereby minimizes the likelihood of choosing the inferior model. Empirically, we investigate model selection problems on several classification and regression tasks and study the accuracy of the resulting p-values. Christoph Sawade, Niels Landwehr, Tobias Scheffer |
NIPS | 1 |
| 2012 | Active Evaluation of Ranking Functions Based on Graded Relevance
Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr |
ECML/PKDD (2) | 1 |
| 2010 | Active Risk Estimation
Christoph Sawade, Niels Landwehr, Steffen Bickel, Tobias Scheffer |
ICML | 1 |
| 2010 | Active Estimation of F-MeasuresabstractWe address the problem of estimating the F-measure of a given model as accurately as possible on a fixed labeling budget. This problem occurs whenever an estimate cannot be obtained from held-out training data; for instance, when data that have been used to train the model are held back for reasons of privacy or do not reflect the test distribution. In this case, new test instances have to be drawn and labeled at a cost. An active estimation procedure selects instances according to an instrumental sampling distribution. An analysis of the sources of estimation error leads to an optimal sampling distribution that minimizes estimator variance. We explore conditions under which active estimates of F-measures are more accurate than estimates based on instances sampled from the test distribution. Christoph Sawade, Niels Landwehr, Tobias Scheffer |
NIPS | 1 |
| 2008 | Transfer Learning by Distribution Matching for Targeted AdvertisingabstractWe address the problem of learning classifiers for several related tasks that may differ in their joint distribution of input and output variables. For each task, small - possibly even empty - labeled samples and large unlabeled samples are available. While the unlabeled samples reflect the target distribution, the labeled samples may be biased. We derive a solution that produces resampling weights which match the pool of all examples to the target distribution of any given task. Our work is motivated by the problem of predicting sociodemographic features for users of web portals, based on the content which they have accessed. Here, questionnaires offered to a small portion of each portal's users produce biased samples. Transfer learning enables us to make predictions even for new portals with few or no training data and improves the overall prediction accuracy. Steffen Bickel, Christoph Sawade, Tobias Scheffer |
NIPS | 2 |