4 papers
Stochastic Optimization and Data Science
Arutyun Avetisyan, Darina Dvinskikh, Alexander Gasnikov +3
This paper aims to motivate stochastic optimization problems from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood…
On weak greedy algorithms
A. S. Spivak, V. N. Temlyakov
The main goal of this paper is twofold. First, we extend some results known in the case of weak greedy algorithms with a scalar parameter to the case of weak greedy algorithms with…
On stability of Weak Greedy Algorithm in the presence of noise
V. N. Temlyakov
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested…
Brief introduction in greedy approximation
V. Temlyakov
Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be…