{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NGRXTVGAFAL7O4RPOLLCFXICR5","short_pith_number":"pith:NGRXTVGA","schema_version":"1.0","canonical_sha256":"69a379d4c02817f7722f72d622dd028f6c957892f218830f572015aebdb80b24","source":{"kind":"arxiv","id":"2006.14567","version":3},"attestation_state":"computed","paper":{"title":"Taming GANs with Lookahead-Minmax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francois Fleuret, Martin Jaggi, Matteo Pagliardini, Sebastian U. Stich, Tatjana Chavdarova","submitted_at":"2020-06-25T17:13:23Z","abstract_excerpt":"Generative Adversarial Networks are notoriously challenging to train. The underlying minmax optimization is highly susceptible to the variance of the stochastic gradient and the rotational component of the associated game vector field. To tackle these challenges, we propose the Lookahead algorithm for minmax optimization, originally developed for single objective minimization only. The backtracking step of our Lookahead-minmax naturally handles the rotational game dynamics, a property which was identified to be key for enabling gradient ascent descent methods to converge on challenging example"},"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":"2006.14567","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-25T17:13:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cb5822bc102db0b32846076a46d70b76e74b1f252d92faf586bac59e86ef37e2","abstract_canon_sha256":"350357d1496a468edea689d127b6e9f2f72496f05c50935c3d3d376e2eeccc0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:53.584884Z","signature_b64":"p2Ob6Kxu+hsZzfYz1p1zho/XOSzPVm0usX/Ud+Q2FEnneazmf5vfdV9vigyCTMQ/GVyjOr5Am+z4jTuL/eqiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a379d4c02817f7722f72d622dd028f6c957892f218830f572015aebdb80b24","last_reissued_at":"2026-07-05T02:51:53.584392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:53.584392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taming GANs with Lookahead-Minmax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francois Fleuret, Martin Jaggi, Matteo Pagliardini, Sebastian U. Stich, Tatjana Chavdarova","submitted_at":"2020-06-25T17:13:23Z","abstract_excerpt":"Generative Adversarial Networks are notoriously challenging to train. The underlying minmax optimization is highly susceptible to the variance of the stochastic gradient and the rotational component of the associated game vector field. To tackle these challenges, we propose the Lookahead algorithm for minmax optimization, originally developed for single objective minimization only. The backtracking step of our Lookahead-minmax naturally handles the rotational game dynamics, a property which was identified to be key for enabling gradient ascent descent methods to converge on challenging example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14567","kind":"arxiv","version":3},"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/2006.14567/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":"2006.14567","created_at":"2026-07-05T02:51:53.584456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14567v3","created_at":"2026-07-05T02:51:53.584456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14567","created_at":"2026-07-05T02:51:53.584456+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGRXTVGAFAL7","created_at":"2026-07-05T02:51:53.584456+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGRXTVGAFAL7O4RP","created_at":"2026-07-05T02:51:53.584456+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGRXTVGA","created_at":"2026-07-05T02:51:53.584456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.07529","citing_title":"Training Deep Learning Models with Norm-Constrained LMOs","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5","json":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5.json","graph_json":"https://pith.science/api/pith-number/NGRXTVGAFAL7O4RPOLLCFXICR5/graph.json","events_json":"https://pith.science/api/pith-number/NGRXTVGAFAL7O4RPOLLCFXICR5/events.json","paper":"https://pith.science/paper/NGRXTVGA"},"agent_actions":{"view_html":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5","download_json":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5.json","view_paper":"https://pith.science/paper/NGRXTVGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14567&json=true","fetch_graph":"https://pith.science/api/pith-number/NGRXTVGAFAL7O4RPOLLCFXICR5/graph.json","fetch_events":"https://pith.science/api/pith-number/NGRXTVGAFAL7O4RPOLLCFXICR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5/action/storage_attestation","attest_author":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5/action/author_attestation","sign_citation":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5/action/citation_signature","submit_replication":"https://pith.science/pith/NGRXTVGAFAL7O4RPOLLCFXICR5/action/replication_record"}},"created_at":"2026-07-05T02:51:53.584456+00:00","updated_at":"2026-07-05T02:51:53.584456+00:00"}