538 citations · 2.3k across the 54 of their papers we have counts for
4 papers · 1 filter
Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
Julie Nutini, Behrooz Sepehry, Issam Laradji +3
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Ve…
Fast Patch-based Style Transfer of Arbitrary Style
Tian Qi Chen, Mark Schmidt
Artistic style transfer is an image synthesis problem where the content of an image is reproduced with the style of another. Recent works show that a visually appealing style trans…
Play and Learn: Using Video Games to Train Computer Vision Models
Alireza Shafaei, James J. Little, Mark Schmidt
Video games are a compelling source of annotated data as they can readily provide fine-grained groundtruth for diverse tasks. However, it is not clear whether the synthetically gen…
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Hamed Karimi, Julie Nutini, Mark Schmidt
In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent. This condition is a special case of the Łojasiewicz in…