English
Related papers

Related papers: A metric approach to sparse domination

200 papers

The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that can enhance the resolution of an imaging system and even…

Data Structures and Algorithms · Computer Science 2022-10-13 Yaonan Jin , Daogao Liu , Zhao Song

We consider expected risk minimization problems when the range of the estimator is required to be nonnegative, motivated by the settings of maximum likelihood estimation (MLE) and trajectory optimization. To facilitate nonlinear…

Machine Learning · Statistics 2022-05-05 Abhishek Chakraborty , Ketan Rajawat , Alec Koppel

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…

Machine Learning · Computer Science 2019-01-25 Yuan Shi , Aurélien Bellet , Fei Sha

Let $i\in\{1,2\}$ and $X_i$ be a space of homogeneous type in the sense of Coifman and Weiss with the upper dimension $\omega_i$. Also let $\eta_i$ be the smoothness index of the Auscher--Hyt\"onen wavelet function $\psi^{k_i}_{\alpha_i}$…

Functional Analysis · Mathematics 2026-02-20 Ziyi He , Dachun Yang , Taotao Zheng

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…

Numerical Analysis · Mathematics 2024-07-24 Moritz Moeller , Serhii Stasyuk , Tino Ullrich

We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree $r$ polynomial which depends on at most $k$ inputs, counting at most $\ell$ monomial terms, which minimizes the sum of the squares…

Optimization and Control · Mathematics 2017-09-29 Dimitris Bertsimas , Bart Van Parys

In this paper we consider a generalized version of bounded oscillation operators, involving new parameters in the definition, as well as considering the operators on vector-valued function spaces. With this definition we will capture some…

Classical Analysis and ODEs · Mathematics 2023-08-08 Grigori A. Karagulyan

We impose standard $ T1 $-type assumptions on a Calder\'on-Zygmund operator $ T $, and deduce that for bounded compactly supported functions $ f, g $ there is a sparse bilinear form $ \Lambda $ so that $$ \lvert \langle T f, g \rangle\rvert…

Classical Analysis and ODEs · Mathematics 2016-12-20 Michael T. Lacey , Darío Mena

Motivated by applications of large embedding models, we study differentially private (DP) optimization problems under sparsity of individual gradients. We start with new near-optimal bounds for the classic mean estimation problem but with…

Machine Learning · Computer Science 2024-11-01 Badih Ghazi , Cristóbal Guzmán , Pritish Kamath , Ravi Kumar , Pasin Manurangsi

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…

Classical Analysis and ODEs · Mathematics 2017-05-11 Ben Krause , Michael Lacey , Máté Wierdl

This paper studies sparse super-resolution in arbitrary dimensions. More precisely, it develops a theoretical analysis of support recovery for the so-called BLASSO method, which is an off-the-grid generalisation of l1 regularization (also…

Numerical Analysis · Mathematics 2017-09-12 Clarice Poon , Gabriel Peyré

This paper is a direct followup of the recent author's paper. In this paper we continue to analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special…

Numerical Analysis · Mathematics 2024-01-29 V. Temlyakov

Many inverse problems in signal processing deal with the robust estimation of unknown data from underdetermined linear observations. Low dimensional models, when combined with appropriate regularizers, have been shown to be efficient at…

Information Theory · Computer Science 2016-12-07 Yann Traonmilin , Rémi Gribonval

This is the second part of a two-paper series on generalized inverses that minimize matrix norms. In Part II we focus on generalized inverses that are minimizers of entrywise p norms whose main representative is the sparse pseudoinverse for…

Information Theory · Computer Science 2017-07-14 Ivan Dokmanić , Rémi Gribonval

In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…

Numerical Analysis · Mathematics 2017-06-12 Ben Adcock , Simone Brugiapaglia , Clayton G. Webster

Optimal control is a popular approach to synthesize highly dynamic motion. Commonly, $L_2$ regularization is used on the control inputs in order to minimize energy used and to ensure smoothness of the control inputs. However, for some…

Robotics · Computer Science 2022-07-18 Traiko Dinev , Wolfgang Merkt , Vladimir Ivan , Ioannis Havoutis , Sethu Vijayakumar

Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…

Information Theory · Computer Science 2016-11-24 M. Ferreira Da Costa , W. Dai

We propose a novel method for establishing the sparsity of the coefficients of the Laguerre generalized polynomial chaos expansion of solutions to parametric elliptic PDEs with log-gamma inputs on $\mathbb{R}_+^\infty$. The established…

Numerical Analysis · Mathematics 2026-03-17 Dinh Dũng , Van Kien Nguyen , Viet Ha Hoang

Image convolution with complex kernels is a fundamental operation in photography, scientific imaging, and animation effects, yet direct dense convolution is computationally prohibitive on resource-limited devices. Existing approximations,…

Graphics · Computer Science 2026-05-20 Zhizhen Wu , Zhe Cao , Yuchi Huo

We study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the…

Classical Analysis and ODEs · Mathematics 2019-12-19 Izabella Laba , Malabika Pramanik
‹ Prev 1 4 5 6 7 8 10 Next ›