AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Learning Infinite RBMs with Frank-Wolfe

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Stochastic Frank-Wolfe methods · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Initialize CD from the Frank-Wolfe-learned model instead of random initializationRBM trained with CD · MNIST and Caltech101 Silhouettestest log-likelihoodHelped
Use Frank-Wolfe with early stopping to choose the number of hidden unitsInfinite RBM / FW · MNIST and Caltech101 Silhouettestest log-likelihoodHelped
Train FW-initialized CD versus best of 5 random CD initializations for classification featuresCD initialized by FW · MNIST and Caltech101 classificationclassification errorHelped
Basic FW features versus fully trained CD features when few hidden units are addedFrank-Wolfe RBM · MNIST and Caltech101 classificationclassification errorMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy