English
Related papers

Related papers: Sandwiching Polynomials for Geometric Concepts wit…

200 papers

We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…

Numerical Analysis · Mathematics 2018-03-20 Philipp Grohs , Hanne Hardering , Oliver Sander , Markus Sprecher

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

Computational Complexity · Computer Science 2008-05-15 Alexander A. Sherstov

For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…

Complex Variables · Mathematics 2021-02-04 Liudmyla Kryvonos

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

Commutative Algebra · Mathematics 2018-10-19 Jose Martinez-Bernal , Yuriko Pitones , Rafael H. Villarreal

We design quasi-interpolation operators based on piecewise polynomial weight functions of degree less than or equal to $p$ that map into the space of continuous piecewise polynomials of degree less than or equal to $p+1$. We show that the…

Numerical Analysis · Mathematics 2024-04-23 Thomas Führer , Manuel A. Sánchez

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

Machine Learning · Computer Science 2024-10-23 Alexandros Eskenazis , Paata Ivanisvili , Lauritz Streck

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…

Machine Learning · Computer Science 2016-11-17 Luo Luo , Zihao Chen , Zhihua Zhang , Wu-Jun Li

We introduce a new technique for reducing the dimension of the ambient space of low-degree polynomials in the Gaussian space while preserving their relative correlation structure, analogous to the Johnson-Lindenstrauss lemma. As…

Computational Complexity · Computer Science 2017-08-15 Badih Ghazi , Pritish Kamath , Prasad Raghavendra

In this work, we study the mean-field flow for learning subspace-sparse polynomials using stochastic gradient descent and two-layer neural networks, where the input distribution is standard Gaussian and the output only depends on the…

Machine Learning · Computer Science 2025-01-10 Ziang Chen , Rong Ge

We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…

Classical Analysis and ODEs · Mathematics 2017-10-17 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

Functional Analysis · Mathematics 2010-11-23 Miguel Couceiro , Jean-Luc Marichal

The paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…

Numerical Analysis · Mathematics 2017-11-20 Lutz Kämmerer

In this paper, we introduce a new class of structured polynomials, called separable plus lower degree (SPLD) polynomials. The formal definition of an SPLD polynomial, which extends the concept of SPQ polynomials (Ahmadi et al. in Math Oper…

Optimization and Control · Mathematics 2026-02-04 Liguo Jiao , Jae Hyoung Lee , Nguyen Bui Nguyen Thao

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

We introduce new finite-dimensional spaces specifically designed to approximate the solutions to high-frequency Helmholtz problems with smooth variable coefficients in dimension $d$. These discretization spaces are spanned by Gaussian…

Numerical Analysis · Mathematics 2025-02-04 T. Chaumont-Frelet , V. Dolean , M. Ingremeau

Zhang et al. introduced a novel modification of Goldstein's classical subgradient method, with an efficiency guarantee of $O(\varepsilon^{-4})$ for minimizing Lipschitz functions. Their work, however, makes use of a nonstandard subgradient…

Optimization and Control · Mathematics 2022-02-17 Damek Davis , Dmitriy Drusvyatskiy , Yin Tat Lee , Swati Padmanabhan , Guanghao Ye

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

Complex Variables · Mathematics 2023-07-19 Sorin G. Gal , Irene Sabadini

This paper presents new uniform Gaussian strong approximations for empirical processes indexed by classes of functions based on $d$-variate random vectors ($d\geq1$). First, a uniform Gaussian strong approximation is established for general…

Statistics Theory · Mathematics 2024-11-14 Matias D. Cattaneo , Ruiqi Rae Yu

The weights $W_\alpha(x)=\exp{(-|x|^{\alpha})}$ $(\alpha>1)$ form a subclass of Freud weights on the real line. Primarily from a functional analytic angle, we investigate the subspace of $L_2(\mathbb R, W_\alpha^2(x)\,dx)$ consisting of…

Classical Analysis and ODEs · Mathematics 2023-05-31 Rui Xie , Marcel de Jeu