Lifted coordinate descent for learning with trace-norm regularization - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Lifted coordinate descent for learning with trace-norm regularization

(1) , (2) , (3)
1
2
3

Abstract

We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multi-task learning. Even though the problem is convex, existing approaches rely on optimizing a non-convex variational bound, which is not guaranteed to converge, or repeatedly perform singular-value decomposition, which prevents scaling beyond moderate matrix sizes. We lift the non-smooth convex problem into an infinitely dimensional smooth problem and apply coordinate descent to solve it. We prove that our approach converges to the optimum, and is competitive or outperforms state of the art.
Fichier principal
Vignette du fichier
dhm_2012_rod_atomdescent.pdf (341.23 Ko) Télécharger le fichier
Vignette du fichier
gauge.png (37.74 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Format : Figure, Image
Loading...

Dates and versions

hal-00756802 , version 1 (23-11-2012)

Identifiers

  • HAL Id : hal-00756802 , version 1

Cite

Miro Dudik, Zaid Harchaoui, Jérôme Malick. Lifted coordinate descent for learning with trace-norm regularization. AISTATS - Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics - 2012, Apr 2012, La Palma, Spain. pp.327-336. ⟨hal-00756802⟩
755 View
513 Download

Share

Gmail Facebook Twitter LinkedIn More