Alternatives and similar repositories for fnl_paper:

Users that are interested in fnl_paper are comparing it to the libraries listed below

• facebookresearch / spartan
  Spartan is an algorithm for training sparse neural network models. This repository accompanies the paper "Spartan Differentiable Sparsity…
  ☆24Updated 2 years ago
• JingtongSu / sanity-checking-pruning
  Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot
  ☆42Updated 4 years ago
• VITA-Group / SMC-Bench
  [ICLR 2023] "Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!" Shiwei Liu, Tianlong Chen, Zhenyu Zhang, Xuxi Chen…
  ☆27Updated last year
• IST-DASLab / WoodFisher
  Code accompanying the NeurIPS 2020 paper: WoodFisher (Singh & Alistarh, 2020)
  ☆48Updated 4 years ago
• IlanPrice / DCTpS
  Code for testing DCT plus Sparse (DCTpS) networks
  ☆14Updated 3 years ago
• mil-ad / prospr
  Prospect Pruning: Finding Trainable Weights at Initialization Using Meta-Gradients
  ☆31Updated 2 years ago
• shwinshaker / LipGrow
  An adaptive training algorithm for residual network
  ☆15Updated 4 years ago
• VITA-Group / Sparsity-Win-Robust-Generalization
  [ICLR 2022] "Sparsity Winning Twice: Better Robust Generalization from More Efficient Training" by Tianlong Chen*, Zhenyu Zhang*, Pengjun…
  ☆39Updated 3 years ago
• VITA-Group / Structure-LTH
  [ICML 2022] "Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets" by Tianlong Chen, Xuxi Chen, Xiaolong Ma, Yanzhi Wa…
  ☆32Updated last year
• JonasGeiping / dataaugs
  ☆17Updated 2 years ago
• naver / force
  ☆14Updated 4 years ago
• GATECH-EIC / SuperTickets
  [ECCV 2022] SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning
  ☆19Updated 2 years ago
• VITA-Group / Lifelong-Learning-LTH
  [ICLR 2021] "Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning" by Tianlong Chen*, Zhenyu Zhang*, Sijia Liu, S…
  ☆25Updated 3 years ago
• nick11roberts / XD
  ☆11Updated 2 years ago
• lottery-ticket / rewinding-iclr20-public
  ☆70Updated 5 years ago
• briancheung / superposition
  ☆45Updated 5 years ago
• sjunhongshen / DASH
  ☆22Updated 2 years ago
• minhtannguyen / SRSGD
  Code base for SRSGD.
  ☆28Updated 5 years ago
• RAIVNLab / STR
  Soft Threshold Weight Reparameterization for Learnable Sparsity
  ☆88Updated 2 years ago
• HayeonLee / MetaD2A
  Official PyTorch implementation of "Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets" (ICLR 2021)
  ☆64Updated 7 months ago
• tml-epfl / understanding-sam
  Towards Understanding Sharpness-Aware Minimization [ICML 2022]
  ☆35Updated 2 years ago
• JingzhaoZhang / why-clipping-accelerates
  A pytorch implementation for the LSTM experiments in the paper: Why Gradient Clipping Accelerates Training: A Theoretical Justification f…
  ☆44Updated 5 years ago
• alecwangcq / GraSP
  Code for "Picking Winning Tickets Before Training by Preserving Gradient Flow" https://openreview.net/pdf?id=SkgsACVKPH
  ☆102Updated 5 years ago
• boone891214 / MEST
  [NeurIPS‘2021] "MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge", Geng Yuan, Xiaolong Ma, Yanzhi Wang et al…
  ☆18Updated 3 years ago
• bbartoldson / GeneralizationStabilityTradeoff
  Experiments from "The Generalization-Stability Tradeoff in Neural Network Pruning": https://arxiv.org/abs/1906.03728.
  ☆14Updated 4 years ago
• jfainberg / hashed_nets
  PyTorch implementation of HashedNets
  ☆36Updated last year
• google-research / wide-sparse-nets
  ☆19Updated 4 years ago
• lushleaf / Network-Pruning-Greedy-Forward-Selection
  Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection
  ☆21Updated 4 years ago
• locuslab / intermediate_robustness
  ☆16Updated 3 years ago
• tml-epfl / sgd-sparse-features
  SGD with large step sizes learns sparse features [ICML 2023]
  ☆32Updated last year