Affiliation:
1. IBM Almaden Research Center, San Jose, CA
Abstract
The problem of maximizing a concave function
f(x)
in the unit simplex Δ can be solved approximately by a simple greedy algorithm. For given
k
, the algorithm can find a point
x
(
k
)
on a
k
-dimensional face of Δ, such that
f
(
x
(
k
)
≥
f(x
*
) −
O
(1/
k
). Here
f
(
x
*
) is the maximum value of
f
in Δ, and the constant factor depends on
f
. This algorithm and analysis were known before, and related to problems of statistics and machine learning, such as boosting, regression, and density mixture estimation. In other work, coming from computational geometry, the existence of ϵ-coresets was shown for the minimum enclosing ball problem by means of a simple greedy algorithm. Similar greedy algorithms, which are special cases of the Frank-Wolfe algorithm, were described for other enclosure problems. Here these results are tied together, stronger convergence results are reviewed, and several coreset bounds are generalized or strengthened.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference45 articles.
1. Agarwal P. K. Har-Peled S. and Varadarajan K. R. 2005. Geometric approximation via coresets. In Combinatorial and Computational Geometry MSRI Publications Cambridge University Press 1--30. 2005. Agarwal P. K. Har-Peled S. and Varadarajan K. R. 2005. Geometric approximation via coresets. In Combinatorial and Computational Geometry MSRI Publications Cambridge University Press 1--30. 2005.
2. Ahipasaoglu D. Sun P. and Todd M. J. 2006. Linear convergence of a modified Frank-Wolfe algorithm for computing minimum volume ellipsoids. Tech. rep. 1452 Cornell University. Ahipasaoglu D. Sun P. and Todd M. J. 2006. Linear convergence of a modified Frank-Wolfe algorithm for computing minimum volume ellipsoids. Tech. rep. 1452 Cornell University.
3. Unifying Divergence Minimization and Statistical Inference Via Convex Duality
4. Computational discovery of gene modules and regulatory networks
5. Universal approximation bounds for superpositions of a sigmoidal function
Cited by
144 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献