Related papers: An introduction to pointwise sparse domination
In this note, we show that if $T$ is a multilinear singular integral operator associated with a kernel satisfies the so-called multilinear $L^{r}$-H\"ormander condition, then $T$ can be dominated by multilinear sparse operators.
This paper proposes a new distributed algorithm for solving linear systems associated with a sparse graph under a generalised diagonal dominance assumption. The algorithm runs iteratively on each node of the graph, with low complexities on…
In this paper, we prove bilinear sparse domination bounds for a wide class of Fourier integral operators of general rank, as well as oscillatory integral operators associated to H\"ormander symbol classes $S^m_{\rho,\delta}$ for all…
In this paper we present two different results in the context of nonlinear analysis. The first one is essentially a nonlinear technique that, in view of its strong generality, may be useful in different practical problems. The second…
In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…
We develop the self similarity argument known as sparse domination in an abstract martingale setting, using a continuous time parameter. With this method, we prove a sharp weighted L^p estimate for the maximal operator Y^* of Y with respect…
We prove a local two-weight Poincar\'e inequality for cubes using the sparse domination method that has been influential in harmonic analysis. The proof involves a localized version of the Fefferman--Stein inequality for the sharp maximal…
Identifying governing equations from data is a critical step in the modeling and control of complex dynamical systems. Here, we investigate the data-driven identification of nonlinear dynamical systems with inputs and forcing using…
Using the Calder\'on-Zygmund decomposition, we give a novel and simple proof that $L^2$ bounded dyadic shifts admit a domination by positive sparse forms with linear growth in the complexity of the shift. Our estimate, coupled with…
How to establish some specific quantitative weighted estimates for the generalized commutator of multilinear fractional singular integral operator $\mathcal{T}_{\eta}^{{\bf b}}$ is the focus of this paper, which is defined by…
Identifying differential operators from data is essential for the mathematical modeling of complex physical and biological systems where massive datasets are available. These operators must be stable for accurate predictions for dynamics…
We present a novel approach to the formulation and the resolution of sparse Linear Discriminant Analysis (LDA). Our proposal, is based on penalized Optimal Scoring. It has an exact equivalence with penalized LDA, contrary to the multi-class…
We prove that scalar-valued sparse domination of a multilinear operator implies vector-valued sparse domination for tuples of quasi-Banach function spaces, for which we introduce a multilinear analogue of the UMD condition. This condition…
Deep learning has been the engine powering many successes of data science. However, the deep neural network (DNN), as the basic model of deep learning, is often excessively over-parameterized, causing many difficulties in training,…
In recent years, it has been well understood that a Calder\'on-Zygmund operator $T$ is pointwise controlled by a finite number of dyadic operators of a very simple structure (called the sparse operators). We obtain a similar pointwise…
We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive…
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…
We prove weighted estimates for rough bilinear singular integral operators with kernel $$K(y_1, y_2) = \frac{\Omega((y_1,y_2)/|(y_1,y_2)|)}{|(y_1, y_2)|^{2d}},$$ where $y_i \in \mathbb{R}^{d}$ and $\Omega \in L^{\infty}(S^{2d-1})$ with…
We consider operators $T$ satisfying a sparse domination property \[ |\langle Tf,g\rangle|\leq c\sum_{Q\in\mathscr{S}}\langle f\rangle_{p_0,Q}\langle g\rangle_{q_0',Q}|Q| \] with averaging exponents $1\leq p_0<q_0\leq\infty$. We prove…
In a sparse representation based recognition scheme, it is critical to learn a desired dictionary, aiming both good representational power and discriminative performance. In this paper, we propose a new dictionary learning model for…