Skip to content
conftrace_
2007 NeurIPS NeurIPS 2007

Hierarchical Penalization

Hierarchical penalization is a generic framework for incorporating prior informa- tion in the fitting of statistical models, when the explicative variables are organized in a hierarchical structure. The penalizer is a convex functional that performs soft selection at the group level, and shrinks variables within each group. This favors solutions with few leading terms in the final combination. The framework, orig- inally derived for taking prior knowledge into account, is shown to be useful in linear regression, when several parameters are used to model the influence of one feature, or in kernel regression, for learning multiple kernels. Keywords – Optimization: constrained and convex optimization. Supervised learning: regression, kernel methods, sparsity and feature selection.

🌉 Interdisciplinary Bridge - Artificial Intelligence and Mathematics & Optimization
📈 Trend Setter - Sparse Optimization
🧭 Keyword Pioneer - group sparsity
🐣 Hot Topic Early Bird - sparse optimization

More from NeurIPS 2007

All NeurIPS 2007 papers →