Log-Sum-Exponential Estimator for Off-Policy Evaluation and Learning
Armin Behnamnia, Gholamali Aminian, Alireza Aghaei, Chengchun Shi, Vincent Y. F. Tan, Hamid R. Rabiee

TL;DR
This paper introduces a novel log-sum-exponential estimator for off-policy evaluation and learning that reduces variance, improves robustness under heavy-tailed rewards, and provides theoretical guarantees on bias, variance, and regret.
Contribution
The paper proposes a new LSE-based estimator that outperforms traditional methods, with theoretical bounds and empirical validation for off-policy evaluation and learning.
Findings
Variance reduction over inverse propensity score estimators
Robustness under heavy-tailed reward distributions
Convergence rate of $O(n^{-rac{psilon}{1+psilon}})$ for regret
Abstract
Off-policy learning and evaluation leverage logged bandit feedback datasets, which contain context, action, propensity score, and feedback for each data point. These scenarios face significant challenges due to high variance and poor performance with low-quality propensity scores and heavy-tailed reward distributions. We address these issues by introducing a novel estimator based on the log-sum-exponential (LSE) operator, which outperforms traditional inverse propensity score estimators. Our LSE estimator demonstrates variance reduction and robustness under heavy-tailed conditions. For off-policy evaluation, we derive upper bounds on the estimator's bias and variance. In the off-policy learning scenario, we establish bounds on the regret -- the performance gap between our LSE estimator and the optimal policy -- assuming bounded -th moment of weighted reward. Notably, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Advanced Causal Inference Techniques · Reinforcement Learning in Robotics
