Mapping global dynamics of benchmark creation and saturation in artificial intelligence

Benchmarks are crucial to measuring and steering progress in artificial intelligence (AI). However, recent studies raised concerns over the state of AI benchmarking, reporting issues such as benchmark overfitting, benchmark saturation and increasing centralization of benchmark dataset creation. To facilitate monitoring of the health of the AI benchmarking ecosystem, we introduce methodologies for creating condensed maps of the global dynamics of benchmark creation and saturation. We curate data for 3765 benchmarks covering the entire domains of computer vision and natural language processing, and show that a large fraction of benchmarks quickly trends towards near-saturation, that many benchmarks fail to find widespread utilization, and that benchmark performance gains for different AI tasks are prone to unforeseen bursts. We analyze attributes associated with benchmark popularity, and conclude that future benchmarks should emphasize versatility, breadth and real-world utility.

Benchmarks are crucial to measuring and steering progress in artificial intelligence (AI). However, recent studies raised concerns over the state of AI benchmarking, reporting issues such as benchmark overfitting, benchmark saturation and increasing centralization of benchmark dataset creation. To facilitate monitoring of the health of the AI benchmarking ecosystem, we introduce methodologies for creating condensed maps of the global dynamics of benchmark creation and saturation. We curate data for 3765 benchmarks covering the entire domains of computer vision and natural language processing, and show that a large fraction of benchmarks quickly trends towards near-saturation, that many benchmarks fail to find widespread utilization, and that benchmark performance gains for different AI tasks are prone to unforeseen bursts. We analyze attributes associated with benchmark popularity, and conclude that future benchmarks should emphasize versatility, breadth and real-world utility.
Benchmarks have become crucial to the development of artificial intelligence (AI). Benchmarks typically contain one or more datasets and metrics for measuring performance. They exemplify and-explicitly or implicitly-define machine learning tasks and goals that models need to achieve. Models achieving new state-of-the-art (SOTA) results on established benchmarks receive widespread recognition. Thus, benchmarks do not only measure, but also steer progress in AI.
Looking at individual benchmarks, one can identify several phenomenologically different SOTA dynamics patterns, such as continuous growth, saturation/stagnation, or stagnation followed by a burst (Fig. 1).
The continuous growth pattern is marked by a steady increase of the SOTA curve over the years. The saturation/stagnation pattern is characterized by initial growth followed by a long-term halt in improvement of the SOTA. This may either be caused by a lack of improvement in technical capability (technological stagnation), a lack of research interest in the benchmark (research intensity stagnation), or by an inability to further improve on the benchmark because its inherent ceiling has already been reached (saturation). The stagnation followed by burst pattern is marked by a flat or only slightly increasing SOTA curve, eventually followed by a sharp increase. This might indicate a late breakthrough in tackling a certain type of task.
In recent years, a sizable portion of novel benchmarks in key domains such as NLP quickly trended towards saturation 1 . Benchmarks that are nearing or have reached saturation are problematic, since either they cannot be used for measuring and steering progress any longer, or-perhaps even more problematic-they see continued use but become misleading measures: actual progress of model capabilities is not properly reflected, statistical significance of differences in model performance is more difficult to achieve, and remaining progress becomes increasingly driven by over-optimization for specific benchmark characteristics that are not generalizable to other data distributions 2,3 . Hence, novel benchmarks need to be created to complement or replace older benchmarks.
These phenomena generate patterns across two or more related benchmarks over time, such as clear-cut consecutive versions or consecutive saturation of benchmarks (Fig. 2).
Some recent work analyzed the global evolution of AI capabilities as measured through benchmarks. The annual AI index 4 investigated progress in performance exemplified through selected benchmarks per task type (e.g., ImageNet 5 for Image Classification or SQuAD for natural language understanding) and compared to human performance. As an example, in the AI index report for 2021, it noted that gains in computer vision benchmarks were flattening, while natural language processing (NLP) models were outpacing available benchmarks for question answering and natural language understanding.
Martínez-Plumed et al. analyzed the community dynamics behind 25 popular AI benchmarks, such as CIFAR-100 6 and SQuAD1.1 7,8 . They found that the 'SOTA front' and SOTA jumps were dominated by longterm collaborative hybrid communities, formed predominantly by American or Asian universities together with tech giants, such as Google or Facebook.
Koch et al. analyzed trends in dataset use and repurposing across a large number of AI benchmarking efforts 9 . They discovered that a large fraction of widely used datasets were introduced by only a few high-profile organizations, that this disparity increased over time and that some of these datasets were increasingly re-purposed for novel tasks. However, they also found that NLP was an exception to this trend, with greater than average introduction and use of novel, taskspecific benchmarks.
There still remain substantial gaps in our understanding of the global dynamics of benchmarking efforts. How well are different classes of AI tasks represented through benchmarking efforts? How are benchmarks created, used and abandoned over time? How quickly do benchmarks become saturated or stagnant, thereby failing to capture or guide further progress? Can trends across AI tasks and application domains be identified? Why are some benchmarks highly utilized while others are neglected?
In this work, we investigate these questions and expand on previous work by exploring methods for mapping the dynamics of benchmark creation, utilization and saturation across a vast number of AI tasks and application domains. We extract data from Papers With Code (paperswithcode.com), the largest centralized repository of AI benchmark results, and conduct extensive manual curation of AI task type hierarchies and performance metrics. Based on these data, we analyze benchmark dynamics of two highly productive AI domains of recent years: computer vision and NLP.

