Related papers: On left democracy function

In this paper, we study left $\phi$-biflatness and left $\phi$-biprojectivity of some Banach algebras, where $\phi$ is a non-zero multiplicative linear function. We show that if the Banach algebra $A^{**}$ is left $\phi$-biprojective, then…

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…

Given a finite set of bases $b_1$, $b_2$, \dots, $b_r$ (integers greater than $1$), a multi-base representation of an integer~$n$ is a sum with summands $db_1^{\alpha_1}b_2^{\alpha_2} \cdots b_r^{\alpha_r}$, where the $\alpha_j$ are…

We construct a uniformly bounded orthonormal almost greedy basis for $L_p([0,1])$, $1<p<\infty$. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional…

We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…

We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new ingredient of the paper is that we bound the…

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…

In [25], T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps, with a focus on the $\mathbf n$-$t$-quasi-greedy property that is based on them. Building upon this foundation, our…

In this work, we consider the maximization of submodular functions constrained by independence systems. Because of the wide applicability of submodular functions, this problem has been extensively studied in the literature, on specialized…

We study homomorphisms on the algebra of analytic functions of bounded type on a Banach space. When the domain space lacks symmetric regularity, we show that in every fiber of the spectrum there are evaluations (in higher duals) which do…

Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…

The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy…

We study the existence of global implicit functions for equations defined on open subsets of Banach spaces. The partial derivative with respect to the second variable is only required to have a left inverse instead of being invertible.…

The purpose of this paper is to introduce $\omega$-Chebyshev-greedy and $\omega$-partially greedy approximation classes and to study their relation with $\omega$-approximation spaces, where the latter are a generalization of the classical…

In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights $\varsigma = (s_n)_{n\in\mathbb{N}}$ on each positive integer, we study a more general weight $\omega =…

Partially greedy bases in Banach spaces were introduced by Dilworth et al. as a strictly weaker notion than the (almost) greedy bases. In this paper, we study two natural ways to strengthen the definition of partial greediness. The first…

The concept of bidemocratic pair for a Banach space was introduced in \cite{KS:18}. We construct a family of orthonormal systems $\mathfrak{F}_{l},$ $l\in (0,\infty)$ of functions defined on $[-1,1]$ such that the pair…

For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide range of optimization tasks, where…

The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic…

The contextual bandit literature has traditionally focused on algorithms that address the exploration-exploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in…