Coresets for polytope distance

DOI10.1145/1542362.1542370MaRDI QIDQ5370697zbMATHOpenAlexFDO

Authors Martin Jaggi, B. 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 methodssparsitysupport vector machinesapproximation algorithmsgeometric optimizationcoresetspolytope 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)

Recommendations

• On coresets for support vector machines
• scientific article; zbMATH DE number 2079414
• Near-optimal coresets of kernel density estimates
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Near-optimal coresets of kernel density estimates

Cited in

(18)

• Distributed and robust support vector machine
• On the von Neumann and Frank-Wolfe algorithms with away steps
• Near-optimal coresets of kernel density estimates
• Streaming algorithms for extent problems in high dimensions
• Robust vertex enumeration for convex hulls in high dimensions
• A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
• On coresets for support vector machines
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
• Near-optimal coresets of kernel density estimates
• Linear convergence rate for the MDM algorithm for the nearest point problem
• An algorithmic separating hyperplane theorem and its applications
• scientific article; zbMATH DE number 5584308 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• Making sense of economics datasets with evolutionary coresets
• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
• SVM via saddle point optimization: new bounds and distributed algorithms
• A characterization theorem and an algorithm for a convex hull problem
• Coresets for Discrete Integration and Clustering

This page was built for publication: Coresets for polytope distance

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