{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2DXU5T4ZZMG7BEQHIBWGDNT73K","short_pith_number":"pith:2DXU5T4Z","schema_version":"1.0","canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","source":{"kind":"arxiv","id":"1205.1417","version":1},"attestation_state":"computed","paper":{"title":"Fast rates for noisy clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"S\\'ebastien Loustau (LAREMA)","submitted_at":"2012-05-07T14:57:06Z","abstract_excerpt":"The effect of errors in variables in empirical minimization is investigated. Given a loss $l$ and a set of decision rules $\\mathcal{G}$, we prove a general upper bound for an empirical minimization based on a deconvolution kernel and a noisy sample $Z_i=X_i+\\epsilon_i,i=1,...,n$. We apply this general upper bound to give the rate of convergence for the expected excess risk in noisy clustering. A recent bound from \\citet{levrard} proves that this rate is $\\mathcal{O}(1/n)$ in the direct case, under Pollard's regularity assumptions. Here the effect of noisy measurements gives a rate of the form "},"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.1417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6340e51b3ac58718fad245e8a4c9d980a250521382f23e7ef6760334b02728d2","abstract_canon_sha256":"f11a03dea0496ec0e6e0eb137a755c28b49b437c5be421fd7607364b2f1c2060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:10.073943Z","signature_b64":"ruafe/79cElatUapS8ZUe5j9m9136+EgV81EfCRvicM15P7rJSeV9vFmHPDD3LMzWO9cByhL10ZX84VMP2VPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","last_reissued_at":"2026-05-18T03:56:10.073265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:10.073265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast rates for noisy clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"S\\'ebastien Loustau (LAREMA)","submitted_at":"2012-05-07T14:57:06Z","abstract_excerpt":"The effect of errors in variables in empirical minimization is investigated. Given a loss $l$ and a set of decision rules $\\mathcal{G}$, we prove a general upper bound for an empirical minimization based on a deconvolution kernel and a noisy sample $Z_i=X_i+\\epsilon_i,i=1,...,n$. We apply this general upper bound to give the rate of convergence for the expected excess risk in noisy clustering. A recent bound from \\citet{levrard} proves that this rate is $\\mathcal{O}(1/n)$ in the direct case, under Pollard's regularity assumptions. Here the effect of noisy measurements gives a rate of the form "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1417","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.1417","created_at":"2026-05-18T03:56:10.073398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1417v1","created_at":"2026-05-18T03:56:10.073398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1417","created_at":"2026-05-18T03:56:10.073398+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DXU5T4ZZMG7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DXU5T4ZZMG7BEQH","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DXU5T4Z","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/2DXU5T4ZZMG7BEQHIBWGDNT73K","json":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K.json","graph_json":"https://pith.science/api/pith-number/2DXU5T4ZZMG7BEQHIBWGDNT73K/graph.json","events_json":"https://pith.science/api/pith-number/2DXU5T4ZZMG7BEQHIBWGDNT73K/events.json","paper":"https://pith.science/paper/2DXU5T4Z"},"agent_actions":{"view_html":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K","download_json":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K.json","view_paper":"https://pith.science/paper/2DXU5T4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1417&json=true","fetch_graph":"https://pith.science/api/pith-number/2DXU5T4ZZMG7BEQHIBWGDNT73K/graph.json","fetch_events":"https://pith.science/api/pith-number/2DXU5T4ZZMG7BEQHIBWGDNT73K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/action/storage_attestation","attest_author":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/action/author_attestation","sign_citation":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/action/citation_signature","submit_replication":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/action/replication_record"}},"created_at":"2026-05-18T03:56:10.073398+00:00","updated_at":"2026-05-18T03:56:10.073398+00:00"}