Related papers: Sparse Domination for Bi-Parameter Operators Using…
Using exclusively the localized estimates upon which the helicoidal method was built, we show how sparse estimates can also be obtained. This approach yields a sparse domination for multiple vector-valued extensions of operators as well. We…
Many conventional statistical procedures are extremely sensitive to seemingly minor deviations from modeling assumptions. This problem is exacerbated in modern high-dimensional settings, where the problem dimension can grow with and…
A theory of sufficient dimension reduction (SDR) is developed from an optimizational perspective. In our formulation of the problem, instead of dealing with raw data, we assume that our ground truth includes a mapping ${\mathbf f}: {\mathbb…
Through the study of novel variants of the classical Littlewood-Paley-Stein $g$-functions, we obtain pointwise estimates for broad classes of highly-singular Fourier multipliers on $\mathbb{R}^d$ satisfying regularity hypotheses adapted to…
Let $ Tf =\sum_{ I} \varepsilon_I \langle f,h_{I^+}\rangle h_{I^-}$. Here, $ \lvert \varepsilon _I\rvert=1 $, and $ h_J$ is the Haar function defined on dyadic interval $ J$. We show that, for instance, \begin{equation*} \lVert T \rVert _{L…
Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…
We extend Lerner's recent approach to sparse domination of Calder\'on--Zygmund operators to upper doubling (but not necessarily doubling), geometrically doubling metric measure spaces. Our domination theorem is different from the one…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
We investigate the use of sparse coding and dictionary learning in the context of multitask and transfer learning. The central assumption of our learning method is that the tasks parameters are well approximated by sparse linear…
This paper explores hypothesis testing for the parametric forms of the mean and variance functions in regression models under diverging-dimension settings. To mitigate the curse of dimensionality, we introduce weighted residual empirical…
A weighted sums of squares decomposition of positive Borel measurable functions on a bounded Borel subset of the Euclidean space is obtained via duality from the spectral theorem for tuples of commuting self-adjoint operators. The analogous…
In this paper, we study the behavior of the weighted composition operators acting on Bergman spaces defined on strictly pseudoconvex domains via the sparse domination technique from harmonic analysis. As a byproduct, we also prove a…
Approximating field variables and data vectors from sparse samples is a key challenge in computational science. Widely used methods such as gappy proper orthogonal decomposition and empirical interpolation rely on linear approximation…
It is well-known that the functions $f \in L^1(\mathbb{R}^d)$ whose translates along a lattice $\Lambda$ form a tiling, can be completely characterized in terms of the zero set of their Fourier transform. We construct an example of a…
In the second part of the series papers, we set out to study the algorithmic efficiency of sparse sensing. Stemmed from co-prime sensing, we propose a generalized framework, termed Diophantine sensing, which utilizes generic Diophantine…
We describe the classes of functions $f=(f(x), x\in R)$, for which processes $f(W_t)-Ef(W_t)$ and $f(W_t)/Ef(W_t)$ are martingales. We apply these results to give a martingale characterization of general solutions of the quadratic and the…
We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…
We show that a fractal affine function $f(x)$ defined by a system $\mathcal S$ which does not satisfy weak separation property is a quadratic function.
In this paper, we study maximal functions along some finite type curves and hypersurfaces. In particular, various impacts of non-isotropic dilations are considered. Firstly, we provide a generic scheme that allows us to deduce the sparse…
Let $\gamma(G)$ denote the domination number of a graph $G$. A {\it Roman domination function} of a graph $G$ is a function $f: V\to\{0,1,2\}$ such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number}…