Hacker News new | past | comments | ask | show | jobs | submit login
Fast Ranking Algorithm: Astonishing Paper by Raykar, Duraiswami, and Krishnapuram (computer.org)
13 points by Anon84 on June 16, 2008 | hide | past | favorite | 8 comments





If an order of magnitude speedup is "astonishing" then the field must have become overconfident and complacent. Great to see someone rocking the boat. But does anyone care to explain any more (in English, for us plebes) more about how this is astonishing? I'm not challenging the assessment; I'm just curious about what it means.

And some interesting words from one of the other papers: what are "classifier regret" and "ranking regret"? Is that a metric of how often you go down the wrong path or something?


Doesn't directly answer your question, but read the comment by thedelimiter on the page below and it may provide some insight :D

http://www.reddit.com/info/6nh28/comments/c04d5l0


hehe, yes, that was well done.


Are you saying an improvement from O(n^2) to O(n) is not impressive? BTW, if this is the improvement you are referring to, its not a "order of magnitude".


I suppose you have an IEEE $ub$cription or member$hip?


Paper from Google Research in a related area: http://www.cs.nyu.edu/web/Research/TechReports/TR2007-903/TR...




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: