{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5BBWBZXREUZM6Z5WUUWZYT2NDK","short_pith_number":"pith:5BBWBZXR","schema_version":"1.0","canonical_sha256":"e84360e6f12532cf67b6a52d9c4f4d1a8ce387ad7506882bd5098ee52aa3ff8c","source":{"kind":"arxiv","id":"1604.04054","version":1},"attestation_state":"computed","paper":{"title":"Optimal Rates For Regularization Of Statistical Inverse Learning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Gilles Blanchard, Nicole M\\\"ucke","submitted_at":"2016-04-14T07:23:56Z","abstract_excerpt":"We consider a statistical inverse learning problem, where we observe the image of a function $f$ through a linear operator $A$ at i.i.d. random design points $X_i$, superposed with an additive noise. The distribution of the design points is unknown and can be very general. We analyze simultaneously the direct (estimation of $Af$) and the inverse (estimation of $f$) learning problems. In this general framework, we obtain strong and weak minimax optimal rates of convergence (as the number of observations $n$ grows large) for a large class of spectral regularization methods over regularity classe"},"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":"1604.04054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-14T07:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"eac61d9b518925a0bdc1c694cab98a583408ca8ed28b1ce9a71cea4838197fe3","abstract_canon_sha256":"7aafc32d9cb6e9c54dd7827ee6801c2d3b0ad614d08a5e8c1980885f4934bc5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.830299Z","signature_b64":"tLFpN/dHzqseSTuvalXA+Zo8dfwyBgfjyRvgCsdwlpvxvpBYx33umey3EhCRnVFOYU2NDgVwtuGC678KUY/jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e84360e6f12532cf67b6a52d9c4f4d1a8ce387ad7506882bd5098ee52aa3ff8c","last_reissued_at":"2026-05-18T01:17:06.829563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.829563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Rates For Regularization Of Statistical Inverse Learning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Gilles Blanchard, Nicole M\\\"ucke","submitted_at":"2016-04-14T07:23:56Z","abstract_excerpt":"We consider a statistical inverse learning problem, where we observe the image of a function $f$ through a linear operator $A$ at i.i.d. random design points $X_i$, superposed with an additive noise. The distribution of the design points is unknown and can be very general. We analyze simultaneously the direct (estimation of $Af$) and the inverse (estimation of $f$) learning problems. In this general framework, we obtain strong and weak minimax optimal rates of convergence (as the number of observations $n$ grows large) for a large class of spectral regularization methods over regularity classe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04054","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":"1604.04054","created_at":"2026-05-18T01:17:06.829676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04054v1","created_at":"2026-05-18T01:17:06.829676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04054","created_at":"2026-05-18T01:17:06.829676+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BBWBZXREUZM","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BBWBZXREUZM6Z5W","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BBWBZXR","created_at":"2026-05-18T12:29:58.707656+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/5BBWBZXREUZM6Z5WUUWZYT2NDK","json":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK.json","graph_json":"https://pith.science/api/pith-number/5BBWBZXREUZM6Z5WUUWZYT2NDK/graph.json","events_json":"https://pith.science/api/pith-number/5BBWBZXREUZM6Z5WUUWZYT2NDK/events.json","paper":"https://pith.science/paper/5BBWBZXR"},"agent_actions":{"view_html":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK","download_json":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK.json","view_paper":"https://pith.science/paper/5BBWBZXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04054&json=true","fetch_graph":"https://pith.science/api/pith-number/5BBWBZXREUZM6Z5WUUWZYT2NDK/graph.json","fetch_events":"https://pith.science/api/pith-number/5BBWBZXREUZM6Z5WUUWZYT2NDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK/action/storage_attestation","attest_author":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK/action/author_attestation","sign_citation":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK/action/citation_signature","submit_replication":"https://pith.science/pith/5BBWBZXREUZM6Z5WUUWZYT2NDK/action/replication_record"}},"created_at":"2026-05-18T01:17:06.829676+00:00","updated_at":"2026-05-18T01:17:06.829676+00:00"}