|
- Learning network structure using L1 regularization: many machine learning algorithms are embarassingly parallel, since they involve running the same code on different subsets of the data for purposes of cross validation, estimating error bars, etc; we used many Arrow nodes to speed up the experiments described in "Learning Graphical Model Structure using L1-Regularization Paths", M Schmidt, A Niculescu-Mizil, K Murphy. AAAI'07
- Bayesian learning of network structure features: in a related project, we looked at new MCMC algorithms for estimating probabilities of network features. We used Arrow to speed up the experiments described in "Bayesian structure learning using dynamic programming and MCMC", D Eaton, K Murphy, UAI'07 to appear.
- Action Graph Games: Using the arrow cluster we carried out computational experiments evaluating the performance of our proposed algorithms for action graph games, which is a compact representation of game-theoretic models. (May 2006 - ongoing; Albert Xin Jiang and Kevin Leyton-Brown, CS)
|