资源分类
》 资源 》论文》A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

2020-03-02 | |  57 |   38 |   0

Abstract

We propose an algorithmic framework for convex minimization problems of composite functions with two terms: a self-concordant part and a possibly nonsmooth regularization part. Our method is a new proximal Newton algorithm with local quadratic convergence rate. As a specific problem instance, we consider sparse precision matrix estimation problems in graph learning. Via a careful dual formulation and a novel analytic stepsize selection, we instantiate an algorithm within our framework for graph learning that avoids Cholesky decompositions and matrix inversions, making it attractive for parallel and distributed implementations.

上一篇：Block-Coordinate Frank-Wolfe Optimization for Structural SVMs

下一篇：Forecastable Component Analysis

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...