A faster algorithm for finding Tarski fixed points.

John Fearnley Rahul Savani

Published in: CoRR (2020)

Keyphrases

objective function
dynamic programming
fixed point
k means
learning algorithm
optimal solution
stationary points
bayesian networks
np hard
worst case
sufficient conditions
closed form
posterior probability