Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryan M. Rifkin

dblp:39/2696 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Learning theory · 36% Reinforcement learning · 25% Probabilistic and Bayesian machine learning · 19%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › regularization for reinforcement learning
value regularization
0.112007
Value Regularization and Fenchel Duality · J. Mach. Learn. Res. 2007
Mathematical optimization
regularization
0.112006
Infinite-sigma Limits For Tikhonov Regularization · J. Mach. Learn. Res. 2006
Mathematical optimization › regularization › convex regularization
tikhonov regularization
0.112006
Infinite-sigma Limits For Tikhonov Regularization · J. Mach. Learn. Res. 2006
Machine learning › Learning theory › statistical learning theory
asymptotic analysis
0.112005
Asymptotics of Gaussian Regularized Least Squares · NIPS 2005
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.112005
Asymptotics of Gaussian Regularized Least Squares · NIPS 2005
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › least squares regression
regularized least squares regression
0.112005
Asymptotics of Gaussian Regularized Least Squares · NIPS 2005
Machine learning › Learning theory
classification
0.012004
In Defense of One-Vs-All Classification · J. Mach. Learn. Res. 2004
Bioinformatics and computational biology
gene expression analysis
0.012002
A bayesian approach to transcript estimation from gene array data: the BEAM technique · RECOMB 2002

Methods — techniques the papers use, named apart from their topics

statistical modeling · 0.0bayesian inference · 0.0
YearPublicationVenuePosition
2007 Value Regularization and Fenchel Duality
Ryan M. Rifkin, Ross Lippert
J. Mach. Learn. Res.1
2006 Infinite-sigma Limits For Tikhonov Regularization
Ross Lippert, Ryan M. Rifkin
J. Mach. Learn. Res.2
2005 Asymptotics of Gaussian Regularized Least Squares
abstract
We consider regularized least-squares (RLS) with a Gaussian kernel. We prove that if we let the Gaussian bandwidth σ → ∞ while letting the regularization parameter λ → 0, the RLS solution tends to a polynomial whose order is controlled by the rielative rates of decay of 1 σ2 and λ: if λ = σ−(2k+1), then, as σ → ∞, the RLS solution tends to the kth order polynomial with minimal empirical error. We illustrate the result with an example.
Ross Lippert, Ryan M. Rifkin
NIPS2
2004 In Defense of One-Vs-All Classification
Ryan M. Rifkin, Aldebaro Klautau
J. Mach. Learn. Res.1
2002 A bayesian approach to transcript estimation from gene array data: the BEAM technique
abstract
We present a new statistically optimal approach to estimate transcript levels and ratios from one or more gene array experiments. The Bayesian Estimation of Array Measurements (BEAM) technique uses a model of measurement noise and prior information to estimate biological expression levels. It provides a principled method to deal with negative expression level measurements, combine multiple measurements, and identify changes in expression level. BEAM is more flexible than existing techniques, because it does not assume a specific functional form for noise and prior models. Rather, it uses a more accurate noise model developed from experimental data, a process we illustrate here using Affymetrix yeast chips.
Ron O. Dror, Jonathan G. Murnick, Nicola J. Rinaldi, Voichita D. Marinescu, Ryan M. Rifkin, Richard A. Young
RECOMB5
1999 A Note on Support Vector Machine Degeneracy
Ryan M. Rifkin, Massimiliano Pontil, Alessandro Verri
ALT1
1999 From regression to classification in support vector machines
Massimiliano Pontil, Ryan M. Rifkin, Theodoros Evgeniou
ESANN2