Neuralizing Algorithms

Investigator: Lee Wee Sun.

Most AI problems are computationally intractable in the worst case. The typical or average case could be much easier but is difficult to design for. We propose to use machine learning to learn algorithms with good average-case performance instead.

Specifically, we learn effective approximate inference algorithms for probabilistic graphical models using deep learning. The Factor Graph Neural Network can represent operations of a well-known approximate inference algorithm, the loopy belief propagation, and can potentially represent more powerful algorithms. It is learned from data, optimizing average-case performance on the data it is learned on, instead of being designed to work on all graphical models.

Privacy Settings
We use cookies to enhance your experience while using our website. If you are using our Services via a browser you can restrict, block or remove cookies through your web browser settings. We also use content and scripts from third parties that may use tracking technologies. You can selectively provide your consent below to allow such third party embeds. For complete information about the cookies we use, data we collect and how we process them, please check our Privacy Policy
Consent to display content from Youtube
Consent to display content from Vimeo
Google Maps
Consent to display content from Google