Related papers: On greedy approximation in complex Banach spaces

Using a strengthening of the concept of $\K$ set, introduced in this paper, we study a certain subclass of the class of $\K$ Banach spaces; the so called strongly $\K$ Banach spaces. This class of spaces includes subspaces of strongly…

We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors.…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…

This paper is devoted to the study of the relatively compact sets in Quasi-Banach function spaces, providing an important improvement of the known results. As an application, we take the final step in establishing a relative compactness…

Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions. The Wasserstein metric used in WGANs is based on a notion of distance between individual images, which…

We study a pair of budget- and performance-constrained weak-submodular maximization problems. For computational efficiency, we explore the use of stochastic greedy algorithms which limit the search space via random sampling instead of the…

In recent work of the authors the notion of a derivation being approximately semi-inner arose as a tool for investigating (approximate) amenability questions for Banach algebras. Here we investigate this property in its own right, together…

Sparsity learning with known grouping structure has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based…

We give a necessary and sufficient condition for amenability of the Banach algebra of approximable operators on a Banach space. We further investigate the relationship between amenability of this algebra and factorization of operators,…

We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We apply this algorithm to the case of simpliciality: it recovers all known simplicial arrangements of lines in a very short time and also produces…

In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new…

We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for $L_1[0,1]^d$ ($d \ge 1$). We prove convergence and uniform boundedness of the weak greedy approximants for all $f \in L_1[0,1]^d$.

Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning directed acyclic graphs, greedy algorithms are popular despite…

The Banach space $E$ has the weakly compact approximation property (W.A.P. for short) if there is a constant $C < \infty$ so that for any weakly compact set $D \subset E$ and $\epsilon > 0$ there is a weakly compact operator $V: E \to E$…

We continue our study of the Thresholding Greedy Algorithm when we restrict the vectors involved in our approximations so that they either are supported on intervals of $\mathbb N$ or have constant coefficients. We introduce and…

We extend Pisier's abstract version of Grothendieck's theorem to general non-locally convex quasi-Banach spaces. We also prove a related result on factoring operators through a Banach space and apply our results to the study of…

We investigate the conditional distributions of two Banach space valued, jointly Gaussian random variables. In particular, we show that these conditional distributions are again Gaussian and that their means and covariances can be…

In this paper we deal with four generalized notions of amenability which are called approximate, approximate weak, approximate cyclic and approximate $n$-weak amenability. The first two were introduced and studied by Ghahramani and Loy in…

We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.

A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…