Convergence and rate of convergence of some greedy algorithms in convex optimization

2014-12-10 · Vladimir Temlyakov

The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization. By approximate version we mean the one where some of evaluations are made with an error. Importance of such versions of greedy-type algorithms in convex optimization and in approximation theory was emphasized in previous literature.

📄 PDF Abstract BibTeX arXiv:1412.3297

Code (0)

등록된 구현이 없습니다.

Tasks

Vocal Bursts Type Prediction

Convergence of Batch Greenkhorn for Regularized Multimarginal Optimal Transport

2021-12-01 · Vladimir Kostic, Saverio Salzo, Massimilano Pontil

In this work we propose a batch version of the Greenkhorn algorithm for multimarginal regularized optimal transport problems. Our framework is general enough to cover, as particular cases, some existing algorithms like S…

Convergence Guarantees for Deep Epsilon Greedy Policy Learning

2021-12-02 · Michael Rawson, Radu Balan

Policy learning is a quickly growing area. As robotics and computers control day-to-day life, their error rate needs to be minimized and controlled. There are many policy learning methods and bandit methods with provable…

reinforcement-learning Reinforcement Learning (RL)

Feature Clustering for Accelerating Parallel Coordinate Descent

2012-12-01 · NeurIPS 2012 12 · Chad Scherrer, Ambuj Tewari, Mahantesh Halappanavar, David Haglin

Large scale $\ell_1$-regularized loss minimization problems arise in numerous applications such as compressed sensing and high dimensional supervised learning, including classification and regression problems. High perf…

Clustering compressed sensing

Sparse Optimization on General Atomic Sets: Greedy and Forward-Backward Algorithms

2019-12-26 · Thomas Zhang

We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include t…

Approximate and Stochastic Greedy Optimization

2017-05-25 · Ye Nan, Bartlett Peter

We consider two greedy algorithms for minimizing a convex function in a bounded convex set: an algorithm by Jones [1992] and the Frank-Wolfe (FW) algorithm. We first consider approximate versions of these algorithms. For…