Compact convex projections

MaRDI QIDQ4558556zbMATH OpenFDO

Authors Steffen Grünewälder

Publication date 22 November 2018

Full work available at URL http://jmlr.csail.mit.edu/papers/v18/16-147.html

zbMATH Keywords

conditional gradientconvex setskernel herding algorithm

Mathematics Subject Classification ID

Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Nonparametric regression and quantile regression (62G08) Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Convex programming (90C25)

Recommendations

• Conjugate gradients for kernel machines
• Convergence rates of kernel conjugate gradient for random design regression
• Convergences of regularized algorithms and stochastic gradient methods with random projections
• Learning Theory
• Convergence rates of learning algorithms by random projection

Cites work

• A conditional gradient method with linear rate of convergence for solving convex linear systems
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• Core vector machines: fast SVM training on very large data sets
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 3526459 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Solving semidefinite-quadratic-linear programs using SDPT3
• Some comments on Wolfe's ‘away step’
• Theory of Reproducing Kernels

Cited in

(7)

• On compacta with convex projections
• Kernel conjugate gradient methods with random projections
• Convex combinations of projections
• The gradient projection method for a supporting function on the unit sphere and its applications
• On some problems with multivalued mappings
• Optimization over a probability simplex
• High-precision linear minimization is no slower than projection

Describes a project that uses

Uses Software

• SDPT3

This page was built for publication: Compact convex projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558556)