{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5VRSMBX5ZHK5C2L2S3DVNDKDHX","short_pith_number":"pith:5VRSMBX5","schema_version":"1.0","canonical_sha256":"ed632606fdc9d5d1697a96c7568d433de12a3ad6756e9e9f92ff5b09067f8849","source":{"kind":"arxiv","id":"1906.09255","version":1},"attestation_state":"computed","paper":{"title":"Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Adityanand Guntuboyina, Ashwin Pananjady, Avishek Ghosh, Kannan Ramchandran","submitted_at":"2019-06-21T17:47:18Z","abstract_excerpt":"Max-affine regression refers to a model where the unknown regression function is modeled as a maximum of $k$ unknown affine functions for a fixed $k \\geq 1$. This generalizes linear regression and (real) phase retrieval, and is closely related to convex regression. Working within a non-asymptotic framework, we study this problem in the high-dimensional setting assuming that $k$ is a fixed constant, and focus on estimation of the unknown coefficients of the affine functions underlying the model. We analyze a natural alternating minimization (AM) algorithm for the non-convex least squares object"},"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":"1906.09255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-21T17:47:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"3c36013966bd9d5f3e752d681a835b3ef0e37d0ed41e439654b811b300a2f2b9","abstract_canon_sha256":"ea4b8ea27ce39adef55f0509c5b2ea00eeb6365124a810a70053ece05c395893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.009783Z","signature_b64":"cL3Izu43Iz+dzBCJW8jHUmFT3JH+9loIhEtQSI4yF0PqugLuqDdEtmq5OmZBkCmikjAxN4N6BfpUwbZ0jF5LAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed632606fdc9d5d1697a96c7568d433de12a3ad6756e9e9f92ff5b09067f8849","last_reissued_at":"2026-05-17T23:42:44.009040Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.009040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Adityanand Guntuboyina, Ashwin Pananjady, Avishek Ghosh, Kannan Ramchandran","submitted_at":"2019-06-21T17:47:18Z","abstract_excerpt":"Max-affine regression refers to a model where the unknown regression function is modeled as a maximum of $k$ unknown affine functions for a fixed $k \\geq 1$. This generalizes linear regression and (real) phase retrieval, and is closely related to convex regression. Working within a non-asymptotic framework, we study this problem in the high-dimensional setting assuming that $k$ is a fixed constant, and focus on estimation of the unknown coefficients of the affine functions underlying the model. We analyze a natural alternating minimization (AM) algorithm for the non-convex least squares object"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09255","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":"1906.09255","created_at":"2026-05-17T23:42:44.009158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09255v1","created_at":"2026-05-17T23:42:44.009158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09255","created_at":"2026-05-17T23:42:44.009158+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VRSMBX5ZHK5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VRSMBX5ZHK5C2L2","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VRSMBX5","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06959","citing_title":"Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions","ref_index":181,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05842","citing_title":"Expectation Maximization (EM) Converges for General Agnostic Mixtures","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX","json":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX.json","graph_json":"https://pith.science/api/pith-number/5VRSMBX5ZHK5C2L2S3DVNDKDHX/graph.json","events_json":"https://pith.science/api/pith-number/5VRSMBX5ZHK5C2L2S3DVNDKDHX/events.json","paper":"https://pith.science/paper/5VRSMBX5"},"agent_actions":{"view_html":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX","download_json":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX.json","view_paper":"https://pith.science/paper/5VRSMBX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09255&json=true","fetch_graph":"https://pith.science/api/pith-number/5VRSMBX5ZHK5C2L2S3DVNDKDHX/graph.json","fetch_events":"https://pith.science/api/pith-number/5VRSMBX5ZHK5C2L2S3DVNDKDHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX/action/storage_attestation","attest_author":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX/action/author_attestation","sign_citation":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX/action/citation_signature","submit_replication":"https://pith.science/pith/5VRSMBX5ZHK5C2L2S3DVNDKDHX/action/replication_record"}},"created_at":"2026-05-17T23:42:44.009158+00:00","updated_at":"2026-05-17T23:42:44.009158+00:00"}