activity
20162024
most citedDouble Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processes

84 citations · 290 across the 36 of their papers we have counts for

collaborators
Showing stat.MLShow all

12 papers · 1 filter

stat.ML2023★ 8 cited

Off-Policy Evaluation of Ranking Policies under Diverse User Behavior

Haruka Kiyohara, Masatoshi Uehara, Yusuke Narita +3

Ranking interfaces are everywhere in online platforms. There is thus an ever growing interest in their Off-Policy Evaluation (OPE), aiming towards an accurate performance evaluatio…

stat.ML2023

Minimax Instrumental Variable Regression and Convergence Guarantees without Identification or Closedness

Andrew Bennett, Nathan Kallus, Xiaojie Mao +3

In this paper, we study nonparametric estimation of instrumental variable (IV) regressions. Recently, many flexible machine learning methods have been developed for instrumental va…

stat.ML2022

A Review of Off-Policy Evaluation in Reinforcement Learning

Masatoshi Uehara, Chengchun Shi, Nathan Kallus

Reinforcement learning (RL) is one of the most vibrant research frontiers in machine learning and has been recently applied to solve a number of challenging problems. In this paper…

stat.ML2021★ 19 cited

Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach

Nathan Kallus, Xiaojie Mao, Masatoshi Uehara +1

We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identific…

stat.ML2020★ 3 cited

Statistically Efficient Off-Policy Policy Gradients

Nathan Kallus, Masatoshi Uehara

Policy gradient methods in reinforcement learning update policy parameters by taking steps in the direction of an estimated gradient of policy value. In this paper, we consider the…

stat.ML2020★ 12 cited

Off-Policy Evaluation and Learning for External Validity under a Covariate Shift

Masahiro Kato, Masatoshi Uehara, Shota Yasui

We consider evaluating and training a new policy for the evaluation data by using the historical data obtained from a different policy. The goal of off-policy evaluation (OPE) is t…

stat.ML2019★ 12 cited

Localized Debiased Machine Learning: Efficient Inference on Quantile Treatment Effects and Beyond

Nathan Kallus, Xiaojie Mao, Masatoshi Uehara

We consider estimating a low-dimensional parameter in an estimating equation involving high-dimensional nuisances that depend on the parameter. A central example is the efficient e…

stat.ML2019★ 2 cited

Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning

Nathan Kallus, Masatoshi Uehara

Off-policy evaluation (OPE) in reinforcement learning is notoriously difficult in long- and infinite-horizon settings due to diminishing overlap between behavior and target policie…

stat.ML2019★ 4 cited

Imputation estimators for unnormalized models with missing data

Masatoshi Uehara, Takeru Matsuda, Jae Kwang Kim

Several statistical models are given in the form of unnormalized densities, and calculation of the normalization constant is intractable. We propose estimation methods for such unn…

stat.ML2019★ 1 cited

Unified estimation framework for unnormalized models with statistical efficiency

Masatoshi Uehara, Takafumi Kanamori, Takashi Takenouchi +1

The parameter estimation of unnormalized models is a challenging problem. The maximum likelihood estimation (MLE) is computationally infeasible for these models since normalizing c…

stat.ML2018★ 5 cited

Analysis of Noise Contrastive Estimation from the Perspective of Asymptotic Variance

Masatoshi Uehara, Takeru Matsuda, Fumiyasu Komaki

There are many models, often called unnormalized models, whose normalizing constants are not calculated in closed form. Maximum likelihood estimation is not directly applicable to…

stat.ML2016★ 49 cited

Generative Adversarial Nets from a Density Ratio Estimation Perspective

Masatoshi Uehara, Issei Sato, Masahiro Suzuki +2

Generative adversarial networks (GANs) are successful deep generative models. GANs are based on a two-player minimax game. However, the objective function derived in the original m…