{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MHKHTJ6AZB2DRKDJYA6V6HLCE2","short_pith_number":"pith:MHKHTJ6A","schema_version":"1.0","canonical_sha256":"61d479a7c0c87438a869c03d5f1d6226b4ddea2e166dea84bcf77583f37f3bca","source":{"kind":"arxiv","id":"1711.05174","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Yining Wang, Yuanzhi Li, Zeyuan Allen-Zhu","submitted_at":"2017-11-14T16:21:57Z","abstract_excerpt":"The experimental design problem concerns the selection of k points from a potentially large design pool of p-dimensional vectors, so as to maximize the statistical efficiency regressed on the selected k design points. Statistical efficiency is measured by optimality criteria, including A(verage), D(eterminant), T(race), E(igen), V(ariance) and G-optimality. Except for the T-optimality, exact optimization is NP-hard.\n  We propose a polynomial-time regret minimization framework to achieve a $(1+\\varepsilon)$ approximation with only $O(p/\\varepsilon^2)$ design points, for all the optimality crite"},"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":"1711.05174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-14T16:21:57Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"4baa01e0a293bc3ee7b4212f1f55117159086a6e85e99045b0a62690d76593ae","abstract_canon_sha256":"6cead72dc0301f971ef428b12205f4e0bc5a61713e2a83488817f22f2499ffb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.553905Z","signature_b64":"SDY8OleSvX8cZlTcFPI/dweOsvkGbx1aEj6QA5yMYTskAfgxeZ2u0q/X9opmg6GHIkYbxPLteRjjGDC0yYYZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d479a7c0c87438a869c03d5f1d6226b4ddea2e166dea84bcf77583f37f3bca","last_reissued_at":"2026-05-18T00:30:34.553208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.553208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Yining Wang, Yuanzhi Li, Zeyuan Allen-Zhu","submitted_at":"2017-11-14T16:21:57Z","abstract_excerpt":"The experimental design problem concerns the selection of k points from a potentially large design pool of p-dimensional vectors, so as to maximize the statistical efficiency regressed on the selected k design points. Statistical efficiency is measured by optimality criteria, including A(verage), D(eterminant), T(race), E(igen), V(ariance) and G-optimality. Except for the T-optimality, exact optimization is NP-hard.\n  We propose a polynomial-time regret minimization framework to achieve a $(1+\\varepsilon)$ approximation with only $O(p/\\varepsilon^2)$ design points, for all the optimality crite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05174","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":"1711.05174","created_at":"2026-05-18T00:30:34.553310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05174v1","created_at":"2026-05-18T00:30:34.553310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05174","created_at":"2026-05-18T00:30:34.553310+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHKHTJ6AZB2D","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHKHTJ6AZB2DRKDJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHKHTJ6A","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08399","citing_title":"Sequential Experimental Design for Transductive Linear Bandits","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2","json":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2.json","graph_json":"https://pith.science/api/pith-number/MHKHTJ6AZB2DRKDJYA6V6HLCE2/graph.json","events_json":"https://pith.science/api/pith-number/MHKHTJ6AZB2DRKDJYA6V6HLCE2/events.json","paper":"https://pith.science/paper/MHKHTJ6A"},"agent_actions":{"view_html":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2","download_json":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2.json","view_paper":"https://pith.science/paper/MHKHTJ6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05174&json=true","fetch_graph":"https://pith.science/api/pith-number/MHKHTJ6AZB2DRKDJYA6V6HLCE2/graph.json","fetch_events":"https://pith.science/api/pith-number/MHKHTJ6AZB2DRKDJYA6V6HLCE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2/action/storage_attestation","attest_author":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2/action/author_attestation","sign_citation":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2/action/citation_signature","submit_replication":"https://pith.science/pith/MHKHTJ6AZB2DRKDJYA6V6HLCE2/action/replication_record"}},"created_at":"2026-05-18T00:30:34.553310+00:00","updated_at":"2026-05-18T00:30:34.553310+00:00"}