{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6PUTADXCAH3HGMMRLCBCNGNTCQ","short_pith_number":"pith:6PUTADXC","schema_version":"1.0","canonical_sha256":"f3e9300ee201f673319158822699b31407ecface2f7fa02ceacdca53d1b2c176","source":{"kind":"arxiv","id":"1211.6158","version":1},"attestation_state":"computed","paper":{"title":"The Interplay Between Stability and Regret in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Ankan Saha, Prateek Jain","submitted_at":"2012-11-26T23:13:23Z","abstract_excerpt":"This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called {\\em forward regret} that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given stability, bounded forward regret is equivalent to bounded regret. We also show that the existence of an algorithm with bounded regret implies the existence of a stable algorithm with bounded regret and bounded forward regret. The equivalence results apply to general, possibly n"},"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":"1211.6158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T23:13:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6d1cca38736b1739848a877e0a58254da56cbf8abacd9923a66b14d3d7a64c43","abstract_canon_sha256":"09a6fdcb36e5de7124faeb5137e3de7aed76332d3dd3fc60f789958846650093"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:52.442461Z","signature_b64":"AVPt3nQJFNrzEBdJDs4Qmrd0gIi/K5526y0CHAzlZz6hqPqHgaQ7EjYfPOGxuv5PFNLGYd7F+IB3cc+lptW+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3e9300ee201f673319158822699b31407ecface2f7fa02ceacdca53d1b2c176","last_reissued_at":"2026-05-18T03:39:52.441913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:52.441913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Interplay Between Stability and Regret in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Ankan Saha, Prateek Jain","submitted_at":"2012-11-26T23:13:23Z","abstract_excerpt":"This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called {\\em forward regret} that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given stability, bounded forward regret is equivalent to bounded regret. We also show that the existence of an algorithm with bounded regret implies the existence of a stable algorithm with bounded regret and bounded forward regret. The equivalence results apply to general, possibly n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6158","kind":"arxiv","version":1},"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":"1211.6158","created_at":"2026-05-18T03:39:52.442004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6158v1","created_at":"2026-05-18T03:39:52.442004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6158","created_at":"2026-05-18T03:39:52.442004+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PUTADXCAH3H","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PUTADXCAH3HGMMR","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PUTADXC","created_at":"2026-05-18T12:26:56.085431+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/6PUTADXCAH3HGMMRLCBCNGNTCQ","json":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ.json","graph_json":"https://pith.science/api/pith-number/6PUTADXCAH3HGMMRLCBCNGNTCQ/graph.json","events_json":"https://pith.science/api/pith-number/6PUTADXCAH3HGMMRLCBCNGNTCQ/events.json","paper":"https://pith.science/paper/6PUTADXC"},"agent_actions":{"view_html":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ","download_json":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ.json","view_paper":"https://pith.science/paper/6PUTADXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6158&json=true","fetch_graph":"https://pith.science/api/pith-number/6PUTADXCAH3HGMMRLCBCNGNTCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6PUTADXCAH3HGMMRLCBCNGNTCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ/action/storage_attestation","attest_author":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ/action/author_attestation","sign_citation":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ/action/citation_signature","submit_replication":"https://pith.science/pith/6PUTADXCAH3HGMMRLCBCNGNTCQ/action/replication_record"}},"created_at":"2026-05-18T03:39:52.442004+00:00","updated_at":"2026-05-18T03:39:52.442004+00:00"}