{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YXJ2T5XALGPG5FCGXPPOQVRTSP","short_pith_number":"pith:YXJ2T5XA","schema_version":"1.0","canonical_sha256":"c5d3a9f6e0599e6e9446bbdee8563393dd0c4eb4a178478f996f9466f13905db","source":{"kind":"arxiv","id":"1205.2653","version":1},"attestation_state":"computed","paper":{"title":"L2 Regularization for Learning Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Corinna Cortes, Mehryar Mohri","submitted_at":"2012-05-09T15:01:22Z","abstract_excerpt":"The choice of the kernel is critical to the success of many learning algorithms but it is typically left to the user. Instead, the training data can be used to learn the kernel by selecting it out of a given family, such as that of non-negative linear combinations of p base kernels, constrained by a trace or L1 regularization. This paper studies the problem of learning kernels with the same family of kernels but with an L2 regularization instead, and for regression problems. We analyze the problem of learning kernels with ridge regression. We derive the form of the solution of the optimization"},"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.2653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T15:01:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19a9130da17c8d4226d4e8c35a5dfb8f8e88e9b3b9fb401e03a5bb7d2a9ab8a1","abstract_canon_sha256":"15ee882d43eca77913e3cf451e9cf0c9aca42fecea7f5ca6f40400d2eccaede9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.622649Z","signature_b64":"bjHf5VtiqGhVbNfxR/J84/2t1qg9f5e1olaiC49r7pBKMy0L/a5bVF8hNS5W8y2OtIx90BkB4YkPvVgeO4k1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5d3a9f6e0599e6e9446bbdee8563393dd0c4eb4a178478f996f9466f13905db","last_reissued_at":"2026-05-18T03:55:47.622176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.622176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L2 Regularization for Learning Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Corinna Cortes, Mehryar Mohri","submitted_at":"2012-05-09T15:01:22Z","abstract_excerpt":"The choice of the kernel is critical to the success of many learning algorithms but it is typically left to the user. Instead, the training data can be used to learn the kernel by selecting it out of a given family, such as that of non-negative linear combinations of p base kernels, constrained by a trace or L1 regularization. This paper studies the problem of learning kernels with the same family of kernels but with an L2 regularization instead, and for regression problems. We analyze the problem of learning kernels with ridge regression. We derive the form of the solution of the optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2653","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":"1205.2653","created_at":"2026-05-18T03:55:47.622242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2653v1","created_at":"2026-05-18T03:55:47.622242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2653","created_at":"2026-05-18T03:55:47.622242+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXJ2T5XALGPG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXJ2T5XALGPG5FCG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXJ2T5XA","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.08514","citing_title":"Predicting Visual Memory Schemas with Variational Autoencoders","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2412.00404","citing_title":"Hard-Label Black-Box Attacks on 3D Point Clouds","ref_index":105,"is_internal_anchor":true},{"citing_arxiv_id":"2604.13938","citing_title":"ASTRA: Enhancing Multi-Subject Generation with Retrieval-Augmented Pose Guidance and Disentangled Position Embedding","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP","json":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP.json","graph_json":"https://pith.science/api/pith-number/YXJ2T5XALGPG5FCGXPPOQVRTSP/graph.json","events_json":"https://pith.science/api/pith-number/YXJ2T5XALGPG5FCGXPPOQVRTSP/events.json","paper":"https://pith.science/paper/YXJ2T5XA"},"agent_actions":{"view_html":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP","download_json":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP.json","view_paper":"https://pith.science/paper/YXJ2T5XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2653&json=true","fetch_graph":"https://pith.science/api/pith-number/YXJ2T5XALGPG5FCGXPPOQVRTSP/graph.json","fetch_events":"https://pith.science/api/pith-number/YXJ2T5XALGPG5FCGXPPOQVRTSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP/action/storage_attestation","attest_author":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP/action/author_attestation","sign_citation":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP/action/citation_signature","submit_replication":"https://pith.science/pith/YXJ2T5XALGPG5FCGXPPOQVRTSP/action/replication_record"}},"created_at":"2026-05-18T03:55:47.622242+00:00","updated_at":"2026-05-18T03:55:47.622242+00:00"}