Related papers: Sparse approximation using new greedy-like bases i…
The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy…
We study the worst-case adaptive optimization problem with budget constraint that is useful for modeling various practical applications in artificial intelligence and machine learning. We investigate the near-optimality of greedy algorithms…
In this paper we introduce several extremal sequences of points on locally compact metric spaces and study their asymptotic properties. These sequences are defined through a greedy algorithm by minimizing a certain energy functional whose…
Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognition. Unfortunately,…
We provide a systematic deterministic numerical scheme to approximate the volume (i.e. the Lebesgue measure) of a basic semi-algebraic set whose description follows a sparsity pattern. As in previous works (without sparsity), the underlying…
In this contribution we are concerned with tight a posteriori error estimation for projection based model order reduction of $\inf$-$\sup$ stable parameterized variational problems. In particular, we consider the Reduced Basis Method in a…
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of…
We investigate the existence of equivalent p-norms, 0< p 1, under which conditional symmetric or spreading bases in quasi-Banach spaces become isometric. For spreading bases (which need not be unconditional or even Schauder bases), we…
We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To…
Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a…
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…
We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment.In a model of communication based on a random walk on an undirected graph, the optimal…
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…
Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an…
A greedy algorithm is proposed for sparse-sensor selection in reduced-order sensing that contains correlated noise in measurement. The sensor selection is carried out by maximizing the determinant of the Fisher information matrix in a…
We give a complete characterization of $2\pi$-periodic weights $w$ for which the usual trigonometric system forms a quasi-greedy basis for $L^p(\bT;w)$, i.e., bases for which simple thresholding approximants converge in norm. The…
An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor $\lambda > 1$ in the condition defining the greedy property, then we obtain an equivalence of the almost greedy property, a strictly weaker…
In this note, we study some concentration properties for Lipschitz maps defined on Hamming graphs, as well as their stability under sums of Banach spaces. As an application, we extend a result of Causey on the coarse Lipschitz structure of…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
We develop techniques to construct a series of sparse polyhedral approximations of the semidefinite cone. Motivated by the semidefinite (SD) bases proposed by Tanaka and Yoshise (2018), we propose a simple expansion of SD bases so as to…