BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IORA - Institute of Operations Research and Analytics - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IORA - Institute of Operations Research and Analytics
X-ORIGINAL-URL:https://iora.nus.edu.sg
X-WR-CALDESC:Events for IORA - Institute of Operations Research and Analytics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:+08
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20230210T100000
DTEND;TZID=Asia/Singapore:20230210T113000
DTSTAMP:20260502T005446
CREATED:20230110T031729Z
LAST-MODIFIED:20230213T021652Z
UID:16650-1676023200-1676028600@iora.nus.edu.sg
SUMMARY:IORA Seminar Series – Antoine Désir
DESCRIPTION:Antoine is an Assistant professor of Technology and Operations Management at INSEAD. His research applies mathematical modeling and analytics to operations management problems with an aim to: (1) quantify fundamental tradeoffs\, and (2) design efficient data-driven algorithms to support operational decisions. More precisely\, he focuses on revenue management and choice modeling with applications such as online advertising. He was an MSOM student paper finalist in 2014 and 2017 and a Nicholson student paper finalist in 2014 and 2015. He spent a year as a post-doctoral researcher at Google NYC. \n\n\n\nName of Speaker\nAntoine Desir\n\n\nSchedule\nFriday 10 February 2023\, 10.00am – 11.30am\n\n\nVenue \nI4-01-03 (Innovation 4.0\, level 1 Seminar Room)\n\n\nLink to Register \n(Via Zoom)\nhttps://nus-sg.zoom.us/meeting/register/tZwtdOyoqjIuGtIP444shDdv-KQrbeOQcFl3\n\n\nTitle\nRepresenting Random Utility Choice Models with Neural Networks\n\n\nAbstract\nMotivated by the successes of deep learning\, we propose a class of neural network-based discrete choice models\, called RUMnets\, which is inspired by the random utility maximization (RUM) framework. This model formulates the agents’ random utility function using the sample average approximation (SAA) method. We show that RUMnets sharply approximate the class of RUM discrete choice models: any model derived from random utility maximization has choice probabilities that can be approximated arbitrarily closely by a RUMnet. Reciprocally\, any RUMnet is consistent with the RUM principle. We derive an upper bound on the generalization error of RUMnets fitted on choice data\, and gain theoretical insights on their ability to predict choices on new\, unseen data depending on critical parameters of the dataset and architecture.  By leveraging open-source libraries for neural networks\, we find that RUMnets outperform other state-of-the-art choice modeling and machine learning methods by a significant margin on two real-world datasets. This is joint work with Ali Aouad (LBS). \n 
URL:https://iora.nus.edu.sg/events/iora-seminar-series-antoine-desir/
CATEGORIES:IORA Seminar Series
END:VEVENT
END:VCALENDAR