{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TRJGNWJWZEWS7HN3YWRRELSZ3P","short_pith_number":"pith:TRJGNWJW","schema_version":"1.0","canonical_sha256":"9c5266d936c92d2f9dbbc5a3122e59dbd2b1df01bb21c4af79e2853f155a537d","source":{"kind":"arxiv","id":"2110.03173","version":4},"attestation_state":"computed","paper":{"title":"Multi-objective Optimization by Learning Space Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kevin Yang, Linnan Wang, Tian Guo, Tianjun Zhang, Yiyang Zhao, Yuandong Tian","submitted_at":"2021-10-07T03:56:19Z","abstract_excerpt":"In contrast to single-objective optimization (SOO), multi-objective optimization (MOO) requires an optimizer to find the Pareto frontier, a subset of feasible solutions that are not dominated by other feasible solutions. In this paper, we propose LaMOO, a novel multi-objective optimizer that learns a model from observed samples to partition the search space and then focus on promising regions that are likely to contain a subset of the Pareto frontier. The partitioning is based on the dominance number, which measures \"how close\" a data point is to the Pareto frontier among existing samples. To "},"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":"2110.03173","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T03:56:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4de45b7b9518225369dc4abfc6f7fb3aaafcd92dbc86754a7242156764cbfc00","abstract_canon_sha256":"3a3ba077e0d2d9290f61317ec0209a19f2ccb11d35b36b149af79776d113f187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:59.838918Z","signature_b64":"x1Ic1FgPPXVLeap9sTV9qJv/66jOsHqjQ4yxczeznsKYqSUBSuQyaJ2Z2MX2nbcILMQt78o6gTQQgnaPT1JaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5266d936c92d2f9dbbc5a3122e59dbd2b1df01bb21c4af79e2853f155a537d","last_reissued_at":"2026-07-05T08:53:59.838477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:59.838477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-objective Optimization by Learning Space Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kevin Yang, Linnan Wang, Tian Guo, Tianjun Zhang, Yiyang Zhao, Yuandong Tian","submitted_at":"2021-10-07T03:56:19Z","abstract_excerpt":"In contrast to single-objective optimization (SOO), multi-objective optimization (MOO) requires an optimizer to find the Pareto frontier, a subset of feasible solutions that are not dominated by other feasible solutions. In this paper, we propose LaMOO, a novel multi-objective optimizer that learns a model from observed samples to partition the search space and then focus on promising regions that are likely to contain a subset of the Pareto frontier. The partitioning is based on the dominance number, which measures \"how close\" a data point is to the Pareto frontier among existing samples. To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03173","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/2110.03173/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":"2110.03173","created_at":"2026-07-05T08:53:59.838536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03173v4","created_at":"2026-07-05T08:53:59.838536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03173","created_at":"2026-07-05T08:53:59.838536+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRJGNWJWZEWS","created_at":"2026-07-05T08:53:59.838536+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRJGNWJWZEWS7HN3","created_at":"2026-07-05T08:53:59.838536+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRJGNWJW","created_at":"2026-07-05T08:53:59.838536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03718","citing_title":"ParetoFlow: Guided Flows in Multi-Objective Optimization","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P","json":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P.json","graph_json":"https://pith.science/api/pith-number/TRJGNWJWZEWS7HN3YWRRELSZ3P/graph.json","events_json":"https://pith.science/api/pith-number/TRJGNWJWZEWS7HN3YWRRELSZ3P/events.json","paper":"https://pith.science/paper/TRJGNWJW"},"agent_actions":{"view_html":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P","download_json":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P.json","view_paper":"https://pith.science/paper/TRJGNWJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03173&json=true","fetch_graph":"https://pith.science/api/pith-number/TRJGNWJWZEWS7HN3YWRRELSZ3P/graph.json","fetch_events":"https://pith.science/api/pith-number/TRJGNWJWZEWS7HN3YWRRELSZ3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P/action/storage_attestation","attest_author":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P/action/author_attestation","sign_citation":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P/action/citation_signature","submit_replication":"https://pith.science/pith/TRJGNWJWZEWS7HN3YWRRELSZ3P/action/replication_record"}},"created_at":"2026-07-05T08:53:59.838536+00:00","updated_at":"2026-07-05T08:53:59.838536+00:00"}