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

Thomas Bird

dblp:227/2305 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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
4 papers
Probabilistic and Bayesian machine learning · 48% Efficient and distributed learning · 29% Generative modeling · 23%
Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.822020
HiLLoC: lossless image compression with hierarchical latent variable models · ICLR 2020
Practical lossless compression with latent variables using bits back coding · ICLR (Poster) 2019
Machine learning › Efficient and distributed learning › model compression › quantization › quantized neural network
binary neural network
0.512021
Reducing the Computational Cost of Deep Generative Models with Binary Neural Networks · ICLR 2021
Machine learning › Efficient and distributed learning
model compression
0.512021
Reducing the Computational Cost of Deep Generative Models with Binary Neural Networks · ICLR 2021
Machine learning › Probabilistic and Bayesian machine learning
divergence measure
0.412020
Spread Divergence · ICML 2020
Machine learning › Probabilistic and Bayesian machine learning › hierarchical modeling
hierarchical model
0.412020
HiLLoC: lossless image compression with hierarchical latent variable models · ICLR 2020
Machine learning › Generative modeling
implicit generative model
0.412020
Spread Divergence · ICML 2020
Image and video coding › image compression
lossless image compression
0.412020
HiLLoC: lossless image compression with hierarchical latent variable models · ICLR 2020
Machine learning › Generative modeling
lossless compression
0.412019
Practical lossless compression with latent variables using bits back coding · ICLR (Poster) 2019
Coding theory › source coding › lossless compression
bits-back coding
0.412019
Practical lossless compression with latent variables using bits back coding · ICLR (Poster) 2019
Coding theory › source coding
lossless compression
0.412019
Practical lossless compression with latent variables using bits back coding · ICLR (Poster) 2019

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

bits-back coding · 1.6hierarchical latent variable model · 0.9variational inference · 0.8binary neural network · 0.5independent component analysis · 0.4divergence minimization · 0.4deep generative network · 0.4
YearPublicationVenuePosition
2022 A Memory Transformer Network for Incremental Learning
Ahmet Iscen, Thomas Bird, Mathilde Caron, Alireza Fathi, Cordelia Schmid
BMVC2
2021 Reducing the Computational Cost of Deep Generative Models with Binary Neural Networks
Thomas Bird, Friso H. Kingma, David Barber
ICLR1
2021 3D Scene Compression through Entropy Penalized Neural Representation Functions
abstract
Some forms of novel visual media enable the viewer to explore a 3D scene from essentially arbitrary viewpoints, by interpolating between a discrete set of original views. Compared to 2D imagery, these types of applications require much larger amounts of storage space, which we seek to reduce. Existing approaches for compressing 3D scenes are often based on a separation of compression and rendering: each of the original views is compressed using traditional 2D image formats; the receiver decompresses the views and then performs the rendering. We unify these steps by directly compressing an implicit representation of the scene, a function that maps spatial coordinates to a radiance vector field, which can then be queried to render arbitrary viewpoints. The function is implemented as a neural network and jointly trained for reconstruction as well as compressibility, in an end-to-end manner, with the use of an entropy penalty on the parameters. Our method significantly outperforms a state-of-the-art conventional approach for scene compression, achieving simultaneously higher quality reconstructions and lower bitrates. Furthermore, we show that the performance at lower bitrates can be improved by jointly representing multiple scenes using a soft form of parameter sharing.
Thomas Bird, Jona Ballé, Philip A. Chou
PCS1
2020 HiLLoC: lossless image compression with hierarchical latent variable models
James Townsend, Thomas Bird, Julius Kunze, David Barber
ICLR2
2020 Spread Divergence
abstract
For distributions $\mathbb{P}$ and $\mathbb{Q}$ with different supports or undefined densities, the divergence $\textrm{D}(\mathbb{P}||\mathbb{Q})$ may not exist. We define a Spread Divergence $\tilde{\textrm{D}}(\mathbb{P}||\mathbb{Q})$ on modified $\mathbb{P}$ and $\mathbb{Q}$ and describe sufficient conditions for the existence of such a divergence. We demonstrate how to maximize the discriminatory power of a given divergence by parameterizing and learning the spread. We also give examples of using a Spread Divergence to train implicit generative models, including linear models (Independent Components Analysis) and non-linear models (Deep Generative Networks).
Mingtian Zhang, Peter Hayes, Thomas Bird, Raza Habib, David Barber
ICML3
2019 Practical lossless compression with latent variables using bits back coding
James Townsend, Thomas Bird, David Barber
ICLR (Poster)2