skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Cyclical environments drive variation in life-history strategies: a general theory of cyclical phenology
Award ID(s):
1851489
PAR ID:
10143189
Author(s) / Creator(s):
Date Published:
Journal Name:
Proceedings of the Royal Society B: Biological Sciences
Volume:
286
Issue:
1898
ISSN:
0962-8452
Page Range / eLocation ID:
20190214
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Dasgupta, Sanjoy; Mandt, Stephan; Li, Yingzhen (Ed.)
    Cyclical MCMC is a novel MCMC framework recently proposed by Zhang et al. (2019) to address the challenge posed by high-dimensional multimodal posterior distributions like those arising in deep learning. The algorithm works by generating a nonhomogeneous Markov chain that tracks -- cyclically in time -- tempered versions of the target distribution. We show in this work that cyclical MCMC converges to the desired limit in settings where the Markov kernels used are fast mixing, and sufficiently long cycles are employed. However in the far more common settings of slow mixing kernels, the algorithm may fail to converge to the correct limit. In particular, in a simple mixture example with unequal variance where powering is known to produce slow mixing kernels, we show by simulation that cyclical MCMC fails to converge to the desired limit. Finally, we show that cyclical MCMC typically estimates well the local shape of the target distribution around each mode, even when we do not have convergence to the target. 
    more » « less
  2. null (Ed.)
  3. null (Ed.)
  4. In explaining how humans selectively attend, common frameworks often focus on how attention is allocated relative to an idealized allocation based on properties of the task. However, these perspectives often ignore different types of constraints that could help explain why attention was allocated in a particular way. For example, many computational models of learning are well equipped to explain how attention should ideally be allocated to minimize errors within the task, but these models often assume all features are perfectly encoded or that the only learning goal is to maximize accuracy. In this article, we argue for a more comprehensive view by using computational modeling to understand the complex interactions that occur between selective attention and memory. Our central thesis is that although selective attention directs attention to relevant dimensions, relevance can be established only through memories of previous experiences. Hence, attention is initially used to encode features and create memories, but thereafter, attention operates selectively on the basis of what is kept in memory. Through this lens, deviations from ideal performance can still be viewed as goal-directed selective attention, but the orientation of attention is subject to the constraints of the individual learner. 
    more » « less