{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2RK6LB3P2KCR6ZMOPBWFINFV67","short_pith_number":"pith:2RK6LB3P","schema_version":"1.0","canonical_sha256":"d455e5876fd2851f658e786c5434b5f7e1b8ad2a4c0ebd901efb5c1ce3f5c228","source":{"kind":"arxiv","id":"1302.0315","version":1},"attestation_state":"computed","paper":{"title":"Sparse Multiple Kernel Learning with Geometric Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","submitted_at":"2013-02-01T23:28:43Z","abstract_excerpt":"In this paper, we study the problem of sparse multiple kernel learning (MKL), where the goal is to efficiently learn a combination of a fixed small number of kernels from a large pool that could lead to a kernel classifier with a small prediction error. We develop an efficient algorithm based on the greedy coordinate descent algorithm, that is able to achieve a geometric convergence rate under appropriate conditions. The convergence rate is achieved by measuring the size of functional gradients by an empirical $\\ell_2$ norm that depends on the empirical data distribution. This is in contrast 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":"1302.0315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-01T23:28:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1c84ad6bcb3082f471fb841c8517c89cffbe24a85fc4877e5d84c5e809165b4a","abstract_canon_sha256":"2289f2a356693c0ea10ac4e1ddae07c61724ed9f4233faafb64095efb8feda28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.476364Z","signature_b64":"vTyroVOxvEcwdt4SqaeGOFee6jzWfXiMrA/zJaGCueIXM9rEsCOQ7v/izMcWBQ1FyBwcV/z7f4S8ndijQhtvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d455e5876fd2851f658e786c5434b5f7e1b8ad2a4c0ebd901efb5c1ce3f5c228","last_reissued_at":"2026-05-18T03:34:37.475762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.475762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Multiple Kernel Learning with Geometric Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","submitted_at":"2013-02-01T23:28:43Z","abstract_excerpt":"In this paper, we study the problem of sparse multiple kernel learning (MKL), where the goal is to efficiently learn a combination of a fixed small number of kernels from a large pool that could lead to a kernel classifier with a small prediction error. We develop an efficient algorithm based on the greedy coordinate descent algorithm, that is able to achieve a geometric convergence rate under appropriate conditions. The convergence rate is achieved by measuring the size of functional gradients by an empirical $\\ell_2$ norm that depends on the empirical data distribution. This is in contrast t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0315","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":"1302.0315","created_at":"2026-05-18T03:34:37.475844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0315v1","created_at":"2026-05-18T03:34:37.475844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0315","created_at":"2026-05-18T03:34:37.475844+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RK6LB3P2KCR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RK6LB3P2KCR6ZMO","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RK6LB3P","created_at":"2026-05-18T12:27:32.513160+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/2RK6LB3P2KCR6ZMOPBWFINFV67","json":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67.json","graph_json":"https://pith.science/api/pith-number/2RK6LB3P2KCR6ZMOPBWFINFV67/graph.json","events_json":"https://pith.science/api/pith-number/2RK6LB3P2KCR6ZMOPBWFINFV67/events.json","paper":"https://pith.science/paper/2RK6LB3P"},"agent_actions":{"view_html":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67","download_json":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67.json","view_paper":"https://pith.science/paper/2RK6LB3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0315&json=true","fetch_graph":"https://pith.science/api/pith-number/2RK6LB3P2KCR6ZMOPBWFINFV67/graph.json","fetch_events":"https://pith.science/api/pith-number/2RK6LB3P2KCR6ZMOPBWFINFV67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67/action/storage_attestation","attest_author":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67/action/author_attestation","sign_citation":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67/action/citation_signature","submit_replication":"https://pith.science/pith/2RK6LB3P2KCR6ZMOPBWFINFV67/action/replication_record"}},"created_at":"2026-05-18T03:34:37.475844+00:00","updated_at":"2026-05-18T03:34:37.475844+00:00"}