Related papers: Relative Rank and Regularization

In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor…

1. A standard Gaussian random matrix has full rank with probability 1 and is well-conditioned with a probability quite close to 1 and converging to 1 fast as the matrix deviates from square shape and becomes more rectangular. 2. If we…

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…

We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…

This paper considers the problem of randomly assigning a set of objects to a set of agents based on the ordinal preferences of agents. We generalize the well-known immediate acceptance algorithm to the afore-mentioned random environments…

Low-rank modeling has many important applications in computer vision and machine learning. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better empirical…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

Rank-based inference methods are applied in various disciplines, typically when procedures relying on standard normal theory are not justifiable, for example when data are not symmetrically distributed, contain outliers, or responses are…

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

This paper offers a new perspective to ease the challenge of domain generalization, which involves maintaining robust results even in unseen environments. Our design focuses on the decision-making process in the final classifier layer.…

Exciting new work on the generalization bounds for neural networks (NN) given by Neyshabur et al. , Bartlett et al. closely depend on two parameter-depenedent quantities: the Lipschitz constant upper-bound and the stable rank (a softer…

Optimization problems with rank constraints appear in many diverse fields such as control, machine learning and image analysis. Since the rank constraint is non-convex, these problems are often approximately solved via convex relaxations.…

We develop an algorithm to train individually fair learning-to-rank (LTR) models. The proposed approach ensures items from minority groups appear alongside similar items from majority groups. This notion of fair ranking is based on the…

Polynomial kernel regression is one of the standard and state-of-the-art learning strategies. However, as is well known, the choices of the degree of polynomial kernel and the regularization parameter are still open in the realm of model…

Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures, compressed graphs, and more. Theoretically considered yet…

The main purpose of this paper is to introduce a new category, which we call a resonance category, whose combinatorics reflect that of canonical stratifications of $n$-fold symmetric smash products. The study of the stratifications can then…

We prove that the (hermitian) rank of $QP^d$ is bounded from below by the rank of $P^d$ whenever $Q$ is not identically zero and real-analytic in a neighborhood of some point on the zero set of $P$ in $\mathbb{C}^n$ and $P$ is a polynomial…

We give an exact value of the rank of an $\mathcal{F}$-Fubini sum of filters for the case where $\mathcal{F}$ is a Borel filter of rank $1$. We also consider $\mathcal{F}$-limits of filters $\mathcal{F}_i$, which are of the form…