{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DEW3Q5WYJNOASCYHIPOBWNIP6F","short_pith_number":"pith:DEW3Q5WY","schema_version":"1.0","canonical_sha256":"192db876d84b5c090b0743dc1b350ff17e0e6ad08c14bce591b1a09043d4d605","source":{"kind":"arxiv","id":"1704.01896","version":4},"attestation_state":"computed","paper":{"title":"On the Statistical Efficiency of Compositional Nonparametric Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jean Honorio, Xiao Wang, Yixi Xu","submitted_at":"2017-04-06T15:43:08Z","abstract_excerpt":"In this paper, we propose a compositional nonparametric method in which a model is expressed as a labeled binary tree of $2k+1$ nodes, where each node is either a summation, a multiplication, or the application of one of the $q$ basis functions to one of the $p$ covariates. We show that in order to recover a labeled binary tree from a given dataset, the sufficient number of samples is $O(k\\log(pq)+\\log(k!))$, and the necessary number of samples is $\\Omega(k\\log (pq)-\\log(k!))$. We further propose a greedy algorithm for regression in order to validate our theoretical findings through synthetic "},"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":"1704.01896","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T15:43:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4dafdf822aa20cb7906e4201d57a802177cde2b4b186d3a963c896ab48ee297f","abstract_canon_sha256":"a847aa35cb006049d538587e1cbdc6b86e4dddab6fa2bdf38f02d1c3c3535aad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.133654Z","signature_b64":"2E8FQg/K124ovqUiKt5OXwgXg7XUrlctMpOsSIZJXJO6EntZ3c6sgQUz/5V5otbEtbV6Ll1zqSHx1yyPLv4fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192db876d84b5c090b0743dc1b350ff17e0e6ad08c14bce591b1a09043d4d605","last_reissued_at":"2026-05-17T23:45:10.132903Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.132903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Statistical Efficiency of Compositional Nonparametric Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jean Honorio, Xiao Wang, Yixi Xu","submitted_at":"2017-04-06T15:43:08Z","abstract_excerpt":"In this paper, we propose a compositional nonparametric method in which a model is expressed as a labeled binary tree of $2k+1$ nodes, where each node is either a summation, a multiplication, or the application of one of the $q$ basis functions to one of the $p$ covariates. We show that in order to recover a labeled binary tree from a given dataset, the sufficient number of samples is $O(k\\log(pq)+\\log(k!))$, and the necessary number of samples is $\\Omega(k\\log (pq)-\\log(k!))$. We further propose a greedy algorithm for regression in order to validate our theoretical findings through synthetic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01896","kind":"arxiv","version":4},"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":"1704.01896","created_at":"2026-05-17T23:45:10.133032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01896v4","created_at":"2026-05-17T23:45:10.133032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01896","created_at":"2026-05-17T23:45:10.133032+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEW3Q5WYJNOA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEW3Q5WYJNOASCYH","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEW3Q5WY","created_at":"2026-05-18T12:31:10.602751+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/DEW3Q5WYJNOASCYHIPOBWNIP6F","json":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F.json","graph_json":"https://pith.science/api/pith-number/DEW3Q5WYJNOASCYHIPOBWNIP6F/graph.json","events_json":"https://pith.science/api/pith-number/DEW3Q5WYJNOASCYHIPOBWNIP6F/events.json","paper":"https://pith.science/paper/DEW3Q5WY"},"agent_actions":{"view_html":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F","download_json":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F.json","view_paper":"https://pith.science/paper/DEW3Q5WY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01896&json=true","fetch_graph":"https://pith.science/api/pith-number/DEW3Q5WYJNOASCYHIPOBWNIP6F/graph.json","fetch_events":"https://pith.science/api/pith-number/DEW3Q5WYJNOASCYHIPOBWNIP6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F/action/storage_attestation","attest_author":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F/action/author_attestation","sign_citation":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F/action/citation_signature","submit_replication":"https://pith.science/pith/DEW3Q5WYJNOASCYHIPOBWNIP6F/action/replication_record"}},"created_at":"2026-05-17T23:45:10.133032+00:00","updated_at":"2026-05-17T23:45:10.133032+00:00"}