Program

Workshop Program for 3/7/2018 | Location: TSRB

8:30 - 9:00 Breakfast and Check-in

9:00 - 10:30 Morning Session 1: (each 25 minutes + 5 minutes questions)

- Overview TRIAD: Xiaoming Huo (GT) (10 minutes)

- Talk 1: Masatoshi Hamanaka - Music Structure Analysis (AIP)

- Talk 2: Akiko Takeda - Efficient DC Algorithm for Nonconvex Nonsmooth Optimization Problems (AIP)

- Talk 3: Andreas Bärmann - An Online-Learning Approach for Objective Function Fitting in Optimization Models (FAU)

10:30 - 11:00 Coffee Break

11:00 - 12:30 Morning Session 2: (each 25 minutes + 5 minutes questions)

- Talk 1: Mohit Singh - Approximation algorithms for diverse subset selection problems (GT)

- Talk 2: Frauke Liers - Solving Scenario-Based Robust b-Matching Problems (FAU)

- Talk 3: Bernd Bischl - Model-Based Optimization for Expensive Black-Box Problems and Hyperparameter Optimization (LMU)

12:30 - 14:30 Lunch Break and Poster Session

14:30 - 16:00 Afternoon Session 1: (each 25 minutes + 5 minutes questions)

- Talk 1: Swati Gupta - Learning With Combinatorial Structure (GT)

- Talk 2: Mihoko Otake - Cognitive Behavioral Assistive Technology based on Coimagination Method (AIP)

- Talk 3: Irfan Essa - Computational Video: Extracting Content and Context (GT)

16:00 - 16:30 Coffee Break

16:30 - 18:00 Afternoon Session 2: (each 25 minutes + 5 minutes questions)

- Talk 1: Christian Menden - Clustering Methods for Prediction Exercises with Incomplete Data (IIS)

- Talk 2: Jake Abernethy - Using regret minimization to quickly solve saddle point problems (GT)

- Talk 3: Santanu Dey - Cardinality-constrained least squares problem for sparse matrices (GT)

18:00 Adjourn