SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2005.05298 · 2020

SOLOIST: Building Task Bots at Scale with Transfer Learning and Machine Teaching

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 3 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
pengbaolin/soloist canonical 1 of 3
FunctionStatusWhere it lives
compare Ran pengbaolin/soloist/examples/reminderbot/reminderbot_server.py
code served (permissive licence) · get_code("26eb391f20701bb3")
parse Not yet run pengbaolin/soloist/examples/reminderbot/reminderbot_server.py
code served (permissive licence) · get_code("4c64232520600a53")
predictor Not yet run pengbaolin/soloist/examples/reminderbot/reminderbot_server.py
code served (permissive licence) · get_code("71ef02da8d69bb5e")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present a new method SOLOIST that uses transfer learning and machine teaching to build task bots at scale. We parameterize classical modular task-oriented dialog systems using a Transformer-based auto-regressive language model, which subsumes different dialog modules into a single neural model. We pre-train, on heterogeneous dialog corpora, a task-grounded response generation model, which can generate dialog responses grounded in user goals and real-world knowledge for task completion. The pre-trained model can be efficiently adapted to accomplish new tasks with a handful of task-specific dialogs via machine teaching, where training samples are generated by human teachers interacting with the system. Experiments show that (i) SOLOIST creates new state-of-the-art on well-studied task-oriented dialog benchmarks, including CamRest676 and MultiWOZ; (ii) in the few-shot fine-tuning settings, SOLOIST significantly outperforms existing methods, and (iii) the use of machine teaching substantially reduces the labeling cost of fine-tuning. The pre-trained models and codes are available at https://aka.ms/soloist.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2005.05298")
get_code_for_paper("2005.05298")
have("2005.05298")

Connect an agent — have() is free.