{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:52P7G75RKUL4AYJZ34MPWWD7KJ","short_pith_number":"pith:52P7G75R","schema_version":"1.0","canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","source":{"kind":"arxiv","id":"1401.6956","version":2},"attestation_state":"computed","paper":{"title":"A continuous-time approach to online optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Joon Kwon, Panayotis Mertikopoulos","submitted_at":"2014-01-27T18:45:54Z","abstract_excerpt":"We consider a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms including as special cases the exponential weight algorithm, online mirror descent, smooth fictitious play and vanishingly smooth fictitious play. In so doing, we obtain a unified view of many classical regret bounds, and we show that they can be decomposed into a term stemming fr"},"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":"1401.6956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d8a7d92bb9ab4fa23b1e56ac0a6f42c3b6b3c7e4373b1f7c2181cffac27a29ff","abstract_canon_sha256":"d0955cf2f046450d1db9e58870945de4ce889037d0e9391428ef78e09385f341"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.187522Z","signature_b64":"ms6Lj2fHoKgQ62be5x0UVhBnKMWLD+eoy4Usaws0chJgM++O873EVA5S9s0YDdj9+EbyESApukvtL4mWBkiYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","last_reissued_at":"2026-05-18T02:57:43.186951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.186951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A continuous-time approach to online optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Joon Kwon, Panayotis Mertikopoulos","submitted_at":"2014-01-27T18:45:54Z","abstract_excerpt":"We consider a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms including as special cases the exponential weight algorithm, online mirror descent, smooth fictitious play and vanishingly smooth fictitious play. In so doing, we obtain a unified view of many classical regret bounds, and we show that they can be decomposed into a term stemming fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6956","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":"1401.6956","created_at":"2026-05-18T02:57:43.187031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6956v2","created_at":"2026-05-18T02:57:43.187031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6956","created_at":"2026-05-18T02:57:43.187031+00:00"},{"alias_kind":"pith_short_12","alias_value":"52P7G75RKUL4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"52P7G75RKUL4AYJZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"52P7G75R","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06190","citing_title":"Constrained Contextual Bandits with Adversarial Contexts","ref_index":274,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ","json":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ.json","graph_json":"https://pith.science/api/pith-number/52P7G75RKUL4AYJZ34MPWWD7KJ/graph.json","events_json":"https://pith.science/api/pith-number/52P7G75RKUL4AYJZ34MPWWD7KJ/events.json","paper":"https://pith.science/paper/52P7G75R"},"agent_actions":{"view_html":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ","download_json":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ.json","view_paper":"https://pith.science/paper/52P7G75R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6956&json=true","fetch_graph":"https://pith.science/api/pith-number/52P7G75RKUL4AYJZ34MPWWD7KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/52P7G75RKUL4AYJZ34MPWWD7KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/action/storage_attestation","attest_author":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/action/author_attestation","sign_citation":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/action/citation_signature","submit_replication":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/action/replication_record"}},"created_at":"2026-05-18T02:57:43.187031+00:00","updated_at":"2026-05-18T02:57:43.187031+00:00"}