When Are Nonconvex Optimization Problems Not Scary?
General nonconvex optimization problems are NP-hard. In applied disciplines, however, nonconvex problems abound, and heuristic algorithms are often surprisingly effective. The ability of nonconvex heuristics to find high-quality solutions for practical problems remains largely mysterious.…
Expectation Propagation
Programming Models and Systems Design for Deep Learning
We have witnessed emergence of many deep learning systems; each comes with its own unique features. While most system will evolve and getting better, there are some fundamental design choices behind the system that will…
Quantum Perceptron Models
SWIM: Synthesizing What I Mean
2016 Microsoft Research PhD Scholarship Projects Announced
By Daron Green, Director, Microsoft Research Every year since 2004, the Microsoft Research PhD Scholarship Programme has awarded scholarships to fund PhD students’ work on selected projects in the Europe, Middle East, and Africa (EMEA)…