{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SXTT5HNP3N4P652MBRVCIN2UAJ","short_pith_number":"pith:SXTT5HNP","schema_version":"1.0","canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","source":{"kind":"arxiv","id":"1803.10366","version":2},"attestation_state":"computed","paper":{"title":"Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Gautam Goel, Niangjun Chen","submitted_at":"2018-03-28T00:39:33Z","abstract_excerpt":"We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditions this bound can be beaten. We introduce a novel algorithmic framework for this problem, Online Balanced Descent (OBD), which works by iteratively projecting the previous point onto a carefully chosen level set of the current cost function so as to balance the switching cos"},"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":"1803.10366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e7cc6a42a091f89cb9ee16987022a4d495e9890e2bce25a46964d6a032b0d72e","abstract_canon_sha256":"9a77ef3cd5f0239c967b0fec61b13e08786b0915ee419c4df16731583dbc14cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:17.613179Z","signature_b64":"akvqUYcaw9qsM4B0A0PJ+lpc0M2mEQlohOab01U5/ESSu1PLrdPEfua4uX0QiL67Hiy7P6Aczbq8W7ZFFyElDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","last_reissued_at":"2026-05-18T00:11:17.612556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:17.612556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Gautam Goel, Niangjun Chen","submitted_at":"2018-03-28T00:39:33Z","abstract_excerpt":"We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditions this bound can be beaten. We introduce a novel algorithmic framework for this problem, Online Balanced Descent (OBD), which works by iteratively projecting the previous point onto a carefully chosen level set of the current cost function so as to balance the switching cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10366","kind":"arxiv","version":2},"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":"1803.10366","created_at":"2026-05-18T00:11:17.612650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10366v2","created_at":"2026-05-18T00:11:17.612650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10366","created_at":"2026-05-18T00:11:17.612650+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXTT5HNP3N4P","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXTT5HNP3N4P652M","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXTT5HNP","created_at":"2026-05-18T12:32:53.628368+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/SXTT5HNP3N4P652MBRVCIN2UAJ","json":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ.json","graph_json":"https://pith.science/api/pith-number/SXTT5HNP3N4P652MBRVCIN2UAJ/graph.json","events_json":"https://pith.science/api/pith-number/SXTT5HNP3N4P652MBRVCIN2UAJ/events.json","paper":"https://pith.science/paper/SXTT5HNP"},"agent_actions":{"view_html":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ","download_json":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ.json","view_paper":"https://pith.science/paper/SXTT5HNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10366&json=true","fetch_graph":"https://pith.science/api/pith-number/SXTT5HNP3N4P652MBRVCIN2UAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SXTT5HNP3N4P652MBRVCIN2UAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/action/storage_attestation","attest_author":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/action/author_attestation","sign_citation":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/action/citation_signature","submit_replication":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/action/replication_record"}},"created_at":"2026-05-18T00:11:17.612650+00:00","updated_at":"2026-05-18T00:11:17.612650+00:00"}