N ° 2013 – 10 Learning in a Black Box
نویسندگان
چکیده
Many interactive environments can be represented as games, but they are so large and complex that individual players are in the dark about others’ actions and the payoff structure. This paper analyzes learning behavior in such ‘black box’ environments, where players’ only source of information is their own history of actions taken and payoffs received. Specifically we study voluntary contributions games. We identify two robust features of the players’ learning dynamics: search volatility and trend-following. These features are clearly present when players have no information about the game; but also when players have full information. Convergence to Nash equilibrium occurs at about the same rate in both situations. JEL classifications: C70, C73, C91, D83, H41
منابع مشابه
Learning experiences and the value of knowledge
Generalized probabilistic learning takes place in a black-box where present probabilities lead to future probabilities by way of a hidden learning process. The idea that generalized learning can be partially characterized by saying that it doesn’t foreseeably lead to harmful decisions is explored. It is shown that a martingale principle follows for finite probability spaces.
متن کاملDistributed Black-Box Software Testing Using Negative Selection
In the software development process, testing is one of the most human intensive steps. Many researchers try to automate test case generation to reduce the manual labor of this step. Negative selection is a famous algorithm in the field of Artificial Immune System (AIS) and many different applications has been developed using its idea. In this paper we have designed a new algorithm based on nega...
متن کاملBootstrapping Obfuscators via Fast Pseudorandom Functions
We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC or even TC i...
متن کاملA Deep Learning Approach with an Ensemble-Based Neural Network Classifier for Black Box ICML 2013 Contest
This paper presents a technical description of a solution for the International Conference on Machine Learning contest in Representation Learning: The Black Box Challenge. The organizers provided a dataset including one thousand labeled data samples and over 130 thousand of extra unlabeled samples. The task was to correctly classify examples into one of nine classes. The presented solution impl...
متن کاملExamples of the Application of Nonparametric Information Geometry to Statistical Physics
We review a nonparametric version of Amari’s information geometry in which the set of positive probability densities on a given sample space is endowed with an atlas of charts to form a differentiable manifold modeled on Orlicz Banach spaces. This nonparametric setting is used to discuss the setting of typical problems in machine learning and statistical physics, such as black-box optimization,...
متن کامل