RESEARCH INTERESTS
My research interests include topics in
machine learning, artificial intelligence, algorithmic game theory,
social networks, and computational finance.
I often examine problems from these areas using methods and models from theoretical
computer science and related disciplines.
While the majority of my work is mathematical in nature,
I have also participated
in a variety of empirical and experimental work,
including applications of machine learning, spoken dialogue systems, and most recently, human-subject experiments
in strategic and economic interaction.
SOME QUICK LINKS
Link to
Publications
Link to information on the new
Market and Social Systems Engineering (MKSE) Program
at Penn
Web page for the graduate seminar course
Social Networks and Algorithmic Game Theory,
Fall 2009
Web page for the undergraduate course
Networked Life (CIS 112), Spring 2009.
Web page for
CIS 620, Fall 2006: Seminar on Sponsored Search.
Web page for
Readings in Finance (Computational and Otherwise)
Web page for the
Penn-Lehman Automated Trading Project.
(Currently inactive, but hope to revive someday.)
Web page for the
Tribute Day for Les Valiant, May 2009
SITE DIRECTORY
Out of either a heightened design aesthetic or laziness (you be the judge),
most of this site is organized as a single flat html file. The links below let you
navigate directly to the various subsections.
Research Interests
Brief Professional Bio
Educational Background
Editorial and Professional Service
Research Group Members
Teaching and Tutorial Material
Press
Publications
BRIEF PROFESSIONAL BIO
Current:
Since 2002 I have been a professor in the
Computer and Information
Science Department
at the
University
of Pennsylvania,
where I hold the
National Center Chair in Resource Management and Technology.
I am the Founding Director of
Penn Engineering's new
Market and Social Systems Engineering (MKSE) Program;
my co-director is
Ali Jadbabaie.
I have secondary appointments in the
Statistics
and
Operations and Information Management (OPIM)
departments of the
Wharton School.
Until July 2006 I was the
co-director
of Penn's interdisciplinary
Institute for Research in Cognitive Science.
I also work closely with a quantitative trading group at
SAC Capital
in New York City.
(For SAC-related inquiries, please email
michael.kearns@sac.com.)
I serve as an advisor to the companies
Yodle,
kaChing,
Invite Media,
and
Kwedit
(a payment system for digital content and virtual goods),
and am a member of the Advanced Technology Advisory Council of
PJM Interconnection.
I am also actively involved in
the nifty startup
Hunch
(try it out and contribute your favorite topic!), and in
the seed-stage fund
Founder Collective
and several of its portfolio companies.
The Past:
I spent the decade 1991-2001 in basic AI and machine learning research at
Bell Labs
and
AT&T Labs.
During my last four years there,
I was the head of the AI department,
which conducted a broad
range of systems and foundational AI work;
I also served briefly as the head
of the Secure Systems Research department.
The AI department boasted terrific colleagues and friends that included
Charles Isbell (now at Georgia Tech),
Diane Litman (now at University of Pittsburgh),
Michael Littman (now at Rutgers),
David McAllester (now at TTI-Chicago),
Satinder Singh (now at University of Michigan),
Peter Stone (now at University of Texas), and
Rich Sutton (now at University of Alberta).
Prior to my time as its head, the AI department was shaped by the
efforts of a number of notable figures, including
Ron Brachman (who originally founded the department; now at Yahoo! Research),
Henry Kautz (who led the department before heading to
the University of Washington; now at the University of Rochester), and
Bart Selman (now at Cornell).
Before leading the AI group, I was a member of the closely related
Machine Learning department at the labs, which was headed by
Fernando Pereira (now also at Penn, currently on leave at Google),
and included
Michael Collins (now at MIT),
Sanjoy Dasgupta (now at UCSD),
Yoav Freund (now at UCSD),
Rob Schapire (now at Princeton),
William Cohen (now at CMU), and
Yoram Singer (now at Hebrew University and Google).
Other friends and colleagues from Labs days include
Sebastian Seung (now at MIT),
Lawrence Saul (now at UCSD),
Yann LeCun (now at NYU),
Roberto Pieraccini (now at SpeechCycle),
Esther Levin (now at CCNY),
Lyn Walker (now at the University of Sheffield),
Corinna Cortes (now at Google),
and
Vladimir Vapnik (now at Columbia and NEC).
Here is a nice
photo wall of
former AT&T Labs theory and algorithms researchers,
compiled by the great
David S. Johnson.
Suffice to say we all had a great time together.
I spent 2001 as CTO of the European venture capital firm
Syntek Capital,
and joined the Penn faculty in January 2002.
From May 2007 through April 2009,
I led a quantitative trading team at
Bank of America in New York City, working on both proprietary and algorithmic trading strategies
within BofA's
Electronic Trading Services division.
From the Spring of 2002 through May 2007, I was both a consultant to and the head of a quant prop trading team within the
Equity Strategies group of
Lehman Brothers in New York City.
In the past I have served on the technical advisory boards of SiteAdvisor
(founded by
Chris Dixon; sold to McAfee),
Riverhead Networks
(sold to Cisco),
as a consultant to
Bessemer Venture Partners,
and as an expert witness/consultant in a few technology-related legal cases.
 
EDUCATIONAL BACKGROUND
I did my undergraduate studies at the University of California
at Berkeley in math and computer science, graduating in 1985. I
received a Ph.D. in computer science from Harvard University in
1989. The title of my dissertation was
The Computational Complexity of Machine Learning
(see
Publications
below for more information),
and
Les Valiant
was my (excellent) advisor. Following postdoctoral
positions at the Laboratory for Computer Science at M.I.T.
(hosted by
Ron Rivest
)
and
at the International Computer Science Institute (ICSI) in Berkeley
(hosted by
Dick Karp
),
in
1991 I joined the research staff of AT&T Bell Labs, and later the Penn faculty (see professional
bio above).
EDITORIAL AND PROFESSIONAL SERVICE
In the past I have been program chair of NIPS, AAAI, COLT, and ACM EC. I have also served on
the program committees of NIPS, AAAI, IJCAI, COLT, UAI, ICML, STOC, FOCS, and a variety of
other acryonyms. I am a member of the NIPS Foundation and the steering committee for
the Snowbird Conference on Learning.
I am currently on the editorial boards of Mathematics of Operations Research,
Games and Economic Behavior,
the Journal of the ACM, and the MIT Press series on Adaptive Computation
and Machine Learning.
In the past
I have also served on the editorial boards of SIAM Journal on Computing, Machine
Learning, the Journal of AI Research, and the
Journal of Machine Learning Research.
From 2002-2008 I was a member, vice chair and chair of
DARPA's Information Science and
Technology (ISAT) study group.
RESEARCH GROUP MEMBERS
Current:
Postdoc
Giro Cavallo
Postdoc
Umar Syed
(jointly hosted with Ben Taskar )
Postdoc
Eugene Vorobeychik
Research scientist
Stephen Judd
Doctoral student
Kareem Amin
Doctoral student
Mickey Brautbar
Doctoral student
Tanmoy Chakraborty
(jointly advised with Sanjeev Khanna )
MD/PhD student
Renuka Nayak
(works primarily in the lab of
Vivian Cheung
)
Doctoral student
Jinsong Tan
Doctoral student
David Weiss
(jointly advised with Ben Taskar )
Alumni:
Former doctoral student
Jenn Wortman Vaughan,
now a postdoc at Harvard; joining UCLA CS faculty Fall 2010
Former postdoc
Eyal Even-Dar,
now at Google
Former doctoral student
Sid Suri,
now at Yahoo! Research
Former postdoc
Sham Kakade,
now on the faculty of TTI-Chicago; joining Wharton/Penn Statistics faculty January 2010
Former postdoc
Ryan Porter,
now at AMA Capital
Former postdoc
Luis Ortiz,
now at SUNY Stonybrook
Former summer postdoctoral visitor
John Langford,
now at Yahoo! Research
TEACHING AND TUTORIAL MATERIAL
Web page for a
new graduate course on Computational Learning Theory, Fall 2008
(jointly taught with Koby Crammer)
Web page for
CIS 620, Fall 2007: Seminar on Foundations of Cryptography.
Web page for
Networked Life, Spring 2009.
See also the
Spring 2008,
 
Spring 2007,
 
Spring 2006,
 
Spring 2005,
and
Spring 2004
offerings.
Web page for
CIS 620, Fall 2006: Seminar on Sponsored Search.
Web page for the graduate seminar
CIS 700/04: Advanced Topics in Machine Learning (Fall 2004).
Web page for
CIS 700/04: Advanced Topics in Machine Learning (Fall 2003).
Web page for a course on
Computational Game Theory (Spring 2003).
This was a joint course between CIS and Wharton
(listed as CIS 620 and Wharton OPIM 952).
Course web page for
CIS 620: Advanced Topics in AI (Spring 2002)
Course web page for
CIS 620: Advanced Topics in AI (Spring 1997)
Web page for
NIPS 2002 Tutorial on Computational Game Theory.
ACL 1999 Tutorial Slides
[Postscript]
[Compressed Postscript]
[PDF]
Course Outline and Material for
1999 Bellairs Institute Workshop
Theoretical Issues in
Probabilistic Artificial Intelligence
(FOCS 98 Tutorial)
[Postscript]
[Compressed Postscript]
[PDF]
A Short Course in Computational
Learning Theory: ICML '97 and AAAI '97 Tutorials
[Postscript]
[Compressed Postscript]
[PDF]
PRESS
Below are links to press articles related to my work.
(Some links are unfortunately now dead.)
Philadelphia Business Journal article on the MKSE program and Networked Life, October 2009
Philadelphia Inquirer article on networked voting experiments, March 2009
The Trade magazine
article natural language processing for algorithmic trading, September 2007
Bloomberg Markets magazine
article on AI on Wall Street, June 2007
SIAM News article on behavioral graph
coloring, November 2006
Philadelphia Inquirer article on network science and
NSA link analysis, May 2006
Chicago Tribune article on privacy in blogs and social networks,
November 2005
Chronicle of Higher Education article on
Facebook and social networks,
May 2004
Star-Ledger article on the
demise of AT&T Labs, March 2004
Business Week Online article on technology in NASDAQ and
NYSE, September 2003
Philadelphia Inquirer article on ISTAR,
interdependent security, and games on networks, January 2003
Washington Post article on
web-based chatterbots, September 2002
New Scientist article
on the Cobot spoken dialogue system, August 2002
Tornado Insider article on DDoS attacks, January 2002
[Cover]
Tornado Insider article on biometric security, January 2002
Audio of COMNET panel "Staving Off Denial-of-Service Attacks and Detecting Malicious Code"
Tornado Insider article on natural language technology, September 2001
Tornado Insider article on robotics, July 2001
Il Sole 24 Ore profile, June 2001
[English Translation]
Corriere Della Sera profile, May 2001
[English Translation]
Associated Press article on software robots, February 2001
New York Times article on TAC, August 2000
New York Times on Cobot, February 2000
TIME Digital Magazine (now Time On) on Cobot, May 2000
Washington Post article on Cobot, December 2000
New York Times article on boosting, August 1999
PUBLICATIONS:BOOKS
-
An Introduction to
Computational Learning Theory
Authored jointly with Prof. Umesh V. Vazirani of U.C. Berkeley,
this MIT Press publication is intended to be an intuitive but
precise treatment of some interesting and fundamental topics in
computational learning theory. The level is appropriate for
graduate students and researchers in machine learning, artificial
intelligence, neural
networks, and theoretical computer science. The link above is to
the MIT Press page that provides a brief description of the book
and ordering information. If you have the book and have any questions
or comments, please click
here to
send me mail.
-
The Computational Complexity
of Machine Learning
This revision of my doctoral dissertation was published by the MIT Press
as part of the ACM Distinguished Dissertation Series; the link above
is to the MIT Press order form for the book. However, as it is now
out of print, I am making it available for downloading below.
[Postscript]
[Compressed Postscript]
[PDF]
PUBLICATIONS: RESEARCH ARTICLES
What follows is a listing of almost all
of my research papers, downloadable
in several file formats.
I have recently converted to listing them in (approximately) reverse
chronological order. For papers with both a conference and journal version,
the paper is usually placed by its first (conference) date.
Acronyms for conferences and journals include:
AAAI: Annual National Conference on Artificial Intelligence; COLT: Annual Conference on Computational Learning Theory;
EC: ACM Conference on Electronic Commerce; FOCS: IEEE Foundations of Computer Science;
ICML: International Conference on Machine Learning;
IJCAI: International Joint Conference on Artificial Intelligence;
NIPS: Neural Information Processing Systems;
PNAS: Proceedings of the National Academy of Science; SODA: ACM Symposium on Discrete Algorithms;
STOC: ACM Symposium on the Theory of Computation;
UAI: Annual Conference on Uncertainty in Artificial Intelligence; WINE: Workshop on Internet and Network Economics.
In addition to the list below, this
DBLP query
or this
"faceted" version
seem to do a pretty good job of finding my publications that appeared in mainstream CS venues, and can be useful for
generating bibtex citations.
Here is what Wordle thinks I work on.
-
Local Algorithms for Finding Interesting Individuals in Large Networks.
With M. Brautbar.
Innovations in Computer Science (ICS), 2010.
[Postscript]
[Compressed Postscript]
[PDF]
-
Coexpression Network Based on Natural Variation in Human Gene Expression Reveals Gene Interactions and Functions.
With R. Nayak, R. Spielman, V. Cheung.
Genome Science, November 2009.
[Web Link]
[PDF]
[Cover Image]
-
Censored Exploration and the Dark Pool Problem.
With K. Ganchev, Y. Nevmyvaka, J. Wortman.
UAI 2009.
[Postscript]
[Compressed Postscript]
[PDF]
-
Networked Bargaining: Algorithms and Structural Results.
With T. Chakraborty and S. Khanna.
ACM EC 2009.
[Postscript]
[Compressed Postscript]
[PDF]
-
Behavioral Experiments on Biased Voting in Networks.
With S. Judd, J. Tan and J. Wortman.
PNAS, January 2009.
[PDF]
-
Biased Voting and the Democratic Primary Problem.
With J. Tan.
WINE 2008.
[Postscript]
[Compressed Postscript]
[PDF]
-
Bargaining Solutions in a Social Network.
With T. Chakraborty.
WINE 2008.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning from Collective Behavior.
With J. Wortman.
COLT 2008.
[Postscript]
[Compressed Postscript]
[PDF]
-
Behavioral Experiments in Networked Trade.
With S. Judd.
ACM EC 2008.
[Postscript]
[Compressed Postscript]
[PDF]
-
Graphical Games.
In
Algorithmic Game Theory,
N. Nisan, T. Roughgarden, E. Tardos and V. Vazirani, editors,
Cambridge University Press,
September, 2007.
[PDF]
-
Sponsored Search with Contexts.
With E. Even-Dar and J. Wortman.
WINE 2007.
The following longer version appeared in the
Third Workshop on Sponsored Search Auctions, WWW 2007.
[Postscript]
[Compressed Postscript]
[PDF]
-
Empirical Price Modeling for Sponsored Search.
With K. Ganchev, A. Kulesza, J. Tan, R. Gabbard, Q. Liu.
WINE 2007.
The following longer version appeared in the
Third Workshop on Sponsored Search Auctions, WWW 2007.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Network Formation Game for Bipartite Exchange Economies.
With E. Even-Dar and S. Suri.
ACM SODA 2007.
[Postscript]
[Compressed Postscript]
[PDF]
[Extended Version, PDF]
-
Privacy-Preserving Belief Propagation and Sampling.
With J. Tan and J. Wortman.
NIPS 2007.
[Postscript]
[Compressed Postscript]
[PDF]
-
Regret to the Best vs. Regret to the Average.
With E. Even-Dar, Y. Mansour, and J. Wortman.
COLT 2007.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Small World Threshold for Economic Network Formation.
With E. Even-Dar.
NIPS 2006.
[Postscript]
[Compressed Postscript]
[PDF]
-
An Experimental Study of the Coloring
Problem on Human Subject Networks.
With S. Suri and N. Montfort.
Science 313(5788), August 2006, pp. 824-827.
[Abstract]
 
