相关论文: Renorming spaces with greedy bases

Subset selection, which aims to select a subset from a ground set to maximize some objective function, arises in various applications such as influence maximization and sensor placement. In real-world scenarios, however, one often needs to…

Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the…

For every Banach space $Z$ with a shrinking unconditional basis satisfying upper $p$-estimates for some $p > 1$, an isomorphically polyhedral Banach space is constructed having an unconditional basis and admitting a quotient isomorphic to…

Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph $G=(U,V,E)$, where the nodes in $V$ are discovered sequentially and nodes…

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…

Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…

We study the existence of pointwise Kadec renormings for Banach spaces of the form $C(K)$. We show in particular that such a renorming exists when $K$ is any product of compact linearly ordered spaces, extending the result for a single…

In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a…

A well-known theorem due to R. C. James states that a Banach space is reflexive if and only if every bounded linear functional attains its norm. In this note we study Banach lattices on which every (real-valued) lattice homomorphism attains…

Motivated by a wide range of applications in data mining and machine learning, we consider the problem of maximizing a submodular function subject to supermodular cost constraints. In contrast to the well-understood setting of cardinality…

Learning methods in Banach spaces are often formulated as regularization problems which minimize the sum of a data fidelity term in a Banach norm and a regularization term in another Banach norm. Due to the infinite dimensional nature of…

We consider weighted banach spaces of holomorphic functions on the upper half plane that are determined by $ \|f\|=\sup_{y>0,-\infty<x<\infty}p(y)|f(x+iy)|<\infty $ for a very large class of weight functions p. We completely solve the…

In many prediction problems, it is not uncommon that the number of variables used to construct a forecast is of the same order of magnitude as the sample size, if not larger. We then face the problem of constructing a prediction in the…

We define and study greedy matchings in vertex-ordered bipartite graphs. It is shown that each vertex-ordered bipartite graph has a unique greedy matching. The proof uses (a weak form of) Newman's lemma. The vertex ordering is called a…

We establish a sharp large deviation principle for renewal-reward processes, supposing that each renewal involves a broad-sense reward taking values in a real separable Banach space. In fact, we demonstrate a weak large deviation principle…

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$.

We prove that the spaces $\ell_p$, $1<p<\infty, p\ne 2$, and all infinite-dimensional subspaces of their quotient spaces do not admit equivalent almost transitive renormings. This is a step towards the solution of the Banach-Mazur rotation…

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…

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…

We survey several results concerning norming Markushevich bases (M-bases, for short), focusing in particular on two recent examples of a weakly compactly generated Banach space with no norming M-basis and of an Asplund space with norming…