Large-Scale and Decentralized
Germans seem to like engineering-related TV commercials. For example, when I was at École Centrale in 2006, Christian Wachinger, a German student who was also visiting, was quite amused by this Volkswagen commercial that "unpimp[ed] ze auto." Also, there is an IBM commercial that has been airing recently in the US featuring buzzword bingo. It seems that this commercial has been out in Germany for a few months and become popular; the German version can be seen here.
The ivory tower is not an impenetrable defense from buzzwords. My officemate Pat was recently quipping that one of us should propose to work on small-scale centralized algorithms, the thing to do now being large-scale, decentralized or distributed algorithms.
Large-scale distributed algorithms are often defined on or described via graphs.
Some of the students in SSG, nicknamed graphniks by Alan, spend some of their time looking at inference in large-scale graphical models via efficient message-passing algorithms. Inference is the problem of estimating unobserved nodes X from observed nodes Y in a graphical model by computing marginal conditional densities (Xi|Y), or statistics of those marginal conditional densities such as mean and variance. Belief propagation, an algorithm for inference is inherently distributed as the procedure involves passing messages -- functions computed locally at nodes, details of which are not described here -- along edges of the graphical model in an iterative fashion.
Part of Devavrat Shah's research agenda is also message-passing algorithms, in particular to solve problems such as matching, independent set, and scheduling. Message-passing algorithms are used in the decoding of low-density parity-check codes, which were developed by Bob Gallager.
On Tuesday, Lieven Vandenberghe gave a talk entitled, "Chordal sparsity in normal graphical models and semidefinite programming" at the LIDS colloquium. He described interior point matrix optimization methods that make use of the junction tree, where the matrix in question is an adjacency matrix of a graph. On Thursday, Éva Tardos gave a talk on games in networks during a CSAIL colloquium. She first discussed congestion games in which agents do not cooperate and make their own choices in a decentralized manner. Then she discussed buying and selling games on trade networks in which there is a little bit of cooperation or collusion. One of her main points was that algorithmic game theory needs to start dealing more with cooperation. Oh snap! German engineering in da house, ya! What? Oh. Belgian and Hungarian engineering in da house, ya!
