Related papers: On greedy approximation in complex Banach spaces
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 consider a general task called partial Wasserstein covering with the goal of providing information on what patterns are not being taken into account in a dataset (e.g., dataset used during development) compared with another dataset(e.g.,…
We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy…
Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight greedy matching on weighted graphs, termed GreedyMatching.…
In this paper, we consider a subset selection problem in a spatial field where we seek to find a set of k locations whose observations provide the best estimate of the field value at a finite set of prediction locations. The measurements…
For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang,…
The paper gives some results on best proximity and fixed point for a class of generalized hybrid cyclic self-mappings in Banach spaces.
Local-search methods are widely employed in statistical applications, yet interestingly, their theoretical foundations remain rather underexplored, compared to other classes of estimators such as low-degree polynomials and spectral methods.…
We introduce and investigate an iterative scheme for approximating common fixed point of a family of Bregman relatively-nonexpansive mappings in real reflexive Banach spaces. We prove strong convergence theorem of the sequence generated by…
The paper presents a priori error analysis of the shallow neural network approximation to the solution to the indefinite elliptic equation and and cutting-edge implementation of the Orthogonal Greedy Algorithm (OGA) tailored to overcome the…
It is shown that for a locally compact group $G$, if $L^{1}(G)^{**}$ is approximately weakly amenable, then $M(G)$ is approximately weakly amenable. Then, new notions of approximate weak amenability and approximate cyclic amenability for…
In this paper, the weighted estimates for multilinear pseudo-differential operators were systematically studied in rearrangement invariant Banach and quasi-Banach spaces. These spaces contain the Lebesgue space, the classical Lorentz space…
Wattenhofer [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the…
Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem, with well-known algorithms. However, most of the algorithms found in the literature do not scale well with large values of data dimension,…
We describe a canonical spanning tree of the ridge graph of a subword complex on a finite Coxeter group. It is based on properties of greedy facets in subword complexes, defined and studied in this paper. Searching this tree yields an…
This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs. After using the cavity…
We call a bounded linear operator acting between Banach spaces weakly compactly generated ($\mathsf{WCG}$ for short) if its range is contained in a weakly compactly generated subspace of its codomain. This notion simultaneously generalises…
We expand the item response theory to study the case of "cheating students" for a set of exams, trying to detect them by applying a greedy algorithm of inference. This extended model is closely related to the Boltzmann machine learning. In…
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…
We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.