MétaCan
Menu
Back to cohort
Record W2111583132 · doi:10.1109/acssc.2004.1399379

Actuator networks: distributed evaluation of causal effect

2005· article· en· W2111583132 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
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsMcGill University
Fundersnot available
KeywordsActuatorComputer scienceMaximizationWireless sensor networkFocus (optics)Distributed computingAction (physics)GraphArtificial intelligenceComputer networkTheoretical computer scienceMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

We study sensor-actuator networks, extensions of sensor networks that consist of nodes that both monitor and interact with the environment. In particular, we focus on the evaluation of average causal effect within such networks. We describe a distributed algorithm that enables individual actuator nodes to determine the probable consequences of local action on the global environment and hence decide if such action is conducive to achieving the aims of the network. Our approach represents the relationship between actuation and sensor measurements using a causal graph, and applies a distributed expectation-maximization algorithm to estimate the average causal effect of actuation. We evaluate the effectiveness of our approach through simulations that examine the benefits of including side-information regarding possible event outcomes.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0000.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.263
Teacher spread0.250 · 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