AI Navigate

重み付けからモデリングへ:オフポリシー評価のための非パラメトリック推定量

arXiv cs.LG / 2026/3/11

Ideas & Deep AnalysisModels & Research

要点

  • 本論文は文脈付きバンディットにおけるオフポリシー評価に取り組んでおり、新しいポリシーを過去のデータを用いて評価する際に、行動の分布ずれによる困難さを扱っている。
  • 従来の逆確率重み付け(IPW)法は分散が大きい問題があり、二重頑健(DR)推定量は分散の一部を軽減するが完全ではない。
  • 著者らは非パラメトリックに重みを構築し、分散を減らしつつバイアスを低く保つ非パラメトリック重み付け(NW)手法を提案する。
  • さらに報酬モデリングを統合したモデル支援非パラメトリック重み付け(MNW)手法により、分散削減効果をさらに高めている。
  • 実証結果では、NWとMNWが既存手法より一貫して優れており、二重頑健性を厳密に要求せずに低分散かつ正確な価値推定を実現している。

Computer Science > Machine Learning

arXiv:2603.09436 (cs)
[Submitted on 10 Mar 2026]

Title:From Weighting to Modeling: A Nonparametric Estimator for Off-Policy Evaluation

View a PDF of the paper titled From Weighting to Modeling: A Nonparametric Estimator for Off-Policy Evaluation, by Rong J.B. Zhu
View PDF HTML (experimental)
Abstract:We study off-policy evaluation in the setting of contextual bandits, where we aim to evaluate a new policy using historical data that consists of contexts, actions and received rewards. This historical data typically does not faithfully represent action distribution of the new policy accurately. A common approach, inverse probability weighting (IPW), adjusts for these discrepancies in action distributions. However, this method often suffers from high variance due to the probability being in the denominator. The doubly robust (DR) estimator reduces variance through modeling reward but does not directly address variance from IPW. In this work, we address the limitation of IPW by proposing a Nonparametric Weighting (NW) approach that constructs weights using a nonparametric model. Our NW approach achieves low bias like IPW but typically exhibits significantly lower variance. To further reduce variance, we incorporate reward predictions -- similar to the DR technique -- resulting in the Model-assisted Nonparametric Weighting (MNW) approach. The MNW approach yields accurate value estimates by explicitly modeling and mitigating bias from reward modeling, without aiming to guarantee the standard doubly robust property. Extensive empirical comparisons show that our approaches consistently outperform existing techniques, achieving lower variance in value estimation while maintaining low bias.
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2603.09436 [cs.LG]
  (or arXiv:2603.09436v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2603.09436
Focus to learn more
arXiv-issued DOI via DataCite
Journal reference: Transactions on Machine Learning Research (3/2026)

Submission history

From: Rong J.B. Zhu [view email]
[v1] Tue, 10 Mar 2026 09:48:22 UTC (38 KB)
Full-text links:

Access Paper:

Current browse context:
cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.