{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5NQ4TEF72EPXPC3VERPQSFJM7W","short_pith_number":"pith:5NQ4TEF7","schema_version":"1.0","canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","source":{"kind":"arxiv","id":"1502.04874","version":2},"attestation_state":"computed","paper":{"title":"Regret bounds for Narendra-Shapiro bandit algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"math.PR","authors_text":"Fabien Panloup, S\\'ebastien Gadat, Sofiane Saadane","submitted_at":"2015-02-17T12:49:01Z","abstract_excerpt":"Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose convergence has been intensively studied in the stochastic algorithm literature. In this paper, we adress the following question: are the Narendra-Shapiro (NS) bandit algorithms competitive from a \\textit{regret} point of view? In our main result, we show that some competitive bounds can be obtained for such algorithms in their penalized version (introduced in \\cite{Lamberton_Pages}). More precisely, up to an over-penalizat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.04874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"af38d4602e66e2e908716309daa2401c8b6b1c96f13c79ec95d26285fb4c8f2d","abstract_canon_sha256":"24179271622bbc50688835096a03efffe9b2f0ccaaf74b2c1eba225ca24c0349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:48.609616Z","signature_b64":"VZlA0WNph7eriykTSEkjQJiCG9ZopPGmV2w1zKPtYS9cWWrahbfh28DuQXrMaZNAz6Dr5vdfv5hDB1xNLc0qAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","last_reissued_at":"2026-05-18T01:22:48.609101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:48.609101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret bounds for Narendra-Shapiro bandit algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"math.PR","authors_text":"Fabien Panloup, S\\'ebastien Gadat, Sofiane Saadane","submitted_at":"2015-02-17T12:49:01Z","abstract_excerpt":"Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose convergence has been intensively studied in the stochastic algorithm literature. In this paper, we adress the following question: are the Narendra-Shapiro (NS) bandit algorithms competitive from a \\textit{regret} point of view? In our main result, we show that some competitive bounds can be obtained for such algorithms in their penalized version (introduced in \\cite{Lamberton_Pages}). More precisely, up to an over-penalizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04874","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04874","created_at":"2026-05-18T01:22:48.609182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04874v2","created_at":"2026-05-18T01:22:48.609182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04874","created_at":"2026-05-18T01:22:48.609182+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NQ4TEF72EPX","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NQ4TEF72EPXPC3V","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NQ4TEF7","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W","json":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W.json","graph_json":"https://pith.science/api/pith-number/5NQ4TEF72EPXPC3VERPQSFJM7W/graph.json","events_json":"https://pith.science/api/pith-number/5NQ4TEF72EPXPC3VERPQSFJM7W/events.json","paper":"https://pith.science/paper/5NQ4TEF7"},"agent_actions":{"view_html":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W","download_json":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W.json","view_paper":"https://pith.science/paper/5NQ4TEF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04874&json=true","fetch_graph":"https://pith.science/api/pith-number/5NQ4TEF72EPXPC3VERPQSFJM7W/graph.json","fetch_events":"https://pith.science/api/pith-number/5NQ4TEF72EPXPC3VERPQSFJM7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/action/storage_attestation","attest_author":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/action/author_attestation","sign_citation":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/action/citation_signature","submit_replication":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/action/replication_record"}},"created_at":"2026-05-18T01:22:48.609182+00:00","updated_at":"2026-05-18T01:22:48.609182+00:00"}