Bandit and Online Learning
-
Speaker Diarization as a Fully Online Bandit Learning Problem in MiniVox
Baihan Lin (Columbia University)*; Xinxin Zhang (University of Washington) -
Improving Kernel Online Learning with a Snapshot Memory
Trung Le (Monash University)*; Khanh Nguyen (HCMUP); Dinh Phung (Monash University) -
Online Strongly Convex Optimization with Unknown Delays
Yuanyu Wan (Nanjing University); Wei-Wei Tu (4Paradigm Inc.); Lijun Zhang (Nanjing University)* -
Worst-case Regret Analysis of Computationally Budgeted Online Kernel Selection
Junfan Li (Tianjin University); Shizhong Liao (Tianjin University)* -
Lifelong Learning with Sketched Structural Regularization
Haoran Li (Johns Hopkins University); Aditya R Krishnan (Johns Hopkins University); Jingfeng Wu (Johns Hopkins University); Soheil Kolouri (Vanderbilt University); Praveen Pilly (HRL Laboratories LLC); Vladimir Braverman (Johns Hopkins University)* -
Expert advice problem with noisy low rank loss
Yaxiong Liu (Kyushu University)*; Xuanke Jiang (Kyushu university); Kohei Hatano (Kyushu University / RIKEN AIP); Eiji Takimoto (Kyushu University) -
Lifelong Learning with Branching Experts
Yi-Shan Wu (Academia Sinica); Yi-Te Hong (Academia Sinica)*; Chi-Jen Lu (Academia Sinica) -
An Aligned Subgraph Kernel Based on Discrete-Time Quantum Walk
Kai Liu (National University of Defense Technology); Lulu Wang (National Innovation Institute of Defense Technology)*; Yi Zhang (Central Future Works Technology Co.,Ltd.)