{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GO2ETOUHJNXMIRF5JBAT6OEAKZ","short_pith_number":"pith:GO2ETOUH","schema_version":"1.0","canonical_sha256":"33b449ba874b6ec444bd48413f38805651baaa30b393efd012fbe2b182045aef","source":{"kind":"arxiv","id":"2107.04636","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Risk Budgeting Portfolio Optimization with Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["q-fin.CP"],"primary_cat":"q-fin.PM","authors_text":"Ayse Sinem Uysal, John M. Mulvey, Xiaoyue Li","submitted_at":"2021-07-09T19:13:07Z","abstract_excerpt":"Portfolio optimization has been a central problem in finance, often approached with two steps: calibrating the parameters and then solving an optimization problem. Yet, the two-step procedure sometimes encounter the \"error maximization\" problem where inaccuracy in parameter estimation translates to unwise allocation decisions. In this paper, we combine the prediction and optimization tasks in a single feed-forward neural network and implement an end-to-end approach, where we learn the portfolio allocation directly from the input features. Two end-to-end portfolio constructions are included: a "},"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":"2107.04636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"q-fin.PM","submitted_at":"2021-07-09T19:13:07Z","cross_cats_sorted":["q-fin.CP"],"title_canon_sha256":"4c1df68a2d514a78bbd585be6391e8914b1e7501b5bf6ed91d6e8f0f72685926","abstract_canon_sha256":"f3b72c3c99ff82ae15c5a2554042d9d2eea74381bb1b615b6a37a4fb8b2fbfdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:41.094232Z","signature_b64":"TYdFZeR/ZDtrpd4ythfgiSvfqt5QQXnXA4Nw8YAGT+vYu7lloR5BK70XqczJKOV9st/kAmsx94JPxz6RQEYEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b449ba874b6ec444bd48413f38805651baaa30b393efd012fbe2b182045aef","last_reissued_at":"2026-07-05T02:56:41.093846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:41.093846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Risk Budgeting Portfolio Optimization with Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["q-fin.CP"],"primary_cat":"q-fin.PM","authors_text":"Ayse Sinem Uysal, John M. Mulvey, Xiaoyue Li","submitted_at":"2021-07-09T19:13:07Z","abstract_excerpt":"Portfolio optimization has been a central problem in finance, often approached with two steps: calibrating the parameters and then solving an optimization problem. Yet, the two-step procedure sometimes encounter the \"error maximization\" problem where inaccuracy in parameter estimation translates to unwise allocation decisions. In this paper, we combine the prediction and optimization tasks in a single feed-forward neural network and implement an end-to-end approach, where we learn the portfolio allocation directly from the input features. Two end-to-end portfolio constructions are included: a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04636","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.04636/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":"2107.04636","created_at":"2026-07-05T02:56:41.093906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.04636v1","created_at":"2026-07-05T02:56:41.093906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04636","created_at":"2026-07-05T02:56:41.093906+00:00"},{"alias_kind":"pith_short_12","alias_value":"GO2ETOUHJNXM","created_at":"2026-07-05T02:56:41.093906+00:00"},{"alias_kind":"pith_short_16","alias_value":"GO2ETOUHJNXMIRF5","created_at":"2026-07-05T02:56:41.093906+00:00"},{"alias_kind":"pith_short_8","alias_value":"GO2ETOUH","created_at":"2026-07-05T02:56:41.093906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19285","citing_title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ","json":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ.json","graph_json":"https://pith.science/api/pith-number/GO2ETOUHJNXMIRF5JBAT6OEAKZ/graph.json","events_json":"https://pith.science/api/pith-number/GO2ETOUHJNXMIRF5JBAT6OEAKZ/events.json","paper":"https://pith.science/paper/GO2ETOUH"},"agent_actions":{"view_html":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ","download_json":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ.json","view_paper":"https://pith.science/paper/GO2ETOUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.04636&json=true","fetch_graph":"https://pith.science/api/pith-number/GO2ETOUHJNXMIRF5JBAT6OEAKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GO2ETOUHJNXMIRF5JBAT6OEAKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ/action/storage_attestation","attest_author":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ/action/author_attestation","sign_citation":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ/action/citation_signature","submit_replication":"https://pith.science/pith/GO2ETOUHJNXMIRF5JBAT6OEAKZ/action/replication_record"}},"created_at":"2026-07-05T02:56:41.093906+00:00","updated_at":"2026-07-05T02:56:41.093906+00:00"}