ResearchTrend.AI
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints

Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints

Alexander Rakhlin
Karthik Sridharan
ArXivPDFHTML

Papers citing "Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints"

6 / 6 papers shown
Title
Noisy Tensor Completion via the Sum-of-Squares Hierarchy
Noisy Tensor Completion via the Sum-of-Squares Hierarchy
Boaz Barak
Ankur Moitra
141
41
0
26 Jan 2015
Online Local Learning via Semidefinite Programming
Online Local Learning via Semidefinite Programming
Paul Christiano
33
15
0
20 Mar 2014
Random Spanning Trees and the Prediction of Weighted Graphs
Random Spanning Trees and the Prediction of Weighted Graphs
Nicolò Cesa-Bianchi
Claudio Gentile
Fabio Vitale
Giovanni Zappella
69
47
0
21 Dec 2012
Computational and Statistical Tradeoffs via Convex Relaxation
Computational and Statistical Tradeoffs via Convex Relaxation
V. Chandrasekaran
Michael I. Jordan
79
220
0
05 Nov 2012
Efficient Transductive Online Learning via Randomized Rounding
Efficient Transductive Online Learning via Randomized Rounding
Nicolò Cesa-Bianchi
Ohad Shamir
68
20
0
13 Jun 2011
The Convex Geometry of Linear Inverse Problems
The Convex Geometry of Linear Inverse Problems
V. Chandrasekaran
Benjamin Recht
P. Parrilo
A. Willsky
161
1,338
0
03 Dec 2010