Related papers: Lebesgue inequalities for Chebyshev Thresholding G…
In this effort we introduce and analyze a novel reduced basis approach, used to construct an approximating subspace for a given set of data. Our technique, which we call the Natural Greedy Algorithm (NGA), is based on a recursive approach…
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…
We present factorizations of weighted Lebesgue, Ce\-s\` aro and Copson spaces, for weights satisfying the conditions which assure the boundedness of the Hardy's integral operator between weighted Lebesgue spaces. Our results enhance, among…
We compute the code parameters for binary linear codes obtained by greedy constructing the parity check matrix. Then we show that these codes improve the Gilbert-Varshamov (GV) bound on the code size and rate. This result counter proves the…
This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…
We investigate properties of the $m$-th error of approximation by polynomials with constant coefficients $\mathcal{D}_{m}(x)$ and with modulus-constant coefficients $\mathcal{D}_{m}^{\ast}(x)$ introduced by Bern\'a and Blasco (2016) to…
The fact that finite direct sums of two or more mutually different spaces from the family $\{\ell_{p} : 1\le p<\infty\}\cup c_{0}$ fail to have greedy bases is stated in [Dilworth et al., Greedy bases for Besov spaces, Constr. Approx. 34…
The explicit expressions for the strong and the weak rigorous multiplicative perturbation bounds for the Generalized block Cholesky downdating problem are obtained. By bringing together the modified matrix-vector equation approach with the…
In this work, we propose integral global optimality conditions for multiobjective problems not necessarily differentiable. The integral characterization, already known for single objective problems, are extended to multiobjective problems…
This article develops a new theoretical basis for decomposing signals that are formed by the linear superposition of a finite number of modes. Each mode depends nonlinearly upon several parameters; we seek both these parameters and the…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang,…
We introduce a notion of algorithmic stability of learning algorithms---that we term \emph{argument stability}---that captures stability of the hypothesis output by the learning algorithm in the normed space of functions from which…
We propose and analyze batch greedy heuristics for cardinality constrained maximization of non-submodular non-decreasing set functions. We consider the standard greedy paradigm, along with its distributed greedy and stochastic greedy…
We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where…
The aim of this paper is to show that almost greedy bases induce tighter embeddings in superreflexive Banach spaces than in general Banach spaces. More specifically, we show that an almost greedy basis in a superreflexive Banach space…
In this paper we present some new results on the existence of solutions of generalized variational inequalities in real reflexive Banach spaces with Fr\'echet differentiable norms. Moreover, we also give some theorems about the structure of…
For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…
We reconsider some estimates the paper "M. Griebel, P. Oswald, On additive Schwarz preconditioners for sparse grid discretizations. Numer. Math. 66 (1994), 449-463" concerning the hierarchical basis preconditioner for sparse grid…