<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" version="2.0">

<channel>
	<title>mim's blog</title>
	
	<link>http://blog.mr-pc.org</link>
	<description>michael i mandel has an infrequently updated weblog</description>
	<lastBuildDate>Fri, 01 Jan 2010 19:49:09 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/MimsBlog" /><feedburner:info xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" uri="mimsblog" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item>
		<title>Dissertation done</title>
		<link>http://blog.mr-pc.org/2010/01/01/dissertation-done/</link>
		<comments>http://blog.mr-pc.org/2010/01/01/dissertation-done/#comments</comments>
		<pubDate>Fri, 01 Jan 2010 19:49:09 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=284</guid>
		<description><![CDATA[I&#8217;ve put the finishing touches on my dissertation.  My defense was at the beginning of September, and my committee didn&#8217;t ask for (m)any changes, but there were a few things I wanted to fix up.  The official &#8220;publication&#8221; date will be February 2010.

Binaural Model-Based Source Separation and Localization
When listening in noisy and reverberant [...]]]></description>
			<content:encoded><![CDATA[<p>I&#8217;ve put the finishing touches on my dissertation.  My defense was at the beginning of September, and my committee didn&#8217;t ask for (m)any changes, but there were a few things I wanted to fix up.  The official &#8220;publication&#8221; date will be February 2010.</p>
<blockquote><p>
<b>Binaural Model-Based Source Separation and Localization</b></p>
<p>When listening in noisy and reverberant environments, human listeners are able to focus on a particular sound of interest while ignoring interfering sounds. Computer listeners, however, can only perform highly constrained versions of this task. While automatic speech recognition systems and hearing aids work well in quiet conditions, source separation is necessary for them to be able to function in these challenging situations.</p>
<p>This dissertation introduces a system that separates more than two sound sources from reverberant, binaural mixtures based on the sources&#8217; locations. Each source is modelled probabilistically using information about its interaural time and level differences at every frequency, with parameters learned using an expectation maximization (EM) algorithm. The system is therefore called Model-based EM Source Separation and Localization (MESSL). This EM algorithm alternates between refining its estimates of the model parameters (location) for each source and refining its estimates of the regions of the spectrogram dominated by each source. In addition to successfully separating sources, the algorithm estimates model parameters from a mixture that have direct psychoacoustic relevance and can usually only be measured for isolated sources. One of the key features enabling this separation is a novel probabilistic localization model that can be evaluated at individual time-frequency points and over arbitrarily-shaped regions of the spectrogram.</p>
<p>The localization performance of the systems introduced here is comparable to that of humans in both anechoic and reverberant conditions, with a 40% lower mean absolute error than four comparable algorithms. When target and masker sources are mixed at similar levels, MESSL&#8217;s separations have signal-to-distortion ratios 2.0 dB higher than four comparable separation algorithms and estimated speech quality 0.19 mean opinion score units higher. When target and masker sources are mixed anechoically at very different levels, MESSL&#8217;s performance is comparable to humans&#8217;, but in similar reverberant mixtures it only achieves 20–25% of human performance. While MESSL successfully rejects enough of the direct-path portion of the masking source in reverberant mixtures to improve energy-based signal-to-noise ratio results, it has difficulty rejecting enough reverberation to improve automatic speech recognition results significantly. This problem is shared by other comparable separation systems.
</p></blockquote>
<p>Download it as <a href="http://mr-pc.org/work/dissertation.pdf"> a single pdf</a> (7.6 MB)</p>
<p>Download separate chapters as pdfs (some of the internal links don&#8217;t work):</p>
<ul>
<li><a href="http://mr-pc.org/work/dissertation_frontmatter.pdf"> Front matter</a> (142 KB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch1.pdf"> Chapter 1: Introduction</a> (450 KB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch2.pdf"> Chapter 2: Literature review</a> (979 KB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch3.pdf"> Chapter 3: Statistics of interaural parameters</a> (2.5 MB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch4.pdf"> Chapter 4: Localization</a> (1.8 MB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch5.pdf"> Chapter 5: Separation</a> (1.9 MB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch6.pdf"> Chapter 6: Evaluation</a> (335 KB)</li>
<li><a href="http://mr-pc.org/work/dissertation_ch7.pdf"> Chapter 7: Conclusion</a> (74 KB)</li>
<li><a href="http://mr-pc.org/work/dissertation_bibliography.pdf"> Bibliography</a> (210 KB)</li>
</ul>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/bGGcVATv9oA" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2010/01/01/dissertation-done/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Website updates</title>
		<link>http://blog.mr-pc.org/2009/12/21/website-updates/</link>
		<comments>http://blog.mr-pc.org/2009/12/21/website-updates/#comments</comments>
		<pubDate>Mon, 21 Dec 2009 03:15:46 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[meta]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=275</guid>
		<description><![CDATA[I just finished a small re-arrangement of my  main website.  I&#8217;m now using  bibtex2html to generate my  publications list from my CV.  It puts in abstracts, bibtex, and links to the paper, poster, slides, whatever.  I wrote a little script around it to combine the different sections generated by [...]]]></description>
			<content:encoded><![CDATA[<p>I just finished a small re-arrangement of my <a href="http://mr-pc.org"> main website</a>.  I&#8217;m now using <a href="http://www.lri.fr/~filliatr/bibtex2html/"> bibtex2html</a> to generate my <a href="http://mr-pc.org/work/pubs.html"> publications list</a> from my CV.  It puts in abstracts, bibtex, and links to the paper, poster, slides, whatever.  I wrote a little script around it to combine the different sections generated by <a href="http://www.cam.ctan.org/tex-archive/macros/latex/contrib/bibunits/"> bibunits</a> into one big html file.  I also shuffled around the front page of the site a tiny bit, adding a picture <a href="http://photoapparat.org/"> Adrian</a> took of me.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/5PyNT9VPoj8" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/12/21/website-updates/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Boston Music Hack Day</title>
		<link>http://blog.mr-pc.org/2009/11/28/boston-music-hack-day/</link>
		<comments>http://blog.mr-pc.org/2009/11/28/boston-music-hack-day/#comments</comments>
		<pubDate>Sat, 28 Nov 2009 15:44:23 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=252</guid>
		<description><![CDATA[I spent last weekend at the Boston Music Hack Day.  It was a lot of fun.  The idea was that people who are into music and web tech would get together for the weekend and build something cool.  

My project was called  Bowie S-S-S-Similarities.  I got all of David Bowie&#8217;s [...]]]></description>
			<content:encoded><![CDATA[<p>I spent last weekend at the Boston Music Hack Day.  It was a lot of fun.  The idea was that people who are into music and web tech would get together for the weekend and build something cool.  </p>
<p><a href="http://mr-pc.org/bowie/"><img src="http://mr-pc.org/bowie/bowiegram3_small.png" class="centered"></a></p>
<p>My project was called <a href="http://mr-pc.org/bowie"> Bowie S-S-S-Similarities</a>.  I got all of David Bowie&#8217;s music (thanks, Brian!) and lined it up from beginning to end.  Then I ran my autotaggers from <a href="http://musicallyintelligent.com"> Musically Intelligent Machines</a> over every 10-second clip in it.  Then I measured the similarity of the tags applied to every 10-second clip with every other 10-second clip, generating a big (5000&#215;5000) similarity matrix.  I originally wanted to use some sort of google maps interface to browse through this big matrix, but I couldn&#8217;t find one, so I wrote a python wrapper to let me browse through it and listen to the clips.  Bowie seemed like a good artist to pick for this because he&#8217;s put out a lot of albums and they&#8217;ve been quite varied.</p>
<p>Some fun observations from playing around with it:</p>
<ul>
<li>The album Low was different from everything else, being one of Bowie&#8217;s ambient collaborations with Brian Eno.</li>
<li>The track &#8220;Kingdom Come&#8221; from the album Scary Monsters is the most self-similar track and is also the most similar to Bowie&#8217;s other tracks.</li>
<li>Using a similarity based only on genre tags makes a pretty different similarity matrix than using a similarity based on tags related to vocals.</li>
</ul>
<p>The audience liked the hack and the presentation enough to get me a copy of Rock Band.  Check out a <a href="http://www.francoismaillet.com/blog/wp-content/uploads/2009/11/P1020732-1024x577.jpg"> picture</a> of me and <a href="http://www.francoismaillet.com/blog"> Frank</a>, who also won a copy of Rock Band for his hack <a href="http://musichackdayboston.pbworks.com/PartyLister"> PartyLister</a>, on Frank&#8217;s <a href="http://www.francoismaillet.com/blog/?p=337"> post</a>.</p>
<p>After getting home, I read Kurt&#8217;s <a href="http://kurtisrandom.blogspot.com/2009/11/echonest-artist-graph.html"> blog post</a> about his hack, which used Microsoft&#8217;s <a href="http://www.seadragon.com/developer/"> Seadragon</a> to zoom and pan around a giant visualization of artist similarity.  I thought that was pretty awesome, and as it was what I had wanted to do for my hack, I made a Seadragon viewer for the Bowie similarity matrix.  I got it working most of the way with the <a href="http://dragonosticism.wordpress.com/2008/12/10/deep-zoom-image-creation-with-python/"> seadragon.py</a> script to chop up the big image into a pyramid of tiles and the Seadragon AJAX code to display it.  But I couldn&#8217;t get that to work on the blog here, so I used the online <a href="http://seadragon.com/create/"> Seadragon builder</a>.</p>
<p><script src="http://seadragon.com/embed/h1p.js?width=auto&#038;height=400px"></script></p>
<p>Note that the seadragon version is using more music than my original hack (9000 clips), which should be all of Bowie&#8217;s studio albums.  I&#8217;d like to add the ability to see which clips you&#8217;re mousing over and to play them, but I haven&#8217;t had time.  I would also like to get the image to be in color, but I haven&#8217;t been able to get the Python Imaging Library to behave with numpy&#8217;s colormaps.  And finally, it would be nice to make the similarity <a href="http://ismir2008.ismir.net/latebreak/lamere.pdf"> steerable</a> so that you can seamlessly switch between different types of similarity or even different weights on different tags.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/Dc2t15DnSLo" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/11/28/boston-music-hack-day/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>WASPAA 2009</title>
		<link>http://blog.mr-pc.org/2009/09/28/waspaa-2009/</link>
		<comments>http://blog.mr-pc.org/2009/09/28/waspaa-2009/#comments</comments>
		<pubDate>Mon, 28 Sep 2009 01:23:40 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=243</guid>
		<description><![CDATA[My  paper was accepted to WASPAA this year.  It is entitled The ideal interaural parameter mask: a bound on binaural separation systems.  It&#8217;s about source separation, an upper bound on source separation algorithms like MESSL.  It also includes some improvements to MESSL, namely a prior on ILD and an explicit model [...]]]></description>
			<content:encoded><![CDATA[<p>My <a href="http://mr-pc.org/work/waspaa09.pdf"> paper</a> was accepted to WASPAA this year.  It is entitled <b>The ideal interaural parameter mask: a bound on binaural separation systems</b>.  It&#8217;s about source separation, an upper bound on source separation algorithms like MESSL.  It also includes some improvements to MESSL, namely a prior on ILD and an explicit model of reverberation, which both improve separations.  In fact, they bring it quite close to the limit set by the proposed upper bound.  Here&#8217;s the abstract:</p>
<blockquote><p>
We introduce the Ideal Interaural Parameter Mask as an upper bound on the performance of mask-based source separation algorithms that are based on the differences between signals from two microphones or ears.  With two additions to our Model-based EM Source Separation and Localization system, its performance approaches that of the IIPM upper bound to within 0.9~dB.  These additions battle the effects of reverberation by absorbing reverberant energy and by forcing the ILD estimate to be larger than it might otherwise be.  An oracle reliability measure was also added, in the hope that estimating parameters from more reliable regions of the spectrogram would improve separation, but it was not consistently useful.
</p></blockquote>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/6kGFU_Cqt9Y" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/09/28/waspaa-2009/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Under construction…</title>
		<link>http://blog.mr-pc.org/2009/09/18/hello-world/</link>
		<comments>http://blog.mr-pc.org/2009/09/18/hello-world/#comments</comments>
		<pubDate>Fri, 18 Sep 2009 22:39:10 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=1</guid>
		<description><![CDATA[I&#8217;m in the process of migrating this blog to a new host.  The infrequently updated blog that you know and love will be back shortly.
]]></description>
			<content:encoded><![CDATA[<p>I&#8217;m in the process of migrating this blog to a new host.  The infrequently updated blog that you know and love will be back shortly.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/_39glrjbwMo" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/09/18/hello-world/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sidebar updates</title>
		<link>http://blog.mr-pc.org/2009/08/01/sidebar-updates/</link>
		<comments>http://blog.mr-pc.org/2009/08/01/sidebar-updates/#comments</comments>
		<pubDate>Sat, 01 Aug 2009 05:27:03 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[books]]></category>
		<category><![CDATA[meta]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=216</guid>
		<description><![CDATA[
I finally cleared my photo backlog, which went back to December, and uploaded them to  flickr.  There are more than will fit in the sidebar, so check out the rest of my  concert photos and  random phone photos there.
I also added a  LibraryThing widget, which shows the last N books [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.flickr.com/photos/48241739@N00/3777228008/" title="Walking on the moon by asterix77, on Flickr"><img src="http://farm3.static.flickr.com/2478/3777228008_109fc3c253_m.jpg" width="240" height="192" alt="Walking on the moon" class="centered"/></a></p>
<p>I finally cleared my photo backlog, which went back to December, and uploaded them to <a href="http://www.flickr.com/photos/48241739@N00/"> flickr</a>.  There are more than will fit in the sidebar, so check out the rest of my <a href="http://www.flickr.com/photos/48241739@N00/sets/72157604522889991/"> concert photos</a> and <a href="http://www.flickr.com/photos/48241739@N00/sets/72157604518319708/"> random phone photos</a> there.</p>
<p>I also added a <a href="http://www.librarything.com/catalog/asterix77"> LibraryThing</a> widget, which shows the last N books I&#8217;ve read.  I haven&#8217;t been doing much extracurricular reading in the last month or two, but I haven&#8217;t told you about the ones before that, so they&#8217;re new to you.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/OJBsuoma0c0" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/08/01/sidebar-updates/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Reading papers</title>
		<link>http://blog.mr-pc.org/2009/07/09/reading-papers/</link>
		<comments>http://blog.mr-pc.org/2009/07/09/reading-papers/#comments</comments>
		<pubDate>Fri, 10 Jul 2009 03:04:11 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[ideas]]></category>
		<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=210</guid>
		<description><![CDATA[I&#8217;m working on the literature review chapter of the dissertation and it&#8217;s gotten me thinking.  It&#8217;s a real pain to put together a good survey.  It&#8217;s hard to know what papers are out there, what they say, and what&#8217;s notable about them.  I&#8217;ve been using a few tools for this, but there&#8217;s [...]]]></description>
			<content:encoded><![CDATA[<p>I&#8217;m working on the literature review chapter of the dissertation and it&#8217;s gotten me thinking.  It&#8217;s a real pain to put together a good survey.  It&#8217;s hard to know what papers are out there, what they say, and what&#8217;s notable about them.  I&#8217;ve been using a few tools for this, but there&#8217;s a lot of room for improvement.</p>
<p>I&#8217;ve been using <a href="http://www.citeulike.org/user/asterix77/"> citeulike</a> for a while, and it&#8217;s great for scraping IEEE and JASA abstracts.  It can import bibtex files, but they&#8217;re harder to get linked in to pdfs and you might end up with a lot of duplicates if you&#8217;re not careful.  On Neeraj&#8217;s recommendation, I&#8217;ve been trying out <a href="http://www.mendeley.com/"> mendeley</a> and it&#8217;s a bit cooler.  It can read in a directory of pdfs and figure out to some extent what they are.  This is most useful with popular papers, because they have some sort of fingerprinter that recognizes the same pdf from multiple users and matches up the metadata.  That way, only one person has to correct each entry and others can benefit.  I&#8217;m not sure if it&#8217;s been able to recognize when a pdf is the same as a bibtex entry, but it might be able to.  They also seem to have a very responsive <a href="http://feedback.mendeley.com"> feedback system</a> using UserVoice.  And of course there&#8217;s always google scholar to actually find these papers.</p>
<p>But, I think these apps could be a lot more useful.  Instead of just linking to the papers that cite a paper, a lot could be gained by keeping track of the &#8220;anchor text&#8221; that does the linking.  This means not only noting that paper X cites paper Y, but that paper X describes paper Y in this way, uses this information from it, cites it in this context, etc.</p>
<p>The first thing that this would enable would be the annotation of a paper&#8217;s bibliography with the relevant parts of its text.  These are all of the outgoing links from a paper.  By analyzing the paper, all of the [22]s or the (Mojo, 1987)s could be associated with the right entry in the bibliography.  It would give the references some much-needed context.  It would also show which references in a bibliography were actually discussed and which were just mentioned in passing.  This could be an application by itself.  And while we&#8217;re linking the references to the bibliography, it could put in some hyperlinks, like the hyperref package in latex does, but after the fact.</p>
<p>The second thing that it would enable would be the annotation of a paper with all of the things that other papers have said about it.  These would be all of the incoming links from other papers.  It would give you some context on a new paper that you had just come across in addition to what the authors wrote in the abstract.  If you wanted to be really fancy, each reader could have trusted sources of these incoming links.  These opinions are like little mini reviews or summaries that have already been published, no need to solicit readers&#8217; opinions.  Instead of the first few sentences on a &#8220;papers that cite X&#8221; page on google scholar, you&#8217;d get a page of summaries, reviews, and extracts.</p>
<p>Both of these features would make it much easier to get introduced to a new field or to write a more balanced review of a familiar or semi-familiar field.  I know it&#8217;s tough to match up bibliography entries with references and with papers themselves, and that there are some user interface issues to work out here, but it shouldn&#8217;t be that hard.  Maybe crowdsourcing could help if necessary.  Hopefully all of this would help allay that niggling fear of missing an important paper.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/nGa7HyI1TJ0" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/07/09/reading-papers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Off to Montreal</title>
		<link>http://blog.mr-pc.org/2009/05/15/off-to-montreal/</link>
		<comments>http://blog.mr-pc.org/2009/05/15/off-to-montreal/#comments</comments>
		<pubDate>Sat, 16 May 2009 02:27:38 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=209</guid>
		<description><![CDATA[Just when you thought I&#8217;d given up on this blog&#8230;big news!  The  grant I wrote to the Quebec government came through.  I&#8217;m going to do a postdoc with  Doug Eck at the Universite de Montreal.  It should be very cool, I&#8217;ll be building up my machine learning chops working on [...]]]></description>
			<content:encoded><![CDATA[<p>Just when you thought I&#8217;d given up on this blog&#8230;big news!  The <a href="http://www.fqrnt.gouv.qc.ca/bourses/regles/boPBEEEAng.htm"> grant I wrote</a> to the Quebec government came through.  I&#8217;m going to do a postdoc with <a href="http://www.iro.umontreal.ca/~eckdoug/"> Doug Eck</a> at the Universite de Montreal.  It should be very cool, I&#8217;ll be building up my machine learning chops working on autotagging and other music problems.  I move up there in the fall.  Now all I have to do is write my dissertation and learn French&#8230;</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/pNgVzOOMykU" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/05/15/off-to-montreal/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Outliers</title>
		<link>http://blog.mr-pc.org/2009/01/11/outliers/</link>
		<comments>http://blog.mr-pc.org/2009/01/11/outliers/#comments</comments>
		<pubDate>Sun, 11 Jan 2009 17:24:54 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[books]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=207</guid>
		<description><![CDATA[ As I&#8217;ve said  many  times, I&#8217;m a big fan of Malcolm Gladwell&#8217;s essays, so when Uncle Wayne and Aunt Jane got me a gift certificate to Barnes and Noble for Hanukkah, I bought a copy of his new book, Outliers.  I couldn&#8217;t put it down and it was a quick read, [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.amazon.com/gp/product/0316017922?ie=UTF8&#038;tag=mimsblog-20&#038;linkCode=as2&#038;camp=1789&#038;creative=390957&#038;creativeASIN=0316017922"><img src="http://blog.mr-pc.org/wp-content/uploads/2009/01/41xq6-rygzl_sl160_.jpg" alt="" title="Outliers" width="106" height="160" class="alignleft size-medium wp-image-208" /></a><img src="http://www.assoc-amazon.com/e/ir?t=mimsblog-20&#038;l=as2&#038;o=1&#038;a=0316017922" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /> As I&#8217;ve said <a href="http://blog.mr-pc.org/2008/05/17/thinking-about-ideas/"> many</a> <a href="http://blog.mr-pc.org/2007/12/02/megachurch-lessons/"> times</a>, I&#8217;m a big fan of Malcolm Gladwell&#8217;s essays, so when Uncle Wayne and Aunt Jane got me a gift certificate to Barnes and Noble for Hanukkah, I bought a copy of his new book, <a href="http://www.amazon.com/gp/product/0316017922?ie=UTF8&#038;tag=mimsblog-20&#038;linkCode=as2&#038;camp=1789&#038;creative=390957&#038;creativeASIN=0316017922">Outliers</a><img src="http://www.assoc-amazon.com/e/ir?t=mimsblog-20&#038;l=as2&#038;o=1&#038;a=0316017922" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" />.  I couldn&#8217;t put it down and it was a quick read, so I finished it in a few days.  The book is broken into two halves.  The first half explores the idea that successful people are successful because firstly they get lucky and secondly they work hard to take advantage of that luck.  The second half explores the idea that different cultures are, in fact, different and that those differences have real effects over many generations.  It&#8217;s linked to the first half in that these differences are intertwined with the lucky breaks people get.</p>
<p>While I enjoyed it, the book seemed a bit padded at times.  There were tangential tables that took up multiple pages and the epilogue, an account of the lucky occurrences throughout Gladwell&#8217;s family tree, was a nice anecdote but didn&#8217;t really bring any more support to the thesis.  A couple of the citations came from wikipedia.  Certainly not worth the $29 list price, or even the $20 discount price, I&#8217;d recommend waiting for the paperback edition or a secondhand copy.  There were, however, a number of choice Gladwellian factoids, which I will relate.</p>
<p>In the first half of the book, there were some interesting anecdotes about the lucky breaks that Bill Gates and Bill Joy got on their ways to the top, but the most interesting idea was the fact that there are certain birth months and years that are better than others for success in various fields.  The first example of this is in sports, where a national birthday cutoff for kids leads to a disproportionate number of the best adult athletes being born just after that cutoff.  The explanation is that the kids who are the oldest for their age group are the biggest and best and they get put on traveling teams, get more practice, play more, and get better coaching, which eventually leads to a significant advantage when they grow up.  In English football, the cutoff is September 1st and, at one point in the mid 90s, the Premier League had twice as many players born in the three months after the cutoff than the three before it (<a href="http://www.nature.com/nature/journal/v368/n6472/abs/368592a0.html">nature article</a>).  This is apparently also true in elementary school where older 4th graders score better on math tests than younger classmates.  This advantage even continues through college, where &#8220;students belonging to the relatively youngest group in their class are under-represented by about 11.6 percent.&#8221;</p>
<p>Gladwell also describes two cases where birth year gave people legs up.  The first was in the software industry.  The titans of which were disproportionately born in 1954 and 1955.  Gladwell&#8217;s argument is that these people were 20 or 21 in 1975 when the Altaire 8800, the first personally-attainable computer, was released.  The second is in the lawyers specializing in hostile takeovers in the 1970s, who were disproportionately born during the great depression in the 1930s when birth rates dropped significantly.  This gave them better access to schools, colleges, and law schools, which had just been expanded to accommodate the previous generation.</p>
<p>The second half of the book focused on the measurable effects of differences between cultures.  In an interesting, but less convincing argument, Gladwell claims that rice cultivation in <a href="http://en.wikipedia.org/wiki/Rice_paddy"> paddies</a> leads to more entrepreneurial farmers, while wheat and corn cultivation lead to stronger feudal hierarchies.  Apparently rice cultivation is quite a tricky endeavor and yields are increased by leveling the ground in the paddy, maintaining the correct water level, using the right combination of rice strains, weeding thoroughly, and fertilizing properly.  Rice landlords charged fixed rent, allowing rice farmers to profit from larger harvests while wheat landlords payed fixed wages regardless of yield.</p>
<p>Chinese rice farmers were able to grow rice all year round, harvesting and planting new seedlings two or three times a year.  French peasants, on the other hand, planted in the spring, harvested in the fall, and hibernated through the winter.  Rice paddies, furthermore, are enriched by nutrients in the irrigation and can be used continuously.  Wheat and corn fields, on the other hand, are exhausted by agriculture and need to lie fallow every few years to recover.  Gladwell suggests that this difference in farming practices led to opposing cultural analogies for human mental growth, and to differences national school schedules: the American school year is on average 180 days long, while the Japanese school year is 243 days long.</p>
<p>His slightly more convincing argument in this section was about plane crashes.  Apparently, plane crashes are generally caused by the compounding of a number of small errors, a condition that is best mitigated by sharing responsibilities between the captain and the first officer.  In cultures that have a great deal of respect for authority, such as Korea,  the deference the first officers showed to captains tended to cause more crashes.  Between 1988 and 1998, Korean Airlines lost 4.79 planes in accidents for every million departures.  Compare that to United Airlines, which in the same period lost 0.27 planes in accidents for every million departures.  By training its first officers to be more assertive when they noticed a problem, Korean Air has gotten these numbers in line with other carriers.  An IBM psychology Geert Hofstede surveyed employees around the globe and used their answers to assemble a set of dimensions for measuring how cultures differ from each other, now known as <a href="http://en.wikipedia.org/wiki/Geert_Hofstede"> Hofstede&#8217;s dimensions</a>.  Korea is apparently second from the top of Hofstede&#8217;s list in deference towards authority.</p>
<p>Overall it was a fun read, but I think I&#8217;m a bigger fan of Gladwell&#8217;s shorter writings.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/__x6Havj2J0" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2009/01/11/outliers/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Ground truth</title>
		<link>http://blog.mr-pc.org/2008/12/01/ground-truth/</link>
		<comments>http://blog.mr-pc.org/2008/12/01/ground-truth/#comments</comments>
		<pubDate>Tue, 02 Dec 2008 04:45:20 +0000</pubDate>
		<dc:creator>mim</dc:creator>
				<category><![CDATA[research]]></category>

		<guid isPermaLink="false">http://blog.mr-pc.org/?p=206</guid>
		<description><![CDATA[The funny thing about my research, whether it&#8217;s music classification, source separation, or any other sort of machine learning task I can think of, is the difference between developing an algorithm and deploying it.  It&#8217;s actually harder to develop an algorithm than it is to deploy it.  To deploy an algorithm, if you&#8217;re [...]]]></description>
			<content:encoded><![CDATA[<p>The funny thing about my research, whether it&#8217;s music classification, source separation, or any other sort of machine learning task I can think of, is the difference between developing an algorithm and deploying it.  It&#8217;s actually harder to develop an algorithm than it is to deploy it.  To deploy an algorithm, if you&#8217;re shooting from the hip, you just need to build it and run it on the data you want to analyze.  So if I want to develop a music classifier, I extract some features, train and classifier, and classify some music.  To develop the algorithm, however, you need to do everything you would need to do to deploy it, but then you also need ground truth.  That is to say that you need to know what answer you&#8217;re expecting before you get it, so you can tell how well you&#8217;re doing.  So, paradoxically, I need to have my music already classified in order to see how well my classifier can classify it.</p>
<p>It was always clear to me that if you can get new ground truth data, you can do cool new things, but it took a while for it to sink in that you really can&#8217;t develop a system to solve a problem without having the problem already solved, in some sense.  Of course, the power of machine learning comes from being able extrapolate results from a small subset of labeled data to an infinite amount of as-yet-unlabeled data.  I can develop music classifiers (and pick the one that does best) using a small set of already-classified music and then use it to classify as much music as I want.  The question is, is that as-yet-unlabeled data really that similar to the test set?  When you have enough data to know the answer to that question, you probably have enough data to do pretty well with a basic classifier.</p>
<p>As an aside, I&#8217;m always highly doubtful of claims that computers can latch onto things beyond human perception.  For watermarking, sure, it&#8217;s designed so that machines can perceive it, but people can&#8217;t.  But when it comes to very human-grounded ideas like <a href="http://blog.wired.com/music/2008/10/mufin.html"> similarity</a>, I think it is impossible to try to circumvent human &#8220;subjectivity&#8221;.  There really is no objective measure of whether two sounds are similar besides the consistency in subjective ratings of human listeners.  I think much of the trick of developing (provably) useful algorithms is defining problems that have objective solutions and then solving them objectively.</p>
<img src="http://feeds.feedburner.com/~r/MimsBlog/~4/UiMqqma7s4c" height="1" width="1"/>]]></content:encoded>
			<wfw:commentRss>http://blog.mr-pc.org/2008/12/01/ground-truth/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
