Related papers: A Gauche perspective on row reduced echelon form a…
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can be represented by a block-bidiagonal matrix that we call the…
We propose a new Riemannian geometry for fixed-rank matrices that is specifically tailored to the low-rank matrix completion problem. Exploiting the degree of freedom of a quotient space, we tune the metric on our search space to the…
We consider exact matrix decomposition by Gauss-Bareiss reduction. We investigate two aspects of the process: common row and column factors and the influence of pivoting strategies. We identify two types of common factors: systematic and…
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are defined as a stack of graphs successively reduced. Within this…
Hashing methods aim to learn a set of hash functions which map the original features to compact binary codes with similarity preserving in the Hamming space. Hashing has proven a valuable tool for large-scale information retrieval. We…
Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…
We propose a new method to learn the structure of a Gaussian graphical model with finite sample false discovery rate control. Our method builds on the knockoff framework of Barber and Cand\`{e}s for linear models. We extend their approach…
We develop a framework for indirect discovery in the Standard Model Effective Field Theory (SMEFT) based on Bayesian model selection over operator subsets. We argue that SMEFT should be understood as a structured space of competing…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
This note provides a very short proof of a spectral gap independent property of the simultaneous iterations algorithm for finding the top singular space of a matrix. See Rokhlin-Szlam-Tygert-2009, Halko-Martinsson-Tropp-2011 and…
A \emph{gerechte framework} is a partition of an $n \times n$ array into $n$ regions of $n$ cells each. A \emph{realization} of a gerechte framework is a latin square of order $n$ with the property that when its cells are partitioned by the…
A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the…
We consider the computation of averaged coefficients for the homogenization of elliptic partial differential equations. In this problem, like in many multiscale problems, a large number of similar computations parametrized by the…
A new methodology for model determination in decomposable graphical Gaussian models is developed. The Bayesian paradigm is used and, for each given graph, a hyper inverse Wishart prior distribution on the covariance matrix is considered.…
We introduce efficient Markov chain Monte Carlo methods for inference and model determination in multivariate and matrix-variate Gaussian graphical models. Our framework is based on the G-Wishart prior for the precision matrix associated…
Graphical modeling explores dependences among a collection of variables by inferring a graph that encodes pairwise conditional independences. For jointly Gaussian variables, this translates into detecting the support of the precision…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the…
A framework to analyze inference performance in densely connected single-layer feed-forward networks is developed for situations where a given data set is composed of correlated patterns. The framework is based on the assumption that the…
In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…