all AI news
Adversarially-Robust Inference on Trees via Belief Propagation
April 2, 2024, 7:50 p.m. | Samuel B. Hopkins, Anqi Li
stat.ML updates on arXiv.org arxiv.org
Abstract: We introduce and study the problem of posterior inference on tree-structured graphical models in the presence of a malicious adversary who can corrupt some observed nodes. In the well-studied broadcasting on trees model, corresponding to the ferromagnetic Ising model on a $d$-regular tree with zero external field, when a natural signal-to-noise ratio exceeds one (the celebrated Kesten-Stigum threshold), the posterior distribution of the root given the leaves is bounded away from $\mathrm{Ber}(1/2)$, and carries nontrivial …
abstract arxiv belief broadcasting cs.ds inference math.pr math.st nodes posterior propagation robust stat.ml stat.th study tree trees type via
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne