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.
? Tutorial for this page

Eric B. Laber

dblp:95/10964 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2021
0000-0003-2640-7696ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 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
3 papers
Probabilistic and Bayesian machine learning · 53% Reinforcement learning · 31% Learning theory · 16%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 88% Computational social science and digital humanities · 12%

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

TopicWeightPapersLastEvidence papers
Medical and health informatics › precision medicine
dynamic treatment regime
0.512021
Estimation and Optimization of Composite Outcomes · J. Mach. Learn. Res. 2021
Medical and health informatics
precision medicine
0.512021
Estimation and Optimization of Composite Outcomes · J. Mach. Learn. Res. 2021
Machine learning › Probabilistic and Bayesian machine learning › causal inference
individualized treatment rule
0.412019
Efficient augmentation and relaxation learning for individualized treatment rules using observational data · J. Mach. Learn. Res. 2019
Machine learning › Probabilistic and Bayesian machine learning
observational data
0.412019
Efficient augmentation and relaxation learning for individualized treatment rules using observational data · J. Mach. Learn. Res. 2019
Machine learning › Learning theory › statistical estimation › semiparametric estimation
semiparametric efficiency
0.412019
Efficient augmentation and relaxation learning for individualized treatment rules using observational data · J. Mach. Learn. Res. 2019
Machine learning › Reinforcement learning › dynamic programming › value iteration
fitted q-iteration
0.212016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Machine learning › Reinforcement learning
multi-objective reinforcement learning
0.212016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Machine learning › Reinforcement learning
value-based reinforcement learning
0.212016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Medical and health informatics
clinical decision support
0.112016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016

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

utility maximization · 1.0semiparametric estimation · 1.0causal inference · 1.0scalarization · 0.5doubly robust estimation · 0.4convex large-margin classification · 0.4sequential decision-making · 0.2sequential decision making · 0.2
YearPublicationVenuePosition
2021 Variance Decompositions for Extensive-Form Games
abstract
The extent to which an individual or chance can influence the outcome of a game is a central question in the analysis of games. Consequently, the ability to characterize sources of variation in game outcomes may have significant implications in areas such as game design, law, and multi-agent reinforcement learning. We derive a closed-form expression and estimators for the variance in the outcome of a general multi-agent game that is attributable to a player or chance. We analyze poker hands to show that randomness in the cards dealt has surprisingly little influence on the outcomes of each hand. A simple example is given that demonstrates how variance decompositions can be used to measure other interesting properties of games.
Alex Cloud, Eric B. Laber
CoG2
2021 Estimation and Optimization of Composite Outcomes
abstract
There is tremendous interest in precision medicine as a means to improve patient outcomes by tailoring treatment to individual characteristics. An individualized treatment rule formalizes precision medicine as a map from patient information to a recommended treatment. A treatment rule is defined to be optimal if it maximizes the mean of a scalar outcome in a population of interest, e.g., symptom reduction. However, clinical and intervention scientists often seek to balance multiple and possibly competing outcomes, e.g., symptom reduction and the risk of an adverse event. One approach to precision medicine in this setting is to elicit a composite outcome which balances all competing outcomes; unfortunately, eliciting a composite outcome directly from patients is difficult without a high-quality instrument, and an expert-derived composite outcome may not account for heterogeneity in patient preferences. We propose a new paradigm for the study of precision medicine using observational data that relies solely on the assumption that clinicians are approximately (i.e., imperfectly) making decisions to maximize individual patient utility. Estimated composite outcomes are subsequently used to construct an estimator of an individualized treatment rule which maximizes the mean of patient-specific composite outcomes. The estimated composite outcomes and estimated optimal individualized treatment rule provide new insights into patient preference heterogeneity, clinician behavior, and the value of precision medicine in a given domain. We derive inference procedures for the proposed estimators under mild conditions and demonstrate their finite sample performance through a suite of simulation experiments and an illustrative application to data from a study of bipolar depression.
Daniel J. Luckett, Eric B. Laber, Siyeon Kim, Michael R. Kosorok
J. Mach. Learn. Res.2
2019 Efficient augmentation and relaxation learning for individualized treatment rules using observational data
abstract
Individualized treatment rules aim to identify if, when, which, and to whom treatment should be applied. A globally aging population, rising healthcare costs, and increased access to patient-level data have created an urgent need for high-quality estimators of individualized treatment rules that can be applied to observational data. A recent and promising line of research for estimating individualized treatment rules recasts the problem of estimating an optimal treatment rule as a weighted classification problem. We consider a class of estimators for optimal treatment rules that are analogous to convex large-margin classifiers. The proposed class applies to observational data and is doubly-robust in the sense that correct specification of either a propensity or outcome model leads to consistent estimation of the optimal individualized treatment rule. Using techniques from semiparametric efficiency theory, we derive rates of convergence for the proposed estimators and use these rates to characterize the bias-variance trade-off for estimating individualized treatment rules with classification-based methods. Simulation experiments informed by these results demonstrate that it is possible to construct new estimators within the proposed framework that significantly outperform existing ones. We illustrate the proposed methods using data from a labor training program and a study of inflammatory bowel syndrome.
Ying-Qi Zhao, Eric B. Laber, Yang Ning, Sumona Saha, Bruce E. Sands
J. Mach. Learn. Res.2
2016 Multi-Objective Markov Decision Processes for Data-Driven Decision Support
abstract
We present new methodology based on Multi-Objective Markov Decision Processes for developing sequential decision support systems from data. Our approach uses sequential decision-making data to provide support that is useful to many different decision-makers, each with different, potentially time-varying preference. To accomplish this, we develop an extension of fitted-$Q$ iteration for multiple objectives that computes policies for all scalarization functions, i.e. preference functions, simultaneously from continuous-state, finite-horizon data. We identify and address several conceptual and computational challenges along the way, and we introduce a new solution concept that is appropriate when different actions have similar expected outcomes. Finally, we demonstrate an application of our method using data from the Clinical Antipsychotic Trials of Intervention Effectiveness and show that our approach offers decision-makers increased choice by a larger class of optimal policies.
Daniel J. Lizotte, Eric B. Laber
J. Mach. Learn. Res.2
2011 Informing sequential clinical decision-making through reinforcement learning: an empirical study
Susan M. Shortreed, Eric B. Laber, Daniel J. Lizotte, T. Scott Stroup, Joelle Pineau, Susan A. Murphy
Mach. Learn.2
2008 Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Eric B. Laber, Susan A. Murphy
UAI1