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

Braden Hancock

dblp:162/0168 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0003-3167-1053ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 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
Information extraction and text analysis · 39% Learning paradigms · 29% Probabilistic and Bayesian machine learning · 14%
Databases, data mining, and information retrieval
4 papers
Knowledge graphs · 40% Machine learning and data management · 23% Data integration and cleaning · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
weakly supervised learning
0.822019
Snorkel DryBell: A Case Study in Deploying Weak Supervision at Industrial Scale · SIGMOD Conference 2019
Training Complex Models with Multi-Task Weak Supervision · AAAI 2019
Natural language and speech › Information extraction and text analysis
data annotation
0.412019
Snorkel DryBell: A Case Study in Deploying Weak Supervision at Industrial Scale · SIGMOD Conference 2019
Machine learning › Probabilistic and Bayesian machine learning › noise modeling
label noise modeling
0.412019
Training Complex Models with Multi-Task Weak Supervision · AAAI 2019
Natural language and speech › Language models and text generation
text generation
0.412019
Generating Titles for Web Tables · WWW 2019
Data integration and cleaning
table understanding
0.412019
Generating Titles for Web Tables · WWW 2019
Machine learning and data management
weak supervision
0.412019
Snorkel DryBell: A Case Study in Deploying Weak Supervision at Industrial Scale · SIGMOD Conference 2019
Natural language and speech › Information extraction and text analysis
relation extraction
0.312018
Training Classifiers with Natural Language Explanations · ACL (1) 2018
Natural language and speech › Information extraction and text analysis › relation extraction
weakly supervised relation extraction
0.312018
Training Classifiers with Natural Language Explanations · ACL (1) 2018
Knowledge graphs
knowledge graph construction
0.312018
Fonduer: Knowledge Base Construction from Richly Formatted Data · SIGMOD Conference 2018
Knowledge graphs › relation extraction
multimodal relation extraction
0.312018
Fonduer: Knowledge Base Construction from Richly Formatted Data · SIGMOD Conference 2018
Data mining › text mining
topic model
0.212016
Collective Supervision of Topic Models for Predicting Surveys with Social Media · AAAI 2016
Machine learning › Trustworthy machine learning › interpretability
natural language explanation
0.112018
Training Classifiers with Natural Language Explanations · ACL (1) 2018

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

