We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...