Results 31 to 40 of about 167 (104)
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 [PDF]
We present a condition on the matrix of an underdetermined linear system which guarantees that the solution of the system with minimal ℓq-quasinorm is also the sparsest one. This generalizes, and slightly improves, a similar result for the ℓ1-norm.
Foucart, Simon, Lai, Ming-Jun
core +1 more source
Symmetric Spaces of Measurable Functions: Old and New Advances
The article is an extensive review in the theory of symmetric spaces of measurable functions. It contains a number of new (recent) and old (known) results in this field.
M. A. Muratov, B.-Z. A. Rubshtein
doaj +1 more source
A note on stability of Hardy inequalities [PDF]
In this note, we formulate recent stability results for Hardy inequalities in the language of Folland and Stein's homogeneous groups. Consequently, we obtain remainder estimates for Rellich-type inequalities on homogeneous groups.
Durvudkhan Suragan +5 more
core +1 more source
Sparse Signal Recovery via Exponential Metric Approximation
Sparse signal recovery problems are common in parameter estimation, image processing, pattern recognition, and so on. The problem of recovering a sparse signal representation from a signal dictionary might be classified as a linear constraint ℓ0 ...
Jian Pan, Jun Tang, Wei Zhu
doaj +1 more source
Variational Regularized Tree-Structured Wavelet Sparsity for CS-SENSE Parallel Imaging
Both compressed sensing magnetic resonance imaging (MRI) and parallel MRI have emerged as effective techniques to accelerate MRI data acquisition in various clinical applications.
Ryan Wen Liu +4 more
doaj +1 more source
Potential trace inequalities via a Calderón‐type theorem
Abstract In this paper, we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement‐invariant function spaces from analogous properties of operators that are easier to handle (such as fractional maximal operators).
Zdeněk Mihula +2 more
wiley +1 more source
Group-wise Sparse and Explainable Adversarial Attacks [PDF]
Sparse adversarial attacks fool deep neural networks (DNNs) through minimal pixel perturbations, typically regularized by the $\ell_0$ norm. Recent efforts have replaced this norm with a structural sparsity regularizer, such as the nuclear group norm, to
Wagner, Moritz +2 more
core +1 more source
Abstract Let μ$\mu$ be a probability measure on R$\mathbb {R}$. We give conditions on the Fourier transform of its density for functionals of the form H(a)=∫Rnh(⟨a,x⟩)μn(dx)$H(a)=\int _{\mathbb {R}^n}h(\langle a,x\rangle)\mu ^n(dx)$ to be Schur monotone. As applications, we put certain known and new results under the same umbrella, given by a condition
Andreas Malliaris
wiley +1 more source
Quantum linear system algorithm with optimal queries to initial state preparation [PDF]
Quantum algorithms for linear systems produce the solution state $A^{-1}|b\rangle$ by querying two oracles: $O_A$ that block encodes the coefficient matrix and $O_b$ that prepares the initial state.
Guang Hao Low, Yuan Su
doaj +1 more source
ABSTRACT The significance of the Jensen inequality stems from its impactful and compelling outcomes. As a generalization of classical convexity, it plays a key role in deriving other well‐known inequalities such as Hermite–Hadamard, Hölder, Minkowski, arithmetic‐geometric, and Young's inequalities.
İzzettin Demir
wiley +1 more source

