Sciweavers

3 search results - page 1 / 1
» Regularity Conditions via Quasi-Relative Interior in Convex ...
Sort
View
SIAMJO
2008
84views more  SIAMJO 2008»
13 years 4 months ago
Regularity Conditions via Quasi-Relative Interior in Convex Programming
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
Radu Ioan Bot, Ernö Robert Csetnek, Gert Wank...
JMLR
2012
11 years 7 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 5 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen