English
Related papers

Related papers: A remark on approximation with polynomials and gre…

200 papers

Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem…

Machine Learning · Computer Science 2018-10-10 Shahin Shahrampour , Vahid Tarokh

Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…

Dynamical Systems · Mathematics 2020-07-22 Yao-Qiang Li

We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank…

Machine Learning · Statistics 2017-03-09 Rajiv Khanna , Ethan Elenberg , Alexandros G. Dimakis , Sahand Negahban

We describe a parallel approximation algorithm for maximizing monotone submodular functions subject to hereditary constraints on distributed memory multiprocessors. Our work is motivated by the need to solve submodular optimization problems…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-18 Shivaram Gopal , S M Ferdous , Hemanta K. Maji , Alex Pothen

Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the…

Numerical Analysis · Mathematics 2024-12-13 Paul Schwerdtner , Benjamin Peherstorfer

We formulate and discuss a necessary and sufficient condition for polynomials to be dense in a space of continuous functions on the real line, with respect to Bernstein's weighted uniform norm. Equivalently, for a positive finite measure…

Complex Variables · Mathematics 2011-11-01 Alexei Poltoratski

Greedy Sampling Methods (GSMs) are widely used to construct approximate solutions of Configuration Optimization Problems (COPs), where a loss functional is minimized over finite configurations of points in a compact domain. While effective…

Optimization and Control · Mathematics 2026-01-09 Evie Nielen , Oliver Tse

Given a Banach space $X$ and a real number $\alpha\ge 1$, we write: (1) $D(X)\le\alpha$ if, for any locally finite metric space $A$, all finite subsets of which admit bilipschitz embeddings into $X$ with distortions $\le C$, the space $A$…

Functional Analysis · Mathematics 2019-10-10 Sofiya Ostrovska , Mikhail I. Ostrovskii

For certain dynamical systems it is possible to significantly simplify the study of stability by means of the center manifold theory. This theory allows to isolate the complicated asymptotic behavior of the system close to a non-hyperbolic…

Dynamical Systems · Mathematics 2020-09-22 Bernard Haasdonk , Boumediene Hamzi , Gabriele Santin , Dominik Wittwar

Let X be a separable Banach space which admits a separating polynomial; in particular X a separable Hilbert space. Let $f:X \rightarrow R$ be bounded, Lipschitz, and $C^1$ with uniformly continuous derivative. Then for each {\epsilon}>0,…

Functional Analysis · Mathematics 2010-11-23 D. Azagra , R. Fry , L. Keener

A deterministic approximation algorithm is presented for the maximization of non-monotone submodular functions over a ground set of size $n$ subject to cardinality constraint $k$; the algorithm is based upon the idea of interlacing two…

Data Structures and Algorithms · Computer Science 2019-10-28 Alan Kuhnle

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal Greedy Algorithms that contains a wide range of greedy algorithms. In particular, we…

Numerical Analysis · Mathematics 2021-06-07 Anton Dereventsov , Vladimir Temlyakov

We deal with the approximate solution of initial value problems in infinite-dimensional Banach spaces with a Schauder basis. We only allow finite-dimensional algorithms acting in the spaces $\rr^N$, with varying $N$. The error of such…

Numerical Analysis · Mathematics 2018-11-09 Boleslaw Kacewicz , Pawel Przybylowicz

In this article M\"untz spaces $M_{\Lambda ,C}$ of continuous functions supplied with the absolute maximum norm are considered. An approximation of functions in M\"untz spaces $M_{\Lambda ,C}$ of continuous functions by Fourier series is…

Functional Analysis · Mathematics 2018-12-18 S. V. Ludkowski

In this paper we study best \(m\)-term trigonometric approximation in weighted Wiener spaces and its consequences for Besov and Sobolev spaces with bounded mixed derivative/difference. We obtain several sharp asymptotic bounds for weighted…

Functional Analysis · Mathematics 2025-11-21 Moritz Moeller , Serhii Stasyuk , Tino Ullrich

Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…

Classical Analysis and ODEs · Mathematics 2020-10-02 Sorin G. Gal , Constantin Niculescu

It is shown here that if $(Y,\|\cdot\|_Y)$ is a Banach space in which martingale differences are unconditional (a UMD Banach space) then there exists $c=c(Y)\in (0,\infty)$ with the following property. For every $n\in \mathbb{N}$ and…

Functional Analysis · Mathematics 2017-01-18 Tuomas Hytönen , Sean Li , Assaf Naor

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

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