Coresets for polytope distance
DOI10.1145/1542362.1542370zbMATH Open1380.68396OpenAlexW1985142965MaRDI QIDQ5370697FDOQ5370697
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
Recommendations
kernel methodssparsitysupport vector machinesapproximation algorithmsgeometric optimizationcoresetspolytope distance
Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (16)
- An algorithmic separating hyperplane theorem and its applications
- Robust vertex enumeration for convex hulls in high dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed and Robust Support Vector Machine
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Coresets for Discrete Integration and Clustering
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Linear convergence rate for the MDM algorithm for the nearest point problem
- 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
- Title not available (Why is that?)
- Streaming algorithms for extent problems in high dimensions
- A characterization theorem and an algorithm for a convex hull problem
- On the von Neumann and Frank-Wolfe algorithms with away steps
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)
