no code implementations • NeurIPS 2021 • Linus Hamilton, Ankur Moitra
In recent years there has been significant effort to adapt the key tools and ideas in convex optimization to the Riemannian setting.
no code implementations • 14 Jan 2021 • Linus Hamilton, Ankur Moitra
In recent years there has been significant effort to adapt the key tools and ideas in convex optimization to the Riemannian setting.
1 code implementation • 26 Apr 2018 • Zachary Abel, Jeffrey Bosboom, Michael Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
We analyze the computational complexity of the many types of pencil-and-paper-style puzzles featured in the 2016 puzzle video game The Witness.
Computational Complexity
no code implementations • NeurIPS 2017 • Linus Hamilton, Frederic Koehler, Ankur Moitra
As an application, we obtain algorithms for learning Markov random fields on bounded degree graphs on $n$ nodes with $r$-order interactions in $n^r$ time and $\log n$ sample complexity.
