5 citations · 18 across the 6 of their papers we have counts for
9 papers
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem
Kelin Luo, Alexandre M. Florio, Syamantak Das +1
Ride-sharing is an essential aspect of modern urban mobility. In this paper, we consider a classical problem in ride-sharing - the Multi-Vehicle Dial-a-Ride Problem (Multi-Vehicle…
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…
Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks
Chen Ma, Xiangyu Guo, Li Chen +2
One major problem in black-box adversarial attacks is the high query complexity in the hard-label attack setting, where only the top-1 predicted label is available. In this paper,…
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…
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…
On Approximating Degree-Bounded Network Design Problems
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit +3
Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph with edge costs $c \in \mathbb{R}…
Distributed -Clustering for Data with Heavy Noise
Xiangyu Guo, Shi Li
In this paper, we consider the -center/median/means clustering with outliers problems (or the -center/median/means problems) in the distributed setting. Most previous di…