2018/7/10 13:30

要旨

Abstract

The purpose of this workshop is to bring together discrete optimizers and machine learning researchers, theory people and practitioners in an effort to bridge the fields and stimulate cross-disciplinary interaction.

Registration

Sorry, it became filled to capacity. (as of July 17)

Program
Monday, July 23
09h30 – 10h00 Reception/ Opening remarks
10h00 – 12h00 Session A1
A11 Blended conditional gradients/
Sebastian Pokutta (Georgia Tech)
A12 Project-free simplex descent/
Dan Tu (Georgia Tech)
A13 Finding new molecules using deep neural network, simulation, and search/Kazuki Yoshizoe (RIKEN AIP)
A14 Learning when to use a decomposition/
Axel Parmentier (Ecole Nationale des Ponts et Chaussées)
12h00 – 13h30 Lunch
13h30 – 15h30 Session A2
A21 Generative modeling via feasibility and iterative projection/
Naveen Kodali (Georgia Tech)
A22 Exact clustering via integer programming and maximum satisfiability/
Atsushi Miyauchi (RIKEN AIP)
A23 Approximation algorithms for covering problems/
Yotaro Takazawa (Tokyo Institute of Technology)
A24 Submodular reassignment problem for reallocating agents to tasks with synergy effects/
Yoshio Okamoto (University of Electro Communications)
15h30 – 16h00 Coffee break
16h00 – 17h30 Session A3
A31 Deep reinforcement learning in inventory management/
Jana Boerger (Georgia Tech)
A32 A framework of efficient online learning algorithms and applications/
Nguyễn Kim Thắng (Université d’Evry)
A33 Machine learning from weak supervision/
Masashi Sugiyama (RIKEN AIP/ University of Tokyo)
Tuesday, July 24
09h30 – 10h00 Reception
10h00 – 12h00 Session B1
B11 Discrete DC programming for integrally convex functions/
Kazuo Murota (Tokyo Metropolitan University)
B12 On limited memory Kelley’s method/ Swati Gupta (Georgia Tech)
B13 Submodular maximization over logics/ Takanori Maehara (RIKEN AIP)
B14 Finding Submodularity hidden in symmetric difference/ Shuji Kijima (Kyushu University)
12h00 – 13h00 Lunch
13h00 – 14h00 Robot Demo I
Cognitive Assistive Technology team/
Mihoko Otake (RIKEN AIP / University of Tokyo)
14h00 – 15h30 Session B2
B21 Random projections in mathematical programming/ Leo Liberti (CNRS and Ecole Polytechnique)
B22 An iterative algorithm using random projection for LP/ Pierre-Louis Poirion (CNRS and Ecole Polytechnique)
B23 Randomized Sketches for feasibility of large linear systems subject to arbitrary convex constraints/ Khac Ky Vu (Chinese University of Hong Kong)
15h30 – 16h00 Coffee
16h00 – 17h30 Session B3
B31 Fenchel-Moreau conjugation inequalities in generalized convexity/ Michel De Lara (Ecole Nationale des Ponts et Chaussées)
B32 Heterogeneous medical data analysis by selective inference/ Ichiro Takeuchi (RIKEN AIP/ Nagoya Institute of Technology)
B33 Fast yet simple natural-gradient variational inference in complex models/ Mohammad Emtiyaz Khan (RIKEN AIP)
Wednesday, July 25
09h30 – 10h00 Reception
10h00 – 12h00 Session C1
C11 Robust hypothesis testing using Wasserstein uncertainty/ Yao Xie (Georgia Tech)
C12 Statistical estimation for non-smooth functions with the regularity lemma/ Masaaki Imaizumi (RIKEN AIP/ Institute of Statistical Mathematics)
C13 Semi-parametric choice models/
Selin Ahipasaoglu (Singapore University of Technology and Design)
C14 Mathematical programming for limited memory influence diagram/
Victor Cohen (Ecole Nationale des Ponts et Chaussées)
12h00 – 13h00 Lunch
13h00 – 14h00 Robot Demo II
Hakuto, the Japanese Google-X team
Takeshi Hakamada (Ispace)
14h00 – 15h30 Session C2
C21 Legal assignments and fast EADAM with consent via classical theory of stable matchings/ Yuri Faenza (Columbia University)
C22 Tensor factorization for spatio-temporal predictions/ Koh Takeuchi (NTT Labs)
C23 Treewidth-based extension complexity lower bounds/ Gonzalo Muñoz (Polytechnique Montréal)
15h30 – 16h00 Coffee
16h00 – 17h30 Session C3
C31 Spectral sparsification of hypergraph/
Yuichi Yoshida (National Institute of Informatics)
C32 Approximation algorithms for covering problems/
Yotaro Takazawa (Tokyo Institute of Technology)
C33 Convex matroid optimization, lattice polytopes, and degree sequences of hypergraphs/Antoine Deza (McMaster University)
17h30 Closing remarks

(Last update: July 05, 2018)

詳細情報

日時 2018/07/23(月) - 2018/07/25(水) 10:00 - 17:00
開場 09:30
URL https://aip.riken.jp/access/?lang=en

場所

〒103-0027 東京都中央区日本橋1-4-1 日本橋一丁目三井ビルディング 15階

関連研究室

last updated on 2020/6/1 10:06研究室