Research map / Learning theory and algorithms / Prediction and decision losses
Coresets for Near-Convex Functions
Murad Tukan, Alaa Maalouf, Dan Feldman
Read the paperCheck your idea against 137,217 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
- Robust Sparsification via Sensitivity (ICML 2025 · similarity 0.88)
- No Dimensional Sampling Coresets for Classification (ICML 2024 · similarity 0.88)
- Small coresets via negative dependence: DPPs, linear statistics, and concentration (NeurIPS 2024 · similarity 0.86)
- Universal Weak Coreset (AAAI 2024 · similarity 0.86)
- Coresets for Multiple $\ell_p$ Regression (ICML 2024 · similarity 0.85)
- Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes (NeurIPS 2025 · similarity 0.85)
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.
