Related papers: Weight-partially greedy bases and weight-Property …
The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized…
The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a…
Decision trees and decision rule systems play important roles as classifiers, knowledge representation tools, and algorithms. They are easily interpretable models for data analysis, making them widely used and studied in computer science.…
The main purpose of this survey is to gather results on the boundedness of the Bergman projection. First, we shall go over some equivalent norms on weighted Bergman spaces $A^p_\omega$ which are useful in the study of this question. In…
We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We fully characterize when the greedy…
We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where…
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…
There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake,…
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…
We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those…
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
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…
The goal of this paper is to define a certain Chow weight structure for the category of Voevodsky's motivic complexes with integral coefficients (as described by Cisinski and Deglise) over any excellent finite-dimensional separated scheme…
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm --…
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 give a characterization of the two weight strong and weak type norm inequalities for the bilinear fractional integrals. Namely, we give the characterization of the following inequalities, \[ \|\mathcal I_\alpha…
We introduce and analyze new envy-based fairness concepts for agents with weights that quantify their entitlements in the allocation of indivisible items. We propose two variants of weighted envy-freeness up to one item (WEF1): strong,…
We give criteria for finding the greedy $\beta$-expansion for $1$ for families of Salem numbers that approach a given Pisot number. We show that these expansions are related to the greedy expansion under the Pisot base. This expands on the…
The idea of covariate balance is at the core of causal inference. Inverse propensity weights play a central role because they are the unique set of weights that balance the covariate distributions of different treatment groups. We discuss…