25,161
edits
Changes
Created page with "'''Home * People * Ryan Rifkin''' '''Ryan Michael Rifkin''',<br/> an American mathematician and computer scientist with expertise in Learning|machine lear..."
'''[[Main Page|Home]] * [[People]] * Ryan Rifkin'''
'''Ryan Michael Rifkin''',<br/>
an American mathematician and computer scientist with expertise in [[Learning|machine learning]], affiliated with [[Google|Google Inc.]] <ref>[https://www.researchgate.net/profile/Ryan_Rifkin Ryan M. Rifkin | Google Inc., Mountain View | Google]</ref>, [https://en.wikipedia.org/wiki/Mountain_View,_California Mountain View, California] and previously at ''Honda Research Institute'', Boston, and the [[Massachusetts Institute of Technology|MIT]] Center for Biological and Computational Learning.
He holds a Ph.D. from MIT on machine learning in 2002 <ref>[[Ryan Rifkin|Ryan M. Rifkin]] ('''2002'''). ''Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning''. Ph. D thesis, [[Massachusetts Institute of Technology|MIT]]</ref>. 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 [[Connection Machine|CM-5]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cc6e9 The 23rd ACM International Computer Chess Championship] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1993_23rd_ACM_ICCC/1993%20ICCC.062303066.sm.pdf pdf]</ref> <ref>[http://groups.google.com/group/rec.games.chess/msg/5f2e7eeb8791dec7 Re: Hash tables----Clash!!!-What happens next?] by [[Albert Gower]], [[Computer Chess Forums|rec.games.chess]], March 19, 1994</ref>. He optimized some [[Move Generation|move generation]] routines in [[Assembly|assembly language]], and cleaned up the parallel work-stealing code.
=Quotes=
from [[Bradley Kuszmaul|Bradley Kuszmaul's]] Ph.D. thesis <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 130, 6.6 How Time is Spent in StarTech</ref>
The code for [[Move Generation|move generation]] and checking [[Legal Move|illegal moves]], which takes a total of 3.5% of the cycles, was optimized in [[Assembly|assembly language]] by Ryan Rifkin under the direction of [[Mark Bromley]] of [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation 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=
<ref>[https://dblp.uni-trier.de/pers/hd/r/Rifkin:Ryan_M=.html dblp: Ryan M. Rifkin]</ref>
==1998 ...==
* [https://dblp.uni-trier.de/pers/hd/p/Pontil:Massimiliano Massimiliano Pontil], [[Ryan Rifkin]], [https://dblp.uni-trier.de/pers/hd/e/Evgeniou:Theodoros Theodoros Evgeniou] ('''1998'''). ''From Regression to Classification in Support Vector Machines''. A.I. Memo 1649, MIT Artificial Intelligence Lab, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.6066 CiteSeerX]
* [[Ryan Rifkin]] ('''1998'''). ''The Static Stochastic Ground-Holding Problem''. Master's thesis, [[Massachusetts Institute of Technology|MIT]]
==2000 ...==
* [[Ryan Rifkin]] ('''2002'''). ''Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning''. Ph.D thesis, [[Massachusetts Institute of Technology|MIT]], [http://cbcl.mit.edu/publications/theses/thesis-rifkin.pdf pdf]
* [[Ryan Rifkin]], [http://laps.ufpa.br/aldebaro/ Aldebaro Klautau] ('''2004'''). ''In Defense of One-Vs-All Classification''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 5, [http://jmlr.csail.mit.edu/papers/volume5/rifkin04a/rifkin04a.pdf pdf]
* [[Mathematician#RALippert|Ross A. Lippert]], [[Ryan Rifkin]] ('''2006'''). ''Infinite-σ Limits For Tikhonov Regularization''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 7, [http://jmlr.csail.mit.edu/papers/volume7/lippert06a/lippert06a.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Tikhonov_regularization Tikhonov regularization from Wikipedia]</ref>
* [[Ryan Rifkin]] ('''2007'''). ''Introduction to Fenchel Duality for Machine Learning''. [https://www.yumpu.com/en/document/view/12194860/introduction-to-fenchel-duality-for-machine-learning-middle-angle slides] <ref>[https://en.wikipedia.org/wiki/Fenchel%27s_duality_theorem Fenchel's duality theorem from Wikipedia] named after [[Mathematician#WFenchel|Werner Fenchel]]</ref>
* [[Ryan Rifkin]] ('''2007'''). ''Fenchel Duality for Machine Learning, Part II: A Bit More Theory''. [https://www.yumpu.com/en/document/view/10362018/fenchel-duality-for-machine-learning-part-ii-a-bit-more-theory/9 slides]
* [[Ryan Rifkin]], [[Mathematician#RALippert|Ross A. Lippert]] ('''2007'''). ''[http://www.jmlr.org/papers/v8/rifkin07a.html Value Regularization and Fenchel Duality]''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research]
* [[Ryan Rifkin]], [[Mathematician#RALippert|Ross A. Lippert]] ('''2007'''). ''Notes on Regularized Least-Squares''. Technical Report, [http://cbcl.mit.edu/publications/ps/MIT-CSAIL-TR-2007-025.pdf pdf]
* [[Ryan Rifkin]] ('''2007'''). ''Regularized Least Squares''. MIT Course, [http://www.mit.edu/~9.520/spring07/Classes/rlsslides.pdf slides as pdf]
* [[Ryan Rifkin]] ('''2009'''). ''Multiclass Classification''. MIT Course, [http://www.mit.edu/~9.520/spring09/Classes/multiclass.pdf pdf]
=External Links=
* [https://scholar.google.com/citations?user=qbjHRA8AAAAJ&hl=en Ryan M. Rifkin - Google Scholar Citations]
* [https://www.researchgate.net/profile/Ryan_Rifkin Ryan M. Rifkin | Google Inc., Mountain View | Google]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Rifkin]]
[[Category:Researcher|Rifkin]]
'''Ryan Michael Rifkin''',<br/>
an American mathematician and computer scientist with expertise in [[Learning|machine learning]], affiliated with [[Google|Google Inc.]] <ref>[https://www.researchgate.net/profile/Ryan_Rifkin Ryan M. Rifkin | Google Inc., Mountain View | Google]</ref>, [https://en.wikipedia.org/wiki/Mountain_View,_California Mountain View, California] and previously at ''Honda Research Institute'', Boston, and the [[Massachusetts Institute of Technology|MIT]] Center for Biological and Computational Learning.
He holds a Ph.D. from MIT on machine learning in 2002 <ref>[[Ryan Rifkin|Ryan M. Rifkin]] ('''2002'''). ''Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning''. Ph. D thesis, [[Massachusetts Institute of Technology|MIT]]</ref>. 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 [[Connection Machine|CM-5]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cc6e9 The 23rd ACM International Computer Chess Championship] from [[The Computer History Museum]], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1993_23rd_ACM_ICCC/1993%20ICCC.062303066.sm.pdf pdf]</ref> <ref>[http://groups.google.com/group/rec.games.chess/msg/5f2e7eeb8791dec7 Re: Hash tables----Clash!!!-What happens next?] by [[Albert Gower]], [[Computer Chess Forums|rec.games.chess]], March 19, 1994</ref>. He optimized some [[Move Generation|move generation]] routines in [[Assembly|assembly language]], and cleaned up the parallel work-stealing code.
=Quotes=
from [[Bradley Kuszmaul|Bradley Kuszmaul's]] Ph.D. thesis <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 130, 6.6 How Time is Spent in StarTech</ref>
The code for [[Move Generation|move generation]] and checking [[Legal Move|illegal moves]], which takes a total of 3.5% of the cycles, was optimized in [[Assembly|assembly language]] by Ryan Rifkin under the direction of [[Mark Bromley]] of [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation 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=
<ref>[https://dblp.uni-trier.de/pers/hd/r/Rifkin:Ryan_M=.html dblp: Ryan M. Rifkin]</ref>
==1998 ...==
* [https://dblp.uni-trier.de/pers/hd/p/Pontil:Massimiliano Massimiliano Pontil], [[Ryan Rifkin]], [https://dblp.uni-trier.de/pers/hd/e/Evgeniou:Theodoros Theodoros Evgeniou] ('''1998'''). ''From Regression to Classification in Support Vector Machines''. A.I. Memo 1649, MIT Artificial Intelligence Lab, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.6066 CiteSeerX]
* [[Ryan Rifkin]] ('''1998'''). ''The Static Stochastic Ground-Holding Problem''. Master's thesis, [[Massachusetts Institute of Technology|MIT]]
==2000 ...==
* [[Ryan Rifkin]] ('''2002'''). ''Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning''. Ph.D thesis, [[Massachusetts Institute of Technology|MIT]], [http://cbcl.mit.edu/publications/theses/thesis-rifkin.pdf pdf]
* [[Ryan Rifkin]], [http://laps.ufpa.br/aldebaro/ Aldebaro Klautau] ('''2004'''). ''In Defense of One-Vs-All Classification''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 5, [http://jmlr.csail.mit.edu/papers/volume5/rifkin04a/rifkin04a.pdf pdf]
* [[Mathematician#RALippert|Ross A. Lippert]], [[Ryan Rifkin]] ('''2006'''). ''Infinite-σ Limits For Tikhonov Regularization''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 7, [http://jmlr.csail.mit.edu/papers/volume7/lippert06a/lippert06a.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Tikhonov_regularization Tikhonov regularization from Wikipedia]</ref>
* [[Ryan Rifkin]] ('''2007'''). ''Introduction to Fenchel Duality for Machine Learning''. [https://www.yumpu.com/en/document/view/12194860/introduction-to-fenchel-duality-for-machine-learning-middle-angle slides] <ref>[https://en.wikipedia.org/wiki/Fenchel%27s_duality_theorem Fenchel's duality theorem from Wikipedia] named after [[Mathematician#WFenchel|Werner Fenchel]]</ref>
* [[Ryan Rifkin]] ('''2007'''). ''Fenchel Duality for Machine Learning, Part II: A Bit More Theory''. [https://www.yumpu.com/en/document/view/10362018/fenchel-duality-for-machine-learning-part-ii-a-bit-more-theory/9 slides]
* [[Ryan Rifkin]], [[Mathematician#RALippert|Ross A. Lippert]] ('''2007'''). ''[http://www.jmlr.org/papers/v8/rifkin07a.html Value Regularization and Fenchel Duality]''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research]
* [[Ryan Rifkin]], [[Mathematician#RALippert|Ross A. Lippert]] ('''2007'''). ''Notes on Regularized Least-Squares''. Technical Report, [http://cbcl.mit.edu/publications/ps/MIT-CSAIL-TR-2007-025.pdf pdf]
* [[Ryan Rifkin]] ('''2007'''). ''Regularized Least Squares''. MIT Course, [http://www.mit.edu/~9.520/spring07/Classes/rlsslides.pdf slides as pdf]
* [[Ryan Rifkin]] ('''2009'''). ''Multiclass Classification''. MIT Course, [http://www.mit.edu/~9.520/spring09/Classes/multiclass.pdf pdf]
=External Links=
* [https://scholar.google.com/citations?user=qbjHRA8AAAAJ&hl=en Ryan M. Rifkin - Google Scholar Citations]
* [https://www.researchgate.net/profile/Ryan_Rifkin Ryan M. Rifkin | Google Inc., Mountain View | Google]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Rifkin]]
[[Category:Researcher|Rifkin]]
