Demo Data from EDBT 2026 / reviewers in the wild / expert
Junbo Jake Zhao
dblp:191/6665
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author
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
5 papers |
Generative modeling · 29% Representation and self-supervised learning · 22% Deep learning architectures and training · 21% |
Topics — the 15 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
autoencoder |
0.6 | 2 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 Disentangling factors of variation in deep representation using adversarial training · NIPS 2016 |
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning |
0.6 | 2 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 Disentangling factors of variation in deep representation using adversarial training · NIPS 2016 |
Machine learning › Generative modeling
learned prior |
0.3 | 1 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 |
Machine learning › Graph learning › relation modeling
relational graph |
0.3 | 1 | 2018 | GLoMo: Unsupervised Learning of Transferable Relational Graphs · NeurIPS 2018 |
Machine learning › Representation and self-supervised learning
transferable representation |
0.3 | 1 | 2018 | GLoMo: Unsupervised Learning of Transferable Relational Graphs · NeurIPS 2018 |
Machine learning › Learning paradigms
unsupervised learning |
0.3 | 1 | 2018 | GLoMo: Unsupervised Learning of Transferable Relational Graphs · NeurIPS 2018 |
Machine learning › Generative modeling
variational autoencoder |
0.3 | 1 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 |
Machine learning › Generative modeling
energy-based model |
0.3 | 1 | 2017 | Energy-based Generative Adversarial Networks · ICLR (Poster) 2017 |
Machine learning › Generative modeling
generative adversarial network |
0.3 | 1 | 2017 | Energy-based Generative Adversarial Networks · ICLR (Poster) 2017 |
Machine learning › Deep learning architectures and training › autoencoder
adversarial autoencoder |
0.2 | 1 | 2016 | Disentangling factors of variation in deep representation using adversarial training · NIPS 2016 |
Natural language and speech › Information extraction and text analysis
text classification |
0.2 | 1 | 2015 | Character-level Convolutional Networks for Text Classification · NIPS 2015 |
Machine learning › Graph learning
graph representation learning |
0.1 | 1 | 2018 | GLoMo: Unsupervised Learning of Transferable Relational Graphs · NeurIPS 2018 |
Machine learning › Optimization for machine learning
optimal transport |
0.1 | 1 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 |
Natural language and speech › Language models and text generation
text generation |
0.1 | 1 | 2018 | Adversarially Regularized Autoencoders · ICML 2018 |
Machine learning › Deep learning architectures and training
convolutional neural network |
0.1 | 1 | 2015 | Character-level Convolutional Networks for Text Classification · NIPS 2015 |
Methods — techniques the papers use, named apart from their topics
adversarial training · 0.5wasserstein autoencoder · 0.3unsupervised learning · 0.3transfer learning · 0.3adversarial regularization · 0.3energy-based model · 0.3convolutional autoencoder · 0.2n-grams · 0.2character-level convolutional network · 0.2bag-of-words · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Adversarially Regularized AutoencodersabstractDeep latent variable models, trained using variational autoencoders or generative adversarial networks, are now a key technique for representation learning of continuous structures. However, applying similar methods to discrete structures, such as text sequences or discretized images, has proven to be more challenging. In this work, we propose a more flexible method for training deep latent variable models of discrete structures. Our approach is based on the recently proposed Wasserstein Autoencoder (WAE) which formalizes adversarial autoencoders as an optimal transport problem. We first extend this framework to model discrete sequences, and then further explore different learned priors targeting a controllable representation. Unlike many other latent variable generative models for text, this adversarially regularized autoencoder (ARAE) allows us to generate fluent textual outputs as well as perform manipulations in the latent space to induce change in the output space. Finally we show that the latent representation can be trained to perform unaligned textual style transfer, giving improvements both in automatic measures and human evaluation. Junbo Jake Zhao, Kelly Zhang, Alexander M. Rush, Yann LeCun |
ICML | 1 |
| 2018 | GLoMo: Unsupervised Learning of Transferable Relational GraphsabstractModern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional features in vision. However, these approaches usually transfer unary features and largely ignore more structured graphical representations. This work explores the possibility of learning generic latent relational graphs that capture dependencies between pairs of data units (e.g., words or pixels) from large-scale unlabeled data and transferring the graphs to downstream tasks. Our proposed transfer learning framework improves performance on various tasks including question answering, natural language inference, sentiment analysis, and image classification. We also show that the learned graphs are generic enough to be transferred to different embeddings on which the graphs have not been trained (including GloVe embeddings, ELMo embeddings, and task-specific RNN hidden units), or embedding-free units such as image pixels. Zhilin Yang 0001, Junbo Jake Zhao, Bhuwan Dhingra, Kaiming He, William W. Cohen, Ruslan Salakhutdinov, Yann LeCun |
NeurIPS | 2 |
| 2017 | Energy-based Generative Adversarial Networks
Junbo Jake Zhao, Michaël Mathieu, Yann LeCun |
ICLR (Poster) | 1 |
| 2016 | Disentangling factors of variation in deep representation using adversarial trainingabstractWe propose a deep generative model for learning to distill the hidden factors of variation within a set of labeled observations into two complementary codes. One code describes the factors of variation relevant to solving a specified task. The other code describes the remaining factors of variation that are irrelevant to solving this task. The only available source of supervision during the training process comes from our ability to distinguish among different observations belonging to the same category. Concrete examples include multiple images of the same object from different viewpoints, or multiple speech samples from the same speaker. In both of these instances, the factors of variation irrelevant to classification are implicitly expressed by intra-class variabilities, such as the relative position of an object in an image, or the linguistic content of an utterance. Most existing approaches for solving this problem rely heavily on having access to pairs of observations only sharing a single factor of variation, e.g. different objects observed in the exact same conditions. This assumption is often not encountered in realistic settings where data acquisition is not controlled and labels for the uninformative components are not available. In this work, we propose to overcome this limitation by augmenting deep convolutional autoencoders with a form of adversarial training. Both factors of variation are implicitly captured in the organization of the learned embedding space, and can be used for solving single-image analogies. Experimental results on synthetic and real datasets show that the proposed method is capable of disentangling the influences of style and content factors using a flexible representation, as well as generalizing to unseen styles or content classes. Michaël Mathieu, Junbo Jake Zhao, Pablo Sprechmann, Aditya Ramesh, Yann LeCun |
NIPS | 2 |
| 2015 | Character-level Convolutional Networks for Text ClassificationabstractThis article offers an empirical exploration on the use of character-level convolutional networks (ConvNets) for text classification. We constructed several large-scale datasets to show that character-level convolutional networks could achieve state-of-the-art or competitive results. Comparisons are offered against traditional models such as bag of words, n-grams and their TFIDF variants, and deep learning models such as word-based ConvNets and recurrent neural networks. Xiang Zhang 0013, Junbo Jake Zhao, Yann LeCun |
NIPS | 2 |