MétaCan
Menu
Back to cohort
Record W7008264660

Bayesian inference in networks

2011· dissertation· en· W7008264660 on OpenAlexaboutno aff

Bibliographic record

VenueeScholarship@McGill (McGill) · 2011
Typedissertation
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsnot available
Fundersnot available
KeywordsParticle filterInferenceUnobservableImportance samplingMarkov chain Monte CarloApproximate inferenceBayesian probabilityMarkov chainRecursive Bayesian estimationOverhead (engineering)
DOInot available

Abstract

fetched live from OpenAlex

Bayesian inference is a method that can be used to estimate an unknown and/or unobservable parameter based on evidence that is accumulated over time.In this thesis, we apply Bayesian inference techniques in the context of two network-based problems.First, we consider multi-target tracking in networks with superpositional sensors, i.e., sensors that generate measurements equal to the sum of individual contributions of each target.We derive a tractable form for a novel moment-based multi-target filter called the Additive Likelihood Moment (ALM) filter.We show, through simulations, that our particle approximation of the ALM filter is more accurate and computationally efficient than Markov chain Monte Carlo-based particle methods to perform radio-frequency (RF) tomographic tracking of multiple targets.The second problem we study is multi-path available bandwidth estimation in computer networks.We propose a probabilistic-rate-based definition for the available bandwidth, probabilistic available bandwidth (PAB), that addresses flaws of the classical utilizationbased definition and existing estimation tools.We design a network-wide estimation tool that uses factor graphs, belief propagation and adaptive sampling to minimize the overhead.We deploy our tool on the Planet Lab network and show that it can produce accurate estimates of the PAB and achieve significant gains (over 70%) in terms of measurement overhead and latency over a popular estimation tool (Pathload).We extend our tool to i) track PAB in time and ii) use chirps to further reduce the number of required measurements by over 80%.Our simulations and online experiments demonstrate that our tracking algorithm is more accurate than block-based approaches without any significant additional complexity.Above all, I want to thank my supervisor Mark Coates, without whom realizing this thesis would have never been possible.For the past seven years, he has taught me everything I know about academic research in a respectful, collaborative and friendly, yet professional, work environment.I could not have asked for better guidance or for a more comprehensive advisor.I am very grateful for all the technical help I have received from people in my lab over the years.In particular, Prof. Michael Rabbat who has helped me as his own student and treated me as a friend from the very first day he arrived at McGill.His availability, precious advice and contributions have played a significant role in most parts of this thesis.Santosh Nannuru for sharing his Markov Chain Monte Carlo-based algorithm and simulation results and helping out on paper submission.Xi Chen for his time and explanations about radiofrequency tomographic target tracking.My research would not have been possible without the financial support I have received from FQRNT (Fonds Qubcois de la Recherche sur la Nature et les Technologies), the MITACS (Mathematics in Information Technology and Complex Systems) internship program and Mark Coates.For making my life so much easier on a regular basis and allowing me to focus on research, I would like to thank Carrie Serban at the SYTAcom

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.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Research integrity
Consensus categoriesResearch integrity
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.579
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0040.001
Research integrity0.0010.003
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.019
GPT teacher head0.243
Teacher spread0.224 · 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; both teacher heads agree on what is shown here.

Study designTheoretical or conceptual
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

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueeScholarship@McGill (McGill)Same topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207