Skip to content
conftrace_

gradient descent

1,421 papers

GD

Papers

Communication trade-offs for Local-SGD with large step size NeurIPS 2019 Comparing EM with GD in Mixture Models of Two Components UAI 2019 Competitive Gradient Descent NeurIPS 2019 Complexity of Highly Parallel Non-Smooth Convex Optimization NeurIPS 2019 Complex Unitary Recurrent Neural Networks Using Scaled Cayley Transform AAAI 2019 Computation Efficient Coded Linear Transform AISTATS 2019 Convergence Guarantees for a Class of Non-convex and Non-smooth Optimization Problems JMLR 2019 Convergence of Gradient Descent on Separable Data AISTATS 2019 DARTS: Differentiable Architecture Search ICLR 2019 DeepView: View Synthesis With Learned Gradient Descent CVPR 2019 Differentiable Game Mechanics JMLR 2019 Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networks ICCV 2019 Differentially Private Empirical Risk Minimization with Smooth Non-Convex Loss Functions: A Non-Stationary View AAAI 2019 Distributed Low-rank Matrix Factorization With Exact Consensus NeurIPS 2019 Efficient Dictionary Learning with Gradient Descent ICML 2019 Efficient Learning of Restricted Boltzmann Machines Using Covariance Estimates ACML 2019 Efficiently escaping saddle points on manifolds NeurIPS 2019 Escaping from saddle points on Riemannian manifolds NeurIPS 2019 Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks ICML 2019 First-Order Algorithms Converge Faster than $O(1/k)$ on Convex Problems ICML 2019 First-order methods almost always avoid saddle points: The case of vanishing step-sizes NeurIPS 2019 Fixing Mini-batch Sequences with Hierarchical Robust Partitioning AISTATS 2019 Game Theoretic Optimization via Gradient-based Nikaido-Isoda Function ICML 2019 Global Convergence of Gradient Descent for Deep Linear Residual Networks NeurIPS 2019 Global Guarantees for Blind Demodulation with Generative Priors NeurIPS 2019