Search Results for author: Jean Lafond

Found 6 papers, 1 papers with code

Diagonal Rescaling For Neural Networks

1 code implementation25 May 2017 Jean Lafond, Nicolas Vasilache, Léon Bottou

We define a second-order neural network stochastic gradient training algorithm whose block-diagonal structure effectively amounts to normalizing the unit activations.

Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems

no code implementations5 Dec 2016 Hoi-To Wai, Jean Lafond, Anna Scaglione, Eric Moulines

The convergence of the proposed algorithm is studied by viewing the decentralized algorithm as an inexact FW algorithm.

Matrix Completion Sparse Learning

On the Online Frank-Wolfe Algorithms for Convex and Non-convex Optimizations

no code implementations5 Oct 2015 Jean Lafond, Hoi-To Wai, Eric Moulines

With a strongly convex stochastic cost and when the optimal solution lies in the interior of the constraint set or the constraint set is a polytope, the regret bound and anytime optimality are shown to be ${\cal O}( \log^3 T / T )$ and ${\cal O}( \log^2 T / T)$, respectively, where $T$ is the number of rounds played.

Low Rank Matrix Completion with Exponential Family Noise

no code implementations24 Feb 2015 Jean Lafond

We first consider an estimator defined as the minimizer of the sum of a log-likelihood term and a nuclear norm penalization and prove an upper bound on the Frobenius prediction risk.

Low-Rank Matrix Completion

Adaptive Multinomial Matrix Completion

no code implementations26 Aug 2014 Olga Klopp, Jean Lafond, Eric Moulines, Joseph Salmon

The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}.

Matrix Completion Multi-class Classification +1

Cannot find the paper you are looking for? You can Submit a new open access paper.