Co-occurring keywords · papers mentioning both
Papers
SpaRCS: Recovering low-rank and sparse matrices from compressive measurements
NeurIPS 2011
Extensions of Generalized Binary Search to Group Identification and Exponential Costs
NeurIPS 2010
Near-Optimal Bayesian Active Learning with Noisy Observations
NeurIPS 2010
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction
NeurIPS 2009
Noisy Generalized Binary Search
NeurIPS 2009
Nonparametric Greedy Algorithms for the Sparse Learning Problem
NeurIPS 2009
On the Consistency of Feature Selection using Greedy Least Squares Regression
JMLR 2009
Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis
NeurIPS 2009
Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models
NeurIPS 2008
Optimal Solutions for Sparse Principal Component Analysis
JMLR 2008
Predicting the Geometry of Metal Binding Sites from Protein Sequence
NeurIPS 2008
Anytime Learning of Decision Trees
JMLR 2007
Bayesian Agglomerative Clustering with Coalescents
NeurIPS 2007
Building Support Vector Machines with Reduced Classifier Complexity
JMLR 2006
On the Complexity of Learning Lexicographic Strategies
JMLR 2006
Greedy Algorithms for Classification -- Consistency, Convergence Rates, and Adaptivity
JMLR 2003
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
JMLR 2002