• Undergraduate
• Graduate
• Online Programs
• Research
• Directory
• Faculty by Alphabet
• Faculty by Research
• Dept. Staff
• Research Staff
• Graduating PhDs
• Dept. Offices
• Student Groups
• About Us
• Awards
• Alumni
• Corporate Relations
• Outreach/Diversity
• Calendar
• In the News
• Search

Lenny Pitt

Research Area: Algorithms and Theory

Research Interests: Artificial intelligence and theoretical computing.

Research Group: Algorithm Group

Research Statement

Professor Pitt's research focuses on formal mathematical models of how learning agents interact with their environments, precise definitions for what it means to learn, and characterizations of exactly which types of concepts or behaviors are provably learnable, given the model of interaction and the definition of learning. A wide variety of techniques are employed, including those borrowed from theory of computation, analysis of algorithms, computational complexity theory, logic, machine learning, and probability and statistics.

Projects have involved investigations into the learnability of various types of logical rules, including propositional Boolean formulas in certain normal forms, description logics (first-order KL-one type languages), and geometric classifiers in Euclidian space. In some cases, provably efficient learning algorithms have been developed, while in others it has been proved that the existence of such algorithms would result in complexity-theoretic consequences widely believed to be unlikely. A recent interdisciplinary project with faculty from Computer Science and Cognitive Science addresses the impact of background knowledge and concept use in feature extraction and concept learning. Another current project focuses on the computational complexity of data mining problems.

Professor Pitt is also involved in educational outreach activities for K-12 classrooms, with emphasis on the development of fun "hands-on" activities for teaching discrete mathematics and computer science at the elementary and secondary level.

Representative Publications

• L. Pitt, H. Hirsh and N. Mishra. Version Spaces and the Consistency Problem. Artificial Intelligence, Vol.156, Issue 2, pp. 115-13, July 2004.
• L. Pitt, C. Heeren and H.V. Jagadish. Optimal Indexing using Near-Minimal Space. Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2003), pp. 244-251.
• L. Pitt, J. Elble and C. Heeren. Optimized Disjunctive Association Rules via Sampling. Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), pp. 43-50.

Honors and Awards

Michigan Mathematics Prize Competition Bronze Award Winner (1974); Phi Beta Kappa (1979); NSF Research Initiation Award (1988); C. W. Gear Outstanding Junior Faculty Award (1992); Everitt Award for Teaching Excellence (1999); University Distinguished Teacher/Scholar (2004/05); College of Engineering Teaching Excellence Award (2006); Campus Award for Excellence in Undergraduate Teaching (2006).

Home Page: http://www-faculty.cs.uiuc.edu/~pitt/

Email: Lenny Pitt