相关论文: Convex body domination for a class of multi-scale …

In this paper, using a new technique from harmonic analysis called sparse domination, we characterize the positive Borel measures including forward, vanishing, and reverse Bergman Carleson measures. The main novelty of this paper is…

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…

We focus in this paper on high-dimensional regression problems where each regressor can be associated to a location in a physical space, or more generally a generic geometric space. Such problems often employ sparse priors, which promote…

The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…

We establish a uniform domination of the family of trilinear multiplier forms with singularity over a one-dimensional subspace by positive sparse forms involving $L^p$-averages. This class includes the adjoint forms to the bilinear Hilbert…

Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…

For networks of systems, with possibly improper transfer function matrices, we present a design framework which enables $\mathcal{H}_\infty$ control, while imposing sparsity constraints on the controller's coprime factors. We propose a…

Stochastic dominance of a random variable by a convex combination of its independent copies has recently been shown to hold within the relatively narrow class of distributions with concave odds function, and later extended to broader…

In this note we give simple proofs of several results involving maximal truncated Calde\'on-Zygmund operators in the general setting of rearrangement invariant quasi-Banach function spaces by sparse domination. Our techniques allow us to…

We present a general sparse domination principle which respects the cancellative structure of the functions under study. We obtain sparse domination results in general measure spaces, including general martingale settings in one and two…

Several properties of the Harnack domination of linear operators acting on Hilbert space with norm less or equal than one are studied. Thus, the maximal elements for this relation are identified as precisely the singular unitary operators,…

Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this…

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…

This paper studies the convergence properties the well-known message-passing algorithm for convex optimisation. Under the assumption of pairwise separability and scaled diagonal dominance, asymptotic convergence is established and a simple…

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of…

In this article, we address pointwise sparse domination for multilinear Calder\'on-Zygmund operators on upper doubling, geometrically doubling metric measure spaces. As a consequence, we have obtained sharp quantitative weighted estimates…

In this paper, we propose a double iteratively reweighted algorithm to solve nonconvex and nonsmooth optimization problems, where both the objectives and constraint functions are formulated by concave compositions to promote group-sparse…

Due to its nonlocal nature, the $r$-variation norm Carleson operator $C_r$ does not yield to the sparse domination techniques of Lerner, Di Plinio and Lerner, Lacey. We overcome this difficulty and prove that the dual form to $C_r$ can be…

We obtain an alternative approach to recent results by M. Lacey \cite{La} and T. Hyt\"onen {\it et al.} \cite{HRT} about a pointwise domination of $\omega$-Calder\'on-Zygmund operators by sparse operators. This approach is rather elementary…

Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of…