{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HUSEMLAH262SLUFADD6QYZW6IF","short_pith_number":"pith:HUSEMLAH","schema_version":"1.0","canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","source":{"kind":"arxiv","id":"1610.07108","version":1},"attestation_state":"computed","paper":{"title":"Fast and Reliable Parameter Estimation from Nonlinear Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2016-10-23T00:36:12Z","abstract_excerpt":"In this paper we study the problem of recovering a structured but unknown parameter ${\\bf{\\theta}}^*$ from $n$ nonlinear observations of the form $y_i=f(\\langle {\\bf{x}}_i,{\\bf{\\theta}}^*\\rangle)$ for $i=1,2,\\ldots,n$. We develop a framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when the nonlinear function $f$ is unknown. This framework includes many popular heuristics such as projected/proximal gradient descent and stochastic schemes. For example, we show that a projected gradient descent scheme converges at a linear rate to a reliable solutio"},"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":"1610.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"e9f4612fe2586306286f041ae03aaef4aeb6f7f82de6f929bcf4f07214973427","abstract_canon_sha256":"45b04524a73b82f1393a183cbb9c9e5009484c653b9ca4e6f7201eb655856f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.213876Z","signature_b64":"/pFKvVOtvEsWuR35QGuXJRPVaJvL4OHafoKeuMeq0UGA0Y7PQnnkPHrbqxV1UJQ8HLyNIjWmD/H3E8spRWYYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","last_reissued_at":"2026-05-18T01:01:35.213379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.213379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Reliable Parameter Estimation from Nonlinear Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2016-10-23T00:36:12Z","abstract_excerpt":"In this paper we study the problem of recovering a structured but unknown parameter ${\\bf{\\theta}}^*$ from $n$ nonlinear observations of the form $y_i=f(\\langle {\\bf{x}}_i,{\\bf{\\theta}}^*\\rangle)$ for $i=1,2,\\ldots,n$. We develop a framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when the nonlinear function $f$ is unknown. This framework includes many popular heuristics such as projected/proximal gradient descent and stochastic schemes. For example, we show that a projected gradient descent scheme converges at a linear rate to a reliable solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07108","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":"1610.07108","created_at":"2026-05-18T01:01:35.213449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07108v1","created_at":"2026-05-18T01:01:35.213449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07108","created_at":"2026-05-18T01:01:35.213449+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUSEMLAH262S","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUSEMLAH262SLUFA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUSEMLAH","created_at":"2026-05-18T12:30:22.444734+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/HUSEMLAH262SLUFADD6QYZW6IF","json":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF.json","graph_json":"https://pith.science/api/pith-number/HUSEMLAH262SLUFADD6QYZW6IF/graph.json","events_json":"https://pith.science/api/pith-number/HUSEMLAH262SLUFADD6QYZW6IF/events.json","paper":"https://pith.science/paper/HUSEMLAH"},"agent_actions":{"view_html":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF","download_json":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF.json","view_paper":"https://pith.science/paper/HUSEMLAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07108&json=true","fetch_graph":"https://pith.science/api/pith-number/HUSEMLAH262SLUFADD6QYZW6IF/graph.json","fetch_events":"https://pith.science/api/pith-number/HUSEMLAH262SLUFADD6QYZW6IF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/action/storage_attestation","attest_author":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/action/author_attestation","sign_citation":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/action/citation_signature","submit_replication":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/action/replication_record"}},"created_at":"2026-05-18T01:01:35.213449+00:00","updated_at":"2026-05-18T01:01:35.213449+00:00"}