Related papers: Unbiased orthogonal designs

This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…

It has been conjectured that a complete set of mutually unbiased bases in a space of dimension d exists if and only if there is an affine plane of order d. We introduce affine constellations and compare their existence properties with those…

Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often…

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…

In all applications in digital communications, it is crucial for an estimator to be unbiased. Although so-called soft feedback is widely employed in many different fields of engineering, typically the biased estimate is used. In this paper,…

Symmetric Positive Definite (SPD) matrices have been used in many fields of medical data analysis. Many Riemannian metrics have been defined on this manifold but the choice of the Riemannian structure lacks a set of principles that could…

Let q be a power of 2. We show by representation theory that there exists a q x q unitary matrix of multiplicative order q+1 whose powers generate q+1 pairwise mutually unbiased base in C^q. When q is a power of an odd prime, there is a q x…

This work studies the problem of learning unbiased algorithms from biased feedback for recommendation. We address this problem from a novel distribution shift perspective. Recent works in unbiased recommendation have advanced the…

We study unextendible maximally entangled basis in arbitrary bipartite spaces. A systematic way of constructing a set of $d^{2}$ orthonormal maximally entangled states in $\mathbb{C}^{d}\bigotimes\mathbb{C}^{d'}(\frac{d'}{2}<d<d')$ is…

We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…

Two equivalent ways of looking for mutually unbiased bases are discussed in this note. The passage from the search for d+1 mutually unbiased bases in C(d) to the search for d(d+1) vectors in C(d*d) satisfying constraint relations is…

We introduce a new method of estimation of parameters in semiparametric and nonparametric models. The method is based on estimating equations that are $U$-statistics in the observations. The $U$-statistics are based on higher order…

This article discusses a generalization of the 1-dimensional multi-reference alignment problem. The goal is to recover a hidden signal from many noisy observations, where each noisy observation includes a random translation and random…

Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…

Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…

We develop a new technique to construct mutually unbiased tripartite absolutely maximally entangled bases. We first explore the tripartite absolutely maximally entangled bases and mutually unbiased bases in $\mathbb{C}^{d} \otimes…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

We introduce the notion of a {\it mock tridiagonal system}. This is a generalization of a tridiagonal system in which the irreducibility assumption is replaced by a certain non-vanishing condition. We show how mock tridiagonal systems can…

We consider optimal experimental design (OED) for Bayesian nonlinear inverse problems governed by partial differential equations (PDEs) under model uncertainty. Specifically, we consider inverse problems in which, in addition to the…

We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…