Co-occurring keywords · papers mentioning both
Papers
Moreau-Yosida Regularization for Grouped Tree Structure Learning
NeurIPS 2010
Multi-Stage Dantzig Selector
NeurIPS 2010
Predicting Execution Time of Computer Programs Using Sparse Polynomial Regression
NeurIPS 2010
Probabilistic Multi-Task Feature Selection
NeurIPS 2010
Quadratic Programming Feature Selection
JMLR 2010
SFO: A Toolbox for Submodular Function Optimization
JMLR 2010
Structured sparsity-inducing norms through submodular functions
NeurIPS 2010
Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework
NeurIPS 2010
The Feature Selection Path in Kernel Methods
AISTATS 2010
Efficient and Accurate Lp-Norm Multiple Kernel Learning
NeurIPS 2009
Feature Selection with Ensembles, Artificial Variables, and Redundancy Elimination
JMLR 2009
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction
NeurIPS 2009
Heterogeneous multitask learning with joint sparsity constraints
NeurIPS 2009
On the Consistency of Feature Selection using Greedy Least Squares Regression
JMLR 2009
Particle Swarm Model Selection
JMLR 2009
Sparse and Locally Constant Gaussian Graphical Models
NeurIPS 2009
Sparse Estimation Using General Likelihoods and Non-Factorial Priors
NeurIPS 2009
Submodularity Cuts and Applications
NeurIPS 2009
Toward Provably Correct Feature Selection in Arbitrary Domains
NeurIPS 2009
Ultrahigh Dimensional Feature Selection: Beyond The Linear Model
JMLR 2009
Unsupervised Feature Selection for the k-means Clustering Problem
NeurIPS 2009
Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models
NeurIPS 2008
An Information Criterion for Variable Selection in Support Vector Machines
JMLR 2008
An interior-point stochastic approximation method and an L1-regularized delta rule
NeurIPS 2008
Dynamic visual attention: searching for coding length increments
NeurIPS 2008