← Search

Christopher Yau

14 accepted papers

2026

Hybrid Restricted Master Problem for Boolean Matrix Factorisation

AAAI 2026technical

We present bfact, a Python package for performing accurate low-rank Boolean matrix factorisation (BMF). bfact uses a hybrid combinatorial optimisation approach based on a priori candidate factors generated from clustering algorithms. It selects the best disjoint factors before performing either a se

Cited by 0SourcePDFScholar
2026

Var-JEPA: Variational Joint-Embedding Predictive Architecture – Bridging Predictive and Generative Self-Supervised Learning

ICML 2026poster

The Joint-Embedding Predictive Architecture (JEPA) is often seen as a non-generative alternative to likelihood-based self-supervised learning, emphasizing prediction in representation space rather than reconstruction in observation space. We argue that the resulting separation from probabilistic gen…

Cited by 0SourceScholar
2025

DoseSurv: Predicting Personalized Survival Outcomes under Continuous-Valued Treatments

NeurIPS 2025poster

Estimating heterogeneous treatment effects (HTEs) of continuous-valued interventions on survival, that is, time-to-event (TTE) outcomes, is crucial in various fields, notably in clinical decision-making and in driving the advancement of next-generation clinical trials. However, while HTE estimation…

Cited by 0SourceScholar
2022

A Multi-Resolution Framework for U-Nets with Applications to Hierarchical VAEs

NeurIPS 2022accept

U-Net architectures are ubiquitous in state-of-the-art deep learning, however their regularisation properties and relationship to wavelets are understudied. In this paper, we formulate a multi-resolution framework which identifies U-Nets as finite-dimensional truncations of models on an infinite-dim…

Cited by 10SourcePDFScholar
2022

Derivative-Based Neural Modelling of Cumulative Distribution Functions for Survival Analysis

AISTATS 2022poster

Survival models — particularly those able to account for patient comorbidities via competing risks analysis — offer valuable prognostic information to clinicians making critical decisions and represent a growing area of application for machine learning approaches. However, current methods typically…

2021

BasisDeVAE: Interpretable Simultaneous Dimensionality Reduction and Feature-Level Clustering with Derivative-Based Variational Autoencoders

ICML 2021spotlight

The Variational Autoencoder (VAE) performs effective nonlinear dimensionality reduction in a variety of problem settings. However, the black-box neural network decoder function typically employed limits the ability of the decoder function to be constrained and interpreted, making the use of VAEs pro…

2021

Multi-Facet Clustering Variational Autoencoders

NeurIPS 2021poster

Work in deep clustering focuses on finding a single partition of data. However, high-dimensional data, such as images, typically feature multiple interesting characteristics one could cluster over. For example, images of objects against a background could be clustered over the shape of the object an…

2020

BasisVAE: Translation-invariant feature-level clustering with Variational Autoencoders

AISTATS 2020poster

Variational Autoencoders (VAEs) provide a flexible and scalable framework for non-linear dimensionality reduction. However, in application domains such as genomics where data sets are typically tabular and high-dimensional, a black-box approach to dimensionality reduction does not provide sufficient…

2020

Neural Decomposition: Functional ANOVA with Variational Autoencoders

AISTATS 2020poster

Variational Autoencoders (VAEs) have become a popular approach for dimensionality reduction. However, despite their ability to identify latent low-dimensional structures embedded within high-dimensional data, these latent representations are typically hard to interpret on their own. Due to the black…

2019

Augmented Ensemble MCMC sampling in Factorial Hidden Markov Models

AISTATS 2019poster

Bayesian inference for Factorial Hidden Markov Models is challenging due to the exponentially sized latent variable space. Standard Monte Carlo samplers can have difficulties effectively exploring the posterior landscape and are often restricted to exploration around localised regions that depend on…

Cited by 4SourcePDFScholar
2019

Decomposing feature-level variation with Covariate Gaussian Process Latent Variable Models

ICML 2019oral

The interpretation of complex high-dimensional data typically requires the use of dimensionality reduction techniques to extract explanatory low-dimensional representations. However, in many real-world problems these representations may not be sufficient to aid interpretation on their own, and it wo…

2017

Testing and Learning on Distributions with Symmetric Noise Invariance

NeurIPS 2017poster

Kernel embeddings of distributions and the Maximum Mean Discrepancy (MMD), the resulting distance between distributions, are useful tools for fully nonparametric two-sample testing and learning on distributions. However, it is rarely that all possible differences between samples are of interest -- d…

Cited by 12SourcePDFScholar