English
Related papers

Related papers: Discretization and affine approximation in high di…

200 papers

We show that on separable Banach spaces admitting a separating polynomial, any uniformly continuous, bounded, real-valued function can be uniformly approximated by Lipschitz, analytic maps on bounded sets.

Functional Analysis · Mathematics 2009-01-09 R. Fry , L. Keener

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Optimization and Control · Mathematics 2015-07-31 Roxana Heß , Didier Henrion , Jean-Bernard Lasserre , Tien Son Pham

The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are…

Functional Analysis · Mathematics 2010-05-27 Lorenzo D'Ambrosio

We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…

Numerical Analysis · Mathematics 2023-06-01 John Paul Ward

In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…

Optimization and Control · Mathematics 2026-02-11 Adrian Göß , Alexander Martin , Sebastian Pokutta , Kartikey Sharma

We construct a Lipschitz truncation which approximates functions of bounded variation in the area-strict metric. The Lipschitz truncation changes the original function only on a small set similar to Lusin's theorem. Previous results could…

Analysis of PDEs · Mathematics 2019-08-29 Dominic Breit , Lars Diening , Franz Gmeineder

This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…

Machine Learning · Statistics 2025-11-20 Gábor Balázs

We study the Finite-Dimensional Distributions (FDDs) of deep neural networks with randomly initialized weights that have finite-order moments. Specifically, we establish Gaussian approximation bounds in the Wasserstein-$1$ norm between the…

Machine Learning · Statistics 2026-03-05 Krishnakumar Balasubramanian , Nathan Ross

Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…

Classical Analysis and ODEs · Mathematics 2020-12-22 Faruk Temur

We prove Carl's type inequalities for the error of approximation of compact sets K by deep and shallow neural networks. This in turn gives lower bounds on how well we can approximate the functions in K when requiring the approximants to…

Machine Learning · Statistics 2022-12-06 Guergana Petrova , Przemysław Wojtaszczyk

In this paper we give some results about the approximation of a Lipschitz function on a Banach space by means of $\Delta$-convex functions. In particular, we prove that the density of $\Delta$-convex functions in the set of Lipschitz…

Functional Analysis · Mathematics 2009-09-25 Manuel Cepedello Boiso

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2016-02-17 Yurii Kolomoitsev , Tetiana Lomako , Jürgen Prestin

We study the problem of computing the value function from a discretely-observed trajectory of a continuous-time diffusion process. We develop a new class of algorithms based on easily implementable numerical schemes that are compatible with…

Machine Learning · Computer Science 2024-07-09 Wenlong Mou , Yuhua Zhu

The purpose of this article is to develop a machinery to study the capacity of deep neural networks (DNNs) to approximate high-dimensional functions. In particular, we show that DNNs have the expressive power to overcome the curse of…

Numerical Analysis · Mathematics 2026-04-30 Pierfrancesco Beneventano , Patrick Cheridito , Robin Graeber , Arnulf Jentzen , Benno Kuckuck

We investigate Baire classes of strongly affine mappings with values in Fr\'echet spaces. We show, in particular, that the validity of the vector-valued Mokobodzki's result on affine functions of the first Baire class is related to the…

Functional Analysis · Mathematics 2016-09-05 Ondřej F. K. Kalenda , Jiří Spurný

We prove an exponential size separation between depth 2 and depth 3 neural networks (with real inputs), when approximating a $\mathcal{O}(1)$-Lipschitz target function to constant accuracy, with respect to a distribution with support in the…

Machine Learning · Computer Science 2024-11-08 Itay Safran , Daniel Reichman , Paul Valiant

This paper introduces new mixed formulations and discretizations for $m$th-Laplace equations of the form $(-1)^m\Delta^m u=f$ for arbitrary $m=1,2,3,\dots$ based on novel Helmholtz-type decompositions for tensor-valued functions. The new…

Numerical Analysis · Mathematics 2016-07-19 Mira Schedensack

Let $\mathcal{M}$ be a smooth submanifold of $\mathbb{R}^n$ equipped with the Euclidean (chordal) metric. This note considers the smallest dimension $m$ for which there exists a bi-Lipschitz function $f: \mathcal{M} \mapsto \mathbb{R}^m$…

Numerical Analysis · Mathematics 2021-05-31 Mark Iwen , Arman Tavakoli , Benjamin Schmidt

We prove discrete restriction estimates for a broad class of hypersurfaces and varieties of intermediate codimension. For our result about hypersurfaces, we use Bourgain's arithmetic version of the Tomas--Stein method and Magyar's…

Classical Analysis and ODEs · Mathematics 2020-04-07 Brian Cook , Kevin Hughes , Eyvindur Palsson

We prove a conjecture of Kleinbock which gives a clear-cut classification of all extremal affine subspaces of $\mathbb{R}^n$. We also give an essentially complete classification of all Khintchine type affine subspaces, except for some…

Number Theory · Mathematics 2024-02-06 Jing-Jing Huang