19 citations · 23 across the 3 of their papers we have counts for
5 papers
Faster Fundamental Graph Algorithms via Learned Predictions
Justin Y. Chen, Sandeep Silwal, Ali Vakilian +1
We consider the question of speeding up classic graph algorithms with machine-learned predictions. In this model, algorithms are furnished with extra advice learned from past or si…
Approximating Fair Clustering with Cascaded Norm Objectives
Eden Chlamtáč, Yury Makarychev, Ali Vakilian
We introduce the -Fair Clustering problem. In this problem, we are given a set of points and a collection of different weight functions . We would like to find a clus…
Improved Local Computation Algorithm for Set Cover via Sparsification
Christoph Grunau, Slobodan Mitrović, Ronitt Rubinfeld +1
We design a Local Computation Algorithm (LCA) for the set cover problem. Given a set system where each set has size at most and each element is contained in at most sets, t…
Learning-Based Low-Rank Approximations
Piotr Indyk, Ali Vakilian, Yang Yuan
We introduce a "learning-based" algorithm for the low-rank decomposition problem: given an matrix , and a parameter , compute a rank- matrix that minimiz…
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
Anders Aamand, Piotr Indyk, Ali Vakilian
\begin{abstract} The frequencies of the elements in a data stream are an important statistical measure and the task of estimating them arises in many applications within data analy…