Bayesian inference of the climbing grade scale

• URL: http://arxiv.org/abs/2111.08140v1
• Date: Mon, 15 Nov 2021 23:15:03 GMT
• Title: Bayesian inference of the climbing grade scale
• Authors: Alexei Drummond and Alex Popinga
• Abstract summary: We implement inference under the whole-history rating model using Markov chain Monte Carlo. We show that the data conform to assumptions that the climbing grade scale is a logarithmic scale of difficulty.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Climbing grades are used to classify a climbing route based on its perceived difficulty, and have come to play a central role in the sport of rock climbing. Recently, the first statistically rigorous method for estimating climbing grades from whole-history ascent data was described, based on the dynamic Bradley-Terry model for games between players of time-varying ability. In this paper, we implement inference under the whole-history rating model using Markov chain Monte Carlo and apply the method to a curated data set made up of climbers who climb regularly. We use these data to get an estimate of the model's fundamental scale parameter m, which defines the proportional increase in difficulty associated with an increment of grade. We show that the data conform to assumptions that the climbing grade scale is a logarithmic scale of difficulty, like decibels or stellar magnitude. We estimate that an increment in Ewbank, French and UIAA climbing grade systems corresponds to 2.1, 2.09 and 2.13 times increase in difficulty respectively, assuming a logistic model of probability of success as a function of grade. Whereas we find that the Vermin scale for bouldering (V-grade scale) corresponds to a 3.17 increase in difficulty per grade increment. In addition, we highlight potential connections between the logarithmic properties of climbing grade scales and the psychophysical laws of Weber and Fechner.

Related papers

• The Way Up: A Dataset for Hold Usage Detection in Sport Climbing [1.3812010983144802]
  We introduce a dataset of 22 annotated climbing videos, providing ground-truth labels for hold locations, usage order, and time of use.<n>We also explore the application of keypoint-based 2D pose-estimation models for detecting hold usage in sport climbing.
  arXiv  Detail & Related papers  (2025-05-19T08:41:18Z)
• Climbing the Ladder of Reasoning: What LLMs Can-and Still Can't-Solve after SFT? [59.418994222096885]
  We conduct a detailed analysis of model performance on the AIME24 dataset. We categorize questions into four tiers (Easy, Medium, Hard, and Extremely Hard) We find that progression from Easy to Medium tier requires adopting an R1 reasoning style with minimal SFT-1K instances. Exh-level questions present a fundamentally different challenge; they require unconventional problem-solving skills.
  arXiv  Detail & Related papers  (2025-04-16T03:39:38Z)
• Boulder2Vec: Modeling Climber Performances in Professional Bouldering Competitions [0.0]
  We use Probabilistic Matrix Factorization (PMF) to represent the unique characteristics of climbers and problems with latent, multi-dimensional vectors. Our results show that the PMF representations improve predictive performance of professional bouldering competitions by capturing both the overall strength of climbers and their specialized skill sets.
  arXiv  Detail & Related papers  (2024-11-04T18:12:59Z)
• Granularity Matters in Long-Tail Learning [62.30734737735273]
  We offer a novel perspective on long-tail learning, inspired by an observation: datasets with finer granularity tend to be less affected by data imbalance. We introduce open-set auxiliary classes that are visually similar to existing ones, aiming to enhance representation learning for both head and tail classes. To prevent the overwhelming presence of auxiliary classes from disrupting training, we introduce a neighbor-silencing loss.
  arXiv  Detail & Related papers  (2024-10-21T13:06:21Z)
• Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations [62.132347451049455]
  Scale has become a main ingredient in obtaining strong machine learning models. In this work, we argue that scale and training research has been needlessly complex due to reliance on the cosine schedule. We show that weight averaging yields improved performance along the training trajectory, without additional training costs, across different scales.
  arXiv  Detail & Related papers  (2024-05-28T17:33:54Z)
• A comparative study on machine learning approaches for rock mass classification using drilling data [0.3749861135832073]
  Current rock engineering design in drill and blast tunnelling relies on engineers' observational assessments. Measure While Drilling (MWD) data, a high-resolution sensor dataset collected during tunnel excavation, is underutilised. This study aims to automate the translation of MWD data into actionable metrics for rock engineering.
  arXiv  Detail & Related papers  (2024-03-15T15:37:19Z)
• Board-to-Board: Evaluating Moonboard Grade Prediction Generalization [0.0]
  Bouldering is a sport where athletes aim to climb up an obstacle using a set of defined holds called a route. The variation in individual climbers technical and physical attributes and many nuances of an individual route make grading a difficult and often biased task. We apply classical and deep-learning modelling techniques to the 2016, 2017 and 2019 Moonboard datasets.
  arXiv  Detail & Related papers  (2023-11-21T08:16:01Z)
• Small-scale proxies for large-scale Transformer training instabilities [69.36381318171338]
  We seek ways to reproduce and study training stability and instability at smaller scales. By measuring the relationship between learning rate and loss across scales, we show that these instabilities also appear in small models when training at high learning rates. We study methods such as warm-up, weight decay, and the $mu$Param to train small models that achieve similar losses across orders of magnitude of learning rate variation.
  arXiv  Detail & Related papers  (2023-09-25T17:48:51Z)
• Inverse Scaling: When Bigger Isn't Better [80.42834197416444]
  Large language models (LMs) show predictable improvements to overall loss with increased scale. We present evidence for the claim that LMs may show inverse scaling, or worse task performance with increased scale.
  arXiv  Detail & Related papers  (2023-06-15T20:11:23Z)
• The World is Not Binary: Learning to Rank with Grayscale Data for Dialogue Response Selection [55.390442067381755]
  We show that grayscale data can be automatically constructed without human effort. Our method employs off-the-shelf response retrieval models and response generation models as automatic grayscale data generators. Experiments on three benchmark datasets and four state-of-the-art matching models show that the proposed approach brings significant and consistent performance improvements.
  arXiv  Detail & Related papers  (2020-04-06T06:34:54Z)
• Learning to Segment the Tail [91.38061765836443]
  Real-world visual recognition requires handling the extreme sample imbalance in large-scale long-tailed data. We propose a "divide&conquer" strategy for the challenging LVIS task: divide the whole data into balanced parts and then apply incremental learning to conquer each one.
  arXiv  Detail & Related papers  (2020-04-02T09:39:08Z)
• augKlimb: Interactive Data-Led Augmentation of Bouldering Training [0.0]
  Climbing is a popular sport, especially indoors, where climbers can train on man-made routes using artificial holds. Various aspects of adding computer-interaction to climbing have been studied in recent years. There is a large space for research into lightweight tools to aid recreational intermediate climbers.
  arXiv  Detail & Related papers  (2020-01-22T10:26:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.