{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4E6D6W4YZFCCNYASNVNEQA2W4Q","short_pith_number":"pith:4E6D6W4Y","schema_version":"1.0","canonical_sha256":"e13c3f5b98c94426e0126d5a480356e400502dcc7b7d555923651df6170f88fb","source":{"kind":"arxiv","id":"1902.01637","version":1},"attestation_state":"computed","paper":{"title":"A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach, Kfir Y. Levy","submitted_at":"2019-02-05T10:48:14Z","abstract_excerpt":"We consider variational inequalities coming from monotone operators, a setting that includes convex minimization and convex-concave saddle-point problems. We assume an access to potentially noisy unbiased values of the monotone operators and assess convergence through a compatible gap function which corresponds to the standard optimality criteria in the aforementioned subcases. We present a universal algorithm for these inequalities based on the Mirror-Prox algorithm. Concretely, our algorithm simultaneously achieves the optimal rates for the smooth/non-smooth, and noisy/noiseless settings. Th"},"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":"1902.01637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T10:48:14Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7a0117d1f3b08e8cfe6ea547fbecbf35fef7ce0782da8fd21a1962b97f570cc2","abstract_canon_sha256":"030c73169f2883c47e4d30ecfeb84bbe2abf6d2e0fb3805689bd327fe793db35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.097399Z","signature_b64":"4n1uzywM71S6/HDn9cHgSETmI5Yp5mZhdIKjRZQzq4Qt0012m1JdHBCUEngf8b9zsjTDcO4w0jSFpGmup2QQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13c3f5b98c94426e0126d5a480356e400502dcc7b7d555923651df6170f88fb","last_reissued_at":"2026-05-17T23:54:47.096917Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.096917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach, Kfir Y. Levy","submitted_at":"2019-02-05T10:48:14Z","abstract_excerpt":"We consider variational inequalities coming from monotone operators, a setting that includes convex minimization and convex-concave saddle-point problems. We assume an access to potentially noisy unbiased values of the monotone operators and assess convergence through a compatible gap function which corresponds to the standard optimality criteria in the aforementioned subcases. We present a universal algorithm for these inequalities based on the Mirror-Prox algorithm. Concretely, our algorithm simultaneously achieves the optimal rates for the smooth/non-smooth, and noisy/noiseless settings. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01637","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":"1902.01637","created_at":"2026-05-17T23:54:47.096989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01637v1","created_at":"2026-05-17T23:54:47.096989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01637","created_at":"2026-05-17T23:54:47.096989+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E6D6W4YZFCC","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E6D6W4YZFCCNYAS","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E6D6W4Y","created_at":"2026-05-18T12:33:10.108867+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/4E6D6W4YZFCCNYASNVNEQA2W4Q","json":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q.json","graph_json":"https://pith.science/api/pith-number/4E6D6W4YZFCCNYASNVNEQA2W4Q/graph.json","events_json":"https://pith.science/api/pith-number/4E6D6W4YZFCCNYASNVNEQA2W4Q/events.json","paper":"https://pith.science/paper/4E6D6W4Y"},"agent_actions":{"view_html":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q","download_json":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q.json","view_paper":"https://pith.science/paper/4E6D6W4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01637&json=true","fetch_graph":"https://pith.science/api/pith-number/4E6D6W4YZFCCNYASNVNEQA2W4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/4E6D6W4YZFCCNYASNVNEQA2W4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q/action/storage_attestation","attest_author":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q/action/author_attestation","sign_citation":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q/action/citation_signature","submit_replication":"https://pith.science/pith/4E6D6W4YZFCCNYASNVNEQA2W4Q/action/replication_record"}},"created_at":"2026-05-17T23:54:47.096989+00:00","updated_at":"2026-05-17T23:54:47.096989+00:00"}