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

Bowen Zheng 0004

dblp:02/9048-4 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1

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
1 paper
Language models and text generation · 50% Representation and self-supervised learning · 50%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.312018
Generating Sentences Using a Dynamic Canvas · AAAI 2018
Natural language and speech › Language models and text generation › text generation
sentence generation
0.312018
Generating Sentences Using a Dynamic Canvas · AAAI 2018

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

recurrent neural network · 0.3canvas memory · 0.3attention mechanism · 0.3
YearPublicationVenuePosition
2018 Generating Sentences Using a Dynamic Canvas
abstract
We introduce the Attentive Unsupervised Text (W)riter (AUTR), which is a word level generative model for natural language. It uses a recurrent neural network with a dynamic attention and canvas memory mechanism to iteratively construct sentences. By viewing the state of the memory at intermediate stages and where the model is placing its attention, we gain insight into how it constructs sentences. We demonstrate that AUTR learns a meaningful latent representation for each sentence, and achieves competitive log-likelihood lower bounds whilst being computationally efficient. It is effective at generating and reconstructing sentences, as well as imputing missing words.
Harshil Shah, Bowen Zheng 0004, David Barber
AAAI2
2017 Complementary Sum Sampling for Likelihood Approximation in Large Scale Classification
abstract
We consider training probabilistic classifiers in the case that the number of classes is too large to perform exact normalisation over all classes. We show that the source of high variance in standard sampling approximations is due to simply not including the correct class of the datapoint into the approximation. To account for this we explicitly sum over a subset of classes and sample the remaining. We show that this simple approach is competitive with recently introduced non likelihood-based approximations.
Aleksandar Botev, Bowen Zheng 0004, David Barber
AISTATS2