Research map / Learning theory and algorithms / Kernels and regression theory
Generalization Analysis for Ranking Using Integral Operator
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 the eigenvalue-based bound (Theorem 3) instead of stability and Rademacher bounds | regularized ranking with Hinge loss · simulated data, Fourier kernel | generalization bound convergence rate | Helped |
| use the eigenvalue-based bound (Theorem 4) instead of stability, Rademacher and U-process bounds | regularized ranking with Hinge loss · simulated data, Gaussian kernel | generalization bound convergence rate | Helped |
Closest papers by meaning
- Why High-rank Neural Networks Generalize?: An Algebraic Framework with RKHSs (ICLR 2026 · similarity 0.86)
- Infinite Kernel Learning: Generalization Bounds and Algorithms (AAAI 2017 · similarity 0.86)
- Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel (NeurIPS 2025 · similarity 0.85)
- Generalization Bounds for Rank-sparse Neural Networks (NeurIPS 2025 · similarity 0.84)
- Koopman-based generalization bound: New aspect for full-rank weights (ICLR 2024 · similarity 0.84)
- Fantastic Generalization Measures are Nowhere to be Found (ICLR 2024 · similarity 0.84)
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.