continuous representations
Recently Published Documents


TOTAL DOCUMENTS

96
(FIVE YEARS 22)

H-INDEX

11
(FIVE YEARS 3)

2021 ◽  
Author(s):  
Cherie Zhou ◽  
Monicque M. Lorist ◽  
Sebastiaan Mathot

Recent studies on visual working memory (VWM) have shown that visual information can be stored in VWM as continuous (e.g., a specific shade of red) as well as categorical representations (e.g., the general category red). It has been widely assumed, yet never directly tested, that continuous representations require more VWM mental effort than categorical representations; given limited VWM capacity, this would mean that fewer continuous, as compared to categorical, representations can be maintained simultaneously. We tested this assumption by measuring pupil size, as a proxy for mental effort, in a delayed estimation task. Participants memorized one to four ambiguous (boundaries between adjacent color categories) or prototypical colors to encourage continuous or categorical representations, respectively; after a delay, a probe indicated the location of the to-be-reported color. We found that, for set size 1, pupil size was larger while maintaining ambiguous as compared to prototypical colors, but without any difference in memory precision; this suggests that participants relied on an effortful continuous representation to maintain a single ambiguous color, thus resulting in pupil dilation while preserving precision. In contrast, for set size 2 and higher, pupil size was equally large while maintaining ambiguous and prototypical colors, but memory precision was now substantially reduced for ambiguous colors; this suggests that participants now also relied on categorical representations for ambiguous colors (which are by definition a poor fit to any category), thus reducing memory precision but not resulting in pupil dilation. Taken together, our results suggest that continuous representations are more effortful than categorical representations, and that very few continuous representations (perhaps only one) can be maintained simultaneously.


2021 ◽  
pp. 79-81
Author(s):  
Brian Evan Saunders ◽  
Rui M. G. Vasconcellos ◽  
Robert J. Kuether ◽  
Abdessattar Abdelkefi

Universe ◽  
2021 ◽  
Vol 7 (8) ◽  
pp. 285
Author(s):  
Julio Marny Hoff da Silva ◽  
Gabriel Marcondes Caires da Rocha

We revisit the fundamental notion of continuity in representation theory, with special attention to the study of quantum physics. After studying the main theorem in the context of representation theory, we draw attention to the significant aspect of continuity in the analytic foundations of Wigner’s work. We conclude the paper by reviewing the connection between continuity, the possibility of defining certain local groups, and their relation to projective representations.


Author(s):  
Zexuan Qiu ◽  
Qinliang Su ◽  
Zijing Ou ◽  
Jianxing Yu ◽  
Changyou Chen

Many unsupervised hashing methods are implicitly established on the idea of reconstructing the input data, which basically encourages the hashing codes to retain as much information of original data as possible. However, this requirement may force the models spending lots of their effort on reconstructing the unuseful background information, while ignoring to preserve the discriminative semantic information that is more important for the hashing task. To tackle this problem, inspired by the recent success of contrastive learning in learning continuous representations, we propose to adapt this framework to learn binary hashing codes. Specifically, we first propose to modify the objective function to meet the specific requirement of hashing and then introduce a probabilistic binary representation layer into the model to facilitate end-to-end training of the entire model. We further prove the strong connection between the proposed contrastive-learning-based hashing method and the mutual information, and show that the proposed model can be considered under the broader framework of the information bottleneck (IB). Under this perspective, a more general hashing model is naturally obtained. Extensive experimental results on three benchmark image datasets demonstrate that the proposed hashing method significantly outperforms existing baselines.


2021 ◽  
Author(s):  
M. E. Rule ◽  
T. O’Leary

AbstractNeural representations change, even in the absence of overt learning. To preserve stable behavior and memories, the brain must track these changes. Here, we explore homeostatic mechanisms that could allow neural populations to track drift in continuous representations without external error feedback. We build on existing models of Hebbian homeostasis, which have been shown to stabilize representations against synaptic turnover and allow discrete neuronal assemblies to track representational drift. We show that a downstream readout can use its own activity to detect and correct drift, and that such a self-healing code could be implemented by plausible synaptic rules. Population response normalization and recurrent dynamics could stabilize codes further. Our model reproduces aspects of drift observed in experiments, and posits neurally plausible mechanisms for long-term stable readouts from drifting population codes.


2020 ◽  
Vol 21 (S21) ◽  
Author(s):  
Min Jin Ha ◽  
Junghi Kim ◽  
Jessica Galloway-Peña ◽  
Kim-Anh Do ◽  
Christine B. Peterson

Abstract Background The estimation of microbial networks can provide important insight into the ecological relationships among the organisms that comprise the microbiome. However, there are a number of critical statistical challenges in the inference of such networks from high-throughput data. Since the abundances in each sample are constrained to have a fixed sum and there is incomplete overlap in microbial populations across subjects, the data are both compositional and zero-inflated. Results We propose the COmpositional Zero-Inflated Network Estimation (COZINE) method for inference of microbial networks which addresses these critical aspects of the data while maintaining computational scalability. COZINE relies on the multivariate Hurdle model to infer a sparse set of conditional dependencies which reflect not only relationships among the continuous values, but also among binary indicators of presence or absence and between the binary and continuous representations of the data. Our simulation results show that the proposed method is better able to capture various types of microbial relationships than existing approaches. We demonstrate the utility of the method with an application to understanding the oral microbiome network in a cohort of leukemic patients. Conclusions Our proposed method addresses important challenges in microbiome network estimation, and can be effectively applied to discover various types of dependence relationships in microbial communities. The procedure we have developed, which we refer to as COZINE, is available online at https://github.com/MinJinHa/COZINE.


2020 ◽  
Author(s):  
Brian Saunders ◽  
Rui Vasconcellos ◽  
Robert Kuether ◽  
Abdessattar Abdelkefi

Sign in / Sign up

Export Citation Format

Share Document