11 citations · 35 across the 24 of their papers we have counts for
26 papers
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
Kangke Cheng, Shihong Song, Guanlin Mo +1
In this paper, we investigate the learning-augmented -median clustering problem, which aims to improve the performance of traditional clustering algorithms by preprocessing the…
Survey on Recent Progress of AI for Chemistry: Methods, Applications, and Opportunities
Hu Ding, Pengxiang Hua, Zhen Huang
The development of artificial intelligence (AI) techniques has brought revolutionary changes across various realms. In particular, the use of AI-assisted methods to accelerate chem…
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
Xiaoyang Xu, Hu Ding
Optimal transport is a fundamental topic that has attracted a great amount of attention from the optimization community in the past decades. In this paper, we consider an interesti…
Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning
Hu Ding
In this paper, we study several important geometric optimization problems arising in machine learning. First, we revisit the Minimum Enclosing Ball (MEB) problem in Euclidean space…
Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers
Hu Ding, Ruomin Huang, Kai Liu +2
In this paper, we study the problem of {\em -center clustering with outliers}. The problem has many important applications in real world, but the presence of outliers can signif…
Coresets for Relational Data and The Applications
Jiaxiang Chen, Qingyuan Yang, Ruomin Huang +1
A coreset is a small set that can approximately preserve the structure of the original input data set. Therefore we can run our algorithm on a coreset so as to reduce the total com…