{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MD7YBYKDDS7QAIA5JH44EJ4WRC","short_pith_number":"pith:MD7YBYKD","schema_version":"1.0","canonical_sha256":"60ff80e1431cbf00201d49f9c22796888bc7908eebbdc40578e566401b9bd080","source":{"kind":"arxiv","id":"2210.06367","version":1},"attestation_state":"computed","paper":{"title":"Quadratic minimization: from conjugate gradient to an adaptive Heavy-ball method with Polyak step-sizes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Aymeric Dieuleveut, Baptiste Goujaud","submitted_at":"2022-10-12T16:18:27Z","abstract_excerpt":"In this work, we propose an adaptive variation on the classical Heavy-ball method for convex quadratic minimization. The adaptivity crucially relies on so-called \"Polyak step-sizes\", which consists in using the knowledge of the optimal value of the optimization problem at hand instead of problem parameters such as a few eigenvalues of the Hessian of the problem. This method happens to also be equivalent to a variation of the classical conjugate gradient method, and thereby inherits many of its attractive features, including its finite-time convergence, instance optimality, and its worst-case c"},"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":"2210.06367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-12T16:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"c75add5a5986719b114fc3edf266c55130f081c3e38b349e1c1ceedc652a13e7","abstract_canon_sha256":"c0959162c8f1d305cd7e211fc971aa3208262b1891c94044ccca4d9edcd6465c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:59.618787Z","signature_b64":"NVQi1BrCfGUY8Q3Z5+0VhjfuL71h/lvaVO1idLBSRfw77aScPDcuSPb42Pagmu1u6vDxOtjHo4Jn2RFNx77jCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60ff80e1431cbf00201d49f9c22796888bc7908eebbdc40578e566401b9bd080","last_reissued_at":"2026-07-05T05:05:59.618360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:59.618360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic minimization: from conjugate gradient to an adaptive Heavy-ball method with Polyak step-sizes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Aymeric Dieuleveut, Baptiste Goujaud","submitted_at":"2022-10-12T16:18:27Z","abstract_excerpt":"In this work, we propose an adaptive variation on the classical Heavy-ball method for convex quadratic minimization. The adaptivity crucially relies on so-called \"Polyak step-sizes\", which consists in using the knowledge of the optimal value of the optimization problem at hand instead of problem parameters such as a few eigenvalues of the Hessian of the problem. This method happens to also be equivalent to a variation of the classical conjugate gradient method, and thereby inherits many of its attractive features, including its finite-time convergence, instance optimality, and its worst-case c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06367","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.06367/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":"2210.06367","created_at":"2026-07-05T05:05:59.618424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06367v1","created_at":"2026-07-05T05:05:59.618424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06367","created_at":"2026-07-05T05:05:59.618424+00:00"},{"alias_kind":"pith_short_12","alias_value":"MD7YBYKDDS7Q","created_at":"2026-07-05T05:05:59.618424+00:00"},{"alias_kind":"pith_short_16","alias_value":"MD7YBYKDDS7QAIA5","created_at":"2026-07-05T05:05:59.618424+00:00"},{"alias_kind":"pith_short_8","alias_value":"MD7YBYKD","created_at":"2026-07-05T05:05:59.618424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04866","citing_title":"On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC","json":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC.json","graph_json":"https://pith.science/api/pith-number/MD7YBYKDDS7QAIA5JH44EJ4WRC/graph.json","events_json":"https://pith.science/api/pith-number/MD7YBYKDDS7QAIA5JH44EJ4WRC/events.json","paper":"https://pith.science/paper/MD7YBYKD"},"agent_actions":{"view_html":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC","download_json":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC.json","view_paper":"https://pith.science/paper/MD7YBYKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06367&json=true","fetch_graph":"https://pith.science/api/pith-number/MD7YBYKDDS7QAIA5JH44EJ4WRC/graph.json","fetch_events":"https://pith.science/api/pith-number/MD7YBYKDDS7QAIA5JH44EJ4WRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC/action/storage_attestation","attest_author":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC/action/author_attestation","sign_citation":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC/action/citation_signature","submit_replication":"https://pith.science/pith/MD7YBYKDDS7QAIA5JH44EJ4WRC/action/replication_record"}},"created_at":"2026-07-05T05:05:59.618424+00:00","updated_at":"2026-07-05T05:05:59.618424+00:00"}