MétaCan
Menu
Back to cohort
Record W2770668236 · doi:10.1109/ipin.2017.8115955

Efficient Wi-Fi signal strength maps using sparse Gaussian process models

2017· article· en· W2770668236 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
TopicGaussian Processes and Bayesian Inference
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsHyperparameterComputer scienceGaussian processParametric statisticsGridAlgorithmComputationHyperparameter optimizationKrigingParametric modelGaussianPattern recognition (psychology)Artificial intelligenceMachine learningMathematicsStatistics

Abstract

fetched live from OpenAlex

This objective of this paper is to propose and evaluate a new algorithm to increase the computation and storage efficiency and to reduce the bandwidth requirements of the Wi-Fi received signal strength indicator (RSSI) maps based on Gaussian Process (GP) models. GP models are non-parametric models that estimate the likelihood function of the target variable, in this case the Wi-Fi RSSI values, conditioned on a set of training data. This paper introduces the Parametric Grid Sparse GP (PGSGP) algorithm, to improve the efficiency of using GP maps. The PGSGP reduces the complexity of evaluating the likelihood function, by reducing the number of points in the training dataset, without significant loss of the mapping or positioning accuracy. This is achieved by finding a set of pseudo-inputs arranged over a parametric grid, then optimizing the corresponding target values and the GP model hyperparameters.

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 categoriesScholarly communication
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.894
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0010.001
Open science0.0030.001
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.043
GPT teacher head0.285
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