paper-with-me

Papers

The Representation Power of Neural Networks: Breaking the Curse of Dimensionality

2020-12-10 · Moise Blanchard, M. Amine Bennouna

In this paper, we analyze the number of neurons and training parameters that a neural networks needs to approximate multivariate functions of bounded second mixed derivatives -- Korobov functions. We prove upper bounds on these quantities for shallow and deep neural networks, breaking the curse of dimensionality. Our bounds hold for general activation functions, including ReLU. We further prove that these bounds nearly match the minimal number of parameters any continuous function approximator needs to approximate Korobov functions, showing that neural networks are near-optimal function approximators.

📄 PDF Abstract BibTeX arXiv:2012.05451

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Breaking the curse of dimensionality with Isolation Kernel

2021-09-29 · Kai Ming Ting, Takashi Washio, Ye Zhu, Yang Xu

The curse of dimensionality has been studied in different aspects. However, breaking the curse has been elusive. We show for the first time that it is possible to break the curse using the recently introduced Isolation K…

Clustering

What Breaks The Curse of Dimensionality in Deep Learning?

2021-05-21 · NeurIPS 2021 12 · Lechao Xiao, Jeffrey Pennington

Although learning in high dimensions is commonly believed to suffer from the curse of dimensionality, modern machine learning methods often exhibit an astonishing power to tackle a wide range of challenging real-world le…

Deep LearningOpen-Ended Question Answering

Breaking the curse of dimensionality in structured density estimation

2024-10-10 · Robert A. Vandermeulen, Wai Ming Tai, Bryon Aragam

We consider the problem of estimating a structured multivariate density, subject to Markov conditions implied by an undirected graph. In the worst case, without Markovian assumptions, this problem suffers from the curse …

Density Estimation

Breaking the Curse of Dimensionality: On the Stability of Modern Vector Retrieval

2025-12-13 · Vihan Lakshman, Blaise Munyampirwa, Julian Shun, Benjamin Coleman arxiv

Modern vector databases enable efficient retrieval over high-dimensional neural embeddings, powering applications from web search to retrieval-augmented generation. However, classical theory predicts such tasks should su…

The Blessing and Curse of Dimensionality in Safety Alignment

2025-07-27 · Rachel S. Y. Teo, Laziz U. Abdullaev, Tan M. Nguyen arxiv

The focus on safety alignment in large language models (LLMs) has increased significantly due to their widespread adoption across different domains. The scale of LLMs play a contributing role in their success, and the gr…