Cited by 6Machine Learning and AlgorithmsStochastic Gradient Optimization TechniquesGaussian Processes and Bayesian Inference

The Exact Sample Complexity Gain from Invariances for Kernel Regression

Open access
Tahmasebi, Behrooz, Jegelka, Stefanie·2023·Advances in Neural Information Processing Systems 36

Abstract

In practice, encoding invariances into models improves sample complexity. In this work, we study this phenomenon from a theoretical perspective. In particular, we provide minimax optimal rates for kernel ridge regression on compact manifolds, with a target function that is invariant to a group action on the manifold. Our results hold for any smooth compact Lie group action, even groups of positive dimension. For a finite group, the gain effectively multiplies the number of samples by the group size. For groups of positive dimension, the gain is observed by a reduction in the manifold's dimension, in addition to a factor proportional to the volume of the quotient space. Our proof takes the viewpoint of differential geometry, in contrast to the more common strategy of using invariant polynomials. This new geometric viewpoint on learning with invariances may be of independent interest.

Integrity signals

Registry

Crossref · 10.52202/075280-2427

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Removing some symmetries by forcing the predictor to be symmetric has been shown, at least in the statistical setting, to reduce sample complexity.

    “which, at least in the statistical setting, has been shown to reduce sample complexity (Bietti et al., 2021; Tahmasebi and Jegelka, 2023).”

    From Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence (2025) · cites this paper as Tahmasebi and Jegelka, 2023

Cited by

Sorted by citations

Authors
Tahmasebi, B., & Jegelka, S.
Venue
Advances in Neural Information Processing Systems 36
Published
2023
Pages
55616-55646
ISSN
1049-5258 (ISSN-L)
OpenAlex
W7133241310
Cited by
6
References
0
Citations by year
2026: 3 · 2025: 3
FWCI
1.07
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • neural information processing systems (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Funders
  • National Science Foundation (2112665, 2134108, 2022448)
  • Multidisciplinary University Research Initiative (N00014-20-1-2023)
  • Office of Naval Research (N00014-20-1-2023, N00014)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
Keywords
sample complexity, kernel regression, invariance, kernel methods

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review