I've been slow at posting because I wanted to post on this current topic for a while, but wanted to work out some more details before doing so. Well, it didn't happen. So I'm writing sans details.

Let's think for a minute about non-linear dimensionality reduction, aka manifold learning. If we compare what, say, ISOMAP does with what laplacian eigenmaps (LE) does, they're really quite similar. In both cases, we construct a graph over our data points, usually a kNN graph or something, sometimes with edge weights, sometimes not. We then attempt to embed the points in a low dimensional space to minimize some sort of distortion. In ISOMAP, the distortion is based on the shortest path distance between the two points in our constructed graph. In LE, the distance is measures according to the Laplacian of the graph. The notion of a Laplacian of a graph is basically a discrete version of the more standard notion of the differential operator by the same name (that comes up in most standard analysis courses). In continuous land, it is the divergence of the differential, which essentially means that measures some form of diffusion (and has its original applications in physics). In discrete land, where we live, it can be thought of as a measure of flow on a graph.

The key difference, then, between ISOMAP and LE is whether you measure distances according to shortest path or to flow, which has a very "average path" feel to it. The advantage to LE is that it tends to be less susceptible to noise, which is easy to understand when viewed this way.

Now, getting back to NLP stuff, we often find ourselves doing some sort of shortest path search. It's well known that the much loved Viterbi algorithm is exactly an application of dynamic programming to search in the lattice defined by an HMM. This extends in well known ways to other structures. Of course, Viterbi search isn't the only game in town. There are two other popular approaches to "decoding" in HMMs. One is marginal decoding, where we individually maximize the probability of each node. The other is minimum Bayes risk decoding. Here, we take a user-supplied risk (aka loss) function and try to find the output that minimizes the expected risk, where the probabilities are given by our current model. MBR has been shown to outperform Viterbi in many applications (speech, MT, tagging, etc.). If your risk (loss) function is 0/1 loss, then these recover the same solution.

What I'm curious about is whether this is a connection here. I'm not exactly sure how the construction would go -- I'm thinking something like a graph defined over the lattice vertices with edges that reflect the loss function -- but there definitely seems to be a similarity between MBR and average path, which is approximately equal to a Laplacian operation (aka spectral operation). The reason I think this would be interesting is because a lot is known about spectral computations and we might be able to use this knowledge to our advantage (coming up with MBR algorithms is sometimes a bit painful). An additional complication (or bit of fun, if you see it that way) is that there are at least three standard ways to generalize the notion of a Laplacian to a hypergraph, which is what we would really need to do. Perhaps we can help pick out the "right" one through the MBR connection.

## 26 April 2009

### Viterbi search, minimum Bayes risk and laplacian eigenmaps

Posted by hal at 4/26/2009 08:01:00 AM | 24 comments

Labels: algorithms, machine learning, questions

## 24 April 2009

### ...and here it is for ACL

Papers are here. Words:

- translat (19)
- model (19)
- base (19)
- learn (16)
- semant (12)
- supervis (10)
- machin (10)
- depend (10)
- automat (10)
- word (9)
- pars (9)
- approach (8)
- system (7)
- relat (7)
- gener (7)
- web (6)
- unsupervis (6)
- train (6)
- languag (6)
- label (6)
- decod (6)
- align (6)

Posted by hal at 4/24/2009 08:59:00 AM | 17 comments

Labels: conferences

## 23 April 2009

### NAACL program up

See here. I see a bunch that I reviewed and really liked, so I'm overall pretty happy. (Though I also see one or two in the "other" category :P.)

At any rate, here are the top stemmed/stopped words with frequencies:

- model (30)
- base (19)
- translat (17)
- languag (16)
- speech (14)
- improv (14)
- statist (12)
- machin (12)
- unsupervis (11)
- recognit (10)
- pars (10)
- system (9)
- learn (9)
- word (8)
- depend (8)
- approach (8)
- spoken (7)
- semant (7)
- search (7)
- linear (7)
- extract (7)

Posted by hal at 4/23/2009 10:00:00 AM | 10 comments

Labels: conferences

Subscribe to:
Posts (Atom)