Related papers: The Thresholding Greedy Algorithm versus Approxima…
We analyze greedy algorithms for the Hierarchical Aggregation (HAG) problem, a strategy introduced in [Jia et al., KDD 2020] for speeding up learning on Graph Neural Networks (GNNs). The idea of HAG is to identify and remove redundancies in…
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…
In this paper we give an example of a Banach algebra $A$ and a closed ideal $I$ of $A$ such that the multiplier algebra of $I$ is equal to $A$ but $I$ does not have any bounded approximate identity. In the case that $I$ has an approximate…
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame of Banach spaces. The idea is to choose a sequence of fixed (real) coefficients $\{c_n\}_{n=1}^\infty$ and a fixed set of elements…
The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We…
The frame algorithm uses a simple recursive formula to approximate an unknown vector from its frame coefficients. This note introduces an adaptive version of the frame algorithm that maximizes the error reduction between steps in terms of…
We derive new results for the performance of a simple greedy algorithm for finding large independent sets and matchings in constant degree regular graphs. We show that for $r$-regular graphs with $n$ nodes and girth at least $g$, the…
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…
Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of…
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…
We consider a multi-agent model for fair division of mixed manna (i.e. items for which agents can have positive, zero or negative utilities), in which agents have additive utilities for bundles of items. For this model, we give several…
Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…
In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non superreflexive mixed-norm sequence space. As a by-product of our…
In this paper we introduce several extremal sequences of points on locally compact metric spaces and study their asymptotic properties. These sequences are defined through a greedy algorithm by minimizing a certain energy functional whose…
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative…
In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating formulas from a certain subclass of the Broyden family. In particular, this subclass includes the well-known DFP, BFGS and SR1 updates. However,…
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.…
The article is devoted to approximate, global and along curves differentiability of functions over non-archimedean infinite fields with non-trivial valuations. Fields with zero and non-zero characteristics are considered. Spaces of…
Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm $\mathsf{Greedy}[d]$ of Azar et al. places each ball by probing $d > 1$ random bins and placing the ball in the least loaded of…
We study an online allocation problem with sequentially arriving items and adversarially chosen agent values, with the goal of balancing fairness and efficiency. Our goal is to study the performance of algorithms that achieve strong…