Testing theories with learnable and predictive representations

نویسندگان

  • Nabil I. Al-Najjar
  • Alvaro Sandroni
  • Rann Smorodinsky
  • Jonathan Weinstein
چکیده

We study the problem of testing an expert whose theory has a learnable and predictive parametric representation, as do all standard processes used in Bayesian statistics. We design a test in which the expert is required to submit a date T by which he will have learned enough to deliver sharp predictions about future frequencies. His forecasts are then tested according to a simple hypothesis test. We show that this test passes an expert who knows the data-generating process and cannot be manipulated by an uninformed one. Such a test is not possible if the theory is unrestricted. ∗ We are grateful to Eddie Dekel, Lance Fortnow, Ehud Kalai, Wojciech Olszewski, Marcin Peski, Phil Reny, Rakesh Vohra, and seminar audiences at Northwestern, Montreal, Technion, Minnesota, Princeton, and Maryland. We also thank Nenad Kos, Yang Zhang and Jie Gong for their comments and careful proofreading. † Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northwestern University, Evanston IL 60208. e-mail:[email protected]. Research page : http://www.kellogg.northwestern.edu/faculty/alnajjar/htm/index.htm ‡ Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northwestern University, Evanston IL 60208, and Department of Economics, University of Pennsylvania. e-mail: . § Davidson Faculty of Industrial Engineering and Management,Technion, Haifa 32000, Israel. e-mail: . ¶ Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northwestern University, Evanston IL 60208. e-mail: [email protected] Research page : http://www.kellogg.northwestern.edu/faculty/weinstein/htm/index.htm

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An argument from acquisition: Comparing English metrical stress representations by how learnable they are from child-directed speech

It has long been recognized that there is a natural dependence between theories of knowledge representation and theories of knowledge acquisition, with the idea that the right knowledge representation enables acquisition to happen as reliably as it does. Given this, a reasonable criterion for a theory of knowledge representation is that it be useful for acquisition, particularly in non-trivial ...

متن کامل

Integrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach

Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...

متن کامل

First-Order jk-Clausal Theories are PAC-Learnable

We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomialsample polynomial-time PAC-learnable with one-sided error from positive examples only. In our framework, concepts are clausal theories and ex...

متن کامل

Learnable And Non-learnable Visual Concepts

Valiant’s theory of the learnable is applied to visual concepts in digital pictures. Several visual concepts that are easily perceived by humans are shown to be learnable from positive examples. These concepts include a certain type of inaccurate copies of line drawings, identifying a subset of objects at specific locations, and pictures of lines in a fixed slope. Several characterizations of v...

متن کامل

Logical Grammars, Logical Theories

Residuated lattices form one of the theoretical backbones of the Lambek Calculus as the standard free models. They also appear in grammatical inference as the syntactic concept lattice, an algebraic structure canonically defined for every language L based on the lattice of all distributionally definable subsets of strings. Recent results show that it is possible to build representations, such a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 145  شماره 

صفحات  -

تاریخ انتشار 2010