VLDB 2026 Research / reviewers in the wild / expert
Robert H. Dodier
dblp:93/3408
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 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
4 papers |
Learning theory · 37% Trustworthy machine learning · 21% Probabilistic and Bayesian machine learning · 21% | |
| Theoretical computer science
2 papers |
Mathematical optimization · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Energy systems and smart grids · 62% Computational finance and economics · 38% |
Topics — the 7 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › classification
binary classification |
0.0 | 1 | 2003 | Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic · ICML 2003 |
Machine learning › Deep learning architectures and training › regularization
early stopping |
0.0 | 1 | 1995 | Geometry of Early Stopping in Linear Networks · NIPS 1995 |
Machine learning › Learning theory › generalization
generalization theory |
0.0 | 1 | 1995 | Geometry of Early Stopping in Linear Networks · NIPS 1995 |
Machine learning › Optimization for machine learning
implicit regularization |
0.0 | 1 | 1995 | Geometry of Early Stopping in Linear Networks · NIPS 1995 |
Robotics › Motion planning and robot control › robot control
optimal control |
0.0 | 1 | 1996 | The Neurothermostat: Predictive Optimal Control of Residential Heating Systems · NIPS 1996 |
Mathematical optimization
gradient descent |
0.0 | 1 | 1995 | Geometry of Early Stopping in Linear Networks · NIPS 1995 |
Mathematical optimization
optimization for machine learning |
0.0 | 1 | 1995 | Geometry of Early Stopping in Linear Networks · NIPS 1995 |
Methods — techniques the papers use, named apart from their topics
approximation to AUC · 0.1constrained optimization · 0.1ROC analysis · 0.1reinforcement learning · 0.0predictive control · 0.0linear network analysis · 0.0geometry analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic
Lian Yan, Robert H. Dodier, Michael C. Mozer, Richard H. Wolniewicz |
ICML | 2 |
| 2001 | Prodding the ROC Curve: Constrained Optimization of Classifier PerformanceabstractWhen designing a two-alternative classifier, one ordinarily aims to maximize the classifier’s ability to discriminate between members of the two classes. We describe a situation in a real-world business application of machine-learning prediction in which an additional constraint is placed on the nature of the solu- tion: that the classifier achieve a specified correct acceptance or correct rejection rate (i.e., that it achieve a fixed accuracy on members of one class or the other). Our domain is predicting churn in the telecommunications industry. Churn refers to customers who switch from one service provider to another. We pro- pose four algorithms for training a classifier subject to this domain constraint, and present results showing that each algorithm yields a reliable improvement in performance. Although the improvement is modest in magnitude, it is nonethe- less impressive given the difficulty of the problem and the financial return that it achieves to the service provider. When designing a classifier, one must specify an objective measure by which the classi- fier’s performance is to be evaluated. One simple objective measure is to minimize the number of misclassifications. If the cost of a classification error depends on the target and/ or response class, one might utilize a risk-minimization framework to reduce the expected loss. A more general approach is to maximize the classifier’s ability to discriminate one class from another class (e.g., Chang & Lippmann, 1994). An ROC curve (Green & Swets, 1966) can be used to visualize the discriminative performance of a two-alternative classifier that outputs class posteriors. To explain the ROC curve, a classifier can be thought of as making a positive/negative judgement as to whether an input is a member of some class. Two different accuracy measures can be obtained from the classifier: the accuracy of correctly identifying an input as a member of the class (a correct acceptance or CA), and the accuracy of correctly identifying an input as a nonmember of the class (a correct rejection or CR). To evaluate the CA and CR rates, it is necessary to pick a threshold above which the classifier’s probability estimate is inter- preted as an “accept,” and below which is interpreted as a “reject”—call this the criterion. The ROC curve plots CA against CR rates for various criteria (Figure 1a). Note that as the threshold is lowered, the CA rate increases and the CR rate decreases. For a criterion of 1, the CA rate approaches 0 and the CR rate 1; for a criterion of 0, the CA rate approaches 1 Michael C. Mozer, Robert H. Dodier, Michael D. Colagrosso, Cesar Guerra-Salcedo, Richard H. Wolniewicz |
NIPS | 2 |
| 1996 | The Neurothermostat: Predictive Optimal Control of Residential Heating Systems
Michael C. Mozer, Lucky Vidmar, Robert H. Dodier |
NIPS | 3 |
| 1995 | Geometry of Early Stopping in Linear Networks
Robert H. Dodier |
NIPS | 1 |