Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...