Photo: ©KOBE CONVENTION & VISITORS ASSOCIATION
Invited Talks
The conference features three invited talks by Noriko Arai, David Stoutemyer and Bernd Sturmfels.
Noriko Arai, National Institute of Informatics, Japan 
Mathematics by MachineAbstract: When David Hilbert began Hilbert's program (formalization of mathematics) in the early 20th century to give the solid foundation of mathematics, he unintentionally introduced the possibility of automatization of mathematics. Theoretically, the possibility was denied by Gödel's incompleteness theorem. However, an interesting question is still open. Is “mediocre mathematics” automizable? We are developing a system that solves a wide range of math problems written in natural language as a part of Todai Robot Project, an AI challenge to pass the university entrance examination. We report the overview and the progress of our project, and the theoretical and methodological difficulties to overcome. 
David Stoutemyer, University of Hawaii, USA 
Fuzzy simplification of nonnumeric expressions containing some numeric intervals and/or floating point numbersAbstract: This article describes a Mathematica package that improves simplification of general nonnumeric expressions containing any mixture of Gaussian rational numbers, symbolic constants, machine and arbitraryprecision floatingpoint numbers, together with intervals having any mixture of such endpoints. Such generalized numbers are not automatically all converted to floats or to intervals. Expressions can be multivariate and nonpolynomial. Techniques include:

Bernd Sturmfels, University of California Berkeley, USA 
Maximum Likelihood for Matrices with Rank ConstraintsAbstract: Maximum likelihood estimation is a fundamental computational task in statistics. We address this problem for manifolds of low rank matrices. These represent mixtures of independent distributions of two discrete random variables. This nonconvex optimization problems lead to some beautiful geometry, topology, and combinatorics. We discuss methods for finding the global maximum of the likelihood function, we present a duality theorem due to Draisma and Rodriguez, and we share recent work with Kubkas and Robeva concerning nonnegative rank and the EM algorithm. 