{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ELPXTPGM4SXISTN6JVTHLE3UWX","short_pith_number":"pith:ELPXTPGM","schema_version":"1.0","canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","source":{"kind":"arxiv","id":"1506.01367","version":1},"attestation_state":"computed","paper":{"title":"A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Jerry Li, Ludwig Schmidt","submitted_at":"2015-06-03T19:55:10Z","abstract_excerpt":"Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\\mathcal{M}$ that is close to the density $f$ of the unknown distribution from which we draw samples. The distance between $\\mathcal{M}$ and $f$ is typically measured in the total variation or $L_1$-norm.\n  We give an algorithm for learning a mixture of $k$ univariate Gaussians that is nearly optimal for any fixed $k$. The sample complexity of our algorithm is $\\tilde{O}(\\fra"},"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":"1506.01367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-03T19:55:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"eddcecc4ff2768bf53cee19b2f973fc4fd81c2d320c1ca34b12d31c3c51351e2","abstract_canon_sha256":"5e8c49be9a5851b4431abb4bccaf25e9ac657e107e2e84c48b411aa53f2c02aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:24.487859Z","signature_b64":"oJaLsvf8Ln3oZnkKejRglIVt5jU3Br0Q+ybUSnTDv3DFlekQ0lSzq2ZiyHRJYYgB9VMTU+SJlJvjbnYSZ2BlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22df79bccce4ae894dbe4d66759374b5ffc9fb46264dbc4303ba870b295f2a88","last_reissued_at":"2026-05-18T01:58:24.487428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:24.487428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Jerry Li, Ludwig Schmidt","submitted_at":"2015-06-03T19:55:10Z","abstract_excerpt":"Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\\mathcal{M}$ that is close to the density $f$ of the unknown distribution from which we draw samples. The distance between $\\mathcal{M}$ and $f$ is typically measured in the total variation or $L_1$-norm.\n  We give an algorithm for learning a mixture of $k$ univariate Gaussians that is nearly optimal for any fixed $k$. The sample complexity of our algorithm is $\\tilde{O}(\\fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01367","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":"1506.01367","created_at":"2026-05-18T01:58:24.487503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01367v1","created_at":"2026-05-18T01:58:24.487503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01367","created_at":"2026-05-18T01:58:24.487503+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELPXTPGM4SXI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELPXTPGM4SXISTN6","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELPXTPGM","created_at":"2026-05-18T12:29:19.899920+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/ELPXTPGM4SXISTN6JVTHLE3UWX","json":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX.json","graph_json":"https://pith.science/api/pith-number/ELPXTPGM4SXISTN6JVTHLE3UWX/graph.json","events_json":"https://pith.science/api/pith-number/ELPXTPGM4SXISTN6JVTHLE3UWX/events.json","paper":"https://pith.science/paper/ELPXTPGM"},"agent_actions":{"view_html":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX","download_json":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX.json","view_paper":"https://pith.science/paper/ELPXTPGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01367&json=true","fetch_graph":"https://pith.science/api/pith-number/ELPXTPGM4SXISTN6JVTHLE3UWX/graph.json","fetch_events":"https://pith.science/api/pith-number/ELPXTPGM4SXISTN6JVTHLE3UWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/action/storage_attestation","attest_author":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/action/author_attestation","sign_citation":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/action/citation_signature","submit_replication":"https://pith.science/pith/ELPXTPGM4SXISTN6JVTHLE3UWX/action/replication_record"}},"created_at":"2026-05-18T01:58:24.487503+00:00","updated_at":"2026-05-18T01:58:24.487503+00:00"}