A central result in the rational learning literature is that if the true measure is absolutely continuous with respect to the beliefs then, given enough data, the updated beliefs merge with the true distribution. In this paper, we show that, under absolute continuity, weak merging occurs fast (at the rate $1/\sqrt t$) with density one. Moreover, if weak merging occurs fast enough (at the rate 1/t) then absolute continuity holds. These rates are sharp. We also show that, under some conditions, if weak merging occurs at the rate $1/\sqrt {t}$ then absolute continuity holds.Rational learning · merging · speed of convergence
We specify conditions under which kernel density estimate for linear process is weakly and strongly ...
Homophily is the tendency of people to associate relatively more with those who are similar to them ...
Analysis of the convergence rates of modern convex optimization algorithms can be achived through bi...
Two agents with different priors watch a sequence unfold over time, updating their priors about the ...
The speed with which a learning algorithm converges as it is presented with more data is a central p...
In this paper we derive convergence rates for Q-learning. We show an interesting rela-tionship betwe...
AbstractWe consider the standard problem of learning a concept from random examples. Here alearning ...
Suppose we randomly pull two agents from a population and ask them to observe an unfolding, infinite...
e study the rate of convergence of Bayesian learning in social networks. Each individual receives a ...
Suppose we randomly pull two agents from a population and ask them to observe an unfolding, infinite...
We consider some problems in learning with respect to a fixed distribution. We introduce two new not...
We introduce an alternative to the notion of ‘fast rate’ in Learning Theory, which coincides with th...
Boosting combines weak learners into a predictor with low empirical risk. Its dual constructs a high...
In the classical herding literature, agents receive a private signal regarding a binary state of nat...
This paper argues that some of the pathologies identified by the social learning literature are not ...
We specify conditions under which kernel density estimate for linear process is weakly and strongly ...
Homophily is the tendency of people to associate relatively more with those who are similar to them ...
Analysis of the convergence rates of modern convex optimization algorithms can be achived through bi...
Two agents with different priors watch a sequence unfold over time, updating their priors about the ...
The speed with which a learning algorithm converges as it is presented with more data is a central p...
In this paper we derive convergence rates for Q-learning. We show an interesting rela-tionship betwe...
AbstractWe consider the standard problem of learning a concept from random examples. Here alearning ...
Suppose we randomly pull two agents from a population and ask them to observe an unfolding, infinite...
e study the rate of convergence of Bayesian learning in social networks. Each individual receives a ...
Suppose we randomly pull two agents from a population and ask them to observe an unfolding, infinite...
We consider some problems in learning with respect to a fixed distribution. We introduce two new not...
We introduce an alternative to the notion of ‘fast rate’ in Learning Theory, which coincides with th...
Boosting combines weak learners into a predictor with low empirical risk. Its dual constructs a high...
In the classical herding literature, agents receive a private signal regarding a binary state of nat...
This paper argues that some of the pathologies identified by the social learning literature are not ...
We specify conditions under which kernel density estimate for linear process is weakly and strongly ...
Homophily is the tendency of people to associate relatively more with those who are similar to them ...
Analysis of the convergence rates of modern convex optimization algorithms can be achived through bi...