Research map / Learning theory and algorithms / Kernels and regression theory
Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Bounds
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use empirical-sensitivity importance sampling to select weighted edges | CoreNet · MNIST, FashionMNIST, and CIFAR-10 | classification accuracy | Helped |
| Use empirical-sensitivity importance sampling to select weighted edges | CoreNet · MNIST, FashionMNIST, and CIFAR-10 | relative output error | Helped |
Closest papers by meaning
- Data-Independent Neural Pruning via Coresets (ICLR 2020 · similarity 0.91)
- Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition (NeurIPS 2021 · similarity 0.90)
- Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions (NeurIPS 2022 · similarity 0.90)
- Does Compression Imply Generalization? A Minimum Description Length Perspective (NeurIPS 2026 · similarity 0.86)
- Slicing Mutual Information Generalization Bounds for Neural Networks (ICML 2024 · similarity 0.86)
- Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks (ICML 2025 · similarity 0.86)
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.