convergence rate

Rates of Convergence for Nearest Neighbor Classification NeurIPS 2014 SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives NeurIPS 2014 Scaling Up Approximate Value Iteration with Options: Better Policies with Fewer Iterations ICML 2014 Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcing NeurIPS 2014 Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm NeurIPS 2014 Towards an optimal stochastic alternating direction method of multipliers ICML 2014 Accelerated Mini-Batch Stochastic Dual Coordinate Ascent NeurIPS 2013 Accelerating Stochastic Gradient Descent using Predictive Variance Reduction NeurIPS 2013 Approachability, fast and slow COLT 2013 Cluster Trees on Manifolds NeurIPS 2013 Divide and Conquer Kernel Ridge Regression COLT 2013 Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA NeurIPS 2013 Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration ICML 2013 General Oracle Inequalities for Gibbs Posterior with Application to Ranking COLT 2013 Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation NeurIPS 2013 Mixed Optimization for Smooth Functions NeurIPS 2013 Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n) NeurIPS 2013 O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions ICML 2013 On the Convergence of Maximum Variance Unfolding JMLR 2013 On the Mutual Nearest Neighbors Estimate in Regression JMLR 2013 Open Problem: Fast Stochastic Exp-Concave Optimization COLT 2013 Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013 Scale Invariant Conditional Dependence Measures ICML 2013 Stochastic Convex Optimization with Multiple Objectives NeurIPS 2013 Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes ICML 2013