Learning Hierarchical Interactions at Scale: A Convex Optimization Approach
In many learning settings, it is beneficial toaugment the main features with pairwise in-teractions. Such interaction models can beoften enhanced by performing variable selec-tion under the so-calledstrong hierarchycon-straint: an interaction is non-zero only if itsassociated main features are non-z...
Main Authors: | Hazimeh, Hussein (Author), Mazumder, Rahul (Author) |
---|---|
Other Authors: | Sloan School of Management (Contributor), Massachusetts Institute of Technology. Operations Research Center (Contributor) |
Format: | Article |
Language: | English |
Published: |
International Machine Learning Society,
2021-04-06T13:49:15Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Sparse regression at scale: branch-and-bound rooted in first-order optimization
by: Hazimeh, Hussein, et al.
Published: (2022) -
Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives
by: Dedieu, Antoine, et al.
Published: (2022) -
Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
by: Hazimeh, Hussein, et al.
Published: (2021) -
A convex optimization approach for solving large scale linear systems
by: Debora Cores, et al.
Published: (2016-11-01) -
The Tree Ensemble Layer: Differentiability meets Conditional Computation
by: Hazimeh, Hussein, et al.
Published: (2022)