Pith Number

pith:XGIURO52

pith:2026:XGIURO52HAOSEVO7ZSRO7AFKVH

not attested not anchored not stored refs resolved

Tight Sample Complexity Bounds for Entropic Best Policy Identification

Amer Essakine, Claire Vernade

A new stopping rule closes the exponential gap and matches the lower bound for entropic best-policy identification.

arxiv:2605.13717 v1 · 2026-05-13 · cs.LG · stat.ML

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{XGIURO52HAOSEVO7ZSRO7AFKVH}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We show that this extra exponential factor can be traced to overly loose concentration control for exponential utilities. [...] we propose a new stopping rule that exploits further this tightness to obtain a sample complexity that matches the lower bound.

C2weakest assumption

The smoothness properties of the exponential utility suffice to derive sharper concentration bounds that are tight enough for the new stopping rule to match the lower bound.

C3one line summary

New concentration bounds and stopping rule close the exponential gap to match the lower bound for entropic best policy identification.

References

29 extracted · 29 resolved · 0 Pith anchors

[1] Proceedings of the 29th International Conference on Machine Learning (ICML-12) , series = 2012

[2] arXiv preprint arXiv:2506.00286 , year =

[3] Computational Economics , year =

[4] Journal of Intelligent 2017

[5] Beyond Average Return in Markov Decision Processes , url =

Receipt and verification

First computed	2026-05-18T02:44:16.691728Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

b99148bbba381d2255dfcca2ef80aaa9dcfff2706ba2e078b19abee30bf1db86

Aliases

arxiv: 2605.13717 · arxiv_version: 2605.13717v1 · doi: 10.48550/arxiv.2605.13717 · pith_short_12: XGIURO52HAOS · pith_short_16: XGIURO52HAOSEVO7 · pith_short_8: XGIURO52

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/XGIURO52HAOSEVO7ZSRO7AFKVH \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: b99148bbba381d2255dfcca2ef80aaa9dcfff2706ba2e078b19abee30bf1db86

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "32f060087b56c361c4c30ebf6b47bce1e30f7242602fc313af11def460648777",
    "cross_cats_sorted": [
      "stat.ML"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-05-13T16:02:26Z",
    "title_canon_sha256": "4ce383fb2f50f96a37eaf1a8737831c6b6fdefa78bb96794104ecb1aa8822a16"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13717",
    "kind": "arxiv",
    "version": 1
  }
}