MétaCan
Menu
Back to cohort
Record W66652580 · doi:10.5555/2484920.2485079

Baseline: practical control variates for agent evaluation in zero-sum domains

2013· article· en· W66652580 on OpenAlexaff
Josh Davidson, Christopher Archibald, Michael Bowling

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsVariance reductionControl variatesBaseline (sea)Variance (accounting)Computer scienceReduction (mathematics)EstimatorMonte Carlo methodDomain (mathematical analysis)Overhead (engineering)AlgorithmMathematical optimizationArtificial intelligenceStatisticsMathematicsHybrid Monte Carlo

Abstract

fetched live from OpenAlex

Agent evaluation in stochastic domains can be difficult. The commonplace approach of Monte Carlo evaluation can in-volve a prohibitive number of simulations when the variance of the outcome is high. In such domains, variance reduc-tion techniques are necessary, but these techniques require careful encoding of domain knowledge. This paper intro-duces baseline as a simple approach to creating low vari-ance estimators for zero-sum multi-agent domains with high outcome variance. The baseline method leverages the self play of any available agent to produce a control variate for variance reduction, subverting any extra complexity inher-ent with traditional approaches. The baseline method is also applicable in situations where existing techniques either require extensive implementation overhead or simply can-not be applied. Experimental variance reduction results are shown for both cases using the baseline method. Baseline is shown to surpass state-of-the-art techniques in three-player computer poker and is competitive in two-player computer poker games. Baseline also shows variance reduction in hu-man poker and in a mock Ad Auction tournament from the Trading Agent Competition, domains where variance reduc-tion methods are not typically employed.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.885
Threshold uncertainty score0.672

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.063
GPT teacher head0.360
Teacher spread0.296 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations6
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicArtificial Intelligence in GamesFrench-language works237,207