paper-with-me

Papers

Compressibility Measures for Affinely Singular Random Vectors

2020-01-12 · Mohammad-Amin Charusaie, Arash Amini, Stefano Rini

There are several ways to measure the compressibility of a random measure; they include general approaches such as using the rate-distortion curve, as well as more specific notions, such as the Renyi information dimension (RID). The RID parameter indicates the concentration of the measure around lower-dimensional subsets of the space. While the evaluation of such compressibility parameters is well-studied for continuous and discrete measures, the case of discrete-continuous measures is quite subtle. In this paper, we focus on a class of multi-dimensional random measures that have singularities on affine lower-dimensional subsets. This class of distributions naturally arises when considering linear transformation of component-wise independent discrete-continuous random variables. To measure the compressibility of such distributions, we introduce the new notion of dimensional-rate bias (DRB) which is closely related to the entropy and differential entropy in discrete and continuous cases, respectively. Similar to entropy and differential entropy, DRB is useful in evaluating the mutual information between distributions of the aforementioned type. Besides the DRB, we also evaluate the the RID of these distributions. We further provide an upper-bound for the RID of multi-dimensional random measures that are obtained by Lipschitz functions of component-wise independent discrete-continuous random variables ($\mathbf{X}$). The upper-bound is shown to be achievable when the Lipschitz function is $A \mathbf{X}$, where $A$ satisfies {\changed$\spark({A_{m\times n}}) = m+1$} (e.g., Vandermonde matrices). When considering discrete-domain moving-average processes with non-Gaussian excitation noise, the above results allow us to evaluate the block-average RID and DRB, as well as to determine a relationship between these parameters and other existing compressibility measures.

📄 PDF Abstract BibTeX arXiv:2001.03884

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Compressibility Measures Complexity: Minimum Description Length Meets Singular Learning Theory

2025-10-14 · Einar Urdshals, Edmund Lau, Jesse Hoogland, Stan van Wingerden 외 arxiv

We study neural network compressibility by using singular learning theory to extend the minimum description length (MDL) principle to singular models like neural networks. Through extensive experiments on the Pythia suit…

Model Compression

Non-Rigid Structure-From-Motion by Rank-One Basis Shapes

2019-04-30 · Sami S. Brandt, Hanno Ackermann

In this paper, we show that the affine, non-rigid structure-from-motion problem can be solved by rank-one, thus degenerate, basis shapes. It is a natural reformulation of the classic low-rank method by Bregler et al., wh…

When Random Tensors meet Random Matrices

2021-12-23 · Mohamed El Amine Seddik, Maxime Guillaud, Romain Couillet

Relying on random matrix theory (RMT), this paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. Using the variational definition of the singular vectors and values of (Lim, 2005), we show that th…

LEMMA

Analysis of singular subspaces under random perturbations

2024-03-14 · Ke Wang

We present a comprehensive analysis of singular vector and singular subspace perturbations in the context of the signal plus random Gaussian noise matrix model. Assuming a low-rank signal matrix, we extend the Davis-Kaha…

A random algorithm for low-rank decomposition of large-scale matrices with missing entries

2014-11-04 · Yiguang Liu

A Random SubMatrix method (RSM) is proposed to calculate the low-rank decomposition of large-scale matrices with known entry percentage \rho. RSM is very fast as the floating-point operations (flops) required are compare…