{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AF6JWETJLXAD67NDCBMLHL42UZ","short_pith_number":"pith:AF6JWETJ","schema_version":"1.0","canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","source":{"kind":"arxiv","id":"2605.14494","version":1},"attestation_state":"computed","paper":{"title":"Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Tianjue Lin, Wen Song, Yaoxin Wu, Zhiguang Cao","submitted_at":"2026-05-14T07:34:13Z","abstract_excerpt":"Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a small, representative subset of scenarios to enable tractable computation. However, existing methods are largely problem-agnostic, operating solely on the uncertainty set without consulting the feasible region or recourse structure. In this paper, we introduce PRISE, a problem-driven sequential lookahead heuristic that constructs reduced scenario sets by evaluating the marginal impact of each scenario. While PRISE yie"},"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":false},"canonical_record":{"source":{"id":"2605.14494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec451db23e60b61ad1cdd981c72a5581de602871af5773a5a00e2d7288e53a0a","abstract_canon_sha256":"dc7b776b403ca60d4e413501b78d26aab85d5902bc49f584bd2f1eff5c565664"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.398522Z","signature_b64":"zGif5kYktsQHJbZFIogmqES5bnJ6DgMFwtyS6vy21CL10LQvz6GFRn8bFnAphnQ8eQFnJd7C4Ku/SwM/vOpHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","last_reissued_at":"2026-05-17T23:39:06.397775Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.397775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Tianjue Lin, Wen Song, Yaoxin Wu, Zhiguang Cao","submitted_at":"2026-05-14T07:34:13Z","abstract_excerpt":"Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a small, representative subset of scenarios to enable tractable computation. However, existing methods are largely problem-agnostic, operating solely on the uncertainty set without consulting the feasible region or recourse structure. In this paper, we introduce PRISE, a problem-driven sequential lookahead heuristic that constructs reduced scenario sets by evaluating the marginal impact of each scenario. While PRISE yie"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"57f20ffff208781e1992a28627b8486606ca447d3768eddf4cbd52b165fc65e5"},"source":{"id":"2605.14494","kind":"arxiv","version":1},"verdict":{"id":"62f87a8e-2a1d-46b5-8c7f-f73965a6069c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:00:16.509140Z","strongest_claim":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.","one_line_summary":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions.","pith_extraction_headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed."},"references":{"count":37,"sample":[{"doi":"","year":2000,"title":"Robust solutions of linear programming problems contaminated with uncertain data.Mathematical programming, 88(3):411–424, 2000","work_id":"dd148461-db5f-48e9-a94a-5830912210c7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Adjustable robust solutions of uncertain linear programs.Mathematical programming, 99(2):351–376, 2004","work_id":"2fd54eec-a62e-4aa2-8c28-a355dd7bb338","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Princeton University Press","work_id":"58a27603-78b1-4098-b51c-1b4ea23e8fa8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Finite adaptability in multistage linear optimization.IEEE Transactions on Automatic Control, 55(12):2751–2766, 2010","work_id":"24327f44-5d9f-4805-a4cb-40d9b227382f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Design of near optimal decision rules in multistage adaptive mixed-integer optimization.Operations Research, 63(3):610–627, 2015","work_id":"dd3882c4-c615-43f7-bf55-efc5178e92f2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"883ce7cab3cd6071d374c4d27beb2ac16c5122a84a7bd1643847ae00a2d20ec5","internal_anchors":1},"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":"2605.14494","created_at":"2026-05-17T23:39:06.397900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14494v1","created_at":"2026-05-17T23:39:06.397900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14494","created_at":"2026-05-17T23:39:06.397900+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF6JWETJLXAD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF6JWETJLXAD67ND","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF6JWETJ","created_at":"2026-05-18T12:33:37.589309+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/AF6JWETJLXAD67NDCBMLHL42UZ","json":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ.json","graph_json":"https://pith.science/api/pith-number/AF6JWETJLXAD67NDCBMLHL42UZ/graph.json","events_json":"https://pith.science/api/pith-number/AF6JWETJLXAD67NDCBMLHL42UZ/events.json","paper":"https://pith.science/paper/AF6JWETJ"},"agent_actions":{"view_html":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ","download_json":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ.json","view_paper":"https://pith.science/paper/AF6JWETJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14494&json=true","fetch_graph":"https://pith.science/api/pith-number/AF6JWETJLXAD67NDCBMLHL42UZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AF6JWETJLXAD67NDCBMLHL42UZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/action/storage_attestation","attest_author":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/action/author_attestation","sign_citation":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/action/citation_signature","submit_replication":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/action/replication_record"}},"created_at":"2026-05-17T23:39:06.397900+00:00","updated_at":"2026-05-17T23:39:06.397900+00:00"}