Coresets for polytope distance

DOI10.1145/1542362.1542370zbMath1380.68396OpenAlexW1985142965MaRDI QIDQ5370697

Martin Jaggi, Bernd Gärtner

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/229256

zbMATH Keywords

kernel methodssupport vector machinesapproximation algorithmsgeometric optimizationsparsitycoresetspolytope distance

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (13)

Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ Robust vertex enumeration for convex hulls in high dimensions ⋮ Linear convergence rate for the MDM algorithm for the nearest point problem ⋮ Near-optimal coresets of kernel density estimates ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ An algorithmic separating hyperplane theorem and its applications ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ On the von Neumann and Frank--Wolfe Algorithms with Away Steps ⋮ On coresets for support vector machines ⋮ Unnamed Item ⋮ A characterization theorem and an algorithm for a convex hull problem ⋮ Distributed and Robust Support Vector Machine ⋮ Streaming algorithms for extent problems in high dimensions

This page was built for publication: Coresets for polytope distance