Please use this identifier to cite or link to this item:

`http://arks.princeton.edu/ark:/88435/dsp0170795b57k`

Title: | Probabilistic Modeling of Structure in Science: Statistical Physics to Recommender Systems |

Authors: | Altosaar, Jaan |

Advisors: | Blei, David M Sondhi, Shivaji L |

Contributors: | Physics Department |

Keywords: | Food Recommender Systems Machine Learning Statistical Physics Variational Inference |

Subjects: | Computer science Computational physics Nutrition |

Issue Date: | 2020 |

Publisher: | Princeton, NJ : Princeton University |

Abstract: | Applied machine learning relies on translating the structure of a problem into a computational model. This arises in applications as diverse as statistical physics and food recommender systems. The pattern of connectivity in an undirected graphical model or the fact that datapoints in food recommendation are unordered collections of features can inform the structure of a model. First, consider undirected graphical models from statistical physics like the ubiquitous Ising model. Basic research in physics requires scalable simulations for comparing the behavior of a model to its experimental counterpart. The Ising model consists of binary random variables with local connectivity; interactions between neighboring nodes can lead to long-range correlations. Modeling these correlations is necessary to capture physical phenomena such as phase transitions. To mirror the local structure of these models, we use flow-based convolutional generative models that can capture long-range correlations. Combining flow-based models designed for continuous variables with recent work on hierarchical variational approximations enables the modeling of discrete random variables. Compared to existing variational inference methods, this approach scales to statistical physics models with millions of correlated random variables and uses 100 times fewer parameters. Just as computational choices can be made by considering the structure of an undirected graphical model, model construction itself can be guided by the structure of individual datapoints. Consider a recommendation task where datapoints consist of unordered sets, and the objective is to maximize top-K recall, a common recommendation metric. Simple results show that a classifier with zero worst-case error achieves maximum top-K recall. Further, the unordered structure of the data suggests the use of a permutation-invariant classifier for statistical and computational efficiency. We evaluate such a classifier on human dietary behavior data, where every meal is an unordered collection of ingredients, and find that it outperforms probabilistic matrix factorization methods. Finally, we show that building problem structure into an approximate inference algorithm improves the accuracy of probabilistic modeling methods. |

URI: | http://arks.princeton.edu/ark:/88435/dsp0170795b57k |

Alternate format: | The Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the library's main catalog: catalog.princeton.edu |

Type of Material: | Academic dissertations (Ph.D.) |

Language: | en |

Appears in Collections: | Physics |

Files in This Item:

File | Description | Size | Format | |
---|---|---|---|---|

Altosaar_princeton_0181D_13397.pdf | 8.34 MB | Adobe PDF | View/Download |

Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.