This repository contains code to replicate the experiments given in NeurIPS 2019 paper "One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizers"
☆50Jul 25, 2024Updated 2 years ago
Alternatives and similar repositories for Generalizing-Lottery-Tickets
Users that are interested in Generalizing-Lottery-Tickets are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Implementing "The Lottery Ticket Hypothesis" paper by "Jonathan Frankle, Michael Carbin"☆34Mar 28, 2024Updated 2 years ago
- ☆144Mar 24, 2023Updated 3 years ago
- Code for reproducing figures and results in the paper ``Early stopping in deep networks: Double descent and how to eliminate it''☆15Jun 27, 2022Updated 4 years ago
- A repository in preparation for open-sourcing lottery ticket hypothesis code.☆640Sep 6, 2022Updated 4 years ago
- ☆68Mar 4, 2020Updated 6 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A reimplementation of "The Lottery Ticket Hypothesis" (Frankle and Carbin) on MNIST.☆730Jul 27, 2020Updated 6 years ago
- Codebase for the paper "A Gradient Flow Framework for Analyzing Network Pruning"☆20Jan 31, 2021Updated 5 years ago
- Code for "Picking Winning Tickets Before Training by Preserving Gradient Flow" https://openreview.net/pdf?id=SkgsACVKPH☆106Feb 18, 2020Updated 6 years ago
- Code and checkpoints of compressed networks for the paper titled "HYDRA: Pruning Adversarially Robust Neural Networks" (NeurIPS 2020) (ht…☆92Dec 22, 2022Updated 3 years ago
- Unsupervised spoken sentence embeddings☆14Dec 14, 2022Updated 3 years ago
- Official PyTorch implementation of "EvoGrad: Efficient Gradient-Based Meta-Learning and Hyperparameter Optimization"☆23Oct 24, 2021Updated 4 years ago
- Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot☆43Nov 8, 2020Updated 5 years ago
- Code accompanying our paper "Finding trainable sparse networks through Neural Tangent Transfer" to be published at ICML-2020.☆13Jun 14, 2020Updated 6 years ago
- ☆13Mar 8, 2020Updated 6 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Gradient-based Hyperparameter Optimization Over Long Horizons☆14Sep 29, 2021Updated 5 years ago
- Computing various measures and generalization bounds on convolutional and fully connected networks☆35Dec 13, 2018Updated 7 years ago
- Delta Orthogonal Initialization for PyTorch☆18Jun 27, 2018Updated 8 years ago
- Linear UCB bandit learning algorithm L Li(2010) python code☆19Oct 6, 2014Updated 12 years ago
- This project attacked widely-used EEG spellers, e.g., P300 spellers and SSVEP spellers, with adversarial perturbation templates. We cons…☆14Jul 14, 2020Updated 6 years ago
- Energy-Aware Neural Architecture Optimization with Fast Splitting Steepest Descent☆14Feb 6, 2020Updated 6 years ago
- [ICLR 2021: Spotlight] Source code for the paper "A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Infer…☆15Feb 16, 2022Updated 4 years ago
- ☆13Feb 12, 2023Updated 3 years ago
- bilevel_augment is a ServiceNow Research project that was started at Element AI.☆27Jun 23, 2022Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Python for streams☆24Jun 28, 2022Updated 4 years ago
- Code for "Supermasks in Superposition"☆127Oct 3, 2023Updated 3 years ago
- Lookahead: A Far-sighted Alternative of Magnitude-based Pruning (ICLR 2020)☆32Oct 25, 2020Updated 5 years ago
- Code for paper "Automatic Neural Network Compression by Sparsity-Quantization Joint Learning: A Constrained Optimization-based Approach"☆21Jul 9, 2020Updated 6 years ago
- ☆14Jan 11, 2024Updated 2 years ago
- Official code for "In Search of Robust Measures of Generalization" (NeurIPS 2020)☆29Dec 22, 2020Updated 5 years ago
- ICML 2020, Estimating Generalization under Distribution Shifts via Domain-Invariant Representations☆23Jun 30, 2020Updated 6 years ago
- DropNet: Reducing Neural Network Complexity via Iterative Pruning (ICML 2020)☆16Aug 24, 2020Updated 6 years ago
- Code for the paper Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift☆39Oct 28, 2020Updated 5 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- ☆17Apr 1, 2020Updated 6 years ago
- RS-IMLE☆44Dec 7, 2024Updated last year
- Pytorch implementation of the paper "SNIP: Single-shot Network Pruning based on Connection Sensitivity" by Lee et al.☆110Apr 23, 2019Updated 7 years ago
- ☆16Dec 8, 2021Updated 4 years ago
- Machine Learning Course Materials, Tsinghua IIIS☆23Aug 6, 2018Updated 8 years ago
- Implementation of knapsack pruning☆27May 26, 2020Updated 6 years ago
- Pose Estimation Errors, the Ultimate Diagnosis☆10Apr 22, 2021Updated 5 years ago