7 citations · 27 across the 14 of their papers we have counts for
12 papers · 1 filter
Active Regression for Single-Index Models with Unknown Link Functions
Chansophea Wathanak In, Yi Li, Wai Ming Tai +1
This paper studies active regression for single-index models under general -loss with an unknown -Lipschitz link function , formulated as …
On Coresets for Clustering in Small Dimensional Euclidean Spaces
Lingxiao Huang, Ruiyuan Huang, Zengfeng Huang +1
We consider the problem of constructing small coresets for -Median in Euclidean spaces. Given a large set of data points , a coreset is a much smaller set…
Improved Coresets for Clustering with Capacity and Fairness Constraints
Lingxiao Huang, Pinyan Lu, Xuan Wu
We study coresets for clustering with capacity and fairness constraints. Our main result is a near-linear time algorithm to construct -sized $\va…
Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
Lingxiao Huang, Jian Li, Pinyan Lu +1
Designing small-sized \emph{coresets}, which approximately preserve the costs of the solutions for large datasets, has been an important research direction for the past decade. We…
On Optimal Coreset Construction for Euclidean -Clustering
Lingxiao Huang, Jian Li, Xuan Wu
Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the cores…
Near-optimal Coresets for Robust Clustering
Lingxiao Huang, Shaofeng H. -C. Jiang, Jianing Lou +1
We consider robust clustering problems in , specifically -clustering problems (e.g., -Median and -Means with outliers, where the cost for a given center…
The Power of Uniform Sampling for Coresets
Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H. -C. Jiang +4
Motivated by practical generalizations of the classic -median and -means objectives, such as clustering with size constraints, fair clustering, and Wasserstein barycenter, we…
Coresets for Clustering with Missing Values
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We provide the first coreset for clustering points in that have multiple missing values (coordinates). Previous coreset constructions only allow one missing coordina…
Coresets for Clustering in Excluded-minor Graphs and Beyond
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
Coresets are modern data-reduction tools that are widely used in data analysis to improve efficiency in terms of running time, space and communication complexity. Our main result i…
Coresets for Clustering in Graphs of Bounded Treewidth
Daniel Baker, Vladimir Braverman, Lingxiao Huang +3
We initiate the study of coresets for clustering in graph metrics, i.e., the shortest-path metric of edge-weighted graphs. Such clustering problems are essential to data analysis a…
Coresets for Ordered Weighted Clustering
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We design coresets for Ordered k-Median, a generalization of classical clustering problems such as k-Median and k-Center, that offers a more flexible data analysis, like easily com…
-Coresets for Clustering (with Outliers) in Doubling Metrics
Lingxiao Huang, Shaofeng H. -C. Jiang, Jian Li +1
We study the problem of constructing -coresets for the -clustering problem in a doubling metric . An -coreset is a weighted subset $S\sub…