Binarsity: a penalization for one-hot encoded features in linear supervised learning

MaRDI QIDQ5214207zbMATH OpenFDO

Authors Mokhtar Z. Alaya, Simon Bussy, Stéphane Gaïffas, A. Guilloux

Publication date 7 February 2020

Full work available at URL https://arxiv.org/abs/1703.08619, http://jmlr.csail.mit.edu/papers/v20/17-170.html

zbMATH Keywords

features binarizationoracle inequalitiesproximal methodssparse additive modelingsupervised learningtotal-variation

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Regularizers for structured sparsity
• Structured variable selection with sparsity-inducing norms
• Binarized support vector machines
• Classifiers of support vector machine type with \(\ell_1\) complexity regularization
• Supervised learning via the “hubNet” procedure

Cites work

• Adaptive Lasso and group-Lasso for functional Poisson regression
• Asymptotics for Lasso-type estimators.
• Convex analysis and monotone operator theory in Hilbert spaces
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Foundations of linear and generalized linear models
• Foundations of predictive analytics
• High-dimensional additive modeling
• High-dimensional generalized linear models and the lasso
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 47282 (Why is no real title available?)
• scientific article; zbMATH DE number 1220667 (Why is no real title available?)
• scientific article; zbMATH DE number 700016 (Why is no real title available?)
• scientific article; zbMATH DE number 6982970 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Kullback-Leibler aggregation and misspecified generalized linear models
• Learning the Intensity of Time Events With Change-Points
• On the Bayes-risk consistency of regularized boosting methods.
• On the prediction performance of the Lasso
• Optimal estimation in additive regression models
• Optimization with sparsity-inducing penalties
• Pathwise coordinate optimization
• Random forests
• Scikit-learn: machine learning in Python
• Self-concordant analysis for logistic regression
• Simultaneous analysis of Lasso and Dantzig selector
• Sparse additive models
• Sparsity and Smoothness Via the Fused Lasso
• Sparsity oracle inequalities for the Lasso
• Statistics for high-dimensional data. Methods, theory and applications.
• Stochastic gradient boosting.
• The elements of statistical learning. Data mining, inference, and prediction
• The Group Lasso for Logistic Regression
• The Lasso, correlated design, and improved oracle inequalities
• Uncertainty principles and ideal atomic decomposition

Cited in

(6)

• Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features
• Multiple criteria sorting models and methods. I: Survey of the literature
• Binacox: automatic cut‐point detection in high‐dimensional Cox model with applications in genetics
• ESTIMATION OF A HIGH-DIMENSIONAL COUNTING PROCESS WITHOUT PENALTY FOR HIGH-FREQUENCY EVENTS
• Learning decision catalogues for situated decision making: the case of scoring systems
• A guided tour of multiple criteria sorting models and methods

Describes a project that uses

Uses Software

• UCI
• Scikit
• Tick

This page was built for publication: Binarsity: a penalization for one-hot encoded features in linear supervised learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214207)