Name
Title | ||
|---|---|---|
Learning the best algorithm for max-cut, clustering, and other partitioning problems. |
Abstract | ||
|---|---|---|
Many data analysis problems are NP-hard, a reality that has motivated researchers to develop a wealth of approximation algorithms and heuristics over the past few decades. Max-cut, clustering, and many other widely applicable partitioning problems fall into this camp. We focus on two common classes of algorithms that are used for clustering and partitioning problems, including SDP rounding algorithms and agglomerative clustering algorithms with dynamic programming. The best algorithm to use typically depends on the specific application or distribution over instances. A worst-case analysis is often used to compare algorithms, but worst-case instances may not be present in the particular problem domain, and thus may be misleading when determining which algorithm to apply. Therefore, it is necessary to develop optimization methods which return the algorithms and parameters best suited for typical inputs from the application at hand. We address this problem for integer quadratic programming and clustering within a learning-theoretic framework where the learning algorithm is given samples from an application-specific distribution over problem instances and learns an algorithm which performs well over the distribution. We provide sample complexity guarantees and computationally efficient algorithms which optimize an algorithm familyu0027s parameters to best suit typical inputs from a particular application. We analyze these algorithms using the learning-theoretic notion of pseudo-dimension. Along with upper bounds, we provide the first pseudo-dimension lower bounds in this line of work, which require an involved analysis of each algorithm familyu0027s performance on carefully constructed problem instances. Our bounds are tight and therefore nail down the intrinsic complexity of the algorithm classes we analyze, which are significantly more complex than classes commonly used in learning theory. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Data Structures and Algorithms | Canopy clustering algorithm,Approximation algorithm,Fuzzy clustering,Correlation clustering,Algorithm,Constrained clustering,Cluster analysis,Maximum cut,Mathematics,Weighted Majority Algorithm |
DocType | Volume | Citations |
Journal | abs/1611.04535 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria-Florina Balcan | 1 | 1445 | 105.01 |
| vaishnavh nagarajan | 2 | 17 | 4.02 |
| Ellen Vitercik | 3 | 23 | 7.23 |
| Colin White | 4 | 7 | 5.23 |