English
Related papers

Related papers: Sparse bounds for a prototypical singular Radon tr…

200 papers

Convolution type Calder\'on-Zygmund singular integral operators with rough kernels $\pv \Om(x)/|x|^n$ are studied. A condition on $\Om$ implying that the corresponding singular integrals and maximal singular integrals map $L^p \to L^p$ for…

Functional Analysis · Mathematics 2016-09-07 Loukas Grafakos , Atanas Stefanov

We estimate in Lp the maximal Riesz transform in terms of the Riesz transform itself for p greater than 1. In the limiting case p=1 the weak L1 inequality is shown to fail. Surprisingly, the weak L1 inequality for the maximal Beurling…

Classical Analysis and ODEs · Mathematics 2010-12-21 Joan Mateu , Joan Verdera

Given sparse collections of measurable sets $\mathcal S_k$, $k=1,2,\ldots ,N$, in a general measure space $(X,\mathfrak M,\mu)$, let $ \Lambda_{\mathcal S_k}$ be the sparse operator, corresponding to $\mathcal S_k$. We show that the maximal…

Classical Analysis and ODEs · Mathematics 2021-01-26 Grigori A. Karagulyan , Michael T. Lacey

The pseudopotential method is used to derive electron hole structures in a suprathermal plasma having a regularized $\kappa$ probability distribution function background. The regularized character allows the exploration of small $\kappa$…

Plasma Physics · Physics 2023-10-16 Fernando Haas , Horst Fichtner , Klaus Scherer

We consider long-range percolation in dimension $d\geq 1$, where distinct sites $x$ and $y$ are connected with probability $p_{x,y}\in[0,1]$. Assuming that $p_{x,y}$ is translation invariant and that $p_{x,y}=\|x-y\|^{-s+o(1)}$ with $s>2d$,…

Probability · Mathematics 2007-05-23 Noam Berger

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…

Machine Learning · Computer Science 2014-06-17 Andreas Maurer , Massimiliano Pontil , Bernardino Romera-Paredes

We perform a smoothed analysis of the componentwise condition numbers for determinant computation, matrix inversion, and linear equations solving for sparse n times n matrices. The bounds we obtain for the ex- pectations of the logarithm of…

Numerical Analysis · Mathematics 2013-02-26 Dennis Cheung , Felipe Cucker

Let $f$ be a $p$-primitive cusp form of level $p^{4r}$, where local representation of $f$ be supercuspidal at $p$, $p$ being an odd prime, $r\geq 1$ and $g$ be a Hecke-Maass or holomorphic primitive cusp form for…

Number Theory · Mathematics 2025-01-22 Aritra Ghosh

We study the thresholds for the property of containing a solution to a linear homogeneous system in random sets. We expand a previous sparse Sz\'emeredi-type result of Schacht to the broadest class of matrices possible. We also provide a…

Combinatorics · Mathematics 2017-01-09 Christoph Spiegel

We prove sparse bounds for pseudodifferential operators associated to H\"ormander symbol classes. Our sparse bounds are sharp up to the endpoint and rely on a single scale analysis. As a consequence, we deduce a range of weighted estimates…

Classical Analysis and ODEs · Mathematics 2018-03-23 David Beltran , Laura Cladek

We give lower bounds for the problem of stable sparse recovery from /adaptive/ linear measurements. In this problem, one would like to estimate a vector $x \in \R^n$ from $m$ linear measurements $A_1x,..., A_mx$. One may choose each vector…

Data Structures and Algorithms · Computer Science 2012-10-23 Eric Price , David P. Woodruff

Real-world processes often contain intermediate state that can be modeled as an extremely sparse activation tensor. In this work, we analyze the identifiability of such sparse and local latent intermediate variables, which we call motifs.…

Machine Learning · Computer Science 2026-03-04 Kavi Gupta , Osbert Bastani , Armando Solar-Lezama

We study verifiable sufficient conditions and computable performance bounds for sparse recovery algorithms such as the Basis Pursuit, the Dantzig selector and the Lasso estimator, in terms of a newly defined family of quality measures for…

Information Theory · Computer Science 2018-01-22 Zhiyong Zhou , Jun Yu

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…

Combinatorics · Mathematics 2015-09-01 Richard Kenyon , Daniel Kral , Charles Radin , Peter Winkler

We prove a sharp $L^p$ weighted Hardy inequality involving boundary distance $\delta$ for any domain $\Omega\subsetneq \mathbb R^n$. The inequality may be improved substantially under the additional assumption that $-\log \delta$ is…

Analysis of PDEs · Mathematics 2020-07-21 Bo-Yong Chen

We study the problem of recovering the underlining sparse signals from clean or noisy phaseless measurements. Due to the sparse prior of signals, we adopt an L0regularized variational model to ensure only a small number of nonzero elements…

Optimization and Control · Mathematics 2016-12-09 Yuping Duan , Chunlin Wu , Zhi-Feng Pang , Huibin Chang

We give a method for producing explicit bounds on $g(p)$, the least primitive root modulo $p$. Using our method we show that $g(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}}$ for $p>10^{56}$ where $r\geq 2$ is an integer parameter.…

Number Theory · Mathematics 2019-04-30 Kevin J. McGown , Tim Trudgian

The $L^p$ ($1<p<\infty$) and weak-$L^1$ estimates for the variation for Calder\'on-Zygmund operators with smooth odd kernel on uniformly rectifiable measures are proven. The $L^2$ boundedness and the corona decomposition method are two key…

Classical Analysis and ODEs · Mathematics 2016-05-17 Albert Mas , Xavier Tolsa

Due to the robustness in sensing, radar has been highlighted, overcoming harsh weather conditions such as fog and heavy snow. In this paper, we present a novel radar-only place recognition that measures the similarity score by utilizing…

Robotics · Computer Science 2023-07-11 Hyesu Jang , Minwoo Jung , Ayoung Kim

Researchers have widely used exploratory factor analysis (EFA) to learn the latent structure underlying multivariate data. Rotation and regularised estimation are two classes of methods in EFA that they often use to find interpretable…

Methodology · Statistics 2023-02-01 Xinyi Liu , Gabriel Wallin , Yunxiao Chen , Irini Moustaki