Short Poster Talks (5 minutes each)
Poster Authors
Information Design with Predictions
Keegan Harris (CMU), Steven Wu (CMU), Nina Balcan (CMU)
Online bipartite matching with imperfect advice
Davin Choo (National University of Singapore), Themistoklis Gouleakis (National University of Singapore), Chun Kai Ling (Columbia University), Arnab Bhattacharyya (National University of Singapore)
Decentralized Scheduling with QoS Constraints: Achieving $O(1)$ QoS Regret of Multi-Player Bandits
Qingsong Liu (Tsinghua University), Zhixuan Fang (Tsinghua University)
Chasing Convex Functions with Long-term Constraints: Optimal Consistency-Robustness Tradeoffs
Adam Lechowicz (UMass Amherst), Nicolas Christianson (Caltech), Bo Sun (University of Waterloo), Noman Bashir (MIT), Mohammad Hajiesmaili (UMass Amherst), Adam Wierman (Caltech), Prashant Shenoy (UMass Amherst)
Contract Scheduling with Distributional and Multiple Advice
Spyros Angelopoulos (CNRS and Sorbonne University), Marcin Bienkowski (University of Wroclaw), Christoph Durr (CNRS and LIP6 - Sorbonne University), Bertrand Simon (CNRS / IN2P3 Computing Center)
Anytime-Competitive Reinforcement Learning with Policy Prior
Jianyi Yang (UC Riverside), Pengfei Li (UC Riverside), Tongxin Li (CUHK Shenzhen), Adam Wierman (Caltech), Shaolei Ren (UC Riverside)
Fast and Reliable $N - k$ Contingency Screening with Input-Convex Neural Networks
Nicolas Christianson (Caltech), Wenqi Cui (University of Washington), Steven Low (Caltech), Weiwei Yang (Microsoft Research), Baosen Zhang (University of Washington)
Online Conversion under Unknown Horizon: Beating $1 + \ln \theta$ with a Single Trusted Query
Ying Cao (HKUST), Hasti NourMohammadi (University of Alberta), Bo Sun (University of Waterloo), Xiaoqi Tan (University of Alberta), Danny H.K. Tsang (HKUST)