Beyond L1: Faster and Better Sparse Models with skglm
We propose a new fast algorithm to estimate any sparse generalized linear model with convex or non-convex separable penalties. Our algorithm is able to solve problems with millions of samples and features in seconds, by relying on coordinate descent, working sets and Anderson acceleration. It handles previously unaddressed models, and is extensively shown to improve state-of-art algorithms. We provide a flexible, scikit-learn compatible package, which easily handles customized datafits and penalties.
Code (2)
Similar Papers 제목 키워드 기반
Sparser, Better, Faster GPU Parsing
Joshua 5.0: Sparser, Better, Faster, Server
At-Scale Sparse Deep Neural Network Inference with Efficient GPU Implementation
This paper presents GPU performance optimization and scaling results for inference models of the Sparse Deep Neural Network Challenge 2020. Demands for network quality have increased rapidly, pushing the size and thus th…
GPUEfficient Sparse Artificial Neural Networks
The brain, as the source of inspiration for Artificial Neural Networks (ANN), is based on a sparse structure. This sparse structure helps the brain to consume less energy, learn easier and generalize patterns better than…
image-classificationImage ClassificationProximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate
Distributed sparse learning with a cluster of multiple machines has attracted much attention in machine learning, especially for large-scale applications with high-dimensional data. One popular way to implement sparse le…
Sparse Learning