Juhan Aru
University of Cambridge
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Juhan Aru.
PLOS ONE | 2017
Ardi Tampuu; Tambet Matiisen; Dorian Kodelja; Ilya Kuzovkin; Kristjan Korjus; Juhan Aru; Jaan Aru; Raul Vicente
Evolution of cooperation and competition can appear when multiple adaptive agents share a biological, social, or technological niche. In the present work we study how cooperation and competition emerge between autonomous agents that learn by reinforcement while using only their raw visual input as the state representation. In particular, we extend the Deep Q-Learning framework to multiagent environments to investigate the interaction between two learning agents in the well-known video game Pong. By manipulating the classical rewarding scheme of Pong we show how competitive and collaborative behaviors emerge. We also describe the progression from competitive to collaborative behavior when the incentive to cooperate is increased. Finally we show how learning by playing against another adaptive agent, instead of against a hard-wired algorithm, results in more robust strategies. The present work shows that Deep Q-Networks can become a useful tool for studying decentralized learning of multiagent systems coping with high-dimensional environments.
Appetite | 2010
Kristjan Lääne; Juhan Aru; Anthony Dickinson
In the first experiment, we demonstrated evaluative conditioning using a novel across-modality procedure in which pictorial abstract brand logos acted as conditioned stimulus (CSs) and self-selected foods of different hedonic valence functioned as unconditioned stimuli (USs). We then investigated whether this form of learning of likes discriminates against redundant CSs using a blocking paradigm in the second experiment. The strength of evaluative conditioning accruing to the target CSs during compound training was unaffected by whether the other element of the compound was pretrained with a hedonic US. The observation that contingency learning about the target CS was blocked by the pretraining suggests that learning of likes and predictive learning are mediated by different processes.
Journal of The Institute of Mathematics of Jussieu | 2017
Juhan Aru; Avelio Sepúlveda; Wendelin Werner
We study certain classes of local sets of the two-dimensional Gaussian free field (GFF) in a simply-connected domain, and their relation to the conformal loop ensemble CLE(4) and its variants. More specifically, we consider bounded-type thin local sets (BTLS), where thin means that the local set is small in size, and bounded-type means that the harmonic function describing the mean value of the field away from the local set is bounded by some deterministic constant. We show that a local set is a BTLS if and only if it is contained in some nested version of the CLE(4) carpet, and prove that all BTLS are necessarily connected to the boundary of the domain. We also construct all possible BTLS for which the corresponding harmonic function takes only two prescribed values and show that all these sets (and this includes the case of CLE(4)) are in fact measurable functions of the GFF.
Electronic Journal of Probability | 2018
Juhan Aru; Avelio Sepúlveda
We study two-valued local sets,
Communications in Mathematical Physics | 2017
Juhan Aru; Yichao Huang; Xin Sun
\mathbb{A}_{-a,b}
arXiv: Probability | 2017
Juhan Aru
, of the two-dimensional continuum Gaussian free field (GFF) with zero boundary condition in simply connected domains. Intuitively,
arXiv: Probability | 2017
Juhan Aru; Ellen Powell; Avelio Sepúlveda
\mathbb{A}_{-a,b}
arXiv: Probability | 2018
Juhan Aru; Bhargav Narayanan; Alex Scott; Ramarathnam Venkatesan
is the (random) set of points connected to the boundary by a path on which the values of the GFF remain in
arXiv: Probability | 2018
Juhan Aru; Titus Lupu; Avelio Sepúlveda
[-a,b]
arXiv: Probability | 2018
Juhan Aru; Ellen Powell; Avelio Sepúlveda
. For specific choices of the parameters