{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3DWWQTYY4MYLJYWSJAME7QXELK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9ec2afddc780f171a490d83e2e6cbddce36ac455f6cc06e1203e6991c6887366","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T23:42:57Z","title_canon_sha256":"eb745ab1b5c87b112c2015729a5968c1a4bc26ecc0e6043a14a34115eabb212d"},"schema_version":"1.0","source":{"id":"1205.0288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0288","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0288v2","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0288","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"3DWWQTYY4MYL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3DWWQTYY4MYLJYWS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3DWWQTYY","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:139b2d10baf8283ca57ee64fb6cd62d11a04e5e3d4d161dded5f0133a32110b2","target":"graph","created_at":"2026-05-18T02:21:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andr\\'as Gy\\\"orgy, Arash Afkanpour, Csaba Szepesv\\'ari, Michael Bowling","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T23:42:57Z","title":"A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0288","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae56051aed12dcabe18240f00d72f649d78de942a9d05f2637650172d845d86b","target":"record","created_at":"2026-05-18T02:21:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9ec2afddc780f171a490d83e2e6cbddce36ac455f6cc06e1203e6991c6887366","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-01T23:42:57Z","title_canon_sha256":"eb745ab1b5c87b112c2015729a5968c1a4bc26ecc0e6043a14a34115eabb212d"},"schema_version":"1.0","source":{"id":"1205.0288","kind":"arxiv","version":2}},"canonical_sha256":"d8ed684f18e330b4e2d248184fc2e45ab17f111f25f9dd6ee7116f508327711c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8ed684f18e330b4e2d248184fc2e45ab17f111f25f9dd6ee7116f508327711c","first_computed_at":"2026-05-18T02:21:15.791092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.791092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MD9EZUiiVV8/t+hSTKLyJXRN18iKjN+jiXAGrDJDhwPkBhhevz8EExq8W3IhW4HT4XzfG9RlRDBGiJ3MGQhOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:15.791734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae56051aed12dcabe18240f00d72f649d78de942a9d05f2637650172d845d86b","sha256:139b2d10baf8283ca57ee64fb6cd62d11a04e5e3d4d161dded5f0133a32110b2"],"state_sha256":"09afb2c1ef27d75d49ec6111c752a383a960571bf8b8ad57fda86eaa7dfbe1a6"}