{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JDFY67CTDUOKALG35LD5LV42KB","short_pith_number":"pith:JDFY67CT","schema_version":"1.0","canonical_sha256":"48cb8f7c531d1ca02cdbeac7d5d79a505ef314e61378b8116b7a81fe2b42ce67","source":{"kind":"arxiv","id":"2311.01453","version":2},"attestation_state":"computed","paper":{"title":"PPI++: Efficient Prediction-Powered Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"PPI++ yields confidence sets for any parameter dimension that always improve on classical intervals by adapting to the quality of machine learning predictions on unlabeled data.","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anastasios N. Angelopoulos, John C. Duchi, Tijana Zrnic","submitted_at":"2023-11-02T17:59:04Z","abstract_excerpt":"We present PPI++: a computationally lightweight methodology for estimation and inference based on a small labeled dataset and a typically much larger dataset of machine-learning predictions. The methods automatically adapt to the quality of available predictions, yielding easy-to-compute confidence sets -- for parameters of any dimensionality -- that always improve on classical intervals using only the labeled data. PPI++ builds on prediction-powered inference (PPI), which targets the same problem setting, improving its computational and statistical efficiency. Real and synthetic experiments d"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2311.01453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-11-02T17:59:04Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"f29900d49f13b21486b9a275f77e1b8aabab0cb2a825e3f59f00f63c4e6b7eae","abstract_canon_sha256":"2d141991f54494373b92f4dc9ef54f76a6d39066e61168342d723350eecc9ae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:14.124725Z","signature_b64":"33DcopvQMpibaJSMekMlTfFGKB03/wtd70Zxs6HTOMEQFdu4z5IxZvCqJfU3B/HzSeNQDYPjDjBsL5LCsYDxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48cb8f7c531d1ca02cdbeac7d5d79a505ef314e61378b8116b7a81fe2b42ce67","last_reissued_at":"2026-05-17T23:38:14.123936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:14.123936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PPI++: Efficient Prediction-Powered Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"PPI++ yields confidence sets for any parameter dimension that always improve on classical intervals by adapting to the quality of machine learning predictions on unlabeled data.","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anastasios N. Angelopoulos, John C. Duchi, Tijana Zrnic","submitted_at":"2023-11-02T17:59:04Z","abstract_excerpt":"We present PPI++: a computationally lightweight methodology for estimation and inference based on a small labeled dataset and a typically much larger dataset of machine-learning predictions. The methods automatically adapt to the quality of available predictions, yielding easy-to-compute confidence sets -- for parameters of any dimensionality -- that always improve on classical intervals using only the labeled data. PPI++ builds on prediction-powered inference (PPI), which targets the same problem setting, improving its computational and statistical efficiency. Real and synthetic experiments d"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"PPI++ builds on prediction-powered inference (PPI), which targets the same problem setting, improving its computational and statistical efficiency. Real and synthetic experiments demonstrate the benefits of the proposed adaptations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The method can automatically adapt to the quality of available predictions in a way that guarantees improvement over classical intervals for parameters of any dimensionality.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PPI++ yields easy-to-compute confidence sets for any-dimensional parameters that always improve on classical intervals from labeled data alone by leveraging abundant ML predictions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"PPI++ yields confidence sets for any parameter dimension that always improve on classical intervals by adapting to the quality of machine learning predictions on unlabeled data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c3b25330d487e036300c066af64369a45906d757c6a0f76a8e74b62d05839c3d"},"source":{"id":"2311.01453","kind":"arxiv","version":2},"verdict":{"id":"76122b95-082e-4919-9901-d429037992a8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T12:17:59.886611Z","strongest_claim":"PPI++ builds on prediction-powered inference (PPI), which targets the same problem setting, improving its computational and statistical efficiency. Real and synthetic experiments demonstrate the benefits of the proposed adaptations.","one_line_summary":"PPI++ yields easy-to-compute confidence sets for any-dimensional parameters that always improve on classical intervals from labeled data alone by leveraging abundant ML predictions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The method can automatically adapt to the quality of available predictions in a way that guarantees improvement over classical intervals for parameters of any dimensionality.","pith_extraction_headline":"PPI++ yields confidence sets for any parameter dimension that always improve on classical intervals by adapting to the quality of machine learning predictions on unlabeled data."},"references":{"count":25,"sample":[{"doi":"","year":2023,"title":"Angelopoulos, Stephen Bates, Clara Fannjiang, Michael I","work_id":"c8193bfd-7617-4fa3-a20f-cfcdf275a345","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A. N. Angelopoulos, J. C. Duchi, and T. Zrnic. A note on statistical efficiency in Prediction-Powered Inference. 2023. URL https://web.stanford.edu/~jduchi/projects/ AngelopoulosDuZr23w.pdf","work_id":"a603ce3f-91ba-4e14-b445-a2128667281a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"P. Bickel, C. A. J. Klaassen, Y. Ritov, and J. Wellner. Efficient and Adaptive Estimation for Semiparametric Models. Springer Verlag, 1998","work_id":"3aceaaac-5ed0-404f-b394-bed549dd4a49","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. 18","work_id":"be7bb34f-546f-4bb8-98b1-f6143f39e45f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1986,"title":"L. D. Brown. Fundamentals of Statistical Exponential Families . Institute of Mathematical Statistics, Hayward, California, 1986","work_id":"2ae6e995-0e38-4867-8c86-4fb731ff4bf1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"6c68683fe23fec48b61c7f2f0899b777041349b6aed6da7a60b82909277c12d2","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f9b73baa44ef20ee2945954de28ad7ab907c287d02328a8ee61b2690dd4673f1"},"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":"2311.01453","created_at":"2026-05-17T23:38:14.124056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01453v2","created_at":"2026-05-17T23:38:14.124056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01453","created_at":"2026-05-17T23:38:14.124056+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDFY67CTDUOK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDFY67CTDUOKALG3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDFY67CT","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":17,"internal_anchor_count":17,"sample":[{"citing_arxiv_id":"2506.16658","citing_title":"Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11638","citing_title":"Learning U-Statistics with Active Inference","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27892","citing_title":"Prediction-powered Inference by Mixture of Experts","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08773","citing_title":"Prediction-Powered Linear Regression: A Balance Between Interpretation and Prediction","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09834","citing_title":"Supercharging Bayesian Inference with Reliable AI-Informed Priors","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10405","citing_title":"Valid Best-Model Identification for LLM Evaluation via Low-Rank Factorization","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09471","citing_title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","ref_index":188,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23770","citing_title":"Bootstrapping with AI/ML-generated labels","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06484","citing_title":"Estimate Level Adjustment For Inference With Proxies Under Random Distribution Shifts","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21260","citing_title":"Calibeating Prediction-Powered Inference","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21020","citing_title":"A Functional-Class Meta-Analytic Framework for Quantifying Surrogate Resilience","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19296","citing_title":"Debiased neural operators for estimating functionals","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12497","citing_title":"Adaptive Budget Allocation in LLM-Augmented Surveys","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06939","citing_title":"Bias and Uncertainty in LLM-as-a-Judge Estimation","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08069","citing_title":"Empirical Bayes Rebiasing","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18569","citing_title":"Revisiting Active Sequential Prediction-Powered Mean Estimation","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB","json":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB.json","graph_json":"https://pith.science/api/pith-number/JDFY67CTDUOKALG35LD5LV42KB/graph.json","events_json":"https://pith.science/api/pith-number/JDFY67CTDUOKALG35LD5LV42KB/events.json","paper":"https://pith.science/paper/JDFY67CT"},"agent_actions":{"view_html":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB","download_json":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB.json","view_paper":"https://pith.science/paper/JDFY67CT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01453&json=true","fetch_graph":"https://pith.science/api/pith-number/JDFY67CTDUOKALG35LD5LV42KB/graph.json","fetch_events":"https://pith.science/api/pith-number/JDFY67CTDUOKALG35LD5LV42KB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB/action/storage_attestation","attest_author":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB/action/author_attestation","sign_citation":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB/action/citation_signature","submit_replication":"https://pith.science/pith/JDFY67CTDUOKALG35LD5LV42KB/action/replication_record"}},"created_at":"2026-05-17T23:38:14.124056+00:00","updated_at":"2026-05-17T23:38:14.124056+00:00"}