{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JY4K2YOOJ3PPI472ZY6LRBY47D","short_pith_number":"pith:JY4K2YOO","schema_version":"1.0","canonical_sha256":"4e38ad61ce4edef473face3cb8871cf8e03e335e1e984885b5315326b8f4398c","source":{"kind":"arxiv","id":"2011.00050","version":3},"attestation_state":"computed","paper":{"title":"Dataset Meta-Learning from Kernel Ridge-Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jaehoon Lee, Timothy Nguyen, Zhourong Chen","submitted_at":"2020-10-30T18:54:04Z","abstract_excerpt":"One of the most fundamental aspects of any machine learning algorithm is the training data used by the algorithm. We introduce the novel concept of $\\epsilon$-approximation of datasets, obtaining datasets which are much smaller than or are significant corruptions of the original training data while maintaining similar model performance. We introduce a meta-learning algorithm called Kernel Inducing Points (KIP) for obtaining such remarkable datasets, inspired by the recent developments in the correspondence between infinitely-wide neural networks and kernel ridge-regression (KRR). For KRR tasks"},"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":"2011.00050","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-10-30T18:54:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"475e4473282371f9b07f66d96727aba121244b2419d342a465aa292cecc89db9","abstract_canon_sha256":"4f922dc52f2d4af28739ba20ceb0cecbc28198aaa8cb7e18e7978859acb23cdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:27.717623Z","signature_b64":"XBXFVHD37c1hkHOgfZhQ9pdWa+8hw/1YIKswOOx+40I5D63Sl/KD6QXRoLmrIrGV1R1hLzcBwlFxhvF52e3cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e38ad61ce4edef473face3cb8871cf8e03e335e1e984885b5315326b8f4398c","last_reissued_at":"2026-07-05T02:25:27.717157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:27.717157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dataset Meta-Learning from Kernel Ridge-Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jaehoon Lee, Timothy Nguyen, Zhourong Chen","submitted_at":"2020-10-30T18:54:04Z","abstract_excerpt":"One of the most fundamental aspects of any machine learning algorithm is the training data used by the algorithm. We introduce the novel concept of $\\epsilon$-approximation of datasets, obtaining datasets which are much smaller than or are significant corruptions of the original training data while maintaining similar model performance. We introduce a meta-learning algorithm called Kernel Inducing Points (KIP) for obtaining such remarkable datasets, inspired by the recent developments in the correspondence between infinitely-wide neural networks and kernel ridge-regression (KRR). For KRR tasks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00050","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.00050/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.00050","created_at":"2026-07-05T02:25:27.717211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.00050v3","created_at":"2026-07-05T02:25:27.717211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00050","created_at":"2026-07-05T02:25:27.717211+00:00"},{"alias_kind":"pith_short_12","alias_value":"JY4K2YOOJ3PP","created_at":"2026-07-05T02:25:27.717211+00:00"},{"alias_kind":"pith_short_16","alias_value":"JY4K2YOOJ3PPI472","created_at":"2026-07-05T02:25:27.717211+00:00"},{"alias_kind":"pith_short_8","alias_value":"JY4K2YOO","created_at":"2026-07-05T02:25:27.717211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20196","citing_title":"Distill Once, Adapt Life-Long: Exploring Dataset Distillation for Continual Test-Time Adaptation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20196","citing_title":"Distill Once, Adapt Life-Long: Exploring Dataset Distillation for Continual Test-Time Adaptation","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25022","citing_title":"D3S2: Diffusion-Guided Dataset Distillation for Semantic Segmentation","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29464","citing_title":"Rank-Aware Hyperbolic Alignment for Vision-Language Dataset Distillation","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31016","citing_title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23482","citing_title":"Multimodal Distribution Matching for Vision-Language Dataset Distillation","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00185","citing_title":"Fair Dataset Distillation via Cross-Group Barycenter Alignment","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10666","citing_title":"Omnimodal Dataset Distillation via High-order Proxy Alignment","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D","json":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D.json","graph_json":"https://pith.science/api/pith-number/JY4K2YOOJ3PPI472ZY6LRBY47D/graph.json","events_json":"https://pith.science/api/pith-number/JY4K2YOOJ3PPI472ZY6LRBY47D/events.json","paper":"https://pith.science/paper/JY4K2YOO"},"agent_actions":{"view_html":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D","download_json":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D.json","view_paper":"https://pith.science/paper/JY4K2YOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.00050&json=true","fetch_graph":"https://pith.science/api/pith-number/JY4K2YOOJ3PPI472ZY6LRBY47D/graph.json","fetch_events":"https://pith.science/api/pith-number/JY4K2YOOJ3PPI472ZY6LRBY47D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D/action/storage_attestation","attest_author":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D/action/author_attestation","sign_citation":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D/action/citation_signature","submit_replication":"https://pith.science/pith/JY4K2YOOJ3PPI472ZY6LRBY47D/action/replication_record"}},"created_at":"2026-07-05T02:25:27.717211+00:00","updated_at":"2026-07-05T02:25:27.717211+00:00"}