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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20250307T100000
DTEND;TZID=Asia/Singapore:20250307T113000
DTSTAMP:20260422T072719
CREATED:20250228T032545Z
LAST-MODIFIED:20250228T032545Z
UID:25858-1741341600-1741347000@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series : Nam Ho-Nguyen
DESCRIPTION:  \n\n\n\nName of Speaker\nNam Ho-Nguyen\n\n\nSchedule\n7 March 2025\, 10am – 11.30am\n\n\nVenue \nBIZ1-0302\n\n\nLink to Register \n \nhttps://nus-sg.zoom.us/meeting/register/LmEAt_ZaTS6N4MlO8pFnbg\n\n\nTitle\nMistake\, Manipulation and Margin Guarantees in Online Strategic Classification\n\n\nAbstract\nWe consider an online strategic classification problem where each arriving agent can manipulate their true feature vector to obtain a positive predicted label\, while incurring a cost that depends on the amount of manipulation. The learner seeks to predict the agent’s true label given access to only the manipulated features. After the learner releases their prediction\, the agent’s true label is revealed. Previous algorithms such as the strategic perceptron guarantee finitely many mistakes under a margin assumption on agents’ true feature vectors. However\, these are not guaranteed to encourage agents to be truthful. Promoting truthfulness is intimately linked to obtaining adequate margin on the predictions\, thus we provide two new algorithms aimed at recovering the maximum margin classifier in the presence of strategic agent behavior. We prove convergence\, finite mistake and finite manipulation guarantees for a variety of agent cost structures. We also provide generalized versions of the strategic perceptron with mistake guarantees for different costs. Our numerical study on real and synthetic data demonstrates that the new algorithms outperform previous ones in terms of margin\, number of manipulation and number of mistakes. \n(This is joint work with Lingqing Shen\, Khanh-Hung Giang-Tran and Fatma Kılınç-Karzan.)\n\n\nAbout the Speaker\nNam Ho-Nguyen is a Senior Lecturer in the Discipline of Business Analytics at The University of Sydney Business School. His research focuses on data-driven optimization models and scalable algorithms for decision-making problems under uncertainty. Prior to joining The University of Sydney\, he received his PhD in Operations Research from Carnegie Mellon University\, and was a postdoctoral researcher at the University of Wisconsin-Madison. He was a past recipient of the INFORMS Optimization Society Young Researchers’ Prize 2022\, and received a Discovery Early Career Researchers Award Fellowship from the Australian Research Council in 2024.\n\n\n\n 
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-nam-ho-nguyen/
CATEGORIES:IORA Seminar Series
END:VEVENT
END:VCALENDAR