Results
We included 3765 benchmarks across 947 distinct AI tasks in our analysis. We found that for a significant fraction of the benchmarks in our dataset, only few results were reported at different time points in  different studies (Table 1). For example, 1318 NLP benchmarks have at least one result reported, but only 661 (50%) of these have results reported at three or more different time points.

SOTA curve diversity and dynamics
In order to explore the diversity of real-world within-benchmark SOTA dynamics in a data-driven way, we used Self Organizing Maps (SOM)-a type of Artificial Neural Network able to convert complex, nonlinear statistical relationships between high-dimensional data items into simple geometric relationships on a low-dimensional display-to cluster individual metrics curves based on their shapes. Only SOTA trajectories with at least five entries over at least one year were considered. Figure 3 displays the three clusters discovered for benchmarks in computer vision and NLP for all metrics. In total, 1079 metric trajectories of 654 benchmarks were assigned to one of three clusters. Cluster 1 (460 trajectories) most closely resembles the phenomenology of continuous growth. Cluster 2 (378 benchmarks), corresponds to the saturation/stagnation scenario. In this cluster, values close to the ceiling of all results are observed very soon in the time series and limited remaining growth in performance is recorded afterwards. Finally, cluster 3 (241 benchmarks) most closely resembles the stagnation followed by breakthrough scenario.
We analyzed the number of benchmarks reporting new SOTA results vs. active benchmarks reporting any results over time for NLP (Fig. 4) and computer vision (Suppl. Fig. 3). For both NLP and computer vision, the number of benchmarks in the dataset started to rise in 2013, with a notable acceleration of growth in benchmarks reporting SOTA results in 2017-2018 and a slowdown of growth after 2018. There is a strong stagnation of the number of active and of SOTA-reporting benchmarks in 2020, which is more marked for NLP. The peak numbers of active benchmarks in the dataset were highest in 2020 (432 for NLP, 1100 for computer vision), demonstrating that the availability of benchmarks for computer vision remained significantly higher compared to NLP.
To understand in greater detail how benchmark creation and saturation unfold across the great variety of tasks that are addressed by global AI research, we devised methodologies for normalizing and visualizing benchmark dynamics, as described below.