weak supervision · 1.8template-based knowledge ingestion · 0.8sequence-to-sequence · 0.8copy mechanism · 0.8semantic parsing · 0.7collective supervision · 0.5user satisfaction estimation · 0.4reinforcement learning · 0.4matrix completion · 0.4multimodal feature learning · 0.3deep learning · 0.3
YearPublicationVenuePosition
2019 Training Complex Models with Multi-Task Weak Supervision
abstract
As machine learning models continue to increase in complexity, collecting large hand-labeled training sets has become one of the biggest roadblocks in practice. Instead, weaker forms of supervision that provide noisier but cheaper labels are often used. However, these weak supervision sources have diverse and unknown accuracies, may output correlated labels, and may label different tasks or apply at different levels of granularity. We propose a framework for integrating and modeling such weak supervision sources by viewing them as labeling different related sub-tasks of a problem, which we refer to as the multi-task weak supervision setting. We show that by solving a matrix completion-style problem, we can recover the accuracies of these multi-task sources given their dependency structure, but without any labeled data, leading to higher-quality supervision for training an end model. Theoretically, we show that the generalization error of models trained with this approach improves with the number of unlabeled data points, and characterize the scaling with respect to the task and dependency structures. On three fine-grained classification problems, we show that our approach leads to average gains of 20.2 points in accuracy over a traditional supervised approach, 6.8 points over a majority vote baseline, and 4.1 points over a previously proposed weak supervision method that models tasks separately.
Alexander Ratner, Braden Hancock, Jared Dunnmon, Frederic Sala, Shreyash Pandey, Christopher Ré
AAAI2
2019 Learning from Dialogue after Deployment: Feed Yourself, Chatbot!
abstract
The majority of conversations a dialogue agent sees over its lifetime occur after it has already been trained and deployed, leaving a vast store of potential training signal untapped.In this work, we propose the self-feeding chatbot, a dialogue agent with the ability to extract new training examples from the conversations it participates in.As our agent engages in conversation, it also estimates user satisfaction in its responses.When the conversation appears to be going well, the user's responses become new training examples to imitate.When the agent believes it has made a mistake, it asks for feedback; learning to predict the feedback that will be given improves the chatbot's dialogue abilities further.On the PERSONACHAT chitchat dataset with over 131k training examples, we find that learning from dialogue with a selffeeding chatbot significantly improves performance, regardless of the amount of traditional supervision.
Braden Hancock, Antoine Bordes, Pierre-Emmanuel Mazaré, Jason Weston
ACL (1)1
2019 The Role of Massively Multi-Task and Weak Supervision in Software 2.0
Alexander Ratner, Braden Hancock, Christopher Ré
CIDR2
2019 Snorkel DryBell: A Case Study in Deploying Weak Supervision at Industrial Scale
abstract
Labeling training data is one of the most costly bottlenecks in developing machine learning-based applications. We present a first-of-its-kind study showing how existing knowledge resources from across an organization can be used as weak supervision in order to bring development time and cost down by an order of magnitude, and introduce Snorkel DryBell, a new weak supervision management system for this setting. Snorkel DryBell builds on the Snorkel framework, extending it in three critical aspects: flexible, template-based ingestion of diverse organizational knowledge, cross-feature production serving, and scalable, sampling-free execution. On three classification tasks at Google, we find that Snorkel DryBell creates classifiers of comparable quality to ones trained with tens of thousands of hand-labeled examples, converts non-servable organizational resources to servable models for an average 52% performance improvement, and executes over millions of data points in tens of minutes.
Stephen H. Bach, Daniel Rodriguez, Yintao Liu 0002, Haidong Shao, Cassandra Xia, Souvik Sen, Alexander Ratner, Braden Hancock, Houman Alborzi, Rahul Kuchhal, Christopher Ré, Rob Malkin
SIGMOD Conference9
2019 Generating Titles for Web Tables
abstract
Descriptive titles provide crucial context for interpreting tables that are extracted from web pages and are a key component of search features such as tabular featured snippets from Google and Bing. Prior approaches have attempted to produce titles by selecting existing text snippets associated with the table. These approaches, however, are limited by their dependence on suitable titles existing a priori. In our user study, we observe that the relevant information for the title tends to be scattered across the page, and often-more than 80% of the time-does not appear verbatim anywhere in the page. We propose instead the application of a sequence-to-sequence neural network model as a more generalizable approach for generating high-quality table titles. This is accomplished by extracting many text snippets that have potentially relevant information to the table, encoding them into an input sequence, and using both copy and generation mechanisms in the decoder to balance relevance and readability of the generated title. We validate this approach with human evaluation on sample web tables and report that while sequence models with only a copy mechanism or only a generation mechanism are easily outperformed by simple selection-based baselines, the model with both capabilities performs the best, approaching the quality of crowdsourced titles while training on fewer than ten thousand examples. To the best of our knowledge, the proposed technique is the first to consider text-generation methods for table titles, and establishes a new state of the art.
Braden Hancock, Hongrae Lee, Cong Yu 0001
WWW1
2018 Training Classifiers with Natural Language Explanations
abstract
Training accurate classifiers requires many labels, but each label provides only limited information (one bit for binary classification). In this work, we propose BabbleLabble, a framework for training classifiers in which an annotator provides a natural language explanation for each labeling decision. A semantic parser converts these explanations into programmatic labeling functions that generate noisy labels for an arbitrary amount of unlabeled data, which is used to train a classifier. On three relation extraction tasks, we find that users are able to train classifiers with comparable F1 scores from 5-100× faster by providing explanations instead of just labels. Furthermore, given the inherent imperfection of labeling functions, we find that a simple rule-based semantic parser suffices.
Braden Hancock, Paroma Varma, Stephanie Wang, Martin Bringmann, Percy Liang, Christopher Ré
ACL (1)1
2018 Fonduer: Knowledge Base Construction from Richly Formatted Data
abstract
We focus on knowledge base construction (KBC) from richly formatted data. In contrast to KBC from text or tabular data, KBC from richly formatted data aims to extract relations conveyed jointly via textual, structural, tabular, and visual expressions. We introduce Fonduer, a machine-learning-based KBC system for richly formatted data. Fonduer presents a new data model that accounts for three challenging characteristics of richly formatted data: (1) prevalent document-level relations, (2) multimodality, and (3) data variety. Fonduer uses a new deep-learning model to automatically capture the representation (i.e., features) needed to learn how to extract relations from richly formatted data. Finally, Fonduer provides a new programming model that enables users to convert domain expertise, based on multiple modalities of information, to meaningful signals of supervision for training a KBC system. Fonduer-based KBC systems are in production for a range of use cases, including at a major online retailer. We compare Fonduer against state-of-the-art KBC approaches in four different domains. We show that Fonduer achieves an average improvement of 41 F1 points on the quality of the output knowledge base-and in some cases produces up to 1.87× the number of correct entries-compared to expert-curated public knowledge bases. We also conduct a user study to assess the usability of Fonduer's new programming model. We show that after using Fonduer for only 30 minutes, non-domain experts are able to design KBC systems that achieve on average 23 F1 points higher quality than traditional machine-learning-based KBC approaches.
Sen Wu 0002, Luke Hsiao, Braden Hancock, Theodoros Rekatsinas, Philip Alexander Levis, Christopher Ré
SIGMOD Conference4
2016 Collective Supervision of Topic Models for Predicting Surveys with Social Media
abstract
This paper considers survey prediction from social media. We use topic models to correlate social media messages with survey outcomes and to provide an interpretable representation of the data. Rather than rely on fully unsupervised topic models, we use existing aggregated survey data to inform the inferred topics, a class of topic model supervision referred to as collective supervision. We introduce and explore a variety of topic model variants and provide an empirical analysis, with conclusions of the most effective models for this task.
Adrian Benton, Michael J. Paul, Braden Hancock, Mark Dredze
AAAI3