Research map / Learning theory and algorithms / Kernels and regression theory
A Sharper Generalization Bound for Divide-and-Conquer Ridge Regression
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
- Effective Distributed Learning with Random Features: Improved Bounds and Algorithms (ICLR 2021 · similarity 0.91)
- Optimal Distributed Learning with Multi-pass Stochastic Gradient Methods (ICML 2018 · similarity 0.88)
- Distributed Nyström Kernel Learning with Communications (ICML 2021 · similarity 0.88)
- One-shot Distributed Ridge Regression in High Dimensions (ICML 2020 · similarity 0.88)
- Slicing Mutual Information Generalization Bounds for Neural Networks (ICML 2024 · similarity 0.86)
- Exactly Tight Information-theoretic Generalization Bounds via Binary Jensen-Shannon Divergence (ICML 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.