Related papers: On Weighted Greedy-type Bases
The target set selection problem (TSS) asks for a set of vertices such that an influence spreading process started in these vertices reaches the whole graph. The current state of the art for this NP-hard problem are three recently proposed…
We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…
Let $\Omega$ be a bounded domain of $\mathbb{R}^N$ whose boundary is a $\mathbb{C}^2$ compact manifolds. In the present paper we shall study a variational problem relating the weighted Hardy inequalities with sharp missing terms. As weights…
In this paper, we propose the concept of an $\Omega$-Rota-Baxter system, which is a generalization of a Rota-Baxter system and an $\Omega$-Rota-Baxter algebra of weight zero. In the framework of operated algebras, we obtain a linear basis…
There has been a long history for studying randomized greedy matching algorithms since the work by Dyer and Frieze~(RSA 1991). We follow this trend and consider the problem formulated in the oblivious setting, in which the algorithm makes…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
The central objective of this paper is to develop reduced basis methods for parameter dependent transport dominated problems that are rigorously proven to exhibit rate-optimal performance when compared with the Kolmogorov $n$-widths of the…
In this article, we derive a novel convergence estimate for the weak POD-Greedy method with multiple POD modes and variable greedy thresholds in terms of the entropy numbers of the parametric solution manifold. Combining the POD with the…
We study minimum entropy submodular optimization, a common generalization of the minimum entropy set cover problem, studied earlier by Cardinal et al., and the submodular set cover problem. We give a general bound of the approximation…
A fundamental open problem in learning theory is to characterize the best-case teaching dimension $\operatorname{TS}_{\min}$ of a concept class $\mathcal{C}$ with finite VC dimension $d$. Resolving this problem will, in particular, settle…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
We study the effect of rich supertag features in greedy transition-based dependency parsing. While previous studies have shown that sparse boolean features representing the 1-best supertag of a word can improve parsing accuracy, we show…
We propose a new concept named adaptive submodularity ratio to study the greedy policy for sequential decision making. While the greedy policy is known to perform well for a wide variety of adaptive stochastic optimization problems in…
Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost…
We present a technique that allows for improving on some relative greedy procedures by well-chosen (non-oblivious) local search algorithms. Relative greedy procedures are a particular type of greedy algorithm that start with a simple,…
We study here sparse recovery problems in the presence of additive noise. We analyze a thresholding version of the CoSaMP algorithm, named Thresholding Greedy Pursuit (TGP). We demonstrate that an appropriate choice of thresholding…
A $t$-spanner of a graph is a subgraph that $t$-approximates pairwise distances. The greedy algorithm is one of the simplest and most well-studied algorithms for constructing a sparse spanner: it computes a $t$-spanner with $n^{1+O(1/t)}$…
For a wide range of functions $W\colon\mathbb{N}\to\mathbb{N}$, we establish a general result for estimating weighted averages of the form \[ \mathbb{E}^{W}_{n \le N} f(\vartheta(n))= \frac{1}{W(N)}\sum_{n=1}^N (W(n)-W(n-1))f(\vartheta(n)),…
Many dynamic programming algorithms for discrete 0-1 optimizationproblems are "pure" in that their recursion equations only use min/max and addition operations, and do not depend on actual input weights. The well-known greedy algorithm of…
Considering the set cover problem, by modifying the approach that gives a logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algorithm's accuracy for a particular input. We compare the…