Search results

We present a lightweight system to extract, store and manage metadata and provenance information of common artifacts in machine learning (ML) experiments: datasets, models, predictions, evaluations and training runs. Our system accelerates users in their ML workflow, and provides a basis for comparability and repeatability of ML experiments. We achieve this by tracking the lineage of produced artifacts

Optimization is commonly employed to determine the content of web pages, such as to maximize conversions on landing pages or click-through rates on search engine result pages. Often the layout of these pages can be decoupled into several separate decisions. For example, the composition of a landing page may involve deciding which image to show, which wording to use, what color background to display, etc

Randomized algorithms are central to modern machine learning. In the presence of massive datasets, researchers often turn to stochastic optimization to solve learning problems. Of particular interest is stochastic gradient descent (SGD), a first-order method that approximates the learning objective and gradient by a random point estimate. A classical question in learning theory is, if a randomized learner

Topics generated by topic models are typically presented as a list of topic terms. Automatic topic labelling is the task of generating a succinct label that summarises the theme or subject of a topic, with the intention of reducing the cognitive load of end-users when interpreting these topics. Traditionally, topic label systems focus on a single label modality, e.g. textual labels. In this work we propose

Bayesian optimization (BO) is a model-based approach for gradient-free black-box function optimization. Typically, BO is powered by a Gaussian process (GP), whose algorithmic complexity is cubic in the number of evaluations. Hence, GPbased BO cannot leverage large amounts of past or related function evaluations, for example, to warm start the BO procedure. We develop a multiple adaptive Bayesian linear

Generative adversarial networks (GANs) have recently seen a surge of interest in learning an inverse mapping—projecting the data back to the latent space. This learned mapping allows for image reconstruction—encoding and decoding—from a compact latent space. The choice of loss function(s) in this framework plays a critical role in determining the quality of the reconstruction. In this paper we explore possible

Interest in neural machine translation has grown rapidly as its effectiveness has been demonstrated across language and data scenarios. New research regularly introduces architectural and algorithmic improvements that lead to significant gains over “vanilla” NMT implementations. However, these new techniques are rarely evaluated in the context of previously published techniques, specifically those that

We present and apply two methods for addressing the problem of selecting relevant training data out of a general pool for use in tasks such as machine translation. Building on existing work on class-based language difference models [1], we first introduce a cluster-based method that uses Brown clusters to condense the vocabulary of the corpora. Secondly, we implement the cynical data selection method [2

The Moore-Lewis method of “intelligent selection of language model training data” is very effective, cheap, efficient... and also has structural problems. (1) The method defines relevance by playing language models trained on the in-domain and the out-of-domain (or data pool) corpora against each other. This powerful idea – which we set out to preserve – treats the two corpora as the opposing ends of a

We study the problem of a retailer that maximizes profit through joint replenishment, pricing and removal decisions. This problem is motivated by the observation that retailers usually retain rights to remove inventory from their network either by returning it to the suppliers or through liquidation in the face of random demand and capacity constraints. We develop a tractable dynamic program by leveraging

RubyStar is a dialog system designed to create “human-like” conversation by combining different response generation strategies. RubyStar conducts a non- task-oriented conversation on general topics by using an ensemble of rule-based, retrieval-based and generative methods. Topic detection, engagement monitoring, and context tracking are used for managing interaction. Predictable elements of conversation

We describe an information-oriented conversational AI system, EmersonBot, developed for the Alexa Prize 2017 competition. The main goal of the system was informing users about current events, and answering their questions, while maintaining a fluent conversation. The main innovations of Emersonbot include the development of a federated multi-source information retrieval system that is aware of the conversation

This paper describes a new open domain dialogue system Alquist developed as part of the Alexa Prize competition for the Amazon Echo line of products. The Alquist dialogue system is designed to conduct a coherent and engaging conversation on popular topics. We are presenting a hybrid system combining several machine learning and rule based approaches. We discuss and describe the Alquist pipeline, data acquisition

In this paper we introduce a novel, open domain socialbot for the Amazon Alexa Prize competition, aimed at carrying on friendly conversations with users on a variety of topics. We present our modular system, highlighting our different data sources and how we use the human mind as a model for data management. Additionally we build and employ natural language understanding and information retrieval tools

In this work, we designed a conversational system by combining a finite state method, a retrieval model and a machine-initiative dialogue strategy. By using the machine-initiative strategy, most of the user queries are handled by the finite state machine which models predefined dialogues. If the user’s utterance is out of the range of modeled dialogues, the retrieval model processes the input. On comparative

This paper introduces the University of Washington’s Alexa Prize socialbot, Sound- ing Board, which is designed to engage users with a wide variety of content. The system models the user utterance using a multi-dimensional representation. A hierarchical dialogue manager is employed where a master manages the overall conversation and a collection of miniskills manage different conversation segments. The

Open–domain dialogue systems should be able to cover a very large set of domains and at the same time keep the user engaged in the interaction. Current approaches to dialogue modeling are divided between domain–independent, non–modular approaches using sequence–to–sequence models and the domain–specific modular systems developed for task–based dialogue. Furthermore, user engagement in dialogue, addressed

Recent years have seen a surge in consumer usage of spoken dialog systems, due to the popularity of voice assistants. While these systems are capable of answering factual questions or executing basic tasks, they do not yet have the capability to hold multi-turn conversations. The Alexa Prize challenge provides us a great opportunity to explore various approaches and dialog strategies for building a multi-turn

We describe our Alexa prize system (called ‘Alana’) which consists of an ensemble of bots, combining rule-based and machine learning systems, and using a contextual ranking mechanism to choose system responses. This paper reports on the version of the system developed and evaluated in the semi-finals of the competition (i.e. up to 15 August 2017), but not on subsequent enhancements. The ranker for this

We present Pixie, a socialbot submitted to the 2017 Alexa Prize, developed with the objective of holding engaging casual conversations on open-ended topics. We discuss the modular, heterogeneous architecture of the Pixie system, and highlight the successes and shortcomings of our primarily template-based approach. We reflect on our findings about alternative paradigms used in the prototyping phase; in particular