conftrace_

greedy algorithm

242 papers

Explore in graph

Co-occurring keywords

submodular optimization (261) submodular maximization (143) approximation algorithm (630) combinatorial optimization (1039) submodular function (121) approximation guarantee (65) cardinality constraint (71) regret bound (1926) feature selection (649) matroid constraint (50)

Papers

On fast approximate submodular minimization NIPS 2011
Orthogonal Matching Pursuit with Replacement NIPS 2011
Near-Optimal Bayesian Active Learning with Noisy Observations NIPS 2010
Extensions of Generalized Binary Search to Group Identification and Exponential Costs NIPS 2010
On the Consistency of Feature Selection using Greedy Least Squares Regression JMLR 2009
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction NIPS 2009
Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis NIPS 2009
Nonparametric Greedy Algorithms for the Sparse Learning Problem NIPS 2009
Optimal Solutions for Sparse Principal Component Analysis JMLR 2008
Predicting the Geometry of Metal Binding Sites from Protein Sequence NIPS 2008
Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models NIPS 2008
Anytime Learning of Decision Trees JMLR 2007
Bayesian Agglomerative Clustering with Coalescents NIPS 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