all AI news
Reconstruction on Trees and Low-Degree Polynomials. (arXiv:2109.06915v2 [math.PR] UPDATED)
Feb. 23, 2022, 2:12 a.m. | Frederic Koehler, Elchanan Mossel
cs.LG updates on arXiv.org arxiv.org
The study of Markov processes and broadcasting on trees has deep connections
to a variety of areas including statistical physics, graphical models,
phylogenetic reconstruction, MCMC algorithms, and community detection in random
graphs. Notably, the celebrated Belief Propagation (BP) algorithm achieves
optimal performance for the reconstruction problem of predicting the value of
the Markov process at the root of the tree from its values at the leaves.
Recently, the analysis of low-degree polynomials has emerged as a valuable
tool for predicting …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
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
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Research Scientist
@ Meta | Menlo Park, CA
Principal Data Scientist
@ Mastercard | O'Fallon, Missouri (Main Campus)