Related papers: The Weak Chebyshev Greedy Algorithm (WCGA) in $L^p…

Given a space of homogeneous type we give sufficient conditions on a variable exponent {p(.)} so that the fractional maximal operator {M_{\eta}} maps {L^{p(.)}(X)} to {L^{q(.)}(X)}, where {1/p(.) - 1/q(.) = {\eta}}. In the endpoint case we…

We prove an extrapolation of compactness theorem for operators on Banach function spaces satisfying certain convexity and concavity conditions. In particular, we show that the boundedness of an operator $T$ in the weighted Lebesgue scale…

Dense kernel matrices resulting from pairwise evaluations of a kernel function arise naturally in machine learning and statistics. Previous work in constructing sparse approximate inverse Cholesky factors of such matrices by minimizing…

We introduce and study the notion of weak weight-semi-greedy Markushevich bases - which extends the concepts of weight semi-greedy and weak semi-greedy Markushevich bases. In particular, we study conditions under which such bases are weight…

The paper presents a priori error analysis of the shallow neural network approximation to the solution to the indefinite elliptic equation and and cutting-edge implementation of the Orthogonal Greedy Algorithm (OGA) tailored to overcome the…

Let $X$ be a ball quasi-Banach function space on ${\mathbb R}^n$. In this article, the authors introduce the weak Hardy-type space $WH_X({\mathbb R}^n)$, associated with $X$, via the radial maximal function. Assuming that the powered…

In the Shortest Common Superstring problem, one needs to find the shortest superstring for a set of strings. This problem is APX-hard, and many approximation algorithms were proposed, with the current best approximation factor of 2.466.…

We study the worst-case approximation of multivariate periodic functions from the weighted Korobov space $H_{d,\alpha,\gamma}$ with smoothness $\alpha>1/2$ in the Lebesgue norm $L_p([0,1]^d)$ for $1\le p\le\infty$. We analyze a \emph{median…

We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…

Discretization of continuous-time diffusion processes is a widely recognized method for sampling. However, the canonical Euler Maruyama discretization of the Langevin diffusion process, referred as Unadjusted Langevin Algorithm (ULA),…

In this paper we prove that there exists a function which $f(x)$ belongs to $L^1[0,1]$ such that a greedy algorithm with regard to the Walsh subsystem does not converge to $f(x)$ in $L^1[0,1]$ norm, i.e. the Walsh subsystem $\{W_{n_k}\}$ is…

Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for…

This paper is motivated by structured sparsity for deep neural network training. We study a weighted group L0-norm constraint, and present the projection and normal cone of this set. Using randomized smoothing, we develop zeroth and…

Democracy functions of wavelet admissible bases are computed for weighted Orlicz Spaces in terms of its fundamental function. In particular, we prove that these bases are greedy if and only if the Orlicz space is a Lebesgue space. Also,…

Computationally-efficient semilocal approximations of density functional theory at the level of the local spin density approximation (LSDA) or generalized gradient approximation (GGA) poorly describe weak interactions. We show improved…

In this paper, we study weak amenability of Beurling algebras. To this end, we introduce the notion inner quasi-additive functions and prove that for a locally compact group $G$, the Banach algebra $L^1(G, \omega)$ is weakly amenable if and…

It is a well-known fact that in a Lipschitz domain \Omega\subset R^n a p-Hardy inequality, with weight d(x,\partial\Omega)^\beta, holds for all u\in C_0^\infty(\Omega) whenever \beta<p-1. We show that actually the same is true under the…

In this paper, we revisit the class of iterative shrinkage-thresholding algorithms (ISTA) for solving the linear inverse problem with sparse representation, which arises in signal and image processing. It is shown in the numerical…

Let $A_p(G)$ denote the Figa-Talamanca-Herz Banach Algebra of the locally compact group $G$, thus $A_2(G)$ is the Fourier Algebra of $G$. If $G$ is commutative then $A_2(G)=L^1(\hat{G}){\hat{}}$. Let $A^r_p(G)=A_p\cap L^r(G)$ with norm…

We give a new decay framework for general dissipative hyperbolic system and hyperbolic-parabolic composite system, which allow us to pay less attention on the traditional spectral analysis in comparison with previous efforts. New…