相关论文: Weight-partially greedy bases and weight-Property …
Grafakos systematically proved that $A_\infty$ weights have different characterizations for cubes in Euclidean spaces in his classical text book. Very recently, Duoandikoetxea, Mart\'{\i}n-Reyes, Ombrosi and Kosz discussed several…
This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is…
We explore solutions for fairly allocating indivisible items among agents assigned weights representing their entitlements. Our fairness goal is weighted-envy-freeness (WEF), where each agent deems their allocated portion relative to their…
We empirically analyze a simple heuristic for large sparse set cover problems. It uses the weighted greedy algorithm as a basic building block. By multiplicative updates of the weights attached to the elements, the greedy solution is…
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter…
An $\alpha$-greedy balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of greedy linear extensions of $P$ that put $x$ before $y$ among all greedy linear extensions is in the real…
We study certain double--series inequalities, which are motivated by weighted Hardy inequalities.
We augment Assumption Based Argumentation (ABA for short) with weighted argumentation. In a nutshell, we assign weights to arguments and then derive the weight of attacks between ABA arguments. We illustrate our proposal through running…
In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment which has two new properties; first, it encapsulates both the topological and weight aspects of a network,…
Envy-Freeness is one of the most fundamental and important concepts in fair allocation. Some recent studies have focused on the concept of weighted envy-freeness. Under this concept, each agent is assigned a weight, and their valuations are…
We develop appropriately generalized notions of indexability for problems of dynamic resource allocation where the resource concerned may be assigned more flexibility than is allowed, for example, in classical multi-armed bandits. Most…
The main results in this paper contribute to bring to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well established techniques of classical Banach…
Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…
Two classes of fractional type variable weights are established in this paper. The first kind of weights ${A_{\vec p( \cdot ),q( \cdot )}}$ are variable multiple weights, which are characterized by the weighted variable boundedness of…
We establish a discrete weighted version of Calder\'{o}n-Zygmund decomposition from the perspective of dyadic grid in ergodic theory. Based on the decomposition, we study discrete $A_\infty$ weights. First, characterizations of the reverse…
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
A lot of recent activity in the theory of cluster algebras has been directed towards various constructions of "natural" bases in them. One of the approaches to this problem was developed several years ago by P.Sherman - A.Zelevinsky who…
In [3] it was proved that almost-greedy and semi-greedy bases are equivalent in the context of Banach spaces with finite cotype. In this paper we show this equivalence for general Banach spaces.
The theory of greedy-like bases started in 1999 when S. V. Konyagin and V. N. Temlyakov introduced in \cite{KT} the famous Thresholding Greedy Algorithm. Since this year, different greedy-like bases appeared in the literature, as for…