University of Cambridge > Talks.cam > Natural Language Processing Reading Group > Frustratingly easy domain adaptation

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Frustratingly easy domain adaptation

Download to your calendar using vCal

If you have a question about this talk, please contact Diarmuid Ó Séaghdha .

At this session of the NLIP Reading Group we’ll be discussing the following paper:

Hal Daumé III . 2007. Frustratingly easy domain adaptation. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics (ACL-07).

Abstract: We describe an approach to domain adaptation that is appropriate exactly in the case when one has enough “target” data to do slightly better than just using only “source” data. Our approach is incredibly simple, easy to implement as a preprocessing step (10 lines of Perl!) and outperforms state-of-the-art approaches on a range of datasets. The technique comes with several simple theoretical guarantees. Moreover, it is trivially extended to a multi-domain adaptation problem, where one has data from a variety of different domains.

This talk is part of the Natural Language Processing Reading Group series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9022.314 kWh Johnson Matthey Lecture Theatre, Department of Chemical Engineering & Biotechnology, Philippa Fawcett Drive, Cambridge CB3 0AS Average on weekdays: 8875.84931507 kWh

Other talks

Fairy Tales Fairy Tales Group Work A Novel Diffusion Model based Approach for Sleep Music Generation Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos Afternoon Break
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity