Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 154 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 70 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Recovery of regular ridge functions on the ball (2102.13203v2)

Published 25 Feb 2021 in math.FA, cs.NA, and math.NA

Abstract: We consider the problem of the uniform (in $L_\infty$) recovery of ridge functions $f(x)=\varphi(\langle a,x\rangle)$, $x\in B_2n$, using noisy evaluations $y_1\approx f(x1),\ldots,y_N\approx f(xN)$. It is known that for classes of functions $\varphi$ of finite smoothness the problem suffers from the curse of dimensionality: in order to provide good accuracy for the recovery it is necessary to make exponential number of evaluations. We prove that if $\varphi$ is analytic in a neighborhood of $[-1,1]$ and the noise is very small, $\varepsilon\le\exp(-c\log2n)$, then there is an efficient algorithm that recovers $f$ with good accuracy using $O(n\log2n)$ function evaluations.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.