Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

APRIL: Interactively Learning to Summarise by Combining Active Preference Learning and Reinforcement Learning (1808.09658v1)

Published 29 Aug 2018 in cs.CL, cs.AI, and cs.LG

Abstract: We propose a method to perform automatic document summarisation without using reference summaries. Instead, our method interactively learns from users' preferences. The merit of preference-based interactive summarisation is that preferences are easier for users to provide than reference summaries. Existing preference-based interactive learning methods suffer from high sample complexity, i.e. they need to interact with the oracle for many rounds in order to converge. In this work, we propose a new objective function, which enables us to leverage active learning, preference learning and reinforcement learning techniques in order to reduce the sample complexity. Both simulation and real-user experiments suggest that our method significantly advances the state of the art. Our source code is freely available at https://github.com/UKPLab/emnlp2018-april.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Yang Gao (761 papers)
  2. Christian M. Meyer (13 papers)
  3. Iryna Gurevych (264 papers)
Citations (33)

Summary

We haven't generated a summary for this paper yet.