[Full Paper]
 
[PDF]
-
Networks Preserving Evolutionary Stability and the
Power of Randomization.
With S. Suri. ACM Conference on Electronic Commerce (EC), 2006.
[Postscript]
[Compressed Postscript]
[PDF]
-
(In)Stability Properties
of Limit Order Dynamics.
With E. Even-Dar, S. Kakade, and Y. Mansour.
ACM Conference on Electronic Commerce (EC), 2006.
[Postscript]
[Compressed Postscript]
[PDF]
-
Reinforcement Learning for Optimized Trade Execution.
With Y. Nevmyvaka and Y. Feng. ICML 2006.
[PDF]
-
Risk-Sensitive
Online Learning.
With E. Even-Dar and J. Wortman.
ALT 2006.
This is a corrected version posted Oct 4 2006.
This version corrects errors in the section of experimental results
published in the ALT 2006 proceedings.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning from Multiple Sources.
With K. Crammer and J. Wortman.
NIPS 2006; also in JMLR 2008.
[Postscript]
[Compressed Postscript]
[PDF]
[Journal Version PDF]
-
Economics, Computer Science, and Policy.
Issues in Science and Technology,
Winter 2005.
[Article in PDF]
[Cover Image]
-
Electronic Trading in Order-Driven Markets:
Efficient Execution.
With Y. Nevmyvaka, A. Papandreou and K. Sycara.
IEEE Conference on Electronic Commerce (CEC), 2005.
[PDF]
-
Trading in Markovian Price Models.
With S. Kakade.
COLT 2005.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning from Data of Variable Quality.
With K. Crammer and J. Wortman. NIPS 2005.
[Postscript]
[Compressed Postscript]
[PDF]
-
Economic Properties of Social Networks.
With S. Kakade, L. Ortiz, R. Pemantle, and S. Suri.
Proceedings of NIPS 2004.
[Postscript]
[Compressed Postscript]
[PDF]
-
Graphical Economics.
With S. Kakade and L. Ortiz.
Proceedings of COLT 2004.
[Postscript]
[Compressed Postscript]
[PDF]
-
Competitive Algorithms for VWAP
and Limit Order Trading.
With S. Kakade, Y. Mansour and L. Ortiz.
Proceedings of the ACM Conference on Electronic Commerce (EC), 2004.
[Postscript]
[Compressed Postscript]
[PDF]
-
Algorithms for Interdependent Security Games.
With L. Ortiz.
NIPS 2003.
[Postscript]
[Compressed Postscript]
[PDF]
-
Correlated Equilibria in Graphical Games.
With S. Kakade, J. Langford, and L. Ortiz.
ACM Conference on Electronic Commerce (EC), 2003.
[Postscript]
[Compressed Postscript]
[PDF]
-
The Penn-Lehman Automated Trading Project.
With L. Ortiz.
IEEE Intelligent Systems, Nov/Dec 2003.
IEEE version [PDF]
Long version [Postscript]
Long version [Compressed Postscript]
Long version [PDF]
-
Exploration in Metric State Spaces.
With S. Kakade and J. Langford.
ICML 2003.
[Postscript]
[Compressed Postscript]
[PDF]
-
Nash Propagation for Loopy Graphical Games.
With L. Ortiz.
Proceedings of NIPS 2002.
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Nash Computation in Large Population Games
with Bounded Influence.
With Y. Mansour.
Proceedings of UAI 2002.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Note on the
Representational Incompatabilty of Function Approximation and
Factored Dynamics.
With E. Allender, S. Arora, C. Moore, A. Russell.
Proceedings of NIPS 2002.
[Postscript]
[Compressed Postscript]
[PDF]
-
CobotDS: A Spoken Dialogue
System for Chat.
With C. Isbell, S. Singh, D. Litman, J. Howe.
Proceedings of AAAI 2002.
[Postscript]
[Compressed Postscript]
[PDF]
-
An Efficient Exact Algorithm
for Singly Connected Graphical Games.
With M. Littman, S. Singh. 2001. NIPS 2001.
[Postscript]
[Compressed Postscript]
[PDF]
NOTE:
The main result of the paper above --- an efficient algorithm claimed to find a
single
exact
Nash equilibrium in tree graphical games --- is unfortunately
wrong.
This was discovered and discussed in the very nice paper by Elkind,
Goldberg and Goldberg, which can be found
here.
The problem of efficiently computing an exact Nash equilibrium in trees remains open (though
EG&G demonstrate that no two-pass algorithm can suffice). The
original polynomial-time
approximate
Nash algorithm from the K., Littman, Singh UAI 2001 paper
is unaffected by these developments, as is its NashProp generalization in the
Ortiz and K. 2002 NIPS paper.
-
Graphical Models for Game Theory.
With M. Littman, S. Singh. 2001.
UAI 2001.
[Postscript]
[Compressed Postscript]
[PDF]
-
ATTac-2000: An
Adaptive Autonomous Bidding Agent.
With P. Stone, M. Littman, S. Singh.
Journal of Artificial Intelligence Research .
Also appeared in Proceedings of Agents 2001.
[Postscript]
[Compressed Postscript]
[PDF]
New York Times article on TAC
-
A Social Reinforcement Learning Agent.
With C. Shelton, C. Isbell, S. Singh, P. Stone.
Proceedings of Agents 2001.
Winner of Best Paper Award at the Conference.
[Postscript]
[Compressed Postscript]
[PDF]
-
Nash Convergence of
Gradient Dynamics in General-Sum Games.
With S. Singh, Y. Mansour.
Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence, Morgan Kaufmann, pages 541-548, 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
Fast Planning in Stochastic Games.
With Y. Mansour, S. Singh.
Proceedings of the Sixteenth Conference on Uncertainty in
Artificial Intelligence, Morgan Kaufmann, pages 309-316, 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
Bias-Variance Error Bounds
for Temporal Difference Updates.
With S. Singh.
Proceedings of the 13th Annual Conference on
Computational Learning Theory, 2000,
pages 142--147.
[Postscript]
[Compressed Postscript]
[PDF]
-
Approximate Planning in Large POMDPs
via Reusable Trajectories.
With Y. Mansour and A. Ng.
Advances in Neural Information Processing Systems 12,
MIT Press, 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
Testing Problems
with Sub-Learning Sample Complexity.
With D. Ron.
Journal of Computer and System Sciences,
61, pp. 428-456, 2000.
See also Proceedings of the 12th Annual Workshop on
Computational Learning Theory.
[Postscript]
[Compressed Postscript]
[PDF]
-
Cobot in LambdaMOO:
A Social Statistics Agent.
With C. Isbell, D. Kormann, S. Singh, P. Stone.
Proceedings of the 17th National Conference on
Artificial Intelligence, pp. 36-41, 2000, AAAI Press/MIT Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Empirical Evaluation of a
Reinforcement Learning Spoken Dialogue System.
With S. Singh, D. Litman, M. Walker.
Proceedings of the 17th National Conference on
Artificial Intelligence, pp. 645-651,
2000, AAAI Press/MIT Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Automatic Optimization of Dialogue Management.
With D. Litman, S. Singh, M. Walker.
Appeared in COLING 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Boosting Approach to Topic
Spotting on Subdialogues.
With K. Myers, S. Singh, M. Walker.
Appeared in ICML 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
Reinforcement Learning for
Spoken Dialogue Systems.
With S. Singh, D. Litman and M. Walker.
Advances in Neural Information Processing Systems 12,
MIT Press, 2000.
[Postscript]
[Compressed Postscript]
[PDF]
-
Automatic Detection of Poor Speech Recognition
at the Dialogue Level.
With D. Litman and M. Walker.
Proceedings of the 37th Annual
Meeting for Computational Linguistics,
1999,
pages 309-316.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Sparse Sampling Algorithm for Near-Optimal
Planning in Large Markov Decision Processes.
With Y. Mansour and A. Ng.
Proceedings of the Sixteenth International Joint
Conference on Artificial Intelligence
Morgan Kaufmann,
1999,
pages 1324--1331.
Appeared in a special issue of the journal
Machine Learning.
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Reinforcement Learning
in Factored MDPs.
With D. Koller.
Proceedings of the Sixteenth International Joint
Conference on Artificial Intelligence,
Morgan Kaufmann,
1999,
pages 740--747.
[Postscript]
[Compressed Postscript]
[PDF]
-
Finite-Sample Rates of Convergence for
Q-Learning and Indirect Methods.
With S. Singh.
Advances in Neural Information Processing Systems 11,
The MIT Press,
1999,
pages 996--1002.
[Postscript]
[Compressed Postscript]
[PDF]
-
Inference in Multilayer
Networks via Large Deviation Bounds.
with L. Saul.
Advances in Neural Information Processing Systems 11,
The MIT Press,
1999,
pages 260--266.
[Postscript]
[Compressed Postscript]
[PDF]
-
Large Deviation
Methods for Approximate Probabilistic Inference,
with Rates
of Convergence.
With L. Saul.
Proceedings of the Fourteenth Conference on Uncertainty in
Artificial Intelligence,
Morgan Kaufmann,
1998,
pages 311--319.
[Postscript]
[Compressed Postscript]
[PDF]
-
Exact Inference of Hidden
Structure from Sample Data in Noisy-OR Networks.
With Y. Mansour.
Proceedings of the Fourteenth Conference on Uncertainty in
Artificial Intelligence,
Morgan Kaufmann,
1998,
pages 304--310.
[Postscript]
[Compressed Postscript]
[PDF]
-
Near-Optimal
Reinforcement Learning in Polynomial
Time.
With S. Singh.
Proceedings of the 15th International Conference
on Machine Learning, pp. 260-268, 1998, Morgan Kaufmann.
Appeared in a special issue of the
journal Machine Learning.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Fast, Bottom-Up
Decision Tree Pruning Algorithm with Near-Optimal
Generalization.
With Y. Mansour.
Proceedings of the 15th International Conference
on Machine Learning, 1998,
Morgan Kaufmann,
pages 269--277.
[Postscript]
[Compressed Postscript]
[PDF]
-
An Information-Theoretic
Analysis of Hard and Soft Assignment Methods for Clustering.
with Y. Mansour and A. Ng.
Proceedings of the
Thirteenth Conference on Uncertainty in Artificial Intelligence,
pp. 282-293, 1997, Morgan Kaufmann.
[Postscript]
[Compressed Postscript]
[PDF]
-
Algorithmic
Stability and Sanity-Check
Bounds for Leave-One-Out Cross-Validation.
With D. Ron.
Neural Computation 11(6), pages 1427-1453, 1999.
Also in Proceedings of the Tenth Annual Conference on
Computational Learning Theory,
ACM Press,
1997,
pages 152--162.
[Postscript]
[Compressed Postscript]
[PDF]
-
Boosting Theory Towards
Practice: Recent Developments in Decision Tree Induction and
the Weak Learning Framework.
Abstract accompanying
invited talk given at AAAI '96, Portland, Oregon,
August 1996.
[Postscript]
[Compressed Postscript]
[PDF]
-
Applying the
Weak Learning Framework
to Understand and Improve C4.5.
With T. Dietterich and Y. Mansour.
Proceedings of the 13th International Conference
on Machine Learning, pp. 96-104, 1996, Morgan Kaufmann.
[Postscript]
[Compressed Postscript]
[PDF]
-
On the Boosting Ability of Top-Down
Decision Tree Learning Algorithms.
With Y. Mansour.
Journal of Computer and Systems Sciences, 58(1), 1999,
pages 109-128. Also in
Proceedings of the 28th ACM Symposium on the
Theory of Computing, pp.459-468, 1996, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
A Bound on the Error of Cross
Validation Using
the Approximation and Estimation Rates, with Consequences for the
Training-Test Split.
Neural Computation 9(5), 1997, pages 1143--1161.
Also in Advances in Neural Information Processing Systems 8,
The MIT Press,
pages 183--189,
1996.
[Postscript]
[Compressed Postscript]
[PDF]
-
An Experimental and Theoretical Comparison
of Model Selection Methods.
With Y. Mansour, A. Ng, and D. Ron.
Machine Learning 27(1), 1997, pages 7--50.
Also in Proceedings of the
Eighth ACM Conference on Computational Learning Theory,
ACM Press,
1995,
pages 21--30.
[Postscript]
[Compressed Postscript]
[PDF]
-
On the Consequences of the
Statistical Mechanics Theory of Learning Curves for
the Model Selection Problem.
Neural Networks: The Statistical Mechanics
Perspective, pp. 277-284, 1995, World Scientific.
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Algorithms
for Learning to Play
Repeated Games Against
Computationally Bounded Adversaries.
With Y. Freund, Y. Mansour, D. Ron, R. Rubinfeld, and R. Schapire.
Proceedings of the 36th IEEE Symposium on the Foundations
of Computer Science, pp. 332-341, 1995, IEEE Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Horn Approximations of Empirical Data.
With H. Kautz and B. Selman.
Artificial Intelligence,
74(1), pages 129-145, 1995.
[Postscript]
[Compressed Postscript]
[PDF]
-
On the Complexity of Teaching.
With S. Goldman.
Journal of Computer and Systems Sciences,
50(1), pp. 20-31, 1995.
[Postscript]
[Compressed Postscript]
[PDF]
-
On the Learnability of Discrete
Distributions.
With Y. Mansour, R. Rubinfeld, D. Ron,
R. Schapire, and L. Sellie.
Proceedings of the
26th Annual ACM Symposium on the Theory of Computing,
pp. 273-282, 1994, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Cryptographic Primitives Based on
Hard Learning Problems.
With A. Blum, M. Furst, and R. Lipton.
Advances in Cryptology, Lecture Notes in
Computer Science, Volume 773, pp. 278-291, 1994, Springer-Verlag.
[Postscript]
[Compressed Postscript]
[PDF]
-
Rigorous Learning
Curve Bounds from Statistical
Mechanics.
With D. Haussler, H.S. Seung, and N. Tishby.
Machine Learning,25, 1996,
pages 195--236.
Also in
ACM Conference
on Computational Learning Theory, pp. 76-87, 1994,
ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Weakly Learning DNF and Characterizing
Statistical Query Learning Using Fourier Analysis.
With A. Blum,
M. Furst, J. Jackson, Y. Mansour, and S. Rudich.
Proceedings of the 26th Annual ACM Symposium on the Theory
of Computing, pp. 253-262, 1994, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Noise-Tolerant
Learning from Statistical Queries.
Journal of the ACM , 45(6), pp. 983 --- 1006, 1998.
See also Proceedings
of the 25th ACM Symposium on the Theory of Computing,
pp. 392-401, 1993, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Learning of Typical
Finite Automata from Random Walks.
With Y. Freund, D. Ron,
R. Rubinfeld, R. Schapire, and L. Sellie.
Proceedings of the 25th ACM Symposium on the Theory of
Computing, pp. 315-324, 1993, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning from a Population of
Hypotheses.
With S. Seung. Machine Learning
18, pp. 255-276, 1995. See also Proceedings of the
Sixth Annual Workshop on Computational Learning Theory,
pp. 101-110, 1993, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Towards Efficient
Agnostic Learning.
With R. Schapire and L. Sellie.
Machine Learning 17, pp. 115-141, 1994.
See also Proceedings of the Fifth Annual Workshop on
Computational Learning Theory, pp. 341-352, 1992, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Bounds on the Sample
Complexity of Bayesian Learning
Using Information Theory and the VC Dimension.
With D. Haussler and
R. Schapire. Machine Learning 14, pp. 83-113, 1994.
See also Proceedings of the Fourth Annual Workshop on Computational
Learning Theory, pp. 61-74, 1991, Morgan Kaufmann.
[Postscript]
[Compressed Postscript]
[PDF]
-
Equivalence of Models for Polynomial
Learnability.
With D. Haussler, N. Littlestone, and M. Warmuth.
Information and Computation 95(2), pp. 129-161, 1991.
(Converted from the original nroff (!!!), so there are
some typographical misfortunes.)
[Postscript]
[Compressed Postscript]
[PDF]
-
Efficient Distribution-free
Learning of Probabilistic Concepts.
With R. Schapire.
Journal of Computer and System Sciences
48(3), pp. 464-497. See also Proceedings of the 31st Annual
IEEE Symposium on Foundations of Computer Science,
pp. 382-391, 1990, IEEE Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Exact Identification of
Read-once Formulas Using Fixed
Points of Amplification Functions.
With S. Goldman and R. Schapire. SIAM Journal
on Computing 22(4), pp. 705-726. See also
Proceedings of the 31st IEEE Symposium on Foundations
of Computer Science, pp. 193-202, 1990, IEEE Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Cryptographic Limitations on
Learning Boolean Formulae and Finite Automata.
With L. Valiant.
Journal of the ACM 41(1), pp. 67-95, 1994.
See also Proceedings of the 21st ACM Symposium on the Theory
of Computing, pp. 433-444, 1989, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
A General Lower Bound on the Number of
Examples Needed for Learning.
With A. Ehrenfeucht, D. Haussler,
and L. Valiant.
Information and Computation
82(3), pp. 247-261, 1989. See also Proceedings of the 1988 Workshop
on Computational Learning Theory,
pp. 139-154, 1988, Morgan Kaufmann.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning in the Presence of
Malicious Errors.
With M. Li.
SIAM Journal on Computing 22(4), pp. 807-837, 1993.
See also Proceedings of the 20th ACM Symposium on the
Theory of Computing, pp. 267-280, 1988, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Thoughts on Hypothesis Boosting.
Unpublished manuscript, 1988. Project
for Ron Rivest's machine learning course at MIT. Included
here for historical interest and because it is occasionally
cited.
[Postscript]
[Compressed Postscript]
[PDF]
-
On the Learnability of Boolean
Formulae.
With M. Li, L. Pitt, and L. Valiant.
Proceedings of the
19th ACM Symposium on the Theory of Computing, pp. 285-195,
1987, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Learning Boolean Formulae.
With M. Li and L. Valiant. Journal of the ACM
41(6), pp. 1298-1328, 1995.
See also Proceedings of the
19th ACM Symposium on the Theory of Computing, pp. 285-195,
1987, ACM Press.
[Postscript]
[Compressed Postscript]
[PDF]
-
Recent Results in Boolean
Concept Learning.
With M. Li, L. Pitt and L. Valiant.
Proceedings of the Fourth International Workshop
on Machine Learning, pp. 337-352, 1987, Morgan Kaufmann.
[Postscript]
[Compressed Postscript]
[PDF]
Last Edited: November 18, 2009
www.digits.com
WM
3YC
|