{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KLT6SXI67J7O4A3LB7GF7DQPJY","short_pith_number":"pith:KLT6SXI6","schema_version":"1.0","canonical_sha256":"52e7e95d1efa7eee036b0fcc5f8e0f4e1f5af08d58d4b69addf8aa6e71bc3e5d","source":{"kind":"arxiv","id":"2106.12639","version":1},"attestation_state":"computed","paper":{"title":"Multi-objective Asynchronous Successive Halving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"C\\'edric Archambeau, David Salinas, Michele Donini, Muhammad Bilal Zafar, Robin Schmucker","submitted_at":"2021-06-23T19:39:31Z","abstract_excerpt":"Hyperparameter optimization (HPO) is increasingly used to automatically tune the predictive performance (e.g., accuracy) of machine learning models. However, in a plethora of real-world applications, accuracy is only one of the multiple -- often conflicting -- performance criteria, necessitating the adoption of a multi-objective (MO) perspective. While the literature on MO optimization is rich, few prior studies have focused on HPO. In this paper, we propose algorithms that extend asynchronous successive halving (ASHA) to the MO setting. Considering multiple evaluation metrics, we assess the p"},"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":"2106.12639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-06-23T19:39:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f97a8d659becace38b4777b6adb8c2ea540ed8de472fd2fbd4a67c726c3c06d0","abstract_canon_sha256":"2f60771abc306a5054e8acf8756b4c39e939a975c39ecbce0f35a8895ef98809"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:04.486278Z","signature_b64":"4EesBgQ0ptCujrW+AzbSIldZfgUOZj2kXdHgvzM4u86i/KKD9yGRlh1IRkSvLjxwmIpJ4KVsccDnATQCGrVuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e7e95d1efa7eee036b0fcc5f8e0f4e1f5af08d58d4b69addf8aa6e71bc3e5d","last_reissued_at":"2026-07-05T02:52:04.485799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:04.485799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-objective Asynchronous Successive Halving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"C\\'edric Archambeau, David Salinas, Michele Donini, Muhammad Bilal Zafar, Robin Schmucker","submitted_at":"2021-06-23T19:39:31Z","abstract_excerpt":"Hyperparameter optimization (HPO) is increasingly used to automatically tune the predictive performance (e.g., accuracy) of machine learning models. However, in a plethora of real-world applications, accuracy is only one of the multiple -- often conflicting -- performance criteria, necessitating the adoption of a multi-objective (MO) perspective. While the literature on MO optimization is rich, few prior studies have focused on HPO. In this paper, we propose algorithms that extend asynchronous successive halving (ASHA) to the MO setting. Considering multiple evaluation metrics, we assess the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.12639","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/2106.12639/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":"2106.12639","created_at":"2026-07-05T02:52:04.485866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.12639v1","created_at":"2026-07-05T02:52:04.485866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.12639","created_at":"2026-07-05T02:52:04.485866+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLT6SXI67J7O","created_at":"2026-07-05T02:52:04.485866+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLT6SXI67J7O4A3L","created_at":"2026-07-05T02:52:04.485866+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLT6SXI6","created_at":"2026-07-05T02:52:04.485866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28365","citing_title":"CAMI: Cost-Aware Agent-Guided Multi-Indexing for Semantic Retrieval","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY","json":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY.json","graph_json":"https://pith.science/api/pith-number/KLT6SXI67J7O4A3LB7GF7DQPJY/graph.json","events_json":"https://pith.science/api/pith-number/KLT6SXI67J7O4A3LB7GF7DQPJY/events.json","paper":"https://pith.science/paper/KLT6SXI6"},"agent_actions":{"view_html":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY","download_json":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY.json","view_paper":"https://pith.science/paper/KLT6SXI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.12639&json=true","fetch_graph":"https://pith.science/api/pith-number/KLT6SXI67J7O4A3LB7GF7DQPJY/graph.json","fetch_events":"https://pith.science/api/pith-number/KLT6SXI67J7O4A3LB7GF7DQPJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY/action/storage_attestation","attest_author":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY/action/author_attestation","sign_citation":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY/action/citation_signature","submit_replication":"https://pith.science/pith/KLT6SXI67J7O4A3LB7GF7DQPJY/action/replication_record"}},"created_at":"2026-07-05T02:52:04.485866+00:00","updated_at":"2026-07-05T02:52:04.485866+00:00"}