Home * People * Ryan Rifkin

Ryan Michael Rifkin,
an American mathematician and computer scientist at Honda Research Institute ^[1] and MIT Center for Biological and Computational Learning. He holds a Ph.D. from MIT on machine learning in 2002 ^[2]. In the early 90s, along with primary author Bradley Kuszmaul, Ryan Rifkin co-authored the massive parallel chess program StarTech which competed the ACM 1993 running on a CM-5 ^{[3] [4]}. He optimized some move generation routines in assembly language, and cleaned up the parallel work-stealing code.

Quotes

from Bradley Kuszmaul's Ph.D. thesis ^[5]

The code for move generation and checking illegal moves, which takes a total of 3.5% of the cycles, was optimized in assembly language by Ryan Rifkin under the direction of Mark Bromley of Thinking Machines Corporation. Before Ryan worked on that code, the move generation and illegal move checking accounted for about 9% of all the cycles.

Selected Publications

^[6]

• Massimiliano Pontil, Ryan Rifkin, Theodoros Evgeniou (1998). From Regression to Classification in Support Vector Machines. A.I. Memo 1649, MIT Artificial Intelligence Lab, CiteSeerX
• Ryan Rifkin (1998). The Static Stochastic Ground-Holding Problem. Master's thesis, MIT
• Ryan Rifkin (2002). Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning. Ph.D Thesis, MIT, pdf
• Ryan Rifkin, Aldebaro Klautau (2004). In Defense of One-Vs-All Classification. Journal of Machine Learning Research 5, pdf
• Ryan Rifkin, Ross A. Lippert (2007). Value Regularization and Fenchel Duality. Journal of Machine Learning Research ^[7]
• Ryan Rifkin, Ross A. Lippert (2007). Notes on Regularized Least-Squares. Technical Report, pdf
• Ryan Rifkin (2007). Fenchel Duality for Machine Learning, Part II: A Bit More Theory. slides as pdf
• Ryan Rifkin (2007). Introduction to Fenchel Duality for Machine Learning. slides as pdf

External Links

• Ryan M. Rifkin - Google Scholar Citations

References

1. ^ Honda Research Institute USA
2. ^ Ryan M. Rifkin (2002). Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning. Ph. D thesis, MIT
3. ^ The 23rd ACM International Computer Chess Championship from The Computer History Museum, pdf
4. ^ Re: Hash tables----Clash!!!-What happens next? by Albert Gower, rec.games.chess, March 19, 1994
5. ^ Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. thesis, Department of Electrical Engineering and Computer Science, MIT, pdf, pp. 130, 6.6 How Time is Spent in StarTech
6. ^ DBLP: Ryan M. Rifkin
7. ^ Fenchel's duality theorem from Wikipedia

What links here?

Up one level