Skip to Content.
Sympa Menu

nl-uiuc - [nl-uiuc] AIIS talk by Prof. Sewoong Oh on Friday, Feb 22

nl-uiuc AT lists.cs.illinois.edu

Subject: Natural language research announcements

List archive

[nl-uiuc] AIIS talk by Prof. Sewoong Oh on Friday, Feb 22


Chronological Thread 
  • From: "Samdani, Rajhans" <rsamdan2 AT illinois.edu>
  • To: "aiis AT cs.uiuc.edu" <aiis AT cs.uiuc.edu>, "aivr AT cs.uiuc.edu" <aivr AT cs.uiuc.edu>, "vision AT cs.uiuc.edu" <vision AT cs.uiuc.edu>, "eyal AT cs.uiuc.edu" <eyal AT cs.uiuc.edu>, "aistudents AT cs.uiuc.edu" <aistudents AT cs.uiuc.edu>, "Girju, Corina R" <girju AT illinois.edu>, "Blake, Catherine" <clblake AT illinois.edu>, nl-uiuc <nl-uiuc AT cs.uiuc.edu>, "Efron, Miles James" <mefron AT illinois.edu>
  • Subject: [nl-uiuc] AIIS talk by Prof. Sewoong Oh on Friday, Feb 22
  • Date: Mon, 18 Feb 2013 20:04:02 +0000
  • Accept-language: en-US
  • List-archive: <http://lists.cs.uiuc.edu/pipermail/nl-uiuc/>
  • List-id: Natural language research announcements <nl-uiuc.cs.uiuc.edu>

Hi all,

This week we're hosting Prof. Sewoong Oh
(http://web.engr.illinois.edu/~swoh/) from the Industrial Engineering
department. Prof. Oh has done a lot of interesting work in Machine Learning,
amongst other things. Here are the talk details:

When: Friday, Feb 22, 2 pm.

Where: Siebel Center, 3405.

Title: Ranking from Pair-wise Comparisons

Abstract:
The question of aggregating pairwise comparisons to obtain a global ranking
has been of interest for a very long time: be it ranking of online gamers
(e.g. MSR's TrueSkill system) and chess players, aggregating social opinions,
or deciding which product to sell based on transactions. In addition to
obtaining a ranking, finding 'scores' for each object is of interest for
understanding the intensity of the preferences. In this talk, I will describe
a new approach for discovering scores for objects (or items) from pairwise
comparisons. The algorithm has a natural random walk interpretation over the
graph of objects with an edge present between a pair of objects if they are
compared; the stationary probability of this random walk assigns a score to
each objects. To establish the efficacy of our method, we consider the
popular Bradley-Terry-Luce (BTL) model and provide an upper bound on the
finite sample error rate. The number of samples required to learn the score
well with high probability depends on the structure of the comparisongraph.
When the Laplacian of the comparison graph has a strictly positive spectral
gap, this leads to an order-optimal sample complexity. We also provide
numerical results on real and synthetic data-sets to compare our approach to
other popular approaches.

Bio: Sewoong Oh is an Assistant Professor of Industrial and Enterprise
Systems Engineering at UIUC. His research interest is in understanding how to
extract meaningful information from societal data, such as aggregating
opinions on social computation platforms like Mechanical Turk, making
recommendations from rating of individuals, and finding ranking from
comparisons.

Hope to see you all!
Best,
Rajhans




  • [nl-uiuc] AIIS talk by Prof. Sewoong Oh on Friday, Feb 22, Samdani, Rajhans, 02/18/2013

Archive powered by MHonArc 2.6.16.

Top of Page