MétaCan
Menu
Back to cohort
Record W2107479312 · doi:10.1109/noms.2008.4575242

Reinforcement learning in policy-driven autonomic management

2008· article· en· W2107479312 on OpenAlexaff
Raphael M. Bahati, Michael Bauer

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsWestern University
Fundersnot available
KeywordsReinforcement learningAutonomic computingComputer scienceContext (archaeology)Set (abstract data type)Order (exchange)Risk analysis (engineering)Work (physics)Knowledge managementProcess managementArtificial intelligenceEngineeringBusinessCloud computing

Abstract

fetched live from OpenAlex

In order to effectively manage todays complex systems, system administrators are turning to automated solutions. Policy-driven management offers significant benefits since the use of policies can make it more straight forward to define and modify systems behavior at run-time, through policy manipulation, rather than through re-engineering. The use of policies within autonomic computing allows system administrators to embed existing knowledge into policies and thereby drive autonomic management. Equally important, however, is a need for autonomic systems to adapt the use of these policies to deal with not only the inherent human error, but also the changes in the configuration of the managed environment and the unpredictability in workloads. This paper reports on the use of reinforcement learning methodologies to determine how to best use a set of enabled policies to meet different performance objectives. The work is presented in the context of an adaptive policy-driven autonomic management system.

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.914
Threshold uncertainty score0.650

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
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.018
GPT teacher head0.244
Teacher spread0.226 · 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
GenreEmpirical

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

Citations3
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicReinforcement Learning in RoboticsFrench-language works237,207