32 citations · 57 across the 8 of their papers we have counts for
23 papers
Online Food Delivery to Minimize Maximum Flow Time
Xiangyu Guo, Shi Li, Kelin Luo +1
We study a common delivery problem encountered in nowadays online food-ordering platforms: Customers order dishes online, and the restaurant delivers the food after receiving the o…
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…