A General Greedy Approximation Algorithm with Applications
نویسنده
چکیده
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class of convex optimization problems. We derive a bound on the rate of approximation for this algorithm, and show that our algorithm includes a number of earlier studies as special cases.
منابع مشابه
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This enables to significantly improve on the approximation ratios of these greedy methods, and gives a unified analysis of greedy for many packing problems. We show matching lower bounds on the ratios of such greedy methods...
متن کاملOn Subset Selection with General Cost Constraints
This paper considers the subset selection problem with a monotone objective function and a monotone cost constraint, which relaxes the submodular property of previous studies. We first show that the approximation ratio of the generalized greedy algorithm is α2 (1 − 1 eα ) (where α is the submodularity ratio); and then propose POMC, an anytime randomized iterative approach that can utilize more ...
متن کاملLatency Minimization Through Optimal User Matchmaking in Multi-Party Online Applications
To improve the user experience in multi-party online applications, i.e., low gaming lag in online gaming, the maximum latency between any pair of users should be minimized. Considering the multiple preferences of users, i.e., which group a user can join, we address the User Latency Minimization (ULM) problem by performing an optimal matchmaking. This paper proves that the ULM problem is NP-hard...
متن کاملThe Best Rank-One Approximation Ratio of a Tensor Space
Abstract. In this paper we define the best rank-one approximation ratio of a tensor space. It turns out that in the finite dimensional case this provides an upper bound for the quotient of the residual of the best rankone approximation of any tensor in that tensor space and the norm of that tensor. This upper bound is strictly less than one, and it gives a convergence rate for the greedy rank-o...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کامل