Login / Signup
On the Communication Complexity of Approximate Fixed Points.
Tim Roughgarden
Omri Weinstein
Published in:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
fixed point
approximate value iteration
sufficient conditions
dynamical systems
asymptotic properties
temporal difference learning
neural network
initial conditions
computational complexity
worst case
least squares
belief propagation