Skip to content
Back to skills

Tabularmath Eval

ASecurity

Evaluates computational extrapolation and algorithmic generalization in tabular learning models by testing their ability to predict target values outside the training distribution. It probes whether models learn statistical interpolation versus deterministic computation on program-verified synthetic math problems. Use when the user wants to benchmark on TabularMath, or asks about evaluating this task. Reports rounded consistency.

  • 3 stars
  • 0 votes
  • 0 copies
  • 0 views
  • Added September 11, 2026
researchpythongotestinggit

Security analysis

A100/100

Scanned September 11, 2026

npx -y skills add qhjqhj00/research-skills-pool --skill tabularmath-eval --agent claude-code

Installs into .claude/skills of the current project.

Are you the author of Tabularmath Eval?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for Tabularmath Eval
[![Security: A — Skills Directory](https://www.skillsdirectory.com/api/skills/qhjqhj00-tabularmath-eval/badge)](https://www.skillsdirectory.com/skills/qhjqhj00-tabularmath-eval)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
---
name: tabularmath-eval
description: Evaluates computational extrapolation and algorithmic generalization in tabular learning models by testing their ability to predict target values outside the training distribution. It probes whether models learn statistical interpolation versus deterministic computation on program-verified synthetic math problems. Use when the user wants to benchmark on TabularMath, or asks about evaluating this task. Reports rounded consistency.
metadata:
  skill_kind: dataset_eval
  source_arxiv: 2602.02523
  bibtex_key: [REDACTED]
  confidence: high
---

# tabularmath-eval

> TabularMath: Evaluating Computational Extrapolation in Tabular Learning via Program-Verified Synthesis — Cheng et al. (2026) (arXiv:2602.02523, 2026)

## What this evaluates

Evaluates computational extrapolation and algorithmic generalization in tabular learning models by testing their ability to predict target values outside the training distribution. It probes whether models learn statistical interpolation versus deterministic computation on program-verified synthetic math problems.

## Datasets

- **TabularMath** — total 233472; splits: context (-1), query (-1); repo https://github.com/Marco-Cheng/TabularMath

## Metrics

- `rounded consistency` **(primary)** — range: [0, 1]
  - Exact-match accuracy after rounding predictions and ground truth to the nearest integer. Formula: Accuracy = (1/|D_test|) * sum_{i in D_test} 1[round(y_hat_i) == round(y_i)].

## Input / output format

**Input**: Tabular rows with numeric features and a target variable y. Models receive a context set (training rows) to learn the mapping, followed by a query set (test rows) for prediction. For ICL, rows are serialized as structured text prompts.

**Output**: Continuous predicted values for each query row. For ICL models, predictions must be returned as a JSON list of floats corresponding to query rows in order.

## Scoring recipe

```python
def score_rounded_consistency(predictions, gold):
    correct = sum(1 for p, g in zip(predictions, gold) if round(p) == round(g))
    return correct / len(gold)
```

## Common pitfalls

- Data leakage occurs if preprocessing (standardization/imputation) is fit on the full dataset instead of strictly on the context set.
- Confusing input extrapolation with output extrapolation; the OOD split specifically tests output extrapolation where test targets exceed the maximum training target.
- Evaluating ICL models with row caps larger than 128 violates the specified context-length constraints.

## Evidence (verbatim from paper)

> Our primary metric in the paper is *rounded consistency*, defined as exact-match accuracy after rounding predictions to integer, reflecting whether or not the underlying math problem is correctly solved by the model’s prediction: | Accuracy=\frac{1}{|\mathcal{D}_{\text{test}}|}\sum_{i\in\mathcal{D}_{\text{test}}}\mathbf{1}[\mathrm{round}(\hat{y}_{i})\=\mathrm{round}(y_{i})]. | The *rounded consistency* metric reflects the discrete correctness requirement of mathematical problems.

## Citation

```bibtex
@misc{cheng2026tabularmath,
  title={TabularMath: Evaluating Computational Extrapolation in Tabular Learning via Program-Verified Synthesis},
  author={Cheng et al. (2026)},
  year={2026},
  note={arXiv:2602.02523}
}
```

- arXiv: 2602.02523

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…

Newsletter

Get the weekly list of safe new skills, and the ones we pulled.