Machine Learning, etc

Saturday, April 30, 2011

Neural Networks making a come-back?

›
Five years ago I ran some queries on Google Scholar to see trends on the number of papers that mention particular phrase. The number of hit...
159 comments:
Friday, April 29, 2011

Another ML blog

›
I just noticed that Justin Domke has a blog -- He's one of the strongest researchers in the field of graphical models. I first came acr...
45 comments:
Sunday, March 13, 2011

Going to Google

›
I've accepted an offer from Google and will be joining their Tesseract team next week. I first got interested in OCR when I faced a pr...
40 comments:
Saturday, March 05, 2011

Linear Programming for Maximum Independent Set

›
Maximum independent set, or "maximum stable" set is one of classical NP-complete problems described in Richard Karp's 1972 pap...
189 comments:
Thursday, March 03, 2011

Perils of floating point arithmetic

›
A recent discussion on stackoverflow brought up the issue of results of floating point arithmetic being non-reproducible A reader asked wha...
160 comments:
Monday, February 21, 2011

How to patent an algorithm in the US

›
Today I got Google Alert today on the following pending patent -- Belief Propagation for Generalized Matching . I like to stay up on Belief...
781 comments:
Sunday, February 20, 2011

Generalized Distributive Law

›
With regular distributive law you can do things like $$\sum_{x_1,x_2,x_3} \exp(x_1 + x_2 + x_3)=\sum_{x_1} \exp x_1 \sum_{x_2} \exp x_2 \sum...
18 comments:
Tuesday, February 15, 2011

Cluster decomposition and variational counting

›
Suppose we want to count the number of independent sets in a graph below. There are 9 independent sets. Because the graphs are disjoint we c...
100 comments:
Wednesday, February 09, 2011

Junction trees in numerical analysis

›
There's a neat connection between Cholesky factorization and graph triangulations -- graph corresponding to Cholesky factorization of a ...
20 comments:
Friday, January 21, 2011

Building Junction Trees

›
Here's a 367 vertex Apollonian Network and its Junction Tree (aka Tree Decomposition) A Junction Tree provides an efficient data struct...
5 comments:
Friday, January 14, 2011

P vs. NP page

›
Here's a page linking 65 attempts of resolving P vs NP problem. A couple of papers were published in peer-reviewed journals or conferen...
9 comments:
Saturday, January 08, 2011

towards Problem Compilers

›
First programmers wrote in machine code and assemblers simplified this task significantly by letting them give algorithms at a higher level....
5 comments:
Sunday, January 02, 2011

Interactive Tree Decomposition

›
Here's a tool (in Mathematica) to help visualize the process of constructing a Junction Tree. wrong link fixed Clicking on vertices cor...
13 comments:
Saturday, January 01, 2011

Happy New Year

›
Here are some links to start the new year on a light note Hinged tesselation Statistics-related Cartoons on stats.SE Memorable math pap...
14 comments:
Tuesday, December 21, 2010

Visualizing 7 dimensional simplex

›
Suppose we'd like to visualize a set of joint probabilities realizable by distributions of 3 binary variables. It is a 7 dimensional reg...
15 comments:
Wednesday, December 15, 2010

Computationally nice structures

›
One approach to solving hard problems is to break them into computationally efficient parts. For instance, Globerson/Jaakkola do approximat...
11 comments:
‹
›
Home
View web version

About Me

My photo
Yaroslav Bulatov
Google (Books/OCR)
View my complete profile
Powered by Blogger.