arXiv research

Investigates offline RL in factorisable action spaces, overcoming overestimation bias.

We provide sufficient conditions to factorise an equivariant spectral triple as a Kasparov product of unbounded classes constructed from the group action on the algebra and from the fixed point spectral triple. Our results are for the action of compact abelian Lie groups, and we demonstrate them with examples from mani…

The construction of topological index maps for equivariant families of Dirac operators requires factoring a general smooth map through maps of a very simple type: zero sections of vector bundles, open embeddings, and vector bundle projections. Roughly speaking, a normally non-singular map is a map together with such a …

New method reduces bias and variance in OPE for large action spaces.

We study geodesic equations for a family of right-invariant Riemannian metrics on the group of diffeomorphisms of a compact manifold. The metrics descend to Fisher's information metric on the space of smooth probability densities. The right reduced geodesic equations are higher-dimensional generalisations of the $μ$--H…

Let $X$ be a CR manifold with transversal, proper CR $G$-action. We show that $X/G$ is a complex space such that the quotient map is a CR map. Moreover the quotient is universal, i.e. every invariant CR map into a complex manifold factorises uniquely over a holomorphic map on $X/G$. We then use this result and complex …

We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional samples to estimate t…

New open books defy positive factorisation in genus one.

We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the structure group is compact, then a choice of an ad-invariant inner product on its Li…

Unified framework for non-negative matrices and tensors using Wasserstein loss.

We introduce and demonstrate the variational autoencoder (VAE) for probabilistic non-negative matrix factorisation (PAE-NMF). We design a network which can perform non-negative matrix factorisation (NMF) and add in aspects of a VAE to make the coefficients of the latent space probabilistic. By restricting the weights i…

This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation algorithm. Using the probabilistic model, we derive a matrix factorisation algorithm …

Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic genera…

We identify a new variational inference scheme for dynamical systems whose transition function is modelled by a Gaussian process. Inference in this setting has either employed computationally intensive MCMC methods, or relied on factorisations of the variational posterior. As we demonstrate in our experiments, the fact…

In this paper, we study the trade-offs of different inference approaches for Bayesian matrix factorisation methods, which are commonly used for predicting missing values, and for finding patterns in the data. In particular, we consider Bayesian nonnegative variants of matrix factorisation and tri-factorisation, and com…

HZ transform applied to knot polynomials reveals hyperbolic knot structures.

We tackle the problem disentangling the latent space of an autoencoder in order to separate labelled attribute information from other characteristic information. This then allows us to change selected attributes while preserving other information. Our method, matrix subspace projection, is much simpler than previous ap…

FACMAC combines deep policy gradients with factored critic for multi-agent reinforcement learning.

We introduce a novel Bayesian hybrid matrix factorisation model (HMF) for data integration, based on combining multiple matrix factorisation methods, that can be used for in- and out-of-matrix prediction of missing values. The model is very general and can be used to integrate many datasets across different entity type…

Loops in surfaces and chord diagrams are studied with graph factorizations and grammars.

We define disentanglement in generative models and prove it's related to identifiable factors.

Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.

FPGs use structure to improve policy learning in complex tasks.

Kotschick and Morita recently discovered factorisations of characteristic classes of transversally symplectic foliations that yield new characteristic classes in foliated cohomology. We describe an alternative construction of such factorisations and construct examples of topologically trivial foliated vector bundles fo…

In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximatio…

We present a novel approach which is able to explore the configuration of grouped convolutions within neural networks. Group-size Series (GroSS) decomposition is a mathematical formulation of tensor factorisation into a series of approximations of increasing rank terms. GroSS allows for dynamic and differentiable selec…

This paper reviews recent advances in Gaussian process regression methods.

The paper shows how to recover true node positions from a graph or similarity matrix.

In many real-world settings, a team of agents must coordinate their behaviour while acting in a decentralised way. At the same time, it is often possible to train the agents in a centralised fashion in a simulated or laboratory setting, where global state information is available and communication constraints are lifte…

