The Exact Sample Complexity Gain from Invariances for Kernel Regression

Behrooz Tahmasebi, Stefanie Jegelka
3/24/2023
cs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tahmasebi2023exact,
  title  = {The Exact Sample Complexity Gain from Invariances for Kernel Regression},
  author = {Behrooz Tahmasebi and Stefanie Jegelka},
  year   = {2023},
  eprint = {2303.14269},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.14269v2},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.14269.svg)](https://codeofpaper.com/paper/2303.14269)

Discussion