Results 11 to 20 of about 87,603 (273)
Greedy Algorithms for Optimal Distribution Approximation
Entropy, 2016 The approximation of a discrete probability distribution $\mathbf{t}$ by an $M$-type distribution $\mathbf{p}$ is considered. The approximation error is measured by the informational divergence $\mathbb{D}(\mathbf{t}\Vert\mathbf{p})$, which is an ...
Böcherer, Georg, Geiger, Bernhard C.
core +4 more sources
Simultaneous approximation by greedy algorithms [PDF]
Advances in Computational Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leviatan, D., Temlyakov, V. N.
exaly +4 more sources
Sparse Approximation and Recovery by Greedy Algorithms [PDF]
IEEE Transactions on Information Theory, 2014 We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random $K$-sparse signals within $\lceil K(1+\e)\rceil$ iterations of the Orthogonal Matching Pursuit (OMP). This result shows that in a probabilistic sense the OMP is almost optimal for exact recovery.
Livshitz, Eugene, Temlyakov, Vladimir
openaire +4 more sources
Simultaneous optimized orthogonal matching pursuit with application to ECG compression. [PDF]
PLoS OneA greedy pursuit strategy which finds a common basis for approximating a set of similar signals is proposed. The strategy extends the Optimized Orthogonal Matching Pursuit approach to selecting the subspace containing the approximation of all the signals
Rebollo-Neira L.
europepmc +2 more sources
On the convergence of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 In this article we consider representing properties of subspaces generated by the Szego kernel. We examine under which conditions on the sequence of points of the unit disk the order-preserving weak greedy algorithm for appropriate subspaces generated by
Speransky, Konstantin Sergeevich
doaj +1 more source
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings
Algorithms, 2021 A grammar-based compressor is an algorithm that receives a word and outputs a context-free grammar that only produces this word. The approximation ratio for a single input word is the size of the grammar produced for this word divided by the size of a ...
Danny Hucke, Carl Philipp Reh
doaj +1 more source
On the Rate of Convergence of Greedy Algorithms
Mathematics, 2023 In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions.
Vladimir Temlyakov
doaj +1 more source
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
Sharp conditions for the convergence of greedy expansions with prescribed coefficients
Open Mathematics, 2021 Greedy expansions with prescribed coefficients were introduced by V. N. Temlyakov in a general case of Banach spaces. In contrast to Fourier series expansions, in greedy expansions with prescribed coefficients, a sequence of coefficients {cn}n=1∞{\left\{{
Valiullin Artur R., Valiullin Albert R.
doaj +1 more source
Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
Mathematics, 2023 We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space.
Xu Xu +3 more
doaj +1 more source