资源分类
》 资源 》论文》A Hybrid Algorithm for Convex Semidefinite Optimization

A Hybrid Algorithm for Convex Semidefinite Optimization

2020-02-28 | |  65 |   44 |   0

Abstract

We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general largescale semidefinite programs and hence can be readily applied to a variety of machine learning problems. We show experimental results on three machine learning problems. Our approach outperforms state-of-the-art algorithms.

上一篇：The Kernelized Stochastic Batch Perceptron

下一篇：Estimating the Hessian by Back-propagating Curvature

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...