{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y6EMGOWKBJXEBU4IWVDLBFVG6E","short_pith_number":"pith:Y6EMGOWK","schema_version":"1.0","canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","source":{"kind":"arxiv","id":"1206.5580","version":2},"attestation_state":"computed","paper":{"title":"A Geometric Algorithm for Scalable Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Saha, John Moeller, Parasaran Raman, Suresh Venkatasubramanian","submitted_at":"2012-06-25T05:57:29Z","abstract_excerpt":"We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geometric formulation allows us to reduce the MKL problem to a simple optimization routine that yields provable convergence as well as quality guarantees. As a result our method scales efficiently to much larger data sets than most prior methods can handle. Empirical evaluation on 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":"1206.5580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-25T05:57:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8826b0e1b7c7945544a02d39bfb0a5e28faf74143207f1cbe4f9779df173beae","abstract_canon_sha256":"6bbd3219d759092f9e828bbf4593474e28bbc49cae289e89922533ab7bbaaeaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:19.404876Z","signature_b64":"yQTo47dTeXL6ygW3i38QQ9yPyZxRsmO/2GW6zl61gopHrTkyFq38smvUZ2Rejs/TRYkWB2G0TamIryQKTwYoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c788c33aca0a6e40d388b546b096a6f10c81d617001549429a90f76fd6a4e558","last_reissued_at":"2026-05-18T02:56:19.404291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:19.404291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Geometric Algorithm for Scalable Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Saha, John Moeller, Parasaran Raman, Suresh Venkatasubramanian","submitted_at":"2012-06-25T05:57:29Z","abstract_excerpt":"We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geometric formulation allows us to reduce the MKL problem to a simple optimization routine that yields provable convergence as well as quality guarantees. As a result our method scales efficiently to much larger data sets than most prior methods can handle. Empirical evaluation on el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5580","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":"1206.5580","created_at":"2026-05-18T02:56:19.404390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5580v2","created_at":"2026-05-18T02:56:19.404390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5580","created_at":"2026-05-18T02:56:19.404390+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6EMGOWKBJXE","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6EMGOWKBJXEBU4I","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6EMGOWK","created_at":"2026-05-18T12:27:27.928770+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/Y6EMGOWKBJXEBU4IWVDLBFVG6E","json":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E.json","graph_json":"https://pith.science/api/pith-number/Y6EMGOWKBJXEBU4IWVDLBFVG6E/graph.json","events_json":"https://pith.science/api/pith-number/Y6EMGOWKBJXEBU4IWVDLBFVG6E/events.json","paper":"https://pith.science/paper/Y6EMGOWK"},"agent_actions":{"view_html":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E","download_json":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E.json","view_paper":"https://pith.science/paper/Y6EMGOWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5580&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6EMGOWKBJXEBU4IWVDLBFVG6E/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6EMGOWKBJXEBU4IWVDLBFVG6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/action/storage_attestation","attest_author":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/action/author_attestation","sign_citation":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/action/citation_signature","submit_replication":"https://pith.science/pith/Y6EMGOWKBJXEBU4IWVDLBFVG6E/action/replication_record"}},"created_at":"2026-05-18T02:56:19.404390+00:00","updated_at":"2026-05-18T02:56:19.404390+00:00"}