MétaCan
Menu
Back to cohort
Record W2106919681 · doi:10.1109/noms.2010.5488472

Towards adaptive policy-based management

2010· article· en· W2106919681 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
TopicReinforcement Learning in Robotics
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

The use of learning, in particular reinforcement learning, has been explored in the context of policy-driven autonomic management as a means of aiding decision making. In this context, the autonomic manager “learns” a model about what actions to take, for example, in certain situations. However, when the set of policies changes, the model is typically discarded or, if used, may yield misleading information. In contrast, this paper presents an approach for “re-using” past knowledge - by transforming a model learned from the use of one set of active policies to a new model when those policies change. This means that some of the “learned” knowledge can be utilized within the new environment. This is possible because our approach to modeling learning and adaptation is dependent only on the structure of the policies. Consequently, changes to policies can be mapped onto transformations specific to the model derived from the use of those policies. In this paper, we describe the model construction and policy modifications and elaborate, with a detailed case study, on how such changes could alter the currently learned model. Our analysis of the different kinds of policy modifications also suggest that, in most cases, most of the learned model can still be reused. This can significantly accelerate the learning process, essentially improving the overall quality of service, as the results presented in this paper demonstrate.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.910
Threshold uncertainty score0.436

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.013
GPT teacher head0.255
Teacher spread0.242 · 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

Quick stats

Citations19
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicReinforcement Learning in RoboticsFrench-language works237,207