Results 11 to 20 of about 488 (114)
Boolean functions with small approximate spectral norm
Boolean functions with small approximate spectral norm, Discrete Analysis 2024:6, 22 pp. Let $G$ be a finite Abelian group and let $f:G\to\mathbb C$.
Tsun Ming Cheung +3 more
doaj +4 more sources
The spectral norm of random lifts of matrices [PDF]
Electronic Communications in Probability ...
Bandeira, Afonso S., Ding, Yunzi
openaire +3 more sources
Spectral Norm of Symmetric Functions [PDF]
The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning theory, circuit complexity, and communication complexity. In this paper, we give a combinatorial characterization
Anil Ada, Omar Fawzi, Hamed Hatami
openaire +2 more sources
Bounds on spectral norms and barcodes [PDF]
We investigate the relations between algebraic structures, spectral invariants, and persistence modules, in the context of monotone Lagrangian Floer homology with Hamiltonian term. Firstly, we use the newly introduced method of filtered continuation elements to prove that the Lagrangian spectral norm controls the barcode of the Hamiltonian perturbation
Kislev, Asaf, Shelukhin, Egor
openaire +2 more sources
SPECTRAL AREA ESTIMATES FOR NORMS OF COMMUTATORS [PDF]
Let A and B be commuting bounded linear operators on a Hilbert space. In this paper, we study spectral area estimates for norms of A∗B −BA∗ when A is subnormal or p-hyponormal.
Cho, Muneo, Nakazi, Takahiko
openaire +2 more sources
A concise proof to the spectral and nuclear norm bounds through tensor partitions
On estimations of the lower and upper bounds for the spectral and nuclear norm of a tensor, Li established neat bounds for the two norms based on regular tensor partitions, and proposed a conjecture for the same bounds to be hold based on general tensor ...
Kong Xu
doaj +1 more source
Tensor Completion Using Spectral $(k,p)$ -Support Norm
In this paper, the goal is to reconstruct a tensor, i.e., a multi-dimensional array, when only subsets of its entries are observed. For well-posedness, the tensor is assumed to have a low-Tucker-rank structure.
Dongxu Wei +3 more
doaj +1 more source
Circulant matrices: norm, powers, and positivity [PDF]
In their recent paper "The spectral norm of a Horadam circulant matrix", Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the spectral norm of a general real circulant matrix \({\bf C}\) equals the modulus of its row/column sum.
Marko Lindner
doaj +1 more source
A Hybrid Norm for Guaranteed Tensor Recovery
Benefiting from the superiority of tensor Singular Value Decomposition (t-SVD) in excavating low-rankness in the spectral domain over other tensor decompositions (like Tucker decomposition), t-SVD-based tensor learning has shown promising performance and
Yihao Luo +5 more
doaj +1 more source
Spectral Norm and Nuclear Norm of a Third Order Tensor
The spectral norm and the nuclear norm of a third order tensor play an important role in the tensor completion and recovery problem. We show that the spectral norm of a third order tensor is equal to the square root of the spectral norm of three positive semi-definite biquadratic tensors, and the square roots of the nuclear norms of those three ...
Liqun Qi 0001, Shenglong Hu
openaire +2 more sources

