benchmark
Systematic benchmarking and comparison of algorithms, models, or approaches under identical conditions.
Skill by rafeeqinea
Install
Works with Claude Code, Claude apps, Codex, Cursor, Gemini CLI, GitHub Copilot, VS Code, OpenCode, Goose, Windsurf. Read the repository before you give any tool access to your data.
npx agentmarket install skill/rafeeqinea-benchmark
Asks which of your tools to add it to (Claude Code, Codex, Cursor, VS Code, Windsurf, Gemini CLI, Claude Desktop) and shows the change first. See https://agentmart.dev/cli.
Get the weekly diff
The weekly diff: one email a week with new agent tools, notable updates and grade changes, plus security alerts for tools you follow. Double opt-in, one-click unsubscribe.
About
Use cases: testing, data
Reviews
Write a reviewNo reviews yet. Installed it? Reviews come from verified installers only. How reviews work
Permissions
What this skill can do and what it asks for, from its SKILL.md. Checked Oct 25, 2026.
- Tools
- No tools found
- Secrets
- None asked for
- Install scripts
- None found
Network hosts it talks to 1
codeload.github.com· found in install command
Files it touches
~/.claude/skills/benchmark
What's inside
- Skill name
benchmark- Description
- Systematic benchmarking and comparison of algorithms, models, or approaches under identical conditions. Generates comparison tables, performance profiles, and statistical significance tests. Use this when: - User says "/benchmark" or "benchmark these approaches" - User wants to compare two or more algorithms, models, or methods - User says "which is faster", "which is more accurate", "compare A vs B" - User wants statistical significance testing between approaches - User wants a fair, controlled comparison with identical conditions - User says "run all methods on the same data and compare"
- License
- MIT
- Instructions
- 186 lines in SKILL.md · view on GitHub
Agent Skills spec issues
- allowed-tools: must be a space-separated string
Files (1)
- SKILL.md
SKILL.md (first lines)
# Benchmark — Systematic Comparison of Approaches
You are a benchmarking specialist. Your job is to design and execute fair, rigorous comparisons between algorithms, models, or approaches. Every benchmark must control for confounding variables and report results with statistical rigour.
## Workflow
### Phase 1: Define the Benchmark
1. **Identify the approaches to compare.** List every method/algorithm/model being benchmarked. Ask the user to clarify if the set is ambiguous.
2. **Define the metrics.** Every benchmark must measure at least:
- **Primary metric**: The main quantity of interest (accuracy, iteration count, wall-clock time, loss, etc.)
- **Secondary metrics**: Supporting measurements (memory usage, training time, parameter count, etc.)
- **Cost metric**: What each approach costs (compute time, memory, FLOPs)
3. **Define the test conditions.** What datasets, problem sizes, hardware, and configurations will be used? All approaches must run under IDENTICAL conditions:
- Same hardware (document CPU/GPU, RAM)
- Same data (same train/val/test splits, same random seeds)
- Same evaluation protocol (same metric computation, same number of runs)
- Same software versions (Python, PyTorch, NumPy, etc.)
4. **Define the number of runs.** Single-run benchmarks are unreliable. Minimum 3 runs for timing benchmarks, 5+ for stochastic methods (ML training). Record the random seeds used.
5. **Create the benchmark specification:**
```
Benchmark: Image Classification Model Comparison
Approaches: [ResNet-18, ResNet-50, EfficientNet-B0, Vision Transformer (ViT-S)]
Primary Metric: Top-1 accuracy (%) on test set
Secondary Metrics: inference time (ms/image), parameter count (M), GPU memory (MB)
Test Data: CIFAR-100 test set (10,000 images)
Runs per approach: 5 (seeds: 42, 123, 456, 789, 1024)
Hardware: [document current machine]
```
### Phase 2: Implement
6. **Write a benchmark runner script.** Create a self-contained script that runs all approaches under identical conditions:
```python
import time
import json
import numpy as np
from datetime import datetime
SEEDS = [42, 123, 456, 789, 1024]
APPROACHES = {
"resnet18": resnet18_fn,
"resnet50": resnet50_fn,
"efficientnet_b0": efficientnet_fn,
}
results = {}
for name, approach_fn in APPROACHES.items():
results[name] = {"accuracies": [], "times": [], "losses": []}
for seed in SEEDS:
np.random.seed(seed)
start = time.perf_counter()
accuracy, loss = approach_fn(seed=seed)
elapsed = time.perf_counter() - start
results[name]["accuracies"].append(accuracy)
results[name]["times"].append(elapsed)
results[name]["losses"].append(loss)
# Save raw results
with open("benchmarks/benchmark_results.json", "w") as f:
json.dump(results, f, indent=2)
```
7. **Ensure fairness.** Before running, verify:
- All approaches use the same input data (loaded once, shared)
- No approach gets an unfair warm-up (e.g., JIT compilation on first run)
- GPU cache is cleared between approaches if applicable (`torch.cuda.empty_cache()`)
- Timing excludes setup/teardown that isn't part of the algorithm
### Phase 3: Execute
8. **Run the benchmark.** Execute with full output capture:
```bash
mkdir -p benchmarks
python benchmarks/run_benchmark.py 2>&1 | tee benchmarks/benchmark_output.log
```
9. **Monitor for anomalies.** Watch for:
- One run taking 10x longer than others (system load interference)
- NaN or Inf values in results
- Approaches that fail on some problems but not others
### Phase 4: Analyse
10. **Compute summary statistics.** For each approach and metric:
- Mean
- Standard deviation
- Median (more robust to outliers than mean)
- Min / Max
- 95% confidence interval
```python
import numpy as np
from scipy import stats
for name, data in results.items():
accs = np.array(data["accuracies"])
mean = np.mean(accs)
std = np.std(accs, ddof=1)
ci = stats.t.interval(0.95, len(accs)-1, loc=mean, scale=stats.sem(accs))
print(f"{name}: {mean:.2f} +/- {std:.2f} (95% CI: [{ci[0]:.2f}, {ci[1]:.2f}])")
```
11. **Statistical significance testing.** Compare each approach against the baseline:
```python
from scipy.stats import ttest_ind, mannwhitneyu, wilcoxon
baseline = results["resnet18"]["accuracies"]
for name, data in results.items():
if name == "resnet18":
continue
approach = data["accuracies"]From rafeeqinea/claude-academic-toolkit, MIT.
More from rafeeqinea/claude-academic-toolkit
- 0.409score
self-improve
rafeeqinea
Deep self-analysis and improvement.
SkillDFreshness: DClaude Code - 0.409score
reflect
rafeeqinea
End-of-session reflection.
SkillDFreshness: DClaude Code +9 - 0.409score
explain-file
rafeeqinea
Read a source file and explain every line in depth.
SkillDFreshness: DClaude Code - 0.406score
drive-research
rafeeqinea
Search Google Drive for papers, datasets, documents, and pull files into the conversation.
SkillDFreshness: DClaude Code +9 - 0.406score
notebook-query
rafeeqinea
Query NotebookLM notebooks directly from Claude Code for grounded, citation-backed answers.
SkillDFreshness: DClaude Code +9 - 0.406score
notion-notes
rafeeqinea
Push research notes, experiment results, and session summaries to Notion.
SkillDFreshness: DClaude Code +9 - 0.406score
docs-lookup
rafeeqinea
Fetch the latest documentation for any programming library using Context7.
SkillDFreshness: DClaude Code +9 - 0.406score
debug
rafeeqinea
Structured debugging workflow that teaches the debugging process, not just fixes the bug.
SkillDFreshness: DClaude Code +9 - 0.406score
experiment
rafeeqinea
Run, track, and compare ML experiments with structured logging.
SkillDFreshness: DClaude Code +9 - 0.403score
derive
rafeeqinea
Perform step-by-step mathematical derivations with full explanations and LaTeX output.
SkillDFreshness: DClaude Code +9 - 0.403score
teach
rafeeqinea
Explain any concept from absolute scratch using first principles, analogies, examples, and progressive complexity.
SkillDFreshness: DClaude Code +9
Signals
- Stars
- 0
- Forks
- 0
- Open issues
- 0
- Last commit (this folder)
- Mar 9, 2026 (7 months ago)
From GitHub (fetched Oct 24, 2026).
Details
- License
- MIT
- First seen
- Oct 24, 2026
- Last checked
- Oct 24, 2026
- Source
- GitHubgithub-graphql
More from rafeeqinea
- 0.409score
explain-file
rafeeqinea
Read a source file and explain every line in depth.
SkillDFreshness: DClaude Code - 0.409score
reflect
rafeeqinea
End-of-session reflection.
SkillDFreshness: DClaude Code +9 - 0.409score
self-improve
rafeeqinea
Deep self-analysis and improvement.
SkillDFreshness: DClaude Code - 0.406score
experiment
rafeeqinea
Run, track, and compare ML experiments with structured logging.
SkillDFreshness: DClaude Code +9 - 0.406score
debug
rafeeqinea
Structured debugging workflow that teaches the debugging process, not just fixes the bug.
SkillDFreshness: DClaude Code +9 - 0.406score
docs-lookup
rafeeqinea
Fetch the latest documentation for any programming library using Context7.
SkillDFreshness: DClaude Code +9
Cite this page
benchmark skill. Agent Mart. https://agentmart.dev/skills/rafeeqinea-benchmark (last updated 2026-10-24)