Newshot

Formalizing the Intrinsic Dimension of Objective Landscapes by a Generalized Notion of Co-dimension

Summary

arXiv:2610.39674v2 Announce Type: replace Abstract: In this work, we formalize the concept of intrinsic dimension of objective landscapes introduced in Li et al. (2018), which measures the structural complexity of learning problems by training along randomly generated subspaces. We define the intrinsic dimension of a set $\Theta\subset\mathbb{R}^p$ as the minimal dimension $d_{\mathrm{int}}(\Theta)$ such that a random plane of dimension $d_{\mathrm{int}}(\Theta)$ in $\mathbb{R}^p$ intersects $\Theta$ with probability one. We show that it is a generalized notion of co-dimension that depends on the global geometry of $\Theta$. We study mathematical properties of the intrinsic dimension and develop techniques to estimate the intrinsic dimension of sets $\Theta$ that arise in learning problems. More specifically, we derive upper and/or lower bounds where $\Theta$ is the set of optimal parameters in student-teacher settings with shallow and deep ReLU networks, including finite and infinite…

Original text(via arXiv stat.ML)

Statistics > Machine Learning

Title:Formalizing the Intrinsic Dimension of Objective Landscapes by a Generalized Notion of Co-dimension

Abstract:In this work, we formalize the concept of intrinsic dimension of objective landscapes introduced in Li et al. (2018), which measures the structural complexity of learning problems by training along randomly generated subspaces. We define the intrinsic dimension of a set $\Theta\subset\mathbb{R}^p$ as the minimal dimension $d_{\mathrm{int}}(\Theta)$ such that a random plane of dimension $d_{\mathrm{int}}(\Theta)$ in $\mathbb{R}^p$ intersects $\Theta$ with probability one. We show that it is a generalized notion of co-dimension that depends on the global geometry of $\Theta$. We study mathematical properties of the intrinsic dimension and develop techniques to estimate the intrinsic dimension of sets $\Theta$ that arise in learning problems. More specifically, we derive upper and/or lower bounds where $\Theta$ is the set of optimal parameters in student-teacher settings with shallow and deep ReLU networks, including finite and infinite sample cases, and with and without regularization. We discuss how our theory leads to novel types of generalization bounds, thereby showing that the intrinsic dimension is a measure of learning complexity. Our results connect techniques from seemingly different areas of machine learning research such as classification of symmetries of ReLU networks and stochastic geometry.
Subjects:Machine Learning (stat.ML) ; Machine Learning (cs.LG); Metric Geometry (math.MG)
Cite as:arXiv:2610.39674 [stat.ML]
(or arXiv:2610.39674v2 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.39674 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv stat.ML
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