{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4BRQOA5AZA3QG7TUAIU2XLUIAC","short_pith_number":"pith:4BRQOA5A","schema_version":"1.0","canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","source":{"kind":"arxiv","id":"1502.02651","version":1},"attestation_state":"computed","paper":{"title":"Optimal and Adaptive Algorithms for Online Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Haipeng Luo, Satyen Kale","submitted_at":"2015-02-09T20:58:38Z","abstract_excerpt":"We study online boosting, the task of converting any weak online learner into a strong online learner. Based on a novel and natural definition of weak online learnability, we develop two online boosting algorithms. The first algorithm is an online version of boost-by-majority. By proving a matching lower bound, we show that this algorithm is essentially optimal in terms of the number of weak learners and the sample complexity needed to achieve a specified accuracy. This optimal algorithm is not adaptive however. Using tools from online loss minimization, we derive an adaptive online boosting 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":"1502.02651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"97296edf921061ae4774294313d54dbc2119a86ddf7a0974ee76540b49f98461","abstract_canon_sha256":"64a8b5996755fbf2ad67a5a9a97f5820d1b49ea2be4597527b2cf80956fed73a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:41.538258Z","signature_b64":"D86xBpoZZG73AWySL/m6nwFb/aDwrEl9hn7ZnossA9ttKJGCakHFQTOwIco1qR1wx2/Y5nK9bzo7netxNY/RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","last_reissued_at":"2026-05-18T02:27:41.537411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:41.537411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal and Adaptive Algorithms for Online Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Haipeng Luo, Satyen Kale","submitted_at":"2015-02-09T20:58:38Z","abstract_excerpt":"We study online boosting, the task of converting any weak online learner into a strong online learner. Based on a novel and natural definition of weak online learnability, we develop two online boosting algorithms. The first algorithm is an online version of boost-by-majority. By proving a matching lower bound, we show that this algorithm is essentially optimal in terms of the number of weak learners and the sample complexity needed to achieve a specified accuracy. This optimal algorithm is not adaptive however. Using tools from online loss minimization, we derive an adaptive online boosting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02651","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":"1502.02651","created_at":"2026-05-18T02:27:41.537560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02651v1","created_at":"2026-05-18T02:27:41.537560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02651","created_at":"2026-05-18T02:27:41.537560+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BRQOA5AZA3Q","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BRQOA5AZA3QG7TU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BRQOA5A","created_at":"2026-05-18T12:29:05.191682+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/4BRQOA5AZA3QG7TUAIU2XLUIAC","json":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC.json","graph_json":"https://pith.science/api/pith-number/4BRQOA5AZA3QG7TUAIU2XLUIAC/graph.json","events_json":"https://pith.science/api/pith-number/4BRQOA5AZA3QG7TUAIU2XLUIAC/events.json","paper":"https://pith.science/paper/4BRQOA5A"},"agent_actions":{"view_html":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC","download_json":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC.json","view_paper":"https://pith.science/paper/4BRQOA5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02651&json=true","fetch_graph":"https://pith.science/api/pith-number/4BRQOA5AZA3QG7TUAIU2XLUIAC/graph.json","fetch_events":"https://pith.science/api/pith-number/4BRQOA5AZA3QG7TUAIU2XLUIAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/action/storage_attestation","attest_author":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/action/author_attestation","sign_citation":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/action/citation_signature","submit_replication":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/action/replication_record"}},"created_at":"2026-05-18T02:27:41.537560+00:00","updated_at":"2026-05-18T02:27:41.537560+00:00"}