{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EPYXP7C3UIRSIZDOKBEWJXSGAW","short_pith_number":"pith:EPYXP7C3","schema_version":"1.0","canonical_sha256":"23f177fc5ba22324646e504964de4605b1caf5253d2f9fcd7bd5d400b6828d4d","source":{"kind":"arxiv","id":"1106.6024","version":1},"attestation_state":"computed","paper":{"title":"The Rate of Convergence of AdaBoost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"math.OC","authors_text":"Cynthia Rudin, Indraneel Mukherjee, Robert E. Schapire","submitted_at":"2011-06-29T18:53:46Z","abstract_excerpt":"The AdaBoost algorithm was designed to combine many \"weak\" hypotheses that perform slightly better than random guessing into a \"strong\" hypothesis that has very low error. We study the rate at which AdaBoost iteratively converges to the minimum of the \"exponential loss.\" Unlike previous work, our proofs do not require a weak-learning assumption, nor do they require that minimizers of the exponential loss are finite. Our first result shows that at iteration $t$, the exponential loss of AdaBoost's computed parameter vector will be at most $\\epsilon$ more than that of any parameter vector of $\\el"},"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":"1106.6024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-29T18:53:46Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"5bfdba21c56128c8a3d46a15597358683ba739a312da176a37baa8b0142f11af","abstract_canon_sha256":"aee60979e9577629795c0620d5bb90ec9c885f30a8dbccd195438053367bc98e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:04.677939Z","signature_b64":"7aMVMgLZgilfv3tSr8aAZzejdZWE6WG1sJxZ6bXxybpR8rqtNMY3TXooeGs1rSnEJz2nIhawZrMg6VhVpI0XCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f177fc5ba22324646e504964de4605b1caf5253d2f9fcd7bd5d400b6828d4d","last_reissued_at":"2026-05-18T04:19:04.677537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:04.677537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rate of Convergence of AdaBoost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"math.OC","authors_text":"Cynthia Rudin, Indraneel Mukherjee, Robert E. Schapire","submitted_at":"2011-06-29T18:53:46Z","abstract_excerpt":"The AdaBoost algorithm was designed to combine many \"weak\" hypotheses that perform slightly better than random guessing into a \"strong\" hypothesis that has very low error. We study the rate at which AdaBoost iteratively converges to the minimum of the \"exponential loss.\" Unlike previous work, our proofs do not require a weak-learning assumption, nor do they require that minimizers of the exponential loss are finite. Our first result shows that at iteration $t$, the exponential loss of AdaBoost's computed parameter vector will be at most $\\epsilon$ more than that of any parameter vector of $\\el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6024","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":"1106.6024","created_at":"2026-05-18T04:19:04.677585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.6024v1","created_at":"2026-05-18T04:19:04.677585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6024","created_at":"2026-05-18T04:19:04.677585+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPYXP7C3UIRS","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPYXP7C3UIRSIZDO","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPYXP7C3","created_at":"2026-05-18T12:26:28.662955+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/EPYXP7C3UIRSIZDOKBEWJXSGAW","json":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW.json","graph_json":"https://pith.science/api/pith-number/EPYXP7C3UIRSIZDOKBEWJXSGAW/graph.json","events_json":"https://pith.science/api/pith-number/EPYXP7C3UIRSIZDOKBEWJXSGAW/events.json","paper":"https://pith.science/paper/EPYXP7C3"},"agent_actions":{"view_html":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW","download_json":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW.json","view_paper":"https://pith.science/paper/EPYXP7C3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.6024&json=true","fetch_graph":"https://pith.science/api/pith-number/EPYXP7C3UIRSIZDOKBEWJXSGAW/graph.json","fetch_events":"https://pith.science/api/pith-number/EPYXP7C3UIRSIZDOKBEWJXSGAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW/action/storage_attestation","attest_author":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW/action/author_attestation","sign_citation":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW/action/citation_signature","submit_replication":"https://pith.science/pith/EPYXP7C3UIRSIZDOKBEWJXSGAW/action/replication_record"}},"created_at":"2026-05-18T04:19:04.677585+00:00","updated_at":"2026-05-18T04:19:04.677585+00:00"}