paper-with-me

Papers

Off-Policy Evaluation for Ranking Policies under Deterministic Logging Policies

2026-03-23 · Koichi Tanaka, Kazuki Kawamura, Takanori Muroi, Yusuke Narita, Yuki Sasamoto, Kei Tateno, Takuma Udagawa, Wei-Wei Du, Yuta Saito arxiv

Off-Policy Evaluation (OPE) is an important practical problem in algorithmic ranking systems, where the goal is to estimate the expected performance of a new ranking policy using only offline logged data collected under a different, logging policy. Existing estimators, such as the ranking-wise and position-wise inverse propensity score (IPS) estimators, require the data collection policy to be sufficiently stochastic and suffer from severe bias when the logging policy is fully deterministic. In this paper, we propose novel estimators, Click-based Inverse Propensity Score (CIPS), exploiting the intrinsic stochasticity of user click behavior to address this challenge. Unlike existing methods that rely on the stochasticity of the logging policy, our approach uses click probability as a new form of importance weighting, enabling low-bias OPE even under deterministic logging policies where existing methods incur substantial bias. We provide theoretical analyses of the bias and variance properties of the proposed estimators and show, through synthetic and real-world experiments, that our estimators achieve significantly lower bias compared to strong baselines, for a range of experimental settings with completely deterministic logging policies.

📄 PDF Abstract BibTeX arXiv:2603.21485

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

ECPO: Evidence-Coupled Policy Optimization for Evidence-Certified Candidate Ranking

2026-05-21 · Miaobo Hu, Shuhao Hu, BoKun Wang, Yina Sa 외 arxiv

Ranking systems used in decision-support settings should not only order candidates but also expose evidence that can be independently checked. We study evidence-certified candidate ranking: given an intent_id, a predefin…

Ranking Policy Decisions

2020-08-31 · NeurIPS 2021 12 · Hadrien Pouget, Hana Chockler, Youcheng Sun, Daniel Kroening

Policies trained via Reinforcement Learning (RL) are often needlessly complex, making them difficult to analyse and interpret. In a run with $n$ time steps, a policy will make $n$ decisions on actions to take; we conject…

Atari GamesReinforcement Learning (RL)

Counterfactual Learning with General Data-generating Policies

2022-12-04 · Yusuke Narita, Kyohei Okumura, Akihiro Shimizu, Kohei Yata

Off-policy evaluation (OPE) attempts to predict the performance of counterfactual policies using log data from a different policy. We extend its applicability by developing an OPE method for a class of both full support …

counterfactualDecision MakingOff-policy evaluation

Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies

2024-05-29 · Haanvid Lee, Tri Wahyu Guntara, Jongmin Lee, Yung-Kyun Noh 외

We consider off-policy evaluation (OPE) of deterministic target policies for reinforcement learning (RL) in environments with continuous action spaces. While it is common to use importance sampling for OPE, it suffers fr…

Metric LearningOff-policy evaluationReinforcement Learning (RL)

Doubly Robust Off-Policy Value and Gradient Estimation for Deterministic Policies

2020-06-06 · NeurIPS 2020 12 · Nathan Kallus, Masatoshi Uehara

Offline reinforcement learning, wherein one uses off-policy data logged by a fixed behavior policy to evaluate and learn new policies, is crucial in applications where experimentation is limited such as medicine. We stud…