{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/lifelong-benchmarks-efficient-model","title":"Efficient Lifelong Model Evaluation in an Era of Rapid Progress","arxiv_id":"2402.19472","date":"2024-02-29","proceeding":null,"authors":["Ameya Prabhu","Vishaal Udandarao","Philip Torr","Matthias Bethge","Adel Bibi","Samuel Albanie"],"abstract":"Standardized benchmarks drive progress in machine learning. However, with repeated testing, the risk of overfitting grows as algorithms over-exploit benchmark idiosyncrasies. In our work, we seek to mitigate this challenge by compiling ever-expanding large-scale benchmarks called Lifelong Benchmarks. These benchmarks introduce a major challenge: the high cost of evaluating a growing number of models across very large sample sets. To address this challenge, we introduce an efficient framework for model evaluation, Sort & Search (S&S)}, which reuses previously evaluated models by leveraging dynamic programming algorithms to selectively rank and sub-select test samples. To test our approach at scale, we create Lifelong-CIFAR10 and Lifelong-ImageNet, containing 1.69M and 1.98M test samples for classification. Extensive empirical evaluations across over 31,000 models demonstrate that S&S achieves highly-efficient approximate accuracy measurement, reducing compute cost from 180 GPU days to 5 GPU hours (about 1000x reduction) on a single A100 GPU, with low approximation error and memory cost of <100MB. Our work also highlights issues with current accuracy prediction metrics, suggesting a need to move towards sample-level evaluation metrics. We hope to guide future research by showing our method's bottleneck lies primarily in generalizing Sort beyond a single rank order and not in improving Search.","url_abs":"https://arxiv.org/abs/2402.19472v2","url_pdf":"https://arxiv.org/pdf/2402.19472v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"lifelong-benchmarks-efficient-model","repo_url":"https://github.com/bethgelab/sort-and-search","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2402.19472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.19472"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/bethgelab/sort-and-search","reach":null}],"summary":{"ran_fixture":3,"unverified":3},"by_repo_kind":{"official":{"samples":6,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":6,"samples":[{"code_sha256_prefix":"b42f62c21b11370f","entry":"create_pred_array","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b42f62c21b11370f"}},{"code_sha256_prefix":"1986c13e156442a5","entry":"do_search_subsampled","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1986c13e156442a5"}},{"code_sha256_prefix":"c59a4d74a45cc0d1","entry":"do_searching","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c59a4d74a45cc0d1"}},{"code_sha256_prefix":"984ffce6cd37d192","entry":"dynamic_programming_threshold","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"984ffce6cd37d192"}},{"code_sha256_prefix":"26d3a93b00f00fa0","entry":"random_sampling","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"26d3a93b00f00fa0"}},{"code_sha256_prefix":"caaf47402ce2a87d","entry":"uniform_sampling","repo":"bethgelab/sort-and-search","repo_kind":"official","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"caaf47402ce2a87d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}