38 citations · 247 across the 108 of their papers we have counts for
5 papers · 1 filter
M-IHS: An Accelerated Randomized Preconditioning Method Avoiding Costly Matrix Decompositions
Ibrahim Kurban Ozaslan, Mert Pilanci, Orhan Arikan
Momentum Iterative Hessian Sketch (M-IHS) techniques, a group of solvers for large scale regularized linear Least Squares (LS) problems, are proposed and analyzed in detail. Propos…
Faster Least Squares Optimization
Jonathan Lacotte, Mert Pilanci
We investigate iterative methods with randomized preconditioners for solving overdetermined least-squares problems, where the preconditioners are based on a random embedding of the…
Distributed Black-Box Optimization via Error Correcting Codes
Burak Bartan, Mert Pilanci
We introduce a novel distributed derivative-free optimization framework that is resilient to stragglers. The proposed method employs coded search directions at which the objective…
High-Dimensional Optimization in Adaptive Random Subspaces
Jonathan Lacotte, Mert Pilanci, Marco Pavone
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adapt…
Straggler Resilient Serverless Computing Based on Polar Codes
Burak Bartan, Mert Pilanci
We propose a serverless computing mechanism for distributed computation based on polar codes. Serverless computing is an emerging cloud based computation model that lets users run…