{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JSZN3HRXPZB5Z34IXQ623GY3II","short_pith_number":"pith:JSZN3HRX","schema_version":"1.0","canonical_sha256":"4cb2dd9e377e43dcef88bc3dad9b1b4229ceda501f867dadd805637d6e31134e","source":{"kind":"arxiv","id":"2305.16610","version":5},"attestation_state":"computed","paper":{"title":"Adaptively Perturbed Mirror Descent for Learning in Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Atsushi Iwasaki, Kaito Ariu, Kenshi Abe, Mitsuki Sakamoto","submitted_at":"2023-05-26T04:02:54Z","abstract_excerpt":"This paper proposes a payoff perturbation technique for the Mirror Descent (MD) algorithm in games where the gradient of the payoff functions is monotone in the strategy profile space, potentially containing additive noise. The optimistic family of learning algorithms, exemplified by optimistic MD, successfully achieves {\\it last-iterate} convergence in scenarios devoid of noise, leading the dynamics to a Nash equilibrium. A recent re-emerging trend underscores the promise of the perturbation approach, where payoff functions are perturbed based on the distance from an anchoring, or {\\it slings"},"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":"2305.16610","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-05-26T04:02:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1cd9c79251e355b888d4761f64a9e6ac9db6cb98e6c22ffbc40bb20a80a2f8bc","abstract_canon_sha256":"cf6bd48d7e1d2a8de2c6e98b0b2714f27b8f4ec3da58f6e052f36d336b3d4860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:35.098053Z","signature_b64":"9zvP/3LO4Z/hw+6mMPsI9T/H/OkRdTKJX33fMub3Es0RoTDS3IBCis2F5CZ/NTvhEacj+r5jXcKFMolg+9xjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cb2dd9e377e43dcef88bc3dad9b1b4229ceda501f867dadd805637d6e31134e","last_reissued_at":"2026-07-05T08:35:35.097692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:35.097692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptively Perturbed Mirror Descent for Learning in Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Atsushi Iwasaki, Kaito Ariu, Kenshi Abe, Mitsuki Sakamoto","submitted_at":"2023-05-26T04:02:54Z","abstract_excerpt":"This paper proposes a payoff perturbation technique for the Mirror Descent (MD) algorithm in games where the gradient of the payoff functions is monotone in the strategy profile space, potentially containing additive noise. The optimistic family of learning algorithms, exemplified by optimistic MD, successfully achieves {\\it last-iterate} convergence in scenarios devoid of noise, leading the dynamics to a Nash equilibrium. A recent re-emerging trend underscores the promise of the perturbation approach, where payoff functions are perturbed based on the distance from an anchoring, or {\\it slings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16610","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.16610/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.16610","created_at":"2026-07-05T08:35:35.097747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16610v5","created_at":"2026-07-05T08:35:35.097747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16610","created_at":"2026-07-05T08:35:35.097747+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSZN3HRXPZB5","created_at":"2026-07-05T08:35:35.097747+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSZN3HRXPZB5Z34I","created_at":"2026-07-05T08:35:35.097747+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSZN3HRX","created_at":"2026-07-05T08:35:35.097747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00533","citing_title":"Rapid Learning in Constrained Minimax Games with Negative Momentum","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II","json":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II.json","graph_json":"https://pith.science/api/pith-number/JSZN3HRXPZB5Z34IXQ623GY3II/graph.json","events_json":"https://pith.science/api/pith-number/JSZN3HRXPZB5Z34IXQ623GY3II/events.json","paper":"https://pith.science/paper/JSZN3HRX"},"agent_actions":{"view_html":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II","download_json":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II.json","view_paper":"https://pith.science/paper/JSZN3HRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16610&json=true","fetch_graph":"https://pith.science/api/pith-number/JSZN3HRXPZB5Z34IXQ623GY3II/graph.json","fetch_events":"https://pith.science/api/pith-number/JSZN3HRXPZB5Z34IXQ623GY3II/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II/action/storage_attestation","attest_author":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II/action/author_attestation","sign_citation":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II/action/citation_signature","submit_replication":"https://pith.science/pith/JSZN3HRXPZB5Z34IXQ623GY3II/action/replication_record"}},"created_at":"2026-07-05T08:35:35.097747+00:00","updated_at":"2026-07-05T08:35:35.097747+00:00"}