Representing 3D shape deformations by linear models in high-dimensional space has many applications in computer vision and medical imaging, such as shape-based interpolation or segmentation. Commonly, using Principal Components Analysis a low-dimensional (affine) subspace of the high-dimensional shape space is determin…

The functional determinants of the GJMS scalar operators, P_{2k}, on even-dimensional spheres are computed via Barnes multiple gamma functions relying on the numerical availability of the digamma function. For the critical k=d/2 case, it is necessary to calculate the Stirling moduli. The multiplicative anomalies are gi…

In this paper we introduce the curvature of densely defined universal connections on Hilbert $C^{*}$-modules relative to a spectral triple (or unbounded Kasparov module), obtaining a well-defined curvature operator. Fixing the spectral triple, we find that modulo junk forms, the curvature only depends on the represente…

In this paper, we study the effects of different prior and likelihood choices for Bayesian matrix factorisation, focusing on small datasets. These choices can greatly influence the predictive performance of the methods. We identify four groups of approaches: Gaussian-likelihood with real-valued priors, nonnegative prio…

We focus on variational inference in dynamical systems where the discrete time transition function (or evolution rule) is modelled by a Gaussian process. The dominant approach so far has been to use a factorised posterior distribution, decoupling the transition function from the system states. This is not exact in gene…

We propose a new approach for Collaborative Filtering which is based on Boolean Matrix Factorisation (BMF) and Formal Concept Analysis. In a series of experiments on real data (Movielens dataset) we compare the approach with the SVD- and NMF-based algorithms in terms of Mean Average Error (MAE). One of the experimental…

Identifying overlapping communities in networks is a challenging task. In this work we present a novel approach to community detection that utilises the Bayesian non-negative matrix factorisation (NMF) model to produce a probabilistic output for node memberships. The scheme has the advantage of computational efficiency…

In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the property that the set of pairwise matchings is cycle-consistent, i.e. in the full…

This paper studies clustering for possibly high dimensional data (e.g. images, time series, gene expression data, and many other settings), and rephrase it as low rank matrix estimation in the PAC-Bayesian framework. Our approach leverages the well known Burer-Monteiro factorisation strategy from large scale optimisati…

Bottom-Up Hidden Tree Markov Model is a highly expressive model for tree-structured data. Unfortunately, it cannot be used in practice due to the intractable size of its state-transition matrix. We propose a new approximation which lies on the Tucker factorisation of tensors. The probabilistic interpretation of such ap…

Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In …

For large matrix factorisation problems, we develop a distributed Markov Chain Monte Carlo (MCMC) method based on stochastic gradient Langevin dynamics (SGLD) that we call Parallel SGLD (PSGLD). PSGLD has very favourable scaling properties with increasing data size and is comparable in terms of computational requiremen…

The paper deals with the Weyl equation which is the massless Dirac equation. We study the Weyl equation in the stationary setting, i.e. when the the spinor field oscillates harmonically in time. We suggest a new geometric interpretation of the stationary Weyl equation, one which does not require the use of spinors, Pau…

QR-MIX models joint state-action values as a distribution to handle randomness in MARL.

We tackle the problem of collaborative filtering (CF) with side information, through the lens of Gaussian Process (GP) regression. Driven by the idea of using the kernel to explicitly model user-item similarities, we formulate the GP in a way that allows the incorporation of low-rank matrix factorisation, arriving at o…

We define the sigma-model action for world-sheets with embedded defect networks in the presence of a three-form field strength. We derive the defect gluing condition for the sigma-model fields and their derivatives, and use it to distinguish between conformal and topological defects. As an example, we treat the WZW mod…

QMIX combines per-agent values to create decentralised policies.

We developed an efficient algorithm to factorize knots.

While matrix factorisation models are ubiquitous in large scale recommendation and search, real time application of such models requires inner product computations over an intractably large set of item factors. In this manuscript we present a novel framework that uses the inverted index representation to exploit struct…