Co-occurring keywords · papers mentioning both
Papers
Improved Dynamic Regret for Non-degenerate Functions
NeurIPS 2017
Improving RANSAC-Based Segmentation Through CNN Encapsulation
CVPR 2017
Learned Optimizers that Scale and Generalize
ICML 2017
Learning ReLUs via Gradient Descent
NeurIPS 2017
Learning to Learn without Gradient Descent by Gradient Descent
ICML 2017
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
ICML 2017
Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter
ICML 2017
Nonlinear Acceleration of Stochastic Algorithms
NeurIPS 2017
Oracle Complexity of Second-Order Methods for Finite-Sum Problems
ICML 2017
POPPONENT: Highly accurate, individually and socially efficient opponent preference model in bilateral multi issue negotiations (Extended Abstract)
IJCAI 2017
Preventing Gradient Explosions in Gated Recurrent Units
NeurIPS 2017
Programming with a Differentiable Forth Interpreter
ICML 2017
Proposing a Highly Accurate Hybrid Component-Based Factorised Preference Model in Recommender Systems
IJCAI 2017
Recovery Guarantees for One-hidden-layer Neural Networks
ICML 2017
Scalable Planning with Tensorflow for Hybrid Nonlinear Domains
NeurIPS 2017
Sequence to Better Sequence: Continuous Revision of Combinatorial Structures
ICML 2017
Sharpness, Restart and Acceleration
NeurIPS 2017
Solving Most Systems of Random Quadratic Equations
NeurIPS 2017
State Aware Imitation Learning
NeurIPS 2017
Straggler Mitigation in Distributed Optimization Through Data Encoding
NeurIPS 2017
Strongly-Typed Agents are Guaranteed to Interact Safely
ICML 2017
The Shattered Gradients Problem: If resnets are the answer, then what is the question?
ICML 2017
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
ICML 2016
A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
JMLR 2016
Algorithms and matching lower bounds for approximately-convex optimization
NeurIPS 2016