Sciweavers

207 search results - page 20 / 42
» Convexity of the Proximal Average
Sort
View
ICML
2010
IEEE
13 years 8 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
DCG
2010
171views more  DCG 2010»
13 years 7 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 5 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
CISS
2008
IEEE
14 years 2 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar