{"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/anchor-points-benchmarking-models-with-much","title":"Anchor Points: Benchmarking Models with Much Fewer Examples","arxiv_id":"2309.08638","date":"2023-09-14","proceeding":null,"authors":["Rajan Vivek","Kawin Ethayarajh","Diyi Yang","Douwe Kiela"],"abstract":"Modern language models often exhibit powerful but brittle behavior, leading to the development of larger and more diverse benchmarks to reliably assess their behavior. Here, we suggest that model performance can be benchmarked and elucidated with much smaller evaluation sets. We first show that in six popular language classification benchmarks, model confidence in the correct class on many pairs of points is strongly correlated across models. We build upon this phenomenon to propose Anchor Point Selection, a technique to select small subsets of datasets that capture model behavior across the entire dataset. Anchor points reliably rank models: across 87 diverse language model-prompt pairs, evaluating models using 1-30 anchor points outperforms uniform sampling and other baselines at accurately ranking models. Moreover, just several anchor points can be used to estimate model per-class predictions on all other points in a dataset with low mean absolute error, sufficient for gauging where the model is likely to fail. Lastly, we present Anchor Point Maps for visualizing these insights and facilitating comparisons of the performance of different models on various regions within the dataset distribution.","url_abs":"https://arxiv.org/abs/2309.08638v2","url_pdf":"https://arxiv.org/pdf/2309.08638v2.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":"anchor-points-benchmarking-models-with-much","repo_url":"https://github.com/rvivek3/anchorpoints","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2309.08638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08638"}},"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/rvivek3/anchorpoints","reach":null}],"summary":{"ran_fixture":1,"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":4,"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":4,"samples":[{"code_sha256_prefix":"73cdeaeb90026ab0","entry":"mean_model_baseline","repo":"rvivek3/anchorpoints","repo_kind":"official","path":"point_prediction_baselines.py","file_url":"https://github.com/rvivek3/anchorpoints/blob/HEAD/point_prediction_baselines.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"73cdeaeb90026ab0"}},{"code_sha256_prefix":"73041f4990c5d980","entry":"random_selection_naive","repo":"rvivek3/anchorpoints","repo_kind":"official","path":"optimal_valset_validation.py","file_url":"https://github.com/rvivek3/anchorpoints/blob/HEAD/optimal_valset_validation.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"73041f4990c5d980"}},{"code_sha256_prefix":"1c57262ec8940027","entry":"random_selection_weighted","repo":"rvivek3/anchorpoints","repo_kind":"official","path":"optimal_valset_validation.py","file_url":"https://github.com/rvivek3/anchorpoints/blob/HEAD/optimal_valset_validation.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1c57262ec8940027"}},{"code_sha256_prefix":"71a741051a9dd453","entry":"random_model_baseline","repo":"rvivek3/anchorpoints","repo_kind":"official","path":"point_prediction_baselines.py","file_url":"https://github.com/rvivek3/anchorpoints/blob/HEAD/point_prediction_baselines.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"71a741051a9dd453"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}