{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7ONCZVUGOO4C5M7EBDPAABQPZT","short_pith_number":"pith:7ONCZVUG","schema_version":"1.0","canonical_sha256":"fb9a2cd68673b82eb3e408de00060fccdb7efef874d1edae48768633aa74419d","source":{"kind":"arxiv","id":"1706.04125","version":2},"attestation_state":"computed","paper":{"title":"Online Learning for Structured Loss Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aadirupa Saha, Aditya Gopalan, Siddharth Barman","submitted_at":"2017-06-13T15:31:22Z","abstract_excerpt":"We consider prediction with expert advice when the loss vectors are assumed to lie in a set described by the sum of atomic norm balls. We derive a regret bound for a general version of the online mirror descent (OMD) algorithm that uses a combination of regularizers, each adapted to the constituent atomic norms. The general result recovers standard OMD regret bounds, and yields regret bounds for new structured settings where the loss vectors are (i) noisy versions of points from a low-rank subspace, (ii) sparse vectors corrupted with noise, and (iii) sparse perturbations of low-rank vectors. F"},"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":"1706.04125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T15:31:22Z","cross_cats_sorted":[],"title_canon_sha256":"9cf5c1cddb0cef1757dcc5e4018d5d8f4bb7f20bfb7b031d4fda0999c0c788a3","abstract_canon_sha256":"b4e5e76abdde77ef745fb1294f7372808d1e3dbdd1f1429556e4c7458432f815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:44.411501Z","signature_b64":"vMN+RQVNWm3fwOXthyMEFof8Z4MGXEv5dA2K16M0RtfVQxQeY48RwWFwO5JlCCNg5ygJDZ8mxhQVqE+6iGC8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb9a2cd68673b82eb3e408de00060fccdb7efef874d1edae48768633aa74419d","last_reissued_at":"2026-05-18T00:30:44.410867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:44.410867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning for Structured Loss Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aadirupa Saha, Aditya Gopalan, Siddharth Barman","submitted_at":"2017-06-13T15:31:22Z","abstract_excerpt":"We consider prediction with expert advice when the loss vectors are assumed to lie in a set described by the sum of atomic norm balls. We derive a regret bound for a general version of the online mirror descent (OMD) algorithm that uses a combination of regularizers, each adapted to the constituent atomic norms. The general result recovers standard OMD regret bounds, and yields regret bounds for new structured settings where the loss vectors are (i) noisy versions of points from a low-rank subspace, (ii) sparse vectors corrupted with noise, and (iii) sparse perturbations of low-rank vectors. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04125","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":"1706.04125","created_at":"2026-05-18T00:30:44.410945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04125v2","created_at":"2026-05-18T00:30:44.410945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04125","created_at":"2026-05-18T00:30:44.410945+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ONCZVUGOO4C","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ONCZVUGOO4C5M7E","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ONCZVUG","created_at":"2026-05-18T12:31:05.417338+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/7ONCZVUGOO4C5M7EBDPAABQPZT","json":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT.json","graph_json":"https://pith.science/api/pith-number/7ONCZVUGOO4C5M7EBDPAABQPZT/graph.json","events_json":"https://pith.science/api/pith-number/7ONCZVUGOO4C5M7EBDPAABQPZT/events.json","paper":"https://pith.science/paper/7ONCZVUG"},"agent_actions":{"view_html":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT","download_json":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT.json","view_paper":"https://pith.science/paper/7ONCZVUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04125&json=true","fetch_graph":"https://pith.science/api/pith-number/7ONCZVUGOO4C5M7EBDPAABQPZT/graph.json","fetch_events":"https://pith.science/api/pith-number/7ONCZVUGOO4C5M7EBDPAABQPZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT/action/storage_attestation","attest_author":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT/action/author_attestation","sign_citation":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT/action/citation_signature","submit_replication":"https://pith.science/pith/7ONCZVUGOO4C5M7EBDPAABQPZT/action/replication_record"}},"created_at":"2026-05-18T00:30:44.410945+00:00","updated_at":"2026-05-18T00:30:44.410945+00:00"}