On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization | Signal Canvas | ScienceToStartup

Page Freshness

Signal Canvas proof surface

Canonical route: /signal-canvas/on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization

stale

Proof freshness: stale
Proof status: unverified
Display score: 0/10
Last proof check: 2026-05-05
Score updated: 2026-05-05
Score fresh until: 2026-06-04
References: 0
Source count: 3
Coverage: 50%

This page is showing the last landed evidence receipt and score bundle because the latest proof data is outside the freshness window.

Agent Handoff

Canonical ID on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization | Route /signal-canvas/on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization

REST example

curl https://sciencetostartup.com/api/v1/agent-handoff/signal-canvas/on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization

MCP example

{
  "tool": "search_signal_canvas",
  "arguments": {
    "mode": "paper",
    "paper_ref": "on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization",
    "query_text": "Summarize On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization"
  }
}

source_context

{
  "surface": "signal_canvas",
  "mode": "paper",
  "query": "On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization",
  "normalized_query": "2605.02141",
  "route": "/signal-canvas/on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization",
  "paper_ref": "on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization",
  "topic_slug": null,
  "benchmark_ref": null,
  "dataset_ref": null
}

Evidence Receipt

Route status: building

Claims: 0

References: Pending verification

Proof: Verification pending

Freshness state: computing

Source paper: On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

PDF: https://arxiv.org/pdf/2605.02141v1

Source count: 3

Coverage: 50%

Last proof check: 2026-05-05T20:33:21.602Z

Signal Canvas receipt window

Not build-ready: On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

/buildability/on-the-optimal-sample-complexity-of-offline-multi-armed-bandits-with-kl-regularization

Ignoreblocked

Subject: On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

Verdict

Ignore

Verdict is Ignore because current viability and proof state do not clear the buildability gate.

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

Use Signal Canvas as the narrative proof surface

Use this Signal Canvas via API or MCP

Signal Canvas proof surface