Research map / Learning theory and algorithms / Kernels and regression theory
On Contraction of Sequential and Offset Rademacher Complexities
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
- Approximate Inference via Weighted Rademacher Complexity (AAAI 2018 · similarity 0.90)
- Localization, Convexity, and Star Aggregation (NeurIPS 2021 · similarity 0.88)
- On the Rademacher Complexity of Graph Neural Networks: Unifying Expressivity and Geometry (NeurIPS 2026 · similarity 0.88)
- Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel (NeurIPS 2025 · similarity 0.86)
- A New Concentration Inequality for Sampling Without Replacement and Its Application for Transductive Learning (ICML 2025 · similarity 0.86)
- Multiclass Loss Geometry Matters for Generalization of Gradient Descent in Separable Classification (NeurIPS 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.