On solving probabilistic linear Diophantine equations

MaRDI QIDQ4999015zbMATH OpenFDO

Authors Patrick Kreitzberg, Oliver Serang

Publication date 9 July 2021

Full work available at URL https://jmlr.csail.mit.edu/papers/v22/17-474.html

zbMATH Keywords

\(L_p\) spaceBayesian inferenceCartesian productconvolutionloopy belief propagationmax-convolutionmax-product inferencenoisy-orsum-product inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 5957368
• Marginalization like a projection
• On computing the multivariate Poisson probability distribution
• A symbolic computation approach to a problem involving multivariate Poisson distributions
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

Cites work

• A bounded p-norm approximation of MAX-convolution for sub-quadratic Bayesian inference on additive factors
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An optimal algorithm for selection in a min-heap
• Computing k-out-of-n System Reliability
• Sequential Minimax Search for a Maximum
• The soft heap

Cited in

(2)

• Lower bounds for solving linear diophantine equations on random access machines
• A unified approach to optimal estimation using diophantine equations

This page was built for publication: On solving probabilistic linear Diophantine equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999015)