An algorithm for classification from a graph-sparse support
-
Updated
Jan 30, 2019 - Jupyter Notebook
An algorithm for classification from a graph-sparse support
Generalized Linear Models with the Exclusive Lasso Penalty
MLP-Rank: A graph theoretical approach to structured pruning of deep neural networks based on weighted Page Rank centrality as introduced by the related thesis.
INT8 Sparse Tensor Core GEMM for PyTorch — built for Windows
Extending Sparse Dictionary Learning Methods for Adversarial Robustness
Accelerate INT8 sparse inference in PyTorch on Windows with minimal setup. Achieve high performance using Sparse Tensor Cores without Linux dependencies.
Add a description, image, and links to the structured-sparsity topic page so that developers can more easily learn about it.
To associate your repository with the structured-sparsity topic, visit your repo's landing page and select "manage topics."