On the Communication Complexity of Approximate Fixed Points.

Tim Roughgarden Omri Weinstein

Published in: FOCS (2016)

Keyphrases

fixed point
approximate value iteration
initial conditions
computational complexity
belief propagation
temporal difference learning
linear logic
asymptotic properties
dynamical systems
worst case
sufficient conditions
free energy
stationary points
bayesian networks
np hard
logic programming