MétaCan
Menu
Back to cohort
Record W1835855307 · doi:10.48550/arxiv.1207.1386

Metrics for Markov Decision Processes with Infinite State Spaces

2012· article· en· W1835855307 on OpenAlexaff
Norm Ferns, Prakash Panangaden, Doina Precup

Bibliographic record

VenuearXiv (Cornell University) · 2012
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsMcGill University
Fundersnot available
KeywordsMarkov decision processMetric (unit)Markov processBisimulationComputer scienceState (computer science)Bellman equationMarkov chainTask (project management)Mathematical optimizationMetric spaceSimilarity (geometry)MathematicsTheoretical computer scienceArtificial intelligenceAlgorithmDiscrete mathematicsMachine learningStatisticsEngineering

Abstract

fetched live from OpenAlex

We present metrics for measuring state similarity in Markov decision processes (MDPs) with infinitely many states, including MDPs with continuous state spaces. Such metrics provide a stable quantitative analogue of the notion of bisimulation for MDPs, and are suitable for use in MDP approximation. We show that the optimal value function associated with a discounted infinite horizon planning task varies continuously with respect to our metric distances.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.036
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.036
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0010.003
Scholarly communication0.0030.007
Open science0.0010.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0020.000

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.087
GPT teacher head0.223
Teacher spread0.137 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations46
Published2012
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicFormal Methods in VerificationFrench-language works237,207