Statistical-Computational Trade-offs in Learning Multi-Index Models via Harmonic Analysis
Hugo Latourelle-Vigeant, Theodor Misiakiewicz

TL;DR
This paper analyzes the fundamental limits and algorithms for learning multi-index models using harmonic analysis, providing sharp complexity bounds and spectral methods that adapt to different trade-offs between data and computation.
Contribution
It offers a harmonic-analytic framework for characterizing learning complexity in multi-index models, extending previous Gaussian-specific results and proposing spectral algorithms based on harmonic tensor unfolding.
Findings
Derived sharp statistical and computational lower bounds for MIMs
Constructed spectral algorithms that nearly achieve these bounds
Demonstrated flexible trade-offs between sample size and runtime
Abstract
We study the problem of learning multi-index models (MIMs), where the label depends on the input only through an unknown -dimensional projection . Exploiting the equivariance of this problem under the orthogonal group , we obtain a sharp harmonic-analytic characterization of the learning complexity for MIMs with spherically symmetric inputs -- which refines and generalizes previous Gaussian-specific analyses. Specifically, we derive statistical and computational complexity lower bounds within the Statistical Query (SQ) and Low-Degree Polynomial (LDP) frameworks. These bounds decompose naturally across spherical harmonic subspaces. Guided by this decomposition, we construct a family of spectral algorithms based on harmonic tensor unfolding that sequentially…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Tensor decomposition and applications · Machine Learning and Algorithms
