Learning the maximum of a Hölder function from inexact data

DOI10.1090/PROC/17456MaRDI QIDQ6864636zbMATH OpenFDO

Authors Simon Foucart

Publication date 3 February 2026

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/17456

zbMATH Keywords

Chebyshev centersHölder functionsinformation-based complexityLipschitz functionsoptimal recovery

Mathematics Subject Classification ID

Lipschitz (Hölder) classes (26A16) Simultaneous approximation (41A28) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Algorithms for approximation of functions (65D15) Minimax problems in mathematical programming (90C47)

Cites work

• Banach lattices
• Finding global minima via kernel approximations
• Finding the minimum of a function
• Handbook of the geometry of Banach spaces. Volume 1
• scientific article; zbMATH DE number 3675205 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• Interpolation of Lipschitz functions
• Mathematical pictures at a data science exhibition
• Monotonicity properties of norms
• Noisy Information and Computational Complexity
• Optimal strategies of the search for an extremum
• Some nonlinear problems are as easy as the approximation problem
• Tractability of multivariate problems. Volume I: Linear information

This page was built for publication: Learning the maximum of a Hölder function from inexact data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864636)