SPARS 2011, day 3

Big things today, with plenaries given by David Donoho and Martin Vetterli.
Donoho answered all the questions I have regarding the variability of recovery algorithms on distributions underlying sparse vectors.
I just need a few years to understand them.
I also need to look more closely at approximate message passing.
And Vetterli gave a great talk, discussing the tendency in algorithm development to jump to a solution before solving the outstanding problem, e.g., sampling the real continuous world on a discretized grid.

Now I need to eat dinner, and run some experiments.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s