Support-aware offline policy selection for advertising marketplaces

• URL: http://arxiv.org/abs/2605.21736v1
• Date: Wed, 20 May 2026 20:57:18 GMT
• Title: Support-aware offline policy selection for advertising marketplaces
• Abstract summary: This paper develops a support-aware offline decision framework for reserve-policy selection.<n>It converts logged evidence into a conservative decision object consisting of certified policies, statistically dominated alternatives, and unresolved candidates.
• Score: 0.5013248430919224
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Logged advertising auctions make offline reserve-price evaluation attractive but risky. Replay tables can identify policies with large apparent yield gains, yet they can also hide weak threshold support, multiple-comparison effects, subgroup harm, and bidder-response uncertainty. Existing replay and off-policy evaluation methods estimate or rank policy values, but they do not directly answer the operational question of whether the available evidence is strong enough to justify validation. This paper develops a support-aware offline decision framework for reserve-policy selection. Rather than outputting a single point-estimate winner, the framework converts logged evidence into a conservative decision object consisting of certified policies, statistically dominated alternatives, and unresolved candidates requiring further validation. The main theoretical result gives a unified finite-catalog guarantee showing that, under simultaneous uncertainty control and conservative support gates, the framework preserves the best gate-passing policy while eliminating only policies with certified regret. Supporting results characterize support-localized replay generalization, establish information-theoretic threshold-resolution limits, and quantify when heterogeneous bidder response can overturn localized replay rankings. Experiments on iPinYou real-time-bidding logs show that the leading reserve rule achieves a 47.66% replay lift in season two, a 40.71% simultaneous lower-bound lift, and a 43.87% frozen out-of-time replay lift in season three. The framework reduces a 19-policy catalog to a two-policy validation shortlist while certifying non-harm across 44 advertiser, exchange, and region segments. The results support the central claim that offline reserve-policy evaluation should produce certified validation decisions rather than point-estimate rankings alone.

Related papers

• TTPO: Test-Time Policy Optimization [53.81524570216593]
  Test-Time Policy Optimization (TTPO) is an asymmetric objective that distills agreeing rollouts via OPSD and penalizes disagreeing rollouts with Grouped RL.<n>We show that TTPO matches label-supervised OPSD on five competition-level benchmarks, raises Qwen3-1.7B from 38.0% to 45.2% in TTT, yields +25.2% to +36.4% without thinking, and shows strong cross-task generalization.
  arXiv  Detail & Related papers  (2026-08-27T17:58:10Z)
• Explicit State Elicitation Is Not Enough: A Controlled Audit of Memory-Policy Classification [11.991995412984503]
  We use this setting to develop an empirical audit protocol for structured intermediate outputs.<n>A 480-example synthetic development set initially suggested large gains from a state-structured prompt bundle.<n>On this set, exposing the four state definitions improves accuracy, but an isolated explicit state-output field does not significantly improve policy accuracy.
  arXiv  Detail & Related papers  (2026-08-18T01:04:45Z)
• Context Is Not Authority: Structured Runtime Governance for Financial Market Agents [13.810351865063632]
  SAGE-Fin is a finance-specific authority-handoff contract.<n>It compiles proposals into typed, adapter-bound candidates.<n>It requires an exact-artifact receipt whose nominal type matches the consuming response, execution, or policy adapter.
  arXiv  Detail & Related papers  (2026-08-10T02:26:07Z)
• When Outcome Looks Right But Discipline Fails: Trace-Based Evaluation Under Hidden Competitor State [0.39287497907611874]
  Outcome-only evaluation can certify economically unsafe agents.<n>In hotel pricing with hidden competitor state, a learner can achieve plausible revenue per available room while failing to preserve the rate discipline of a rule-based revenue-management policy.<n>We introduce discipline stability, a trace-based evaluation paradigm.
  arXiv  Detail & Related papers  (2026-05-18T15:58:34Z)
• Decision Support for Marketplace Policies under Incomplete Evidence: From Replay to Launch Readiness [0.5013248430919224]
  We propose a support-aware decision-support system (DSS) that distinguishes promising from actionable evidence.<n>The framework integrates replay, support-aware off-policy evaluation (OPE), conservative lower-bound ranking, multi-sided guardrails, out-of-time validation, sensitivity analysis, and interference-aware validation design.<n>Applying the framework to iPinYou-style RTB logs, we identify a margin-gated floor policy as the leading candidate.
  arXiv  Detail & Related papers  (2026-05-13T00:26:50Z)
• Reward Hacking in Rubric-Based Reinforcement Learning [23.418394508756464]
  We study reward hacking in rubric-based RL, where a policy is optimized against a training verifier but evaluated against a cross-family panel of three frontier judges.<n>Our framework separates two sources of divergence: verifier failure and rubric-design limitations.<n>Across medical and science domains, weak verifiers produce large proxy-reward gains that do not transfer to the reference verifiers.
  arXiv  Detail & Related papers  (2026-05-12T17:54:25Z)
• Conformal Path Reasoning: Trustworthy Knowledge Graph Question Answering via Path-Level Calibration [31.29584002718744]
  We propose Conformal Path Reasoning (CPR), a trustworthy KGQA framework with two key innovations.<n>First, we perform query-level conformal calibration over path-level scores, preserving the exchangeability while generating path prediction sets.<n>Second, we introduce the Residual Conformal Value Network (RCVNet), a lightweight module trained via PUCT-guided exploration to learn discriminative path-level nonconformity scores.
  arXiv  Detail & Related papers  (2026-05-08T17:57:13Z)
• Bayesian Conservative Policy Optimization (BCPO): A Novel Uncertainty-Calibrated Offline Reinforcement Learning with Credible Lower Bounds [1.2183405753834562]
  offline reinforcement learning (RL) aims to learn decision policies from a fixed batch of logged transitions.<n>We propose emphBayesian Conservative Policy Optimization (BCPO), a unified framework that converts uncertainty into emphprovably conservative policy improvement.<n>BCPO maintains a hierarchical Bayesian posterior over environment/value models, constructs a emphcredible lower bound (LCB) on action values, and performs policy updates under explicit KL regularization.
  arXiv  Detail & Related papers  (2026-03-06T01:46:02Z)
• Preventing the Collapse of Peer Review Requires Verification-First AI [49.995126139461085]
  We propose truth-coupling, i.e. how tightly venue scores track latent scientific truth.<n>We formalize two forces that drive a phase transition toward proxy-sovereign evaluation.
  arXiv  Detail & Related papers  (2026-01-23T17:17:32Z)
• Making LLMs Reliable When It Matters Most: A Five-Layer Architecture for High-Stakes Decisions [51.56484100374058]
  Current large language models (LLMs) excel in verifiable domains where outputs can be checked before action but prove less reliable for high-stakes strategic decisions with uncertain outcomes.<n>This gap, driven by mutually cognitive biases in both humans and artificial intelligence (AI) systems, threatens the defensibility of valuations and sustainability of investments in the sector.<n>This report describes a framework emerging from systematic qualitative assessment across 7 frontier-grade LLMs and 3 market-facing venture vignettes under time pressure.
  arXiv  Detail & Related papers  (2025-11-10T22:24:21Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• The Decisive Power of Indecision: Low-Variance Risk-Limiting Audits and Election Contestation via Marginal Mark Recording [51.82772358241505]
  Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections. We define new families of audits that improve efficiency and offer advances in statistical power. New audits are enabled by revisiting the standard notion of a cast-vote record so that it can declare multiple possible mark interpretations.
  arXiv  Detail & Related papers  (2024-02-09T16:23:54Z)
• Offline Policy Selection under Uncertainty [113.57441913299868]
  We consider offline policy selection as learning preferences over a set of policy prospects given a fixed experience dataset. Access to the full distribution over one's belief of the policy value enables more flexible selection algorithms under a wider range of downstream evaluation metrics. We show how BayesDICE may be used to rank policies with respect to any arbitrary downstream policy selection metric.
  arXiv  Detail & Related papers  (2020-12-12T23:09:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.