Related papers: Sparse domination via the helicoidal method

An efficient approach to handle localized states by using spectral methods (SM) in one and three dimensions is presented. The method consists of transformation of the infinite domain to the bounded domain in $(0, \pi)$ and using the Fourier…

We provide elementary proofs that the 2-variation Carleson operator $V_2$ along with explicit bilinear multipliers adapted to $\{\xi_1 + \xi_2 = 0\}$ satisfy no $L^p$ estimates. Furthermore, we obtain $L^p \rightarrow L^p$ estimates when $2…

We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applications…

This is a continuation of our work [BBGG23, BBGG22] where we have initiated the study of sparse domination and quantitative weighted estimates for Grushin pseudo-multipliers. In this article, we further extend this analysis to study…

In this work we extend Lacey's domination theorem to prove the pointwise control of bilinear Calder\'on--Zygmund operators with Dini--continuous kernel by sparse operators. The precise bounds are carefully tracked following the spirit in a…

Interpolation-based trust-region methods are an important class of algorithms for Derivative-Free Optimization which rely on locally approximating an objective function by quadratic polynomial interpolation models, frequently built from…

Despite impressive advances in simultaneous localization and mapping, dense robotic mapping remains challenging due to its inherent nature of being a high-dimensional inference problem. In this paper, we propose a dense semantic robotic…

Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies.…

We develop a technique to design efficiently computable estimators for sparse linear regression in the simultaneous presence of two adversaries: oblivious and adaptive. We design several robust algorithms that outperform the state of the…

Sparse Representation (SR) of signals or data has a well founded theory with rigorous mathematical error bounds and proofs. SR of a signal is given by superposition of very few columns of a matrix called Dictionary, implicitly reducing…

We construct a new idempotent Fourier multiplier on the Hardy space on the bidisc, which could not be obtained by applying known one dimentional results. The main tool is a new $L^1$ equivalent of the Stein martingale inequality which holds…

We prove a sparse bound in the context of Schauder theory for divergence form elliptic partial differential equations. In addition, we show how an iteration argument inspired by sparse domination bounds can be used to deduce gradient…

We propose new methods for calculation of the discrete spectrum, the reflection amplitude and the correlation functions of boundary Liouville theory on a strip with Lorentzian signature. They are based on the structure of the vertex…

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…

We consider a dictionary learning problem whose objective is to design a dictionary such that the signals admits a sparse or an approximate sparse representation over the learned dictionary. Such a problem finds a variety of applications…

We study the restricted isometry property of a matrix that is built from the discrete Fourier transform matrix by collecting rows indexed by quadratic residues. We find an $\epsilon>0$ such that, conditioned on a folklore conjecture in…

The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major…

We prove the off-diagonal estimates of the bilinear iterated commutators in the two-weight setting. The upper bound is established via sparse domination, and the lower bound is proved by the median method. Our methods are so flexible so…

This paper provides a novel approach for finding sparse state-space realizations of linear systems (e.g., controllers). Sparse controllers are commonly used in distributed control, where a controller is synthesized with some sparsity…

Rational Lax hierarchies introduced by Krichever are generalized. A systematic construction of infinite multi-Hamiltonian hierarchies and related conserved quantities is presented. The method is based on the classical R-matrix approach…