相关论文: Lebesgue inequalities for the greedy algorithm in …

We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…

We intend to derive the moment and exponential tail estimates for the so-called bivariate or more generally multivariate functional operations, not necessary to be linear or even multilinear. We will show also the strong or at last weak…

The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube $[0,1]^d$. The figures of merit are three different variants of $L_2$ discrepancy. Theoretical results…

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 investigate two greedy strategies for finding an approximation to the minimum of a convex function $E$ defined on a Hilbert space $H$. We prove convergence rates for these algorithms under suitable conditions on the objective function…

In this work we obtain a transference theorem for Lebesgue spaces with $A_{\infty }$ weights, namely, starting from some uniform-norm inequalities it is possible to obtain similar inequalities in Lebesgue spaces with $A_{\infty }$ weights.…

We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank…

We present a simple performance bound for the greedy scheme in string optimization problems that obtains strong results. Our approach vastly generalizes the group of previously established greedy curvature bounds by Conforti and…

We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the…

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 fact that finite direct sums of two or more mutually different spaces from the family $\{\ell_{p} : 1\le p<\infty\}\cup c_{0}$ fail to have greedy bases is stated in [Dilworth et al., Greedy bases for Besov spaces, Constr. Approx. 34…

We establish optimal Lebesgue estimates for a class of generalized Radon transforms defined by averaging functions along polynomial-like curves. The presence of an essentially optimal weight allows us to prove uniform estimates, wherein the…

We investigate the problem of improving the greedy-type constant of a basis by means of an equivalent renorming of the ambient Banach space. Our main result shows that if a Banach space admits an unconditional and bidemocratic basis whose…

We present new estimate for Hardy-type inequality in variable exponent Lebesgue spaces. More precisely, by imposing regularity assumptions on the exponent, we prove that the estimations can be reduced to the fixed exponents.

We present a family of numerical implementations of Kato's ODE propagating global bases of analytically varying invariant subspaces, of which the first-order version is a surprising simple "greedy algorithm" that is both stable and easy to…

In this work, we study Bayesian quantum parameter estimation given a finite number of uses of the process encoding one or more unknown physical quantities. For multiple uses, it is conventional to classify quantum metrological protocols as…

We obtain in this short article the non-asymptotic estimations for the norm of (generalized) Cesaro-Hardy integral operators in the so-called Bilateral Grand Lebesgue Spaces. We also give examples to show the sharpness of these…

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…

We investigate properties of the $m$-th error of approximation by polynomials with constant coefficients $\mathcal{D}_{m}(x)$ and with modulus-constant coefficients $\mathcal{D}_{m}^{\ast}(x)$ introduced by Bern\'a and Blasco (2016) to…

This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems due to their low computational requirements and at the same…