MétaCan
Menu
Back to cohort
Record W2114240352 · doi:10.1109/icas.2009.58

An Adaptive Reinforcement Learning Approach to Policy-Driven Autonomic Management

2009· article· en· W2114240352 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Software Engineering Methodologies
Canadian institutionsWestern University
Fundersnot available
KeywordsReinforcement learningComputer scienceSet (abstract data type)Context (archaeology)Autonomic computingWorkloadKey (lock)Order (exchange)Artificial intelligenceKnowledge managementRisk analysis (engineering)Computer securityBusiness

Abstract

fetched live from OpenAlex

Policies have been explored as a basis for autonomic management. In many cases, there is a need for policy-driven autonomic systems to have the ability to adapt the use of policies based, for example, on past experience, in order to deal with human error or the unpredictability in workload characteristics. This suggests that learning approaches can offer significant potential benefits in providing autonomic systems with the ability to identify preferred uses of existing policies or learn new policies. In this context, we have explored the use of reinforcement learning in adaptive policy-driven autonomic management. A key question is whether a model "learned'' from the use of one set of policies could be applied to another set of "similar'' policies, or whether a new model must be learned from scratch as a result of changes to an active set of policies. In this paper, we illustrate how a reinforcement learning model might be adapted to accommodate such changes.

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.

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.000
metaresearch head score (Gemma)0.000
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.320
Threshold uncertainty score0.598

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.038
GPT teacher head0.299
Teacher spread0.261 · 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