Research map / Learning theory and algorithms / Sample complexity
Learning convex polytopes with margin
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.
Closest papers by meaning
- A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise (NeurIPS 2024 · similarity 0.86)
- Replicable Learning of Large-Margin Halfspaces (ICML 2024 · similarity 0.84)
- Box Facets and Cut Facets of Lifted Multicut Polytopes (ICML 2024 · similarity 0.84)
- Tight Generalization Bounds for Large-Margin Halfspaces (NeurIPS 2025 · similarity 0.83)
- Improved Dimensionality Dependence for Zeroth-Order Optimisation over Cross-Polytopes (ICML 2024 · similarity 0.83)
- Achieving Margin Maximization Exponentially Fast via Progressive Norm Rescaling (ICML 2024 · similarity 0.83)
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.