Results 1 to 10 of about 8,591 (298)
Greedy Algorithms for Optimal Distribution Approximation [PDF]
Entropy, 2016 The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj +6 more sources
Simultaneous greedy approximation in Banach spaces
Journal of Complexity, 2005 The notion of the weak greedy algorithms (WGA) in the case of Hilbert space \(H\) was introduced and studied by the second author [Adv. Comp. Math. 12, 213--227 (2000; Zbl 0964.65009)]. This algorithm is provided for each \(f\in H\) and any dictionary \(\mathcal{D} \) by the sums \(G_m(f,\mathcal{D})\) \(=\sum _{j=1}^mc_j\varphi _j(f),\) where \(m\in N
V N Temlyakov
exaly +4 more sources
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 +2 more sources
Simultaneous approximation by greedy algorithms [PDF]
Advances in Computational Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V N Temlyakov +2 more
exaly +2 more sources
Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms
Axioms, 2022 We propose the Weak Rescaled Pure Super Greedy Algorithm (WRPSGA) for approximation with respect to a dictionary D in Hilbert space. The WRPSGA is simpler than some popular greedy algorithms.
Wenhui Zhang +3 more
doaj +3 more sources
On approximation spaces and Greedy-type bases
Annals of Functional AnalysisThe purpose of this paper is to introduce $ω$-Chebyshev-greedy and $ω$-partially greedy approximation classes and to study their relation with $ω$-approximation spaces, where the latter are a generalization of the classical approximation spaces. The relation gives us sufficient conditions of when certain continuous embeddings imply different greedy ...
Pablo M Berna +2 more
exaly +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
Laura Rebollo-Neira
doaj +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
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.
Rémi Gribonval, Morten Nielsen 0002
openaire +3 more sources