{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3DWWQTYY4MYLJYWSJAME7QXELK","short_pith_number":"pith:3DWWQTYY","schema_version":"1.0","canonical_sha256":"d8ed684f18e330b4e2d248184fc2e45ab17f111f25f9dd6ee7116f508327711c","source":{"kind":"arxiv","id":"1205.0288","version":2},"attestation_state":"computed","paper":{"title":"A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Arash Afkanpour, Csaba Szepesv\\'ari, Michael Bowling","submitted_at":"2012-05-01T23:42:57Z","abstract_excerpt":"We consider the problem of simultaneously learning to linearly combine a very large number of kernels and learn a good predictor based on the learnt kernel. When the number of kernels $d$ to be combined is very large, multiple kernel learning methods whose computational cost scales linearly in $d$ are intractable. We propose a randomized version of the mirror descent algorithm to overcome this issue, under the objective of minimizing the group $p$-norm penalized empirical risk. The key to achieve the required exponential speed-up is the computationally efficient construction of low-variance es"},"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":"1205.0288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T23:42:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb745ab1b5c87b112c2015729a5968c1a4bc26ecc0e6043a14a34115eabb212d","abstract_canon_sha256":"9ec2afddc780f171a490d83e2e6cbddce36ac455f6cc06e1203e6991c6887366"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.791734Z","signature_b64":"MD9EZUiiVV8/t+hSTKLyJXRN18iKjN+jiXAGrDJDhwPkBhhevz8EExq8W3IhW4HT4XzfG9RlRDBGiJ3MGQhOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8ed684f18e330b4e2d248184fc2e45ab17f111f25f9dd6ee7116f508327711c","last_reissued_at":"2026-05-18T02:21:15.791092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.791092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Arash Afkanpour, Csaba Szepesv\\'ari, Michael Bowling","submitted_at":"2012-05-01T23:42:57Z","abstract_excerpt":"We consider the problem of simultaneously learning to linearly combine a very large number of kernels and learn a good predictor based on the learnt kernel. When the number of kernels $d$ to be combined is very large, multiple kernel learning methods whose computational cost scales linearly in $d$ are intractable. We propose a randomized version of the mirror descent algorithm to overcome this issue, under the objective of minimizing the group $p$-norm penalized empirical risk. The key to achieve the required exponential speed-up is the computationally efficient construction of low-variance es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0288","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":"1205.0288","created_at":"2026-05-18T02:21:15.791186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0288v2","created_at":"2026-05-18T02:21:15.791186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0288","created_at":"2026-05-18T02:21:15.791186+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DWWQTYY4MYL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DWWQTYY4MYLJYWS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DWWQTYY","created_at":"2026-05-18T12:26:50.516681+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/3DWWQTYY4MYLJYWSJAME7QXELK","json":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK.json","graph_json":"https://pith.science/api/pith-number/3DWWQTYY4MYLJYWSJAME7QXELK/graph.json","events_json":"https://pith.science/api/pith-number/3DWWQTYY4MYLJYWSJAME7QXELK/events.json","paper":"https://pith.science/paper/3DWWQTYY"},"agent_actions":{"view_html":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK","download_json":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK.json","view_paper":"https://pith.science/paper/3DWWQTYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0288&json=true","fetch_graph":"https://pith.science/api/pith-number/3DWWQTYY4MYLJYWSJAME7QXELK/graph.json","fetch_events":"https://pith.science/api/pith-number/3DWWQTYY4MYLJYWSJAME7QXELK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK/action/storage_attestation","attest_author":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK/action/author_attestation","sign_citation":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK/action/citation_signature","submit_replication":"https://pith.science/pith/3DWWQTYY4MYLJYWSJAME7QXELK/action/replication_record"}},"created_at":"2026-05-18T02:21:15.791186+00:00","updated_at":"2026-05-18T02:21:15.791186+00:00"}