Michael Carbin
15 papers · 2019–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🗺️ Taxonomy Completionist (31) 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
👑
Triple Crown
🏆
Grand Slam
🌈
Renaissance Researcher
(5)
💎
Century Club · Bronze
❓
The Questioner
🗃️
Keyword Collector
(57)
🔥
Unstoppable · Bronze
Top co-authors
Research topics
Machine Learning
(14)
Deep Learning
(8)
Optimization & Theory · Machine Learning
(8)
Application Areas
(7)
Artificial Intelligence
(6)
Core AI
(6)
Architectures
(4)
Techniques
(4)
Learning Types · Machine Learning
(3)
Natural Language Processing
(2)
Reinforcement Learning
(2)
Learning Types · Deep Learning
(2)
Methods
(2)
Optimization & Theory · Deep Learning
(2)
Computer Science
(1)
Keywords
neural network pruning
(6)
model compression
(5)
lottery ticket hypothesis
(4)
sparse training
(3)
network pruning
(2)
transfer learning
(2)
reinforcement learning
(2)
magnitude pruning
(2)
network compression
(2)
sample complexity
(2)
weight pruning
(2)
computational complexity
(1)
neural network optimization
(1)
optimal control
(1)
imitation learning
(1)
scaling law
(1)
policy learning
(1)
deep neural network
(1)
weight initialization
(1)
optimal policy
(1)
Papers
Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous Decoding
ICML 2025
Learning to Compile Programs to Neural Networks
ICML 2024
The Cost of Scaling Down Large Language Models: Reducing Model Size Affects Memory before In-context Learning
ICLR 2024
Computably Continuous Reinforcement-Learning Objectives Are PAC-Learnable
AAAI 2023
On the (In)Tractability of Reinforcement Learning for LTL Objectives
IJCAI 2022
Pruning’s Effect on Generalization Through the Lens of Training and Regularization
NeurIPS 2022
On the Predictability of Pruning Across Scales
ICML 2021
Pruning Neural Networks at Initialization: Why Are We Missing the Mark?
ICLR 2021
The Lottery Tickets Hypothesis for Supervised and Self-Supervised Pre-Training in Computer Vision Models
CVPR 2021
Comparing Rewinding and Fine-tuning in Neural Network Pruning
ICLR 2020
Linear Mode Connectivity and the Lottery Ticket Hypothesis
ICML 2020
The Lottery Ticket Hypothesis for Pre-trained BERT Networks
NeurIPS 2020
Compiler Auto-Vectorization with Imitation Learning
NeurIPS 2019
Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks
ICML 2019
The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks
ICLR 2019