Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew J. Vowels

dblp:254/1206 · also Matthew James Vowels · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0002-8811-1156ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Probabilistic and Bayesian machine learning · 49% Representation and self-supervised learning · 18% Trustworthy machine learning · 17%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.922021
VDSM: Unsupervised Video Disentanglement With State-Space Modeling and Deep Mixtures of Experts · CVPR 2021
NestedVAE: Isolating Common Factors via Weak Supervision · CVPR 2020
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.712023
Causal Effect Identification in Uncertain Causal Networks · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal effect identification
0.712023
Causal Effect Identification in Uncertain Causal Networks · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.712023
Causal Effect Identification in Uncertain Causal Networks · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.512021
VDSM: Unsupervised Video Disentanglement With State-Space Modeling and Deep Mixtures of Experts · CVPR 2021
Machine learning › Deep learning architectures and training
state space model
0.512021
VDSM: Unsupervised Video Disentanglement With State-Space Modeling and Deep Mixtures of Experts · CVPR 2021
Machine learning › Trustworthy machine learning
debiasing
0.412020
NestedVAE: Isolating Common Factors via Weak Supervision · CVPR 2020
Machine learning › Trustworthy machine learning
fairness
0.412020
NestedVAE: Isolating Common Factors via Weak Supervision · CVPR 2020
Mathematical optimization
combinatorial optimization
0.212023
Causal Effect Identification in Uncertain Causal Networks · NeurIPS 2023
Machine learning › Generative modeling
variational autoencoder
0.112020
NestedVAE: Isolating Common Factors via Weak Supervision · CVPR 2020

Methods — techniques the papers use, named apart from their topics

approximation algorithm · 1.3unsupervised learning · 0.5mixture of experts · 0.5dynamic prior · 0.5weak supervision · 0.4paired data · 0.4information bottleneck · 0.4
YearPublicationVenuePosition
2023 Causal Effect Identification in Uncertain Causal Networks
abstract
Causal identification is at the core of the causal inference literature, where complete algorithms have been proposed to identify causal queries of interest. The validity of these algorithms hinges on the restrictive assumption of having access to a correctly specified causal structure. In this work, we study the setting where a probabilistic model of the causal structure is available. Specifically, the edges in a causal graph exist with uncertainties which may, for example, represent degree of belief from domain experts. Alternatively, the uncertainty about an edge may reflect the confidence of a particular statistical test. The question that naturally arises in this setting is: Given such a probabilistic graph and a specific causal effect of interest, what is the subgraph which has the highest plausibility and for which the causal effect is identifiable? We show that answering this question reduces to solving an NP-hard combinatorial optimization problem which we call the edge ID problem. We propose efficient algorithms to approximate this problem and evaluate them against both real-world networks and randomly generated graphs.
Sina Akbari, Fateme Jamshidi, Ehsan Mokhtarian, Matthew J. Vowels, Jalal Etesami, Negar Kiyavash
NeurIPS4
2021 VDSM: Unsupervised Video Disentanglement With State-Space Modeling and Deep Mixtures of Experts
abstract
Disentangled representations support a range of downstream tasks including causal reasoning, generative modeling, and fair machine learning. Unfortunately, disentanglement has been shown to be impossible without the incorporation of supervision or inductive bias. Given that supervision is often expensive or infeasible to acquire, we choose to incorporate structural inductive bias and present an unsupervised, deep State-Space-Model for Video Disentanglement (VDSM). The model disentangles latent time-varying and dynamic factors via the incorporation of hierarchical structure with a dynamic prior and a Mixture of Experts decoder. VDSM learns separate disentangled representations for the identity of the object or person in the video, and for the action being performed. We evaluate VDSM across a range of qualitative and quantitative tasks including identity and dynamics transfer, sequence generation, Fréchet Inception Distance, and factor classification. VDSM achieves state-of-the-art performance and exceeds adversarial methods, even when the methods use additional supervision.
Matthew J. Vowels, Necati Cihan Camgöz, Richard Bowden
CVPR1
2021 Improving Robot Localisation by Ignoring Visual Distraction
abstract
Attention is an important component of modern deep learning. However, less emphasis has been put on its inverse: ignoring distraction. Our daily lives require us to explicitly avoid giving attention to salient visual features that confound the task we are trying to accomplish. This visual prioritisation allows us to concentrate on important tasks while ignoring visual distractors.In this work, we introduce Neural Blindness, which gives an agent the ability to completely ignore objects or classes that are deemed distractors. More explicitly, we aim to render a neural network completely incapable of representing specific chosen classes in its latent space. In a very real sense, this makes the network "blind" to certain classes, allowing and agent to focus on what is important for a given task, and demonstrates how this can be used to improve localisation.
Oscar Mendez 0001, Matthew J. Vowels, Richard Bowden
IROS2
2020 NestedVAE: Isolating Common Factors via Weak Supervision
abstract
Fair and unbiased machine learning is an important and active field of research, as decision processes are increasingly driven by models that learn from data. Unfortunately, any biases present in the data may be learned by the model, thereby inappropriately transferring that bias into the decision making process. We identify the connection between the task of bias reduction and that of isolating factors common between domains whilst encouraging domain specific invariance. To isolate the common factors we combine the theory of deep latent variable models with information bottleneck theory for scenarios whereby data may be naturally paired across domains and no additional supervision is required. The result is the Nested Variational AutoEncoder (NestedVAE). Two outer VAEs with shared weights attempt to reconstruct the input and infer a latent space, whilst a nested VAE attempts to reconstruct the latent representation of one image, from the latent representation of its paired image. In so doing, the nested VAE isolates the common latent factors/causes and becomes invariant to unwanted factors that are not shared between paired images. We also propose a new metric to provide a balanced method of evaluating consistency and classifier performance across domains which we refer to as the Adjusted Parity metric. An evaluation of NestedVAE on both domain and attribute invariance, change detection, and learning common factors for the prediction of biological sex demonstrates that NestedVAE significantly outperforms alternative methods.
Matthew J. Vowels, Necati Cihan Camgöz, Richard Bowden
CVPR1
2020 Gated Variational AutoEncoders: Incorporating Weak Supervision to Encourage Disentanglement
abstract
Variational AutoEncoders (VAEs) provide a means to generate representational latent embeddings. Previous research has highlighted the benefits of achieving representations that are disentangled, particularly for downstream tasks. However, there is some debate about how to encourage disentanglement with VAEs, and evidence indicates that existing implementations do not achieve disentanglement consistently. The evaluation of how well a VAE's latent space has been disentangled is often evaluated against our subjective expectations of which attributes should be disentangled for a given problem. Therefore, by definition, we already have domain knowledge of what should be achieved and yet we use unsupervised approaches to achieve it. We propose a weakly-supervised approach that incorporates any available domain knowledge into the training process to form a Gated-VAE. The process involves partitioning the representational embedding and gating backpropagation. All partitions are utilised on the forward pass but gradients are backpropagated through different partitions according to selected image/target pairings. The approach can be used to modify existing VAE models such as beta-VAE, InfoVAE and DIP-VAE-II. Experiments demonstrate that using gated backpropagation, latent factors are represented in their intended partition. The approach is applied to images of faces for the purpose of disentangling head-pose from facial expression. Quantitative metrics show that using Gated-VAE improves average disentanglement, completeness and informativeness, as compared with un-gated implementations. Qualitative assessment of latent traversals demonstrate its disentanglement of head-pose from expression, even when only weak/noisy supervision is available.
Matthew J. Vowels, Necati Cihan Camgöz, Richard Bowden
FG1