Skip to content
conftrace_

convergence rate

830 papers

Papers

Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems IJCAI 2017 Follow the Moving Leader in Deep Learning ICML 2017 Gradient Descent Can Take Exponential Time to Escape Saddle Points NeurIPS 2017 Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees NeurIPS 2017 Group Sparse Optimization via lp,q Regularization JMLR 2017 Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression JMLR 2017 Improving Gibbs Sampler Scan Quality with DoGS ICML 2017 Kernel Partial Least Squares for Stationary Data JMLR 2017 Nonlinear Acceleration of Stochastic Algorithms NeurIPS 2017 Optimal Rates for Multi-pass Stochastic Gradient Methods JMLR 2017 Second-Order Stochastic Optimization for Machine Learning in Linear Time JMLR 2017 Sparse Accelerated Exponential Weights AISTATS 2017 Stochastic Composite Least-Squares Regression with Convergence Rate $O(1/n)$ COLT 2017 Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017 Stochastic Optimization with Variance Reduction for Infinite Datasets with Finite Sum Structure NeurIPS 2017 When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent NeurIPS 2017 A General Framework for Consistency of Principal Component Analysis JMLR 2016 Blind Attacks on Machine Learners NeurIPS 2016 Convergence guarantees for kernel-based quadrature rules in misspecified settings NeurIPS 2016 Density Estimation via Discrepancy Based Adaptive Sequential Partition NeurIPS 2016 Fast Algorithms for Segmented Regression ICML 2016 Fast Convergence of Online Pairwise Learning Algorithms AISTATS 2016 Fast Rate Analysis of Some Stochastic Optimization Algorithms ICML 2016 Herded Gibbs Sampling JMLR 2016 Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods NeurIPS 2016