Creating global maps of AI benchmark dynamics
Comparing SOTA trajectories across a wide variety of tasks, benchmarks and performance metrics is not trivial: How significant is a certain increment in performance? What constitutes a markedly unimpressive result (i.e., the 'floor' of our expectations)? What would constitute the best result realistically possible (i.e., the 'ceiling' of our expectations)?  x2N1 ≤ x ≤ 50 f g ), early saturation (f ðxÞ = À 1=x where x2N1 ≤ x ≤ 50 f g ) and stagnation followed by breakthrough (f ðxÞ = À 1=x where x2NÀ50 ≤ x ≤ À 1 f g ). As similarity metric we use the euclidean distance between trajectory and gold function.
Different performance metrics can inherently cover widely different value ranges. For example, for the performance metric accuracy, the inherent lowest value would be 0%, while the inherent highest value would be 100%. However, this is often less helpful for judging benchmark results than one might hope: For a balanced dataset with two classes, the floor should rather be set to 50%, as this would be the accuracy achieved by a random classifier. For an unbalanced dataset, the inherent floor might be another value-i.e., it would be highly dataset specific. Similar concerns can also be raised about the potential ceiling value: for example, a perfect accuracy score of 100% might never be achievable even by the best hypothetical model because of limitations inherent in the dataset (e.g., mislabeled examples in the test set).
Arguably, the best solution for judging and comparing trajectories would be an in-depth manual analysis and curation of all benchmarks, where floor values are determined by trivially simple prediction algorithms and ceiling values are determined through gold standards (e.g., expert human curators). Unfortunately, such curated data are not available for the vast majority of benchmarks. Moreover, even purported gold standard test sets can have severe limitations. For example, many recent NLP benchmarks were quickly saturated with some systems reaching above-human performance on test sets 1 -but further analyses reveal that models achieving very high performance often did so through recognizing benchmark-inherent artifacts that did not transfer to other data distributions 1,3 .
To easily scale our analysis to all benchmarks without requiring cost-prohibitive per-benchmark curation of performance metrics value ranges, we normalized and calibrated SOTA benchmark results in a data-driven way. As the basis of further analyses, we calculated the relative improvement (i.e., increase in performance) for individual metrics (e.g., accuracy). We achieved this by comparing the stepwise increment from the first (A, anchor) to the last reported result (M, maximum) in each step of a SOTA trajectory.
We define relative improvement (r) as: where relative improvement (r i ) is the ratio of the difference between the current result (R i ) minus the previous result (R i-1 ) over the difference between the last result (M, maximum) minus the first result (A, anchor). Because we need the anchor value (i = 1) as reference for the r i calculation of the subsequent values, we only consider the calculation of r from the second value (i = 2) in the trajectory onwards. Figure 5 exemplifies this calculation and visualizes the resulting values for SOTA accuracy results of five AI models reported from October 2015 until April 2017 for the visual question answering benchmark 'VQA v1 test-dev'. The methodology exemplified in Fig. 5 was applied to all AI tasks in NLP and computer vision to create global SOTA trajectory maps (generated data are available in Supplementary Data 3 and 4). To condense the visual representation, data items for the same task and month were aggregated by selecting the maximum value. Figure 6 displays the global SOTA trajectory map for NLP. Here, every dash represents an anchor, i.e., the first result of a newly established benchmark. The subsequent icons depict the relative improvements for different benchmarks belonging to each task. We grouped tasks based on their superclasses extracted from the ontology structure we created during data curation (see Methods section), placing related tasks adjacent to each other. For example, "Semantic analysis" is the superclass of "Semantic textual similarity" and "Word sense disambiguation". A similar global SOTA trajectory map for computer vision is available in Supplementary Fig. 1.
Interactive versions of these plots that allow for displaying details for each data item can be accessed online through a webpage (https:// openbiolink.github.io/ITOExplorer/) and Jupyter notebooks (Code 2, Code availability).
In NLP the tasks of information extraction, sentiment analysis, language modeling and question answering had significant density of novel SOTA results the earliest (2014-2016). It is noteworthy that none of the tasks completely ceased to produce SOTA activity once they became established. Relative SOTA improvements were modest until 2018. There was a slight clustering of large relative SOTA improvements around 2018-2019-a possible interpretation being that this was when AI language capabilities experienced a boost while benchmarks were not yet saturated.
In computer vision, high research intensity and continuous progress on image classification benchmarking (Supplementary Fig. 1) started in 2013. This is earlier than most other AI tasks, as those were the first application areas in which deep learning started to excel. Notable later advances happened in 3D vision processing (since 2016), image generation (since 2017) and few-shot learning (2018-2019). In terms of relative SOTA improvements, the map for CV shows a wide array of patterns in benchmark dynamics across different AI tasks that elude simple narratives about benchmark intensity and progress.  To further visualize the dynamics of benchmark creation, progression, saturation/stagnation and eventual abandonment, we devised a global AI benchmark lifecycle map, exemplified in Fig. 7 for the NLP domain. The lifecycle map classifies each benchmark into one of four classes every year: (a) New benchmark: benchmark reporting its first result this years, (b) Benchmark reporting SOTA: established benchmark that reports at least one SOTA result, (c) Benchmark reporting no SOTA/no results: established benchmarks that does not report any results, or does report results but none of them establish a new SOTA, and (d) Disbanded benchmark: a benchmark that does not report further results from a given year onwards. In the lifecycle map, every class is represented as an icon, while the size of the icon represents the number of benchmarks falling into this category. Each benchmark can only fall into a single category for each year.
The figure and a related figure for computer vision are also available as interactive graphs on the web (https://openbiolink.github. io/ITOExplorer/).
The benchmark lifecycle map for NLP ( Fig. 7) shows that a few benchmarks across most tasks were established early (before 2015), but only a small number of novel SOTA results were reported for these benchmarks during this period. Establishment of novel benchmarks strongly accelerated in 2015-2018, and was most marked in question answering, information extraction, text classification and text summarization. The years 2018 and 2019 saw the establishment of many novel benchmarks for a wide variety of further tasks, as well as the reporting of SOTA results for large numbers of benchmarks. Establishment of novel benchmarks was reduced in 2020, and concentrated on high-level tasks associated with inference and reasoning, likely because of increasing model capabilities in these areas. From 2019, no novel SOTA results (or no results at all) were reported for a large number of benchmarks, and this phenomenon was not particularly biased towards any specific types of tasks.
The lifecycle map for computer vision ( Supplementary Fig. 2) shows a first wave of benchmark establishment for the tasks of image clustering and image classification around 2013, followed by several other tasks in 2014. It is noteworthy that even tasks established earlysuch as image classification and semantic segmentation-demonstrated high benchmark activity and novel SOTA results well into 2021, and especially for image classification this was accompanied by an ongoing establishment of novel few-shot benchmarks. Tasks for most other benchmarks were established in 2015-2019.
For both NLP and computer vision, the number of distinct benchmarks strongly differs between tasks. Only a very fraction of benchmarks was disbanded in the years up to 2020. A larger number of benchmarks was reported as disbanded from 2020 (i.e., have no reported results in 2020 or after). The number of benchmarks classified as disbanded is highest in 2021, but this is likely partially influenced by the cutoff date of the dataset used in the analysis (mid 2022).

Dataset popularity is distributed very unevenly
We selected all datasets used to benchmark NLP or computer vision tasks and which had first reported results in the Papers With Code dataset in 2018. We analyzed the distribution of dataset popularity, measured by the number of scientific papers utilizing each dataset for NLP. We found distributions to be heavy-tailed, i.e., a small set of benchmark datasets was used to generate a large number of benchmark results, as demonstrated in Fig. 8 for NLP datasets. The top 22% of NLP datasets and top 21% of computer vision datasets were utilized by the same number of papers as the remaining datasets for each domain. The disparity becomes even greater when analyzing all datasets in Papers With Code, regardless of their first recorded entry: Here, the top 10% of NLP and top 5% of computer vision datasets were utilized by the same number of papers as the remaining datasets.

Quantifying Papers With Code dataset completeness
While Papers With Code is the largest dataset of AI benchmark results by a wide margin, it cannot provide a full coverage of all existing AI benchmarks. We conducted a small-scale study to estimate the completeness of the Papers With Code dataset regarding SOTA result trajectories.
We randomly sampled 10 benchmark datasets from NLP and 10 benchmark datasets from computer vision in the dataset, resulting in a total of 20 randomly sampled datasets (listed in Supplementary Data 7). Querying Google Scholar, we found that the total size of the combined corpus of papers introducing the datasets and all their citing papers was 7595. Out of the citing papers, we randomly sampled 365 papers (sample size chosen to yield a margin of error of 5% in the analysis).
We inspected and annotated these 365 papers to determine whether each paper contained results on the benchmark of the cited dataset paper. If this was the case, we compared the reported result with the Papers With Code dataset to determine if the paper reported a result that was SOTA at the time and was not currently covered by Papers With Code (annotation data is available in Supplementary Data 8).
We found that even though dataset papers were highly cited, only a small fraction of citing papers reported results on the associated benchmarks, and an even smaller fraction (

Dataset attributes associated with popularity
The finding that a large fraction of research activity was focussed on a comparatively small number of benchmark datasets and that many datasets failed to find adoption raises the question: which attributes differentiate highly popular from unpopular benchmark datasets? Gaining an understanding of these differences may guide creators of future benchmark datasets in prioritizing their efforts.
We conducted an exploratory analysis of some such potentially differentiating attributes. We selected all benchmark datasets used to benchmark NLP or computer vision tasks and which had first reported results in the Papers With Code dataset in 2018. We ranked selected datasets in two separate lists for NLP and computer vision by the number of unique papers that reported benchmark results on each dataset, i.e., a list ranked by the follow-up utilization of datasets for benchmarking.
We created two samples of top 10 and bottom 10 datasets (i.e., datasets with highest/least follow-up utilization for benchmarking) for NLP and computer vision, respectively (see "Methods" section for details on the sampling methodology). We combined the top and bottom lists of computer vision and NLP, resulting in a top list and a bottom list with 20 datasets each, yielding a total of N = 40 annotated datasets.
The majority of included datasets (n = 36; 90%) were associated with peer-reviewed publications. 33 datasets (82.5%) were associated with a paper with a first or last author with a public/academic affiliation, and 11 (27.5%) of datasets were associated with a paper with a first or last author with a private/industrial affiliation.
We investigated seven attributes for their correlation with top or bottom popularity status, based on the following driving hypotheses: 1. Number of task types, i.e., the number of different AI tasks that were evaluated by building on a specific dataset. This can include     Table 2. We found that datasets in the top popularity list were versatile (had greater number of task types), were published alongside a dedicated leaderboard, and had a larger number of sub-benchmarks (which was particularly the case for NLP datasets). Involvement of first/ last authors from top institutions was associated with greater popularity. Proposing benchmark datasets as part of a competition was not associated with greater popularity, as was the involvement of a greater number of institutions.

Discussion
First, we found that a significant fraction of benchmarks quickly trends towards stagnation/saturation, and that this effect was especially marked in the recent past. One approach towards extending the useful lifetime of benchmarks could be an increased focus on benchmarks covering a larger number of sub-benchmarks covering different data distributions and task types. An extreme example is the recently released BIG-Bench benchmark (Srivastava et al. 2022), which contains >200 crowdsourced sub-benchmarks. Another approach could be the creation of 'living benchmarks' that are updated over time to prevent overfitting and benchmark saturation 10 . This could be achieved by creating tight loops of humans and AI systems working together on benchmark creation and evaluation 10,11 . However, it remains to be seen if this approach is practical enough to be adopted widely.
Second, we found that dynamics of performance gains on specific AI tasks usually do not follow clearly identifiable patterns. This indicates that progress in AI as captured by improvements in SOTA benchmark results remains rather unpredictable and prone to unexpected bursts of progress and phases of saturation/stagnation. This is likely caused both by the complexities and limitations of current benchmarking practices, as well as actual sudden bursts in AI capabilities. Deep learning models are flexible enough that 'cross-pollination' between developments in very different tasks and application domains is possible. For example, during the burst of progress in computer vision, developments from computer vision were transferred to NLP (e.g., convolutional neural networks applied to text classification 12 ) while developments were transferred in the other direction during the more recent burst of progress in NLP (e.g., vision transformers 13 ).
Third, we found that a significant fraction of benchmarks in our dataset was only utilized by a small number of independent studies at different time points. While this might be amplified by the incompleteness of the dataset, it does point towards an actual failure of many benchmarks to find widespread adoption. This resonates with recent findings that benchmarking efforts tend to be dominated by datasets created by a few high-profile institutions 9 . On the one hand, this raises concerns about potential bias and insufficient representativeness of benchmarks. On the other hand, recent criticism of the validity of many benchmarks for capturing real-world performance of AI systems 3 suggest that the development of fewer, but more quality-assured benchmarks covering multiple AI capabilities might be desirable 14 .
Are current benchmarks covering all important AI tasks or are there fundamental gaps? This question cannot satisfactorily be answered by looking at benchmarking activity alone, and requires an in-depth analysis of the requirements of important AI application domains. As an example, we recently conducted a study in which we compared the explicitly stated needs for AI automation of clinical practitioners with the landscape of available clinical benchmark datasets 15 . We found that benchmark datasets failed to capture the needs of this user group, and that benchmarks for tasks that were most urgently required (such as assistance with documentation and administrative workflows) were missing completely. It is very plausible that similar misalignments between AI benchmarking practices and actual priorities for AI automation also exist in other domains.
Based on our findings and considerations, we can formulate some recommendations for creating benchmarks that are useful and utilized. Benchmarks should ideally be versatile, so that they can be used and re-purposed for a multitude of tasks. They should, if feasible, contain several sub-benchmarks covering different task types to decrease overfitting to narrowly defined tasks and to extend the lifespan of the benchmark by avoiding saturation from highly specialized models 1,11 . Benchmark creators should establish a leaderboard; we recommend establishing the benchmark directly in the Papers With Code platform and advertising that follow-up work should report results there. However, if feasible, benchmark performance should not be aggregated into a single metric but should be reported as a collection of metrics measuring different aspects of performance to avoid over-optimizing for specific metrics 16 . Benchmark creators should invest significant effort into orienting on most pressing use-cases and try to achieve high ecological validity, rather than merely orienting on easy access to existing data sources.
Our analyses have some important limitations. The curation of benchmark results across the entirety of AI research is highly laborintensive. We therefore base our analysis on data from Papers With Code which-while being the most comprehensive source of benchmark data to date-still cannot provide a fully complete and unbiased representation of all benchmarking efforts in AI. A recent analysis concluded that while Papers With Code displays some bias towards recent work, its coverage of the literature is good and omitted works are mostly low-impact (as judged by citation count) 9 . We further investigated the completeness of Papers With Code in our study, and found that it covered approximately 1/3 of published SOTA results. While we deem this level of data completeness sufficient for the aggregated analyses of benchmarking dynamics as part of the present study, it underlines that significant improvements can still be made. We therefore suggest that publishing research results to the Papers With Code repository should be further incentivized (e.g., through editorial guidelines of conferences and journals). Some of our analyses put emphasis on the 'SOTA front', i.e., benchmark results that push the curve of SOTA results, while putting less emphasis on the dynamics of results below this SOTA curve. There are several good arguments that non-SOTA results can also provide valuable contributions and should receive more attention. For example, models that do not improve on SOTA performance metrics might have other benefits, such as better interpretability, lower resource need, lower bias or higher task versatility 1 . Nonetheless, research practice and scientific reward systems (such as paper acceptance) remain heavily influenced by progress on SOTA performance metrics, making their dynamics and potential shortcomings important subjects of investigation.
The creation of a global view on SOTA performance progress proved to be fraught with many difficulties. Performance results are reported for an enormous variety of tasks and benchmarks through an enormous variety of performance metrics that are often of questionable quality 16,17 . While we addressed some of these issues through a largescale curation effort 18 , the fundamental difficulty of interpreting the actual practical relevance, generalizability and potential impact of AI benchmark results remains. The analyses conducted in this work are therefore primarily geared towards furthering our understanding of the practice of AI benchmarking, rather than AI capability gain in itself. To better understand the real-world implications of specific benchmark results, more work needs to be done to map specific benchmark performance results to expected real-word impact-a currently very undeveloped field of investigation that should be the focus of future research.

Methods
We extracted data from Papers With Code and conducted extensive manual curation to create a resource termed the Intelligence Task Ontology and Knowledge Graph (ITO) 18 . ITO broadly covers the results of different AI models applied against different benchmarks representative of different AI tasks in a coherent data model, and served as the basis of the analyses conducted in this study. AI tasks are grouped under major top-level classes in a rich task hierarchy. We queried benchmark results and task classifications and extracted SOTA values per metric spanning more than a decade (2008-mid 2021).
Metrics captured in ITO can have positive or negative polarities, i.e., they reflect performance improvement either as an increase (positive polarity, e.g., "Accuracy") or a decrease (negative polarity, e.g., "Error") in value. As we intended to depict an aggregated trajectory for both positive and negative polarities, we needed to detect and normalize the polarity of a large number of metrics. We identified metrics polarities through leaderboard analysis and manual curation, and inverted results with negative polarities prior to further analysis.
During curation, we found 662 metrics in ITO that were used with an unambiguous polarity, whereas 87 were utilized in apparently conflicting ways (reported with negative and positive polarity in different benchmarks because of data quality issues). We resolved this ambiguity through manual curation. A list with the 85 manually curated polarity assignments and the final list with the complete metrics can be found in Supplementary Data 1 and 2, respectively.
For the creation of the Intelligence Task Ontology and Knowledge Graph / ITO, we utilized the official data dump of the Papers With Code repository (data export date 2022/07/30) and devised Python scripts to convert the data into the Web Ontology Language (OWL) format 19 . We conducted extensive manual curation of the task class hierarchy and the performance metric property hierarchy in the collaborative ontology editing environment WebProtége 20 (version 4.0.2).
Data from ITO was loaded into the high-performance graph database BlazeGraph (version 2.1.6, blazegraph.com) and queried using the graph query language SPARQL 21 . For data manipulation, we used Pandas (version 1.2.4) for manipulating large data frames and Numpy (version 1.20.3) for numeric calculations (such as average). Plotly (version 4.14.3) was used for data visualization in order to create trajectory plots and state of the art curves on Jupyter™ Notebooks (version 6.4.0) running Python (version 3.9.5). We created an interactive Global Map of Artificial Intelligence Benchmark Dynamics using the graphical library Plotly.express (version 5.10, plotly.com/python/ plotly-express) in dedicated Jupyter notebooks using Python (see Code availability) For the creation of SOMs we used the Python library MiniSom (version 2.3.0, github.com/JustGlowing/minisom). We used Tunc's implementation (www.kaggle.com/izzettunc/introduction-to-timeseries-clustering) to analyze our trajectories. The SOM parameters for the time series clustering were sigma = 0.3, learning rate = 0.1, random weight initialization and 50,000 iterations (see Code availability). For retrieving the top-k most similar trajectories to predefined functions we used tslearn (https://github.com/tslearn-team/tslearn/). Trajectories were first resampled to daily frequency, while missing values are filled with previous values (forward fill). Values were normalized to the range [0,1] using min-max normalization. Finally, the trajectory was resampled again into the interval x ℕ | 0 × 1200.
For the creation of top and bottom dataset popularity lists, we split the ranking into two groups of most and least utilized datasets, such that the group of least utilized datasets have roughly the same utilization (i.e., number of papers utilizing the benchmark) as the group of most utilized datasets. Consider P and D as two lists, such that P i is the amount of unique papers utilizing the dataset D i , and P is sorted in descending order. We split the list of datasets D at index k, such that sumðP½0 : kÞ≈sumðP½k : nÞ into two groups D À = D½0 : k and D + = D½k : n. As lenðD À Þ≫lenðD + Þ, we randomly subsampled elements from D À such that lenðD À Þ = lenðD + Þ. For both NLP and computer vision, we each created two lists of top-10 and bottom-10 datasets by using only the the top 10 and bottom 10 datasets from D + and D À respectively.

Statistics
For comparing datasets in the top vs. bottom popularity sets ( Table 2, Supplementary Data 6) we conducted unpaired, one-sided, heteroscedastic t-tests.

Reporting summary
Further information on research design is available in the Nature Portfolio Reporting Summary linked to this article.

Data availability
Source data are provided with this paper. Benchmark data was downloaded from the Papers With Code repository available at https:// github.com/paperswithcode/paperswithcode-data (export date 2022/ 07/30). The curated knowledge graph underlying our analyses was deposited In the Zenodo database under accession code https://doi. org/10.5281/zenodo.7097305a 22 . The supplementary data generated in this study have been deposited in the Zenodo Database under accession code https://doi.org/10.5281/zenodo.7110147 23 .
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/ licenses/by/4.0/.