{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HRAPGU2JWPSWBQVHA2BIW4KNGJ","short_pith_number":"pith:HRAPGU2J","schema_version":"1.0","canonical_sha256":"3c40f35349b3e560c2a706828b714d325e8586b3ffa634289619d1158f4eaf6d","source":{"kind":"arxiv","id":"2305.01094","version":4},"attestation_state":"computed","paper":{"title":"Performative Prediction with Bandit Feedback: Learning through Reparameterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chien-Ju Ho, Wei Tang, Yang Liu, Yatong Chen","submitted_at":"2023-05-01T21:31:29Z","abstract_excerpt":"Performative prediction, as introduced by Perdomo et al, is a framework for studying social prediction in which the data distribution itself changes in response to the deployment of a model. Existing work in this field usually hinges on three assumptions that are easily violated in practice: that the performative risk is convex over the deployed model, that the mapping from the model to the data distribution is known to the model designer in advance, and the first-order information of the performative risk is available. In this paper, we initiate the study of performative prediction problems t"},"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":"2305.01094","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-01T21:31:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cfecd9441d2dff8c6c3f7dccd0e98ceda561b33290fb114a43eb15eeace8f84e","abstract_canon_sha256":"81a650e495780ca00a7ecc2dc2e605bfe5125d1cf24149a715c3d0cb31cdb8b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:42.467355Z","signature_b64":"3oSlY0SXgTvx7rTwI9TUWlgQdesDtM+Ul4qyF9lVc8JA85QKz++6vuN7K7xZ9z4krFAT1AQLrPjSi0b1arqvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c40f35349b3e560c2a706828b714d325e8586b3ffa634289619d1158f4eaf6d","last_reissued_at":"2026-07-05T08:54:42.466887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:42.466887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performative Prediction with Bandit Feedback: Learning through Reparameterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chien-Ju Ho, Wei Tang, Yang Liu, Yatong Chen","submitted_at":"2023-05-01T21:31:29Z","abstract_excerpt":"Performative prediction, as introduced by Perdomo et al, is a framework for studying social prediction in which the data distribution itself changes in response to the deployment of a model. Existing work in this field usually hinges on three assumptions that are easily violated in practice: that the performative risk is convex over the deployed model, that the mapping from the model to the data distribution is known to the model designer in advance, and the first-order information of the performative risk is available. In this paper, we initiate the study of performative prediction problems t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01094","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.01094/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.01094","created_at":"2026-07-05T08:54:42.466945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01094v4","created_at":"2026-07-05T08:54:42.466945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01094","created_at":"2026-07-05T08:54:42.466945+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRAPGU2JWPSW","created_at":"2026-07-05T08:54:42.466945+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRAPGU2JWPSWBQVH","created_at":"2026-07-05T08:54:42.466945+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRAPGU2J","created_at":"2026-07-05T08:54:42.466945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06549","citing_title":"Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15525","citing_title":"Complexity Guarantees for Zeroth-order Methods via Exponentially-shifted Gaussian Smoothing: Mitigating Dimension-dependence and Incorporating Decision-dependence","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ","json":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ.json","graph_json":"https://pith.science/api/pith-number/HRAPGU2JWPSWBQVHA2BIW4KNGJ/graph.json","events_json":"https://pith.science/api/pith-number/HRAPGU2JWPSWBQVHA2BIW4KNGJ/events.json","paper":"https://pith.science/paper/HRAPGU2J"},"agent_actions":{"view_html":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ","download_json":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ.json","view_paper":"https://pith.science/paper/HRAPGU2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01094&json=true","fetch_graph":"https://pith.science/api/pith-number/HRAPGU2JWPSWBQVHA2BIW4KNGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HRAPGU2JWPSWBQVHA2BIW4KNGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ/action/storage_attestation","attest_author":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ/action/author_attestation","sign_citation":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ/action/citation_signature","submit_replication":"https://pith.science/pith/HRAPGU2JWPSWBQVHA2BIW4KNGJ/action/replication_record"}},"created_at":"2026-07-05T08:54:42.466945+00:00","updated_at":"2026-07-05T08:54:42.466945+00:00"}