算法艺术创作
algorithmic-art
通过代码和可调参数创作生成艺术与交互式视觉效果。
corl-experiments【设计与创意】Use when designing or auditing experiments for a CoRL robot-learning paper — seeds and evaluation-episode counts, task-suite breadth, real-robot versus simulation evidence, sim-to-real gap measurement, baseline fairness across BC/RL/VLA families, generalization splits, and statistics for success-rate claims.
独立 GitHub 快照 · 自动分类 · 以原作者文档为准
At CoRL the object under evaluation is a learned policy, which makes the evidence problem statistical twice over: training is stochastic (seeds, data order, initialization) and execution is stochastic (initial states, physics, sensor noise). An experimental design that controls only one of the two is the most common weakness this reviewer pool writes up.
| Claim in the paper | Minimum credible evidence shape |
|---|---|
| "Method X learns task family T" | Multiple training seeds; per-task success over many scripted-reset episodes |
| "X outperforms baseline Y" | Same data, same evaluation protocol, same tuning effort for both; dispersion reported |
| "X transfers sim-to-real" | The same checkpoint evaluated in sim and on hardware; the gap reported as a number |
| "X generalizes to novel objects/scenes/instructions" | Held-out splits defined before training; per-split breakdown, not a pooled average |
| "X scales with data" | ≥3 dataset sizes on the same axis; no two-point "trends" |
| "X runs in real time on the robot" | Latency/frequency measured on the deployed compute, stated with hardware |
The routing consequence: if none of your claims require the last four rows, ask
whether the paper is CoRL-shaped at all (corl-topic-selection).
# Evaluation bookkeeping: per-seed success with a binomial interval,
# then dispersion across seeds — the two layers stay separate.
import numpy as np
from scipy import stats
def summarize(results): # results[seed] = list of 0/1 episode outcomes
per_seed = {}
for seed, eps in results.items():
n, k = len(eps), int(np.sum(eps))
lo, hi = stats.beta.ppf([0.025, 0.975], k + 1, n - k + 1) # Jeffreys-ish CI
per_seed[seed] = dict(rate=k / n, n=n, ci=(lo, hi))
rates = [v["rate"] for v in per_seed.values()]
return per_seed, dict(mean=np.mean(rates), sd=np.std(rates), seeds=len(rates))
Small-n hardware caveat: with 15 trials, a 73% vs 60% difference is not resolvable — either add trials, aggregate over tasks with a paired design, or soften the comparative language.
Robot-learning baselines span imitation (BC, diffusion policies), offline/online RL, and pretrained VLA models — families with wildly different data appetites:
corl-writing-style); a Limitations section that matches the failure cases in
your video reads as credible, and one that contradicts them reads as concealment.[ ] Every abstract-level claim mapped to a table/figure with regime declared
[ ] k seeds x n episodes stated per cell; two randomness layers separated
[ ] Hardware protocol written: resets, success criterion, stopping rule, exclusions
[ ] Same-checkpoint sim/real pairing for any transfer claim; gap printed
[ ] Baselines: fair data, disclosed tuning, pinned provenance, one recent + one simple
[ ] Splits frozen pre-training; per-axis generalization breakdown
[ ] Compute + data volumes reported (GPU-hours, demo counts, env steps)
Evidence norms here are community culture rather than a posted rulebook — they move each year with the field. Calibrate against the newest PMLR volume (v305 = CoRL 2025) and the current reviewer instructions at corl.org.