{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XSR2BCIL2LGWSJPHN56UX54TWJ","short_pith_number":"pith:XSR2BCIL","schema_version":"1.0","canonical_sha256":"bca3a0890bd2cd6925e76f7d4bf793b27248d4793307becfd9b3ffc0cc449d15","source":{"kind":"arxiv","id":"1206.6422","version":1},"attestation_state":"computed","paper":{"title":"An Online Boosting Algorithm with Theoretical Justifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi-Jen Lu (Academia Sinica), Hsuan-Tien Lin (National Taiwan University), Shang-Tse Chen (Academia Sinica)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and propose a novel and reasonable assumption for the online weak learner. Based on the assumption, we design an online boosting algorithm with a strong theoretical guarantee by adapting from the offline SmoothBoost algorithm that matches the assumption closely. We further tackle the t"},"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":"1206.6422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6727937ba6c5a4827c2335707fd4d3480b1fbfcb6fef2c06e05ed7359e96a07d","abstract_canon_sha256":"a0e0af4d54682e875a252204f98e29e35bc6338d40a3e0ecb5500bca22ef9ec1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.256707Z","signature_b64":"MAux16vBkCu6P3jY0aJJUe5UHsDosJnLv0MQPMO1RivCUK6+lDChSTg6rlT7mC3URsQPF85Wj1Xg/CEdREytAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bca3a0890bd2cd6925e76f7d4bf793b27248d4793307becfd9b3ffc0cc449d15","last_reissued_at":"2026-05-18T03:52:14.255986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.255986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Online Boosting Algorithm with Theoretical Justifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi-Jen Lu (Academia Sinica), Hsuan-Tien Lin (National Taiwan University), Shang-Tse Chen (Academia Sinica)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and propose a novel and reasonable assumption for the online weak learner. Based on the assumption, we design an online boosting algorithm with a strong theoretical guarantee by adapting from the offline SmoothBoost algorithm that matches the assumption closely. We further tackle the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6422","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":"1206.6422","created_at":"2026-05-18T03:52:14.256101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6422v1","created_at":"2026-05-18T03:52:14.256101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6422","created_at":"2026-05-18T03:52:14.256101+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSR2BCIL2LGW","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSR2BCIL2LGWSJPH","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSR2BCIL","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.18464","citing_title":"DriftMoE: A Mixture of Experts Approach to Handle Concept Drifts","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ","json":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ.json","graph_json":"https://pith.science/api/pith-number/XSR2BCIL2LGWSJPHN56UX54TWJ/graph.json","events_json":"https://pith.science/api/pith-number/XSR2BCIL2LGWSJPHN56UX54TWJ/events.json","paper":"https://pith.science/paper/XSR2BCIL"},"agent_actions":{"view_html":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ","download_json":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ.json","view_paper":"https://pith.science/paper/XSR2BCIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6422&json=true","fetch_graph":"https://pith.science/api/pith-number/XSR2BCIL2LGWSJPHN56UX54TWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XSR2BCIL2LGWSJPHN56UX54TWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ/action/storage_attestation","attest_author":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ/action/author_attestation","sign_citation":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ/action/citation_signature","submit_replication":"https://pith.science/pith/XSR2BCIL2LGWSJPHN56UX54TWJ/action/replication_record"}},"created_at":"2026-05-18T03:52:14.256101+00:00","updated_at":"2026-05-18T03:52:14.256101+00:00"}