Optimization & Theory
7,804 papers (27 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
8
7
12
6
16
9
25
48
45
60
94
150
295
436
675
803
1,010
944
1,346
1,352
463
'10
'15
'20
'25
Papers (including subtopics)
Fixed-Horizon Temporal Difference Methods for Stable Reinforcement Learning
AAAI 2020
Forward and Backward Information Retention for Accurate Binary Neural Networks
CVPR 2020
Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domains
NeurIPS 2020
Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference
AAAI 2020
Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noise
ICML 2020
FracTrain: Fractionally Squeezing Bit Savings Both Temporally and Spatially for Efficient DNN Training
NeurIPS 2020
Frequency Domain Compact 3D Convolutional Neural Networks
CVPR 2020
GAIT-prop: A biologically plausible learning rule derived from backpropagation of error
NeurIPS 2020
GAN Compression: Efficient Architectures for Interactive Conditional GANs
CVPR 2020
Generalization bound of globally optimal non-convex neural network training: Transportation map estimation by infinite dimensional Langevin dynamics
NeurIPS 2020
Generalization Error Bounds of Gradient Descent for Learning Over-Parameterized Deep ReLU Networks
AAAI 2020
Generalization error in high-dimensional perceptrons: Approaching Bayes error with convex optimization
NeurIPS 2020
Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations
CVPR 2020
Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Data
ICML 2020
GhostNet: More Features From Cheap Operations
CVPR 2020
GLAD: Learning Sparse Graph Recovery
ICLR 2020
Glyph: Fast and Accurately Training Deep Neural Networks on Encrypted Data
NeurIPS 2020
Going Deep: Graph Convolutional Ladder-Shape Networks
AAAI 2020
Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection
ICML 2020
Go Wide, Then Narrow: Efficient Training of Deep Thin Networks
ICML 2020
Gradient-based Analysis of NLP Models is Manipulable
EMNLP 2020
Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networks
AISTATS 2020
Gradient Estimation with Stochastic Softmax Tricks
NeurIPS 2020
Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compression
CVPR 2020
Group-Wise Dynamic Dropout Based on Latent Semantic Variations
AAAI 2020