NIPS Proceedingsβ

Tianbao Yang

16 Papers

  • Adaptive Negative Curvature Descent with Applications in Non-convex Optimization (2018)
  • Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization (2018)
  • Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions (2018)
  • First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear Time (2018)
  • Adaptive Accelerated Gradient Converging Method under H\"{o}lderian Error Bound Condition (2017)
  • Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter (2017)
  • ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization (2017)
  • Improved Dynamic Regret for Non-degenerate Functions (2017)
  • Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\epsilon)$ (2016)
  • Improved Dropout for Shallow and Deep Learning (2016)
  • Extracting Certainty from Uncertainty: Transductive Pairwise Classification from Pairwise Similarities (2014)
  • Stochastic Convex Optimization with Multiple Objectives (2013)
  • Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent (2013)
  • Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison (2012)
  • Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning (2012)
  • Stochastic Gradient Descent with Only One Projection (2012)