English
Related papers

Related papers: Sparse domination of sharp variational truncations

200 papers

We obtain Musielak Orlicz bumps conditions on a pair of weights for the boundedness of Calder\'on Zygmund operators and their commutators between variable Lebesgue spaces with different weights. The symbols of the commutators belong to a…

Analysis of PDEs · Mathematics 2019-10-25 Luciana Melchiori , Gladis Pradolini , Wilfredo Ramos

Robust statistical estimators offer resilience against outliers but are often computationally challenging, particularly in high-dimensional sparse settings. Modern optimization techniques are utilized for robust sparse association…

Computation · Statistics 2025-02-03 Pia Pfeiffer , Andreas Alfons , Peter Filzmoser

We explore a recently proposed Variational Dropout technique that provided an elegant Bayesian interpretation to Gaussian Dropout. We extend Variational Dropout to the case when dropout rates are unbounded, propose a way to reduce the…

Machine Learning · Statistics 2017-06-14 Dmitry Molchanov , Arsenii Ashukha , Dmitry Vetrov

There has been an intense development on the estimation of a sparse regression coefficient vector in statistics, machine learning and related fields. In this paper, we focus on the Bayesian approach to this problem, where sparsity is…

Computation · Statistics 2016-02-25 Xichen Huang , Jin Wang , Feng Liang

A new type of dependent thinning for point processes in continuous space is proposed, which leverages the advantages of determinantal point processes defined on finite spaces and, as such, is particularly amenable to statistical, numerical,…

Machine Learning · Computer Science 2019-06-19 Bartłomiej Błaszczyszyn , Paul Keeler

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations. These challenges can be addressed by enforcing sparsity in the series…

Machine Learning · Statistics 2020-06-24 Panagiotis Tsilifis , Iason Papaioannou , Daniel Straub , Fabio Nobile

We consider unbiased estimation of a sparse nonrandom vector corrupted by additive white Gaussian noise. We show that while there are infinitely many unbiased estimators for this problem, none of them has uniformly minimum variance.…

Statistics Theory · Mathematics 2010-06-02 Alexander Jung , Zvika Ben-Haim , Franz Hlawatsch , Yonina C. Eldar

We have utilized the non-conjugate Variational Bayesian (VB) method for the problem of the sparse Poisson regression model. To provide approximate conjugacy in the model, the likelihood is approximated by a quadratic function, yielding…

Methodology · Statistics 2026-02-06 Mitra Kharabati , Morteza Amini , Mohammad Arashi

We introduce a class of operators on abstract measure spaces, which unifies the Calder\'on-Zygmund operators on spaces of homogeneous type, the maximal functions and the martingale transforms. We prove that such operators can be dominated…

Classical Analysis and ODEs · Mathematics 2022-11-07 Grigori A. Karagulyan

We investigate the approximate dynamics of several differential equations when the solutions are restricted to a sparse subset of a given basis. The restriction is enforced at every time step by simply applying soft thresholding to the…

Numerical Analysis · Mathematics 2015-06-12 Hayden Schaeffer , Stanley Osher , Russel Caflisch , Cory Hauck

We suggest an efficient algorithm for the selection of sparse subsets of a set of influence for the numerical discretization of differential operators on irregular nodes with polynomial consistency of a given order with the help of the QR…

Numerical Analysis · Mathematics 2019-08-06 Oleg Davydov

We assume the direct sum <A> o <B> for the signal subspace. As a result of post- measurement, a number of operational contexts presuppose the a priori knowledge of the LB -dimensional "interfering" subspace <B> and the goal is to estimate…

Applications · Statistics 2017-04-17 Guillaume Bouleux , Rémy Boyer

In this paper we analyze the asymptotic properties of l1 penalized maximum likelihood estimation of signals with piece-wise constant mean values and/or variances. The focus is on segmentation of a non-stationary time series with respect to…

Statistics Theory · Mathematics 2014-01-22 Cristian R. Rojas , Bo Wahlberg

We dominate non-integral singular operators by adapted sparse operators and derive optimal norm estimates in weighted spaces. Our assumptions on the operators are minimal and our result applies to an array of situations, whose prototype are…

Classical Analysis and ODEs · Mathematics 2016-08-03 Frédéric Bernicot , Dorothee Frey , Stefanie Petermichl

As a corollary to our main result we deduce sharp A_p$ inequalities for T being either the Hilbert transform in dimension d=1, the Beurling transform in dimension d=2, or a Riesz transform in any dimension d\ge 2. For T_{\ast} the maximal…

Classical Analysis and ODEs · Mathematics 2011-03-30 Tuomas P. Hytönen , Michael T. Lacey , Maria Carmen Reguera , Armen Vagharshakyan

In this paper, we establish a large deviation principle for a type of stochastic partial differential equations (SPDEs) with locally monotone coefficients driven by L\'evy noise. The weak convergence method plays an important role.

Probability · Mathematics 2016-06-08 Jie Xiong , Jianliang Zhai

We consider stochastic partial differential equations under minimal assumptions: the coefficients are merely bounded and measurable and satisfy the stochastic parabolicity condition. In particular, the diffusion term is allowed to be…

Probability · Mathematics 2016-10-18 Konstantinos Dareiotis , Máté Gerencsér

In this paper, we establish sparse dominations for the Dunkl-Calder\'on-Zygmund operators and their commutators in the Dunkl setting. As applications, we first define the Dunkl-Muckenhoupt $A_p$ weight and obtain the weighted bounds for the…

Classical Analysis and ODEs · Mathematics 2025-05-27 Yanping Chen , Xueting Han

Sparsity is a desirable attribute. It can lead to more efficient and more effective representations compared to the dense model. Meanwhile, learning sparse latent representations has been a challenging problem in the field of computer…

Computer Vision and Pattern Recognition · Computer Science 2022-09-22 Hanao Li , Tian Han

We study the theoretical properties of the fused lasso procedure originally proposed by \cite{tibshirani2005sparsity} in the context of a linear regression model in which the regression coefficient are totally ordered and assumed to be…

Statistics Theory · Mathematics 2023-06-28 Fan Wang , Oscar Hernan Madrid Padilla , Yi Yu , Alessandro Rinaldo