David McAllester

(773)702-5562

AAAI Fellow

A release of the Chicago 2007 object detector. This detector took six gold medals, eight silver, and one bronze in the 2007 PASCAL object detection challenge.

Selected Papers etc.

DBLP listing of my publications (contains proper citations and some items not listed below)

2007:

A Discriminatively Trained, Multiscale, Deformable Part Model with Pedro Felzenszwalb and Deva Ramanan. Draft.
The Communication Complexity of Correlation with Prahladh Harsha, Rahul Jain, and Jaikumar Radhakrishnan. In Proc. 22nd IEEE Conference on Computational Complexity, pages 10-23, San Diego, California, 13-16 June 2007.
Statistical Methods for Artificial Intelligence A TTI-Chicago core course.

2006:

Min-Cover Approach for Finding Salient Curves with Pedro Felzenszwalb, IEEE Workshop on Perceptual Organization in Computer Vision, 2006
Generalization Bounds and Consistency for Structured Labeling in Predicting Structured Data, edited by G. Bakir, T. Hofmann, B. Scholkopf, A. Smola, B. Taskar, and S. V. N. Vishwanathan. MIT Press, 2007.
The Generalized A* Architecture with Pedro Felzenszwalb, to appear in the Journal of Artificial Intelligence Research (JAIR)

2005:

2004:

2003:

2002:

Logical Algorithms with Harald Ganzinger, ICLP 02
Concentration Inequalities for the Missing Mass and for Histogram Rule Error with Luis Ortiz, JMLR 03, a shorter version appeared in NIPS 02.

2001:

PAC Generalization Bounds for Co-Training with Sanjoy Dasgupta and Michael Littman, NIPS 01
Learning Theory and Language Modeling with Robert Schapire, paper accompanying IJCAI-01 distinguished presentation. Slides from the IJCAI presentation.
On The Complexity Analysis of Static Analyses JACM 49(4): 512-537 (2002)
PAC-Bayesian Stochastic Model Selection Machine Learning 51(1): 5-21 (2003). A revised version of "PAC-Bayesian Model Averaging" in COLT-99.
A New Meta-Complexity Theorem for Bottom-Up Logic Programs with Harald Ganzinger, IJCAR-01.
Modeling Auction Price Uncertainty Using Boosting-based Conditional Density Estimation with Peter Stone, Robert E. Schapire, Janos Csirik, and Michael L. Littman, ICML 2002.
Inference Using Formal Logics Article for the Encyclopedia of Cognitive Science, Nature Publishing Group (NPG).

2000:

An Architecture for Action Selection in Robotic Soccer with Peter Stone, Fifth International Conference on Autonomous Agents (Agents 2001)
An Indexed Model of Recursive Types for foundational Proof Carrying Code with Andrew Appel, TOPLAS 23(5): 657-683 (2001)
Hardening Soft Information Sources with William Cohen and Henry Kautz, KDD-2000
Computable Shell Decomposition Bounds with John Langford, COLT-2000
On the Convergence Rate of Good-Turing Estimators with Robert Schapire, COLT-2000
Boosting Using Branching Programs with Yishay Mansour, JCSS 64(1): 103-112 (2002), an earlier version appeared in COLT-2000
Generalization Bounds for Decision Trees with Yishay Mansour, COLT-2000

1999:

papers:

Bellman Equations for Stochastic Programs, revised version of a paper accompanying an invited talk at LPNMR-99
Policy Gradient Methods for Reinforcement Learning with Function Approximation. with Richard Suttun, Satinder Singh, and Yishay Mansour, NIPS-99
Boosting with Multi-Way Branching in Decision Trees, with Yishay Mansour, NIPS-99
On the Complexity Analysis of Static Analyses, paper accompanying an invited talk at SAS-99
PAC-Bayesian Model Averaging, COLT-99. This paper is subsumed by "PAC-Bayesian Stochastic Model Selection" listed under 2001.
Relating Probabilistic Grammars and Automata, with Steve Abney and Fernando Pereira, ACL-99
Approximate Planning for Factored POMDPs using Beleif State Simplification, with Satinder Singh, UAI-99

other:

1998:

Some PAC-Bayesian Theorems, COLT-98, pages 230-234. Machine Learning 37(3): 355-363 (1999). An earlier version appeared in COLT-98.
Alternating Fixed Point Logic Programs with Andreas Podelski, Witold Charatonik, Damian Niwinski, and Igor Wilukiewicz. A smaller version appeared as "The Horn Mu-Calculus", LICS-98, pages 58-69.
Object Conversion is Type-Preserving

1997:

1996:

Tarskian Set Constraints with Robert Givan, Dexter Kozen, and Carl Witty. Information and Computation 174(2): 105-131 (2002) an earlier version appeared in LICS 1996.
long version of Tarskian Set Constraints
Inferring Recursive Types
Walther Recursion with Kostas Arkoudas, CADE-13, 1996, pages 643-657.
Encoding Plans in Propositional Logic, with Henry Kautz and Bart Selman, KR96.

1995:

1994:

GSAT and Dynamic Backtracking, with Matthew Ginsberg ,Fourth Conference on Principles of Knowledge Representation and Reasoning (KR-94), May, 1994, pages 226-237.

1993:

Taxonomic Sytnax for First Order Inference with Robert Givan, JACM, vol. 40, number 2, April 1993, pages 246-283.
Automatic Recognition of Tractability in Inference Relations, JACM, vol. 40, number 2, April 1993, pages 284-303.
The Ontic Language June 1993.
Nondeterministic Lisp as a Substrait for Constraint Logic Programming, with Jeffery Mark Siskind, AAAI-93, pages 133-138.
Alpha-Beta-Conspiracy Search, with Denize Yuret, ICGA Journal, Vol. 25, No. 1, pp. 16-35 (2002).

1992:

Grammar Rewriting CADE-11, 1992, pages 124-138.
Rewriting Induction Slides for a talk given at the induction workshop at CADE-11, 1992.
Natural Language Syntax and First Order Inference with Robert Givan, Artificial Intelligence 56 (1992), pages 1-20.
Polynomial Time Computation via Local Inference Relations with Robert Givan, TOCL 3(4): 521-541 (2002). This is a revised version of "New results on local inference relations" in KR-92.

1991:

1990: