Abstract: The communication class UPP^{cc} is a communication analog of the Turing Machine complexity class PP.

This course will start with gradient based methods in convex optimization starting with gradient descent, proximal point methods and the use of momentum and randomness.

Abstract: A polynomial is said to be multilinear if the individual degree of every variable is at most one in any monomial; and is said to be homogeneous if every monomial in it has the same degree.

Abstract: Many stochastic optimization and empirical dynamic programming algorithms have been proposed in the literature that approximates certain deterministic learning algorithms.

Abstract: We study the complexity of equilibrium computation in discrete preference games.