{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DO3F7Y624FAD64EG7ETJGKMPUU","short_pith_number":"pith:DO3F7Y62","schema_version":"1.0","canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","source":{"kind":"arxiv","id":"1708.00075","version":1},"attestation_state":"computed","paper":{"title":"Efficient Regret Minimization in Non-Convex Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","submitted_at":"2017-07-31T21:23:29Z","abstract_excerpt":"We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guarantee convergence to equilibrium in this framework."},"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":"1708.00075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"00b9b1e48a461f98008d4d24aa5f4d7dec20f8b692ed39db287acfe1ff0d37f3","abstract_canon_sha256":"ae276b1ea35e2275c68ed880798005608246b8971c7f4034eda3a0a08e592a39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:28.764642Z","signature_b64":"WFa9TEQVo9BtUPy2FK7xfJKQ0ibOAzgdyYK67SfVK76FZlK+79EOseW6TvOpORTVVySGy0gNhkjdtBBLxTKcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","last_reissued_at":"2026-05-18T00:31:28.763827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:28.763827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Regret Minimization in Non-Convex Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","submitted_at":"2017-07-31T21:23:29Z","abstract_excerpt":"We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guarantee convergence to equilibrium in this framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00075","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":"1708.00075","created_at":"2026-05-18T00:31:28.763979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00075v1","created_at":"2026-05-18T00:31:28.763979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00075","created_at":"2026-05-18T00:31:28.763979+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO3F7Y624FAD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO3F7Y624FAD64EG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO3F7Y62","created_at":"2026-05-18T12:31:12.930513+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/DO3F7Y624FAD64EG7ETJGKMPUU","json":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU.json","graph_json":"https://pith.science/api/pith-number/DO3F7Y624FAD64EG7ETJGKMPUU/graph.json","events_json":"https://pith.science/api/pith-number/DO3F7Y624FAD64EG7ETJGKMPUU/events.json","paper":"https://pith.science/paper/DO3F7Y62"},"agent_actions":{"view_html":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU","download_json":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU.json","view_paper":"https://pith.science/paper/DO3F7Y62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00075&json=true","fetch_graph":"https://pith.science/api/pith-number/DO3F7Y624FAD64EG7ETJGKMPUU/graph.json","fetch_events":"https://pith.science/api/pith-number/DO3F7Y624FAD64EG7ETJGKMPUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/action/storage_attestation","attest_author":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/action/author_attestation","sign_citation":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/action/citation_signature","submit_replication":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/action/replication_record"}},"created_at":"2026-05-18T00:31:28.763979+00:00","updated_at":"2026-05-18T00:31:28.763979+00:00"}