Seminars


The Priberam Machine Learning Lunch Seminars are a series of informal meetings which occur every two weeks at Instituto Superior Técnico, in Lisbon. It works as a discussion forum involving different research groups, from IST and elsewhere. Its participants are interested in areas such as (but not limited to): statistical machine learning, signal processing, pattern recognition, computer vision, natural language processing, computational biology, neural networks, control systems, reinforcement learning, or anything related (even if vaguely) with machine learning.

The seminars last for about one hour (including time for discussion and questions) and revolve around the general topic of Machine Learning. The speaker is a volunteer who decides the topic of his/her presentation. Past seminars have included presentations about state-of-the-art research, surveys and tutorials, practicing a conference talk, presenting a challenging problem and asking for help, and illustrating an interesting application of Machine Learning such as a prototype or finished product.

Presenters can have any background: undergrads, graduate students, academic researchers, company staff, etc. Anyone is welcome both to attend the seminar as well as to present it. Ocasionally we will have invited speakers. See below for a list of all seminars, including the speakers, titles and abstracts.

Note: The seminars are held at lunch-time, and include delicious free food.

Feel free to join our mailing list, where seminar topics are announced beforehand. You may also visit the group webpage. Anyone can attend the seminars. If you would like to present something, please send us an email.

The seminars are usually held every other Tuesday, from 1 PM to 2 PM, at the IST campus in Alameda. This sometimes changes due to availability of the speakers, so check regularly!

Tuesday, June 30th 2020, 13h00 - 14h00

Laura Balzano (U. Michigan)

Preference Modeling with Context-Dependent Salient Features

Location (webinar): Zoom

Abstract:

This talk considers the preference modeling problem and addresses the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared based on only a salient subset of features. Formalizing this idea, I will introduce our proposal for a “salient feature preference model” and discuss sample complexity results for learning the parameters of our model and the underlying ranking with maximum likelihood estimation. I will also provide empirical results that support our theoretical bounds, illustrate how our model explains systematic intransitivity, and show in this setting that our model is able to recover both pairwise comparisons and rankings for unseen pairs or items. Finally I will share results on two data sets: the UT Zappos50K data set and comparison data about the compactness of legislative districts in the US. This is joint work with Amanda Bower at the University of Michigan, accepted to ICML.

--

Bio: Laura Balzano is an associate professor in Electrical Engineering and Computer Science at the University of Michigan, and a member of the Institute for Advanced Study for the special year on Optimization, Statistics, and Theoretical Machine Learning. She is a recipient of the NSF Career Award, a Fulbright fellowship, ARO Young Investigator Award, AFOSR Young Investigator Award, and faculty fellowships from Intel and 3M. Laura received a BS from Rice University, MS from UCLA, and PhD from the University of Wisconsin, all in Electrical and Computer Engineering. Her main research focus is on modeling with big, messy data — highly incomplete or corrupted data, uncalibrated data, and heterogeneous data — and its applications in machine learning, environmental monitoring, and computer vision. Her expertise is in statistical signal processing, matrix factorization, and optimization.

Eventbrite - Preference Modeling with Context-Dependent Salient Features