{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WMRC3V76C43P3UQ6CQBUYT2GME","short_pith_number":"pith:WMRC3V76","schema_version":"1.0","canonical_sha256":"b3222dd7fe1736fdd21e14034c4f466113dbd9a29651f681cfd8d2ecc08e4e25","source":{"kind":"arxiv","id":"1605.00609","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasios Kyrillidis, Andreas Krause, Bernd G\\\"artner, Hemant Tyagi","submitted_at":"2016-05-02T18:32:19Z","abstract_excerpt":"A function $f: \\mathbb{R}^d \\rightarrow \\mathbb{R}$ is a Sparse Additive Model (SPAM), if it is of the form $f(\\mathbf{x}) = \\sum_{l \\in \\mathcal{S}}\\phi_{l}(x_l)$ where $\\mathcal{S} \\subset [d]$, $|\\mathcal{S}| \\ll d$. Assuming $\\phi$'s, $\\mathcal{S}$ to be unknown, there exists extensive work for estimating $f$ from its samples. In this work, we consider a generalized version of SPAMs, that also allows for the presence of a sparse number of second order interaction terms. For some $\\mathcal{S}_1 \\subset [d], \\mathcal{S}_2 \\subset {[d] \\choose 2}$, with $|\\mathcal{S}_1| \\ll d, |\\mathcal{S}_2|"},"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":"1605.00609","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-02T18:32:19Z","cross_cats_sorted":["cs.IT","math.IT","math.NA","stat.ML"],"title_canon_sha256":"27a28360013321ee721de5df52c93f1d388e020c6a056d1c82ffe8c8bfc4c252","abstract_canon_sha256":"7018f0a60c2daa42093ebda22a41fdaafbb833a47402d424e9c0c4af4accfff2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.065177Z","signature_b64":"7axEXF1BvTkJxIOtHqEHCZM9wOfdRfFNsGsPmnBduJx0yQaXGX0LNWRA7BoaTrjQLH8YtL/U27HBww2K0PGpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3222dd7fe1736fdd21e14034c4f466113dbd9a29651f681cfd8d2ecc08e4e25","last_reissued_at":"2026-05-18T00:44:58.064743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.064743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasios Kyrillidis, Andreas Krause, Bernd G\\\"artner, Hemant Tyagi","submitted_at":"2016-05-02T18:32:19Z","abstract_excerpt":"A function $f: \\mathbb{R}^d \\rightarrow \\mathbb{R}$ is a Sparse Additive Model (SPAM), if it is of the form $f(\\mathbf{x}) = \\sum_{l \\in \\mathcal{S}}\\phi_{l}(x_l)$ where $\\mathcal{S} \\subset [d]$, $|\\mathcal{S}| \\ll d$. Assuming $\\phi$'s, $\\mathcal{S}$ to be unknown, there exists extensive work for estimating $f$ from its samples. In this work, we consider a generalized version of SPAMs, that also allows for the presence of a sparse number of second order interaction terms. For some $\\mathcal{S}_1 \\subset [d], \\mathcal{S}_2 \\subset {[d] \\choose 2}$, with $|\\mathcal{S}_1| \\ll d, |\\mathcal{S}_2|"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00609","kind":"arxiv","version":3},"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":"1605.00609","created_at":"2026-05-18T00:44:58.064813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00609v3","created_at":"2026-05-18T00:44:58.064813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00609","created_at":"2026-05-18T00:44:58.064813+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMRC3V76C43P","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMRC3V76C43P3UQ6","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMRC3V76","created_at":"2026-05-18T12:30:48.956258+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/WMRC3V76C43P3UQ6CQBUYT2GME","json":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME.json","graph_json":"https://pith.science/api/pith-number/WMRC3V76C43P3UQ6CQBUYT2GME/graph.json","events_json":"https://pith.science/api/pith-number/WMRC3V76C43P3UQ6CQBUYT2GME/events.json","paper":"https://pith.science/paper/WMRC3V76"},"agent_actions":{"view_html":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME","download_json":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME.json","view_paper":"https://pith.science/paper/WMRC3V76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00609&json=true","fetch_graph":"https://pith.science/api/pith-number/WMRC3V76C43P3UQ6CQBUYT2GME/graph.json","fetch_events":"https://pith.science/api/pith-number/WMRC3V76C43P3UQ6CQBUYT2GME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME/action/storage_attestation","attest_author":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME/action/author_attestation","sign_citation":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME/action/citation_signature","submit_replication":"https://pith.science/pith/WMRC3V76C43P3UQ6CQBUYT2GME/action/replication_record"}},"created_at":"2026-05-18T00:44:58.064813+00:00","updated_at":"2026-05-18T00:44:58.064813+00:00"}