{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NTCJEAWVTAFWAU3GBKI5IBLYOB","short_pith_number":"pith:NTCJEAWV","schema_version":"1.0","canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","source":{"kind":"arxiv","id":"2010.04104","version":2},"attestation_state":"computed","paper":{"title":"Learning the Pareto Front with Hypernetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik","submitted_at":"2020-10-08T16:39:20Z","abstract_excerpt":"Multi-objective optimization (MOO) problems are prevalent in machine learning. These problems have a set of optimal solutions, called the Pareto front, where each point on the front represents a different trade-off between possibly conflicting objectives. Recent MOO methods can target a specific desired ray in loss space however, most approaches still face two grave limitations: (i) A separate model has to be trained for each point on the front; and (ii) The exact trade-off must be known before the optimization process. Here, we tackle the problem of learning the entire Pareto front, with the "},"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":"2010.04104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"4117d9ab37217a22d07675340078147aec507cfe3692acc07d6f34b73ee0628b","abstract_canon_sha256":"52c24d99fec29d81c2f12c2971f7d0a981dd7fca8173f388a2ec7f8ba5536f7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:42.519142Z","signature_b64":"r5JMaqz/JdwopAS0JS+rG7s0ILe6v71/rsPPFbzPUEU2NRIRgZjdgD5fAHyig/WpE22IJ/aRHZNTCqfveaaFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","last_reissued_at":"2026-07-05T02:34:42.518663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:42.518663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning the Pareto Front with Hypernetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik","submitted_at":"2020-10-08T16:39:20Z","abstract_excerpt":"Multi-objective optimization (MOO) problems are prevalent in machine learning. These problems have a set of optimal solutions, called the Pareto front, where each point on the front represents a different trade-off between possibly conflicting objectives. Recent MOO methods can target a specific desired ray in loss space however, most approaches still face two grave limitations: (i) A separate model has to be trained for each point on the front; and (ii) The exact trade-off must be known before the optimization process. Here, we tackle the problem of learning the entire Pareto front, with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04104","kind":"arxiv","version":2},"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/2010.04104/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":"2010.04104","created_at":"2026-07-05T02:34:42.518717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04104v2","created_at":"2026-07-05T02:34:42.518717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04104","created_at":"2026-07-05T02:34:42.518717+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTCJEAWVTAFW","created_at":"2026-07-05T02:34:42.518717+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTCJEAWVTAFWAU3G","created_at":"2026-07-05T02:34:42.518717+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTCJEAWV","created_at":"2026-07-05T02:34:42.518717+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03102","citing_title":"Small RL Controller, Large Language Model: RL-Guided Adaptive Sampling for Test-Time Scaling","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29521","citing_title":"Not All Objectives Are Born Equal: Priority-Constrained Descent for Hierarchical Multi-Objective Optimization","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11278","citing_title":"Representation-Aligned Multi-Scale Personalization for Federated Learning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB","json":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB.json","graph_json":"https://pith.science/api/pith-number/NTCJEAWVTAFWAU3GBKI5IBLYOB/graph.json","events_json":"https://pith.science/api/pith-number/NTCJEAWVTAFWAU3GBKI5IBLYOB/events.json","paper":"https://pith.science/paper/NTCJEAWV"},"agent_actions":{"view_html":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB","download_json":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB.json","view_paper":"https://pith.science/paper/NTCJEAWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04104&json=true","fetch_graph":"https://pith.science/api/pith-number/NTCJEAWVTAFWAU3GBKI5IBLYOB/graph.json","fetch_events":"https://pith.science/api/pith-number/NTCJEAWVTAFWAU3GBKI5IBLYOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/action/storage_attestation","attest_author":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/action/author_attestation","sign_citation":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/action/citation_signature","submit_replication":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/action/replication_record"}},"created_at":"2026-07-05T02:34:42.518717+00:00","updated_at":"2026-07-05T02:34:42.518717+00:00"}