University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Detecting paraphrases using recursive autoencoders

  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

Detecting paraphrases using recursive autoencoders

Download to your calendar using vCal

If you have a question about this talk, please contact Yingzhen Li .

In this RCC we will talk about work from Richard Socher applying deep learning to paraphrase detection (i.e. determining when two sentences carry the same meaning). We will give an introduction to distributional semantics and models/techniques relevant to the sentence similarity task, then dive deep on the novel contributions of the referenced paper and compare it against existing work. We will conclude with surveying the current state of the art and highlighting potential directions for additional research.

optional reading Paper and Code: Dynamic Pooling And Unfolding Recursive Autoencoders For Paraphrase Detection

This talk is part of the Machine Learning Reading Group @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 1 Average on weekdays: 9078.70182094 kWh CCIMI Short Course: Introduction to the Bayesian approach to inverse problems

Other talks

Royal Papworth Hospital and Acute Medicine Title tbc LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater External Seminar - Jenn Brophy TBC "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. Cooperation for Nature
 

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