相关论文: On a Norm Compression Inequality for 2XN Partition…

Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B =…

Nonnegative matrix factorization (NMF) has become a ubiquitous tool for data analysis. An important variant is the sparse NMF problem which arises when we explicitly require the learnt features to be sparse. A natural measure of sparsity is…

A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…

Given complex numbers $a, b, c$ and a non-negative continuous function $\varphi$ defined on $[0, +\infty)$, consider the $2 \times 2$ matrix $$ M_t = \begin{pmatrix} a & t \\ ct & b\varphi(t) \end{pmatrix}, \quad t \in [0, +\infty). $$ We…

In the first part of the present work the $\mu-\tau $ symmetry of the neutrino mass matrix is perturbed at its minimal level in order to produce deviation from Tri-bimaximal mixing (TBM), which includes nonzero value of reactor angle…

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…

The paper aims to establish the Tur\'an inequalities, the Laguerre inequalities (order $2$), and the determinantal inequalities (order $3$) for $\Delta p(n)$ and $\Delta \bar{p}(n)$, where $\Delta f(n)$ is the first-order forward difference…

Two-Bar Charts Packing Problem is to pack $n$ two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. We prove that the problem remains strongly NP-hard even if…

We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…

In this paper we compare the difference in performance of two of the Prediction by Partial Matching (PPM) family of compressors (PPM$^*$ and the original Bounded PPM algorithm) and the Lempel-Ziv 78 (LZ) algorithm. We construct an infinite…

The present paper is devoted to the second part of our project on asymmetric maximal inequalities, where we consider martingales in continuous time. Let $(\mathcal M,\tau)$ be a noncommutative probability space equipped with a continuous…

Deep convolutional neural networks (CNNs) with a large number of parameters require intensive computational resources, and thus are hard to be deployed in resource-constrained platforms. Decomposition-based methods, therefore, have been…

A previous study of diatomic molecules revealed that variational second-order density matrix theory has serious problems in the dissociation limit when the N-representability is imposed at the level of the usual two-index (P, Q, G) or even…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

Neural networks are widely used for image-related tasks but typically demand considerable computing power. Once a network has been trained, however, its memory- and compute-footprint can be reduced by compression. In this work, we focus on…

Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…

We present Rosenthal-type moment inequalities for matrix-valued U-statistics of order 2. As a corollary, we obtain new matrix concentration inequalities for U-statistics. One of our main technical tools, a version of the non-commutative…

A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten $p$-classes for p>2 is proved

Utilising some recent ideas from our bilinear bi-parameter theory, we give an efficient proof of a two-weight Bloom type inequality for iterated commutators of linear bi-parameter singular integrals. We prove that if $T$ is a bi-parameter…

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…