{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WWH5LXJ7DLZJCWYKUWDWA4KDTZ","short_pith_number":"pith:WWH5LXJ7","schema_version":"1.0","canonical_sha256":"b58fd5dd3f1af2915b0aa5876071439e47290d44d675e2d19db20b90a420c91c","source":{"kind":"arxiv","id":"2202.00992","version":3},"attestation_state":"computed","paper":{"title":"Tight Convergence Rate Bounds for Optimization Under Power Law Spectral Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"math.OC","authors_text":"Dmitry Yarotsky, Maksim Velikanov","submitted_at":"2022-02-02T12:24:03Z","abstract_excerpt":"Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated by power law distributions, resulting in power law convergence rates for iterative solutions of these problems by gradient-based algorithms. In this paper, we propose a new spectral condition providing tighter upper bounds for problems with power law optimization trajectories. We use this condition to build a complete picture of upper and lower bounds for a"},"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":"2202.00992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T12:24:03Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"fec0b3ad41b3a088f1d0a6c8b94e0da5b9db1ce6b1c593e62fdd14bdd4492db6","abstract_canon_sha256":"1388af3adbee2f3d54ffb0b521d1da2509684b7908c1e94bca5931d8c963da82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:46.234801Z","signature_b64":"NlU36r8r400lEs+l2js09K+vdB/RSJs2P8rmtRtUQe29OBOD7Q7/i+vWMySy2e5jW3gRlTgpz1XzpyIQOkoHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58fd5dd3f1af2915b0aa5876071439e47290d44d675e2d19db20b90a420c91c","last_reissued_at":"2026-07-05T07:59:46.234349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:46.234349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Convergence Rate Bounds for Optimization Under Power Law Spectral Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"math.OC","authors_text":"Dmitry Yarotsky, Maksim Velikanov","submitted_at":"2022-02-02T12:24:03Z","abstract_excerpt":"Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated by power law distributions, resulting in power law convergence rates for iterative solutions of these problems by gradient-based algorithms. In this paper, we propose a new spectral condition providing tighter upper bounds for problems with power law optimization trajectories. We use this condition to build a complete picture of upper and lower bounds for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00992","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/2202.00992/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":"2202.00992","created_at":"2026-07-05T07:59:46.234408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00992v3","created_at":"2026-07-05T07:59:46.234408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00992","created_at":"2026-07-05T07:59:46.234408+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWH5LXJ7DLZJ","created_at":"2026-07-05T07:59:46.234408+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWH5LXJ7DLZJCWYK","created_at":"2026-07-05T07:59:46.234408+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWH5LXJ7","created_at":"2026-07-05T07:59:46.234408+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/WWH5LXJ7DLZJCWYKUWDWA4KDTZ","json":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ.json","graph_json":"https://pith.science/api/pith-number/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/graph.json","events_json":"https://pith.science/api/pith-number/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/events.json","paper":"https://pith.science/paper/WWH5LXJ7"},"agent_actions":{"view_html":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ","download_json":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ.json","view_paper":"https://pith.science/paper/WWH5LXJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00992&json=true","fetch_graph":"https://pith.science/api/pith-number/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/action/storage_attestation","attest_author":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/action/author_attestation","sign_citation":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/action/citation_signature","submit_replication":"https://pith.science/pith/WWH5LXJ7DLZJCWYKUWDWA4KDTZ/action/replication_record"}},"created_at":"2026-07-05T07:59:46.234408+00:00","updated_at":"2026-07-05T07:59:46.234408+00:00"}