32 citations · 98 across the 32 of their papers we have counts for
8 papers · 1 filter
Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding
Di Wang, Xiangyu Guo, Shi Li +1
In this paper, we study the problem of estimating latent variable models with arbitrarily corrupted samples in high dimensional space ({\em i.e.,} ) where the underlying pa…
Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably
Di Wang, Xiangyu Guo, Chaowen Guan +2
Recently, many machine learning and statistical models such as non-linear regressions, the Single Index, Multi-index, Varying Coefficient Index Models and Two-layer Neural Networks…
Consistent -Median: Simpler, Better and Robust
Xiangyu Guo, Janardhan Kulkarni, Shi Li +1
In this paper we introduce and study the online consistent -clustering with outliers problem, generalizing the non-outlier version of the problem studied in [Lattanzi-Vassilvits…
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, Jakub Tarnawski +1
We consider the classic problem of scheduling jobs with precedence constraints on a set of identical machines to minimize the makespan objective function. Understanding the exact a…
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
Shi Li
We study the classic problem of scheduling precedence constrained unit-size jobs on machines so as to minimize the makespan. In a recent breakthrough, Levey and Roth…
Covering the Relational Join
Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra
In this paper, we initiate a theoretical study of what we call the join covering problem. We are given a natural join query instance on attributes and relations $(R_i)_…
Topology Dependent Bounds For FAQs
Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman +1
In this paper, we prove topology dependent bounds on the number of rounds needed to compute Functional Aggregate Queries (FAQs) studied by Abo Khamis et al. [PODS 2016] in a synchr…
The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
Xiangyu Guo, Janardhan Kulkarni, Shi Li +1
In this paper we study the facility location problem in the online with recourse and dynamic algorithm models. In the online with recourse model, clients arrive one by one and our…