Pith. sign in

REVIEW 2 cited by

Learning Curves for Decision Making in Supervised Machine Learning: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.12150 v2 pith:QZ3QYQD4 submitted 2022-01-28 cs.LG

classification cs.LG
keywords learningalgorithmcurvescurvecertaindecisionmachinemodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Learning curves are a concept from social sciences that has been adopted in the context of machine learning to assess the performance of a learning algorithm with respect to a certain resource, e.g., the number of training examples or the number of training iterations. Learning curves have important applications in several machine learning contexts, most notably in data acquisition, early stopping of model training, and model selection. For instance, learning curves can be used to model the performance of the combination of an algorithm and its hyperparameter configuration, providing insights into their potential suitability at an early stage and often expediting the algorithm selection process. Various learning curve models have been proposed to use learning curves for decision making. Some of these models answer the binary decision question of whether a given algorithm at a certain budget will outperform a certain reference performance, whereas more complex models predict the entire learning curve of an algorithm. We contribute a framework that categorises learning curve approaches using three criteria: the decision-making situation they address, the intrinsic learning curve question they answer and the type of resources they use. We survey papers from the literature and classify them into this framework.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bayesian Neural Scaling Law Extrapolation with Prior-Data Fitted Networks

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A Prior-data Fitted Network with a scaling-law-specific prior gives better point and uncertainty predictions for neural scaling law extrapolation than MCMC, BNSL, and LC-PFN baselines.

  2. PyAWD: A Library for Generating Large Synthetic Datasets of Acoustic Wave Propagation

    cs.LG 2024-11 conditional novelty 4.0 of 10

    PyAWD is a new Python library that turns acoustic wave simulations into PyTorch-ready datasets and demonstrates their use for ML epicenter retrieval and data budgeting.

Pith tools