Related papers: Lower-Order Refinements of Greedy Approximation

This paper offers a fresh look at the pumping lemma constant as an upper bound on the information required for learning Context Free Grammars. An objective function based on indirect negative evidence considers the occurrences, and…

The problem of minimization of a quadratic functional depending on great number of binary variables is examined. 3 variants of minimization procedure are studied with the aid of computer simulation for spin-glass matrices. It is shown that…

We show that non of the spaces $(\bigoplus_{n=1}^\infty\ell_p)_{\ell_q}$, $1\le p\not= q<\infty$, have a greedy basis. This solves a problem raised by Dilworth, Freeman, Odell and Schlumprect. Similarly, the spaces…

It is known that greedy methods perform well for maximizing monotone submodular functions. At the same time, such methods perform poorly in the face of non-monotonicity. In this paper, we show - arguably, surprisingly - that invoking the…

The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a $1-1/e$ factor. Although it is well known that this guarantee is essentially…

There are two main aims of the paper. The first one is to extend the criterion for the precompactness of sets in Banach function spaces to the setting of quasi-Banach function spaces. The second one is to extend the criterion for the…

We investigate the existence of equivalent p-norms, 0< p 1, under which conditional symmetric or spreading bases in quasi-Banach spaces become isometric. For spreading bases (which need not be unconditional or even Schauder bases), we…

We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…

A map f between two metric spaces (X,d_1) and (Y,d_2) is called a coarse embedding of X into Y if there exist two nondecreasing functions phi_1, phi_2:[0,\infty) --> [0,\infty) such that: phi_1(d_1(x,y)) \leq d_2(f(x),f(y)) \leq…

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

We study Matching and other related problems in a partial information setting where the agents' utilities for being matched to other agents are hidden and the mechanism only has access to ordinal preference information. Our model is…

We present convergence estimates of two types of greedy algorithms in terms of the metric entropy of underlying compact sets. In the first part, we measure the error of a standard greedy reduced basis method for parametric PDEs by the…

The greedy coloring algorithm shows that a graph of maximum degree at most $\Delta$ has chromatic number at most $\Delta + 1$, and this is tight for cliques. Much attention has been devoted to improving this "greedy bound" for graphs…

The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…

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…

We consider parametrized linear-quadratic optimal control problems and provide their online-efficient solutions by combining greedy reduced basis methods and machine learning algorithms. To this end, we first extend the greedy control…

We identify a quantum lift of the greedy basis for rank 2 coefficient-free cluster algebras. Our main result is that our construction does not depend on the choice of initial cluster, that it builds all cluster monomials, and that it…

We introduce an unconditional concept of almost squareness in order to provide a partial negative answer to the problem of existence of any dual almost square Banach space. We also take advantage of this notion to provide some criterion of…

Let $X$ be a Banach space. We prove that, for a large class of Banach or quasi-Banach spaces $E$ of $X$-valued sequences, the sets $E-\bigcup _{q\in\Gamma}\ell_{q}(X)$, where $\Gamma$ is any subset of $(0,\infty]$, and $E-c_{0}(X)$ contain…

We recently introduced a scale of kernel-based greedy schemes for approximating the solutions of elliptic boundary value problems. The procedure is based on a generalized interpolation framework in reproducing kernel Hilbert spaces and was…