相关论文: On the Convergence of a Weak Greedy Algorithm for …

Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: $(1)$ reduce the…

Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem…

We prove weighted weak-type $(r,r)$ estimates for operators satisfying $(r,s)$ limited-range sparse domination of $\ell^q$-type. Our results contain improvements for operators satisfying limited-range and square function sparse domination.…

The main goal of this paper is to provide a complete characterization of the weak-type boundedness of the Hardy-Littlewood maximal operator, $M$, on weighted Lorentz spaces $\Lambda^p_u(w)$, whenever $p>1$. This solves a problem left open…

In this work we provide a criterion for the global weak (1,1) type of integral operators which are known to be locally uniformly of weak (1,1) type. As an application, we establish the global weak (1,1) type for a class of Fourier integral…

Data-dependent greedy algorithms in kernel spaces are known to provide fast converging interpolants, while being extremely easy to implement and efficient to run. Despite this experimental evidence, no detailed theory has yet been…

In this paper, Hardy type operator $H_{\beta}$ on $\bR^{n}$ and its adjoint operator $H_{\beta}^{*}$ are investigated. We use novel methods to obtain two main results. One is that we obtain the operators $H_{\beta}$ and $H_{\beta}^{*}$…

Greedy algorithms have been successfully analyzed and applied in training neural networks for solving variational problems, ensuring guaranteed convergence orders. In this paper, we extend the analysis of the orthogonal greedy algorithm…

We study a pair of budget- and performance-constrained weak-submodular maximization problems. For computational efficiency, we explore the use of stochastic greedy algorithms which limit the search space via random sampling instead of the…

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

Simultaneous operation of all sensors in a large-scale sensor network is power-consuming and computationally expensive. Hence, it is desirable to select fewer sensors. A greedy algorithm is widely used for sensor selection in homogeneous…

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we…

Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide range of optimization tasks, where…

We give an alternative proof of recent results by the authors on uniform boundedness of dyadic averaging operators in (quasi-)Banach spaces of Hardy-Sobolev and Triebel-Lizorkin type. This result served as the main tool to establish…

We shall present new characterizations of partially greedy and almost greedy bases. A new class of basis (which we call reverse partially greedy basis) arises naturally from these characterizations of partially greedy bases. We also give…

We study the algorithmic problem of finding large $\gamma$-balanced independent sets in dense random bipartite graphs; an independent set is $\gamma$-balanced if a $\gamma$ proportion of its vertices lie on one side of the bipartition. In…

Following Cs\"{o}rg\H{o}, Szyszkowicz and Wang (Ann. Statist. {\bf 34}, (2006), 1013--1044) we consider a long range dependent linear sequence. We prove weak convergence of the uniform Vervaat and the uniform Vervaat error processes,…

The standard greedy algorithm has been recently shown to enjoy approximation guarantees for constrained non-submodular nondecreasing set function maximization. While these recent results allow to better characterize the empirical success of…