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

We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter…

The purpose of this article is to provide an alternative proof of the weak-type $\left(1,\ldots,1;\frac{1}{m}\right)$ estimate for $m$-multilinear Calder\'on-Zygmund operators on $\mathbb{R}^n$ first proved by Grafakos and Torres.…

In this note we describe some recent advances in the area of maximal function inequalities. We also study the behaviour of the centered Hardy-Littlewood maximal operator associated to certain families of doubling, radial decreasing…

We study the fundamental limits of matching pursuit, or the pure greedy algorithm, for approximating a target function $ f $ by a linear combination $f_n$ of $n$ elements from a dictionary. When the target function is contained in the…

We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy…

In this paper, we classify all commutative weakly distance-regular digraphs of girth $g$ and one type of arcs under the assumption that $p_{(1,g-1),(1,g-1)}^{(2,g-2)}\geq k_{1,g-1}-2$. In consequence, we recover [13, Theorem 1.1] as a…

It is known that greedy methods perform well for maximizing monotone submodular functions. At the same time, such methods perform poorly in the face of non-monotonicity. In this paper, we show - arguably, surprisingly - that invoking the…

The problem of least squares regression of a $d$-dimensional unknown parameter is considered. A stochastic gradient descent based algorithm with weighted iterate-averaging that uses a single pass over the data is studied and its convergence…

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

A $k$-submodular function is a generalization of the submodular set function. Many practical applications can be modeled as maximizing a $k$-submodular function, such as multi-cooperative games, sensor placement with $k$ type sensors,…

The Power-Relaxed Greedy Algorithm (PRGA) was introduced as a generalization of the so called Relaxed Greedy Algorithm, introduced by DeVore and Temlyakov, by replacing the relaxation parameter $1/m$ with $1/m^\alpha$, with the aim of…

This letter studies the problem of minimizing increasing set functions, or equivalently, maximizing decreasing set functions, over the base of a matroid. This setting has received great interest, since it generalizes several applied…

We consider the problem of studying the performance of greedy algorithm on sensor selection problem for stable linear systems with Kalman Filter. Specifically, the objective is to find the system parameters that affects the performance of…

We show that $d$-variate polynomials of degree $R$ can be represented on $[0,1]^d$ as shallow neural networks of width $2(R+d)^d$. Also, by SNN representation of localized Taylor polynomials of univariate $C^\beta$-smooth functions, we…

In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and successful approach. We define the class of "degree sensitive"…

In this paper, a weak type (1,1) bound criterion is established for singular integral operator with rough kernel. As some applications of this criterion, we prove some important operators with rough kernel in harmonic analysis, such as…

We study submodular maximization problems with matroid constraints, in particular, problems where the objective can be expressed via compositions of analytic and multilinear functions. We show that for functions of this form, the so-called…

The "classical" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimator is maximized and the snapshot corresponding to the…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

We study solutions to the Egyptian fractions equation with the prime factors of the denominators constrained to lie in a fixed set of primes. We evaluate the effectiveness of the greedy algorithm in establishing bounds on such solutions.…