Real causal systems are complicated. Despite this, causal learning research has traditionally emphasized how causal relations can be induced on the basis of idealized events, i.e. those that have been mapped to binary variables and abstracted from time. For example, participants may be asked to assess the efficacy of a headache-relief pill on the basis of multiple patients who take the pill (or not) and find their headache relieved (or not). In contrast, the current study examines learning via (...) interactions with continuous dynamic systems, systems that include continuous variables that interact over time (and that can be continuously observed in real time by the learner). To explore such systems, we develop a new framework that represents a causal system as a network of stationary Gauss--Markov (``\OU'') processes and show how such \textit{OU networks} can express complex dynamic phenomena such as feedback loops and oscillations. To assess adult's abilities to learn such systems, we conducted an experiment in which participants were asked to identify the causal relationships of a number of OU networks, potentially carrying out multiple, temporally-extended interventions. We compared their judgments to a normative model for learning OU networks as well as a range of alternative and heuristic learning models from the literature. We found that, although participants exhibited substantial learning of such systems, they committed certain systematic errors. These successes and failures were best accounted for by a model that describes people as focusing on pairs of variables, rather than evaluating the evidence with respect to the full space of possible structural models. We argue that our approach provides both a principled framework for exploring the space of dynamic learning environments as well as new algorithmic insights into how people interact successfully with a continuous causal world. (shrink)

Standard time series structure learning algorithms assume that the measurement timescale is approximately the same as the timescale of the underlying system. In many scientific contexts, however, this assumption is violated: the measurement timescale can be substantially slower than the system timescale. This assumption violation can lead to significant learning errors. In this paper, we provide a novel learning algorithm to extract systemtimescale structure from measurement data that undersample the underlying system. We employ multiple algorithmic (...) optimizations that exploit the problem structure in order to achieve computational tractability. The resulting algorithm is highly reliable at extracting system-timescale structure from undersampled data. (shrink)

In contrast to Pietraszewski's account, latent structure learning neither requires conflict nor relies on observation of explicit coalitional behavior to support group inference. This alternative addresses how even non-conflict-based groups may be defined and is supported by experimental evidence in human behavior.

Causal structure learning from time series data is a major scientific challenge. Existing algorithms assume that measurements occur sufficiently quickly; more precisely, they assume that the system and measurement timescales are approximately equal. In many scientific domains, however, measurements occur at a significantly slower rate than the underlying system changes. Moreover, the size of the mismatch between timescales is often unknown. This paper provides three distinct causal structure learning algorithms, all of which discover all dynamic graphs (...) that could explain the observed measurement data as arising from undersampling at some rate. That is, these algorithms all learn causal structure without assuming any particular relation between the measurement and system timescales; they are thus rate-agnostic. We apply these algorithms to data from simulations. The results provide insight into the challenge of undersampling. (shrink)

Causal structure learning algorithms have focused on learning in ”batch-mode”: i.e., when a full dataset is presented. In many domains, however, it is important to learn in an online fashion from sequential or ordered data, whether because of memory storage constraints or because of potential changes in the underlying causal structure over the course of learning. In this paper, we present TDSL, a novel causal structure learning algorithm that processes data sequentially. This algorithm (...) can track changes in the generating causal structure or parameters, and requires significantly less memory in realistic settings. We show by simulation that the algorithm performs comparably to batch-mode learning when the causal structure is stationary, and significantly better in non-stationary environments. (shrink)

본 연구의 목적은 최근 20여 년 동안 진행되어 온 학습이론에 대한 피아제의 명제논리학적 학습이론과 베이즈주의의 확률론적 학습이론의 융합에 근거하는 새로운 융합교수학습모형을 개발하는 것이다. 연구자는 이 새로운 교수학습모델을 “베이지안 구조구성주의 교수학습모형”(Bayesian structure-constructivist Model of Teaching-learning: 이하 약칭 BMT)이라 명명한다. 본고는 역사-비판적 관점 및 형식화적 관점에서 피아제의 명제논리학적 학습모형에서 해석된 학습이론과 베이즈주의의 확률론적 추론모형에서 해석된 학습이론을 일차적으로 분석하고, 논문의 후반부에서는 이를 근거로 교수법의 관점에서 양자의 학습이론을 통합하는 새로운 교수학습모델, 즉 BMT의 중요한 특성들을 세부적으로 제시한다. 몇 가지 핵심만 언급하면, 첫째로, BMT는 (...) 개념 학습이든 이론 학습이든 모든 학습은 표상과 샘플링의 상호작용임을 강조한다. 매우 이른 나이에서부터 아동은 학습하기 이전에 자기에게 주어진 예시들이 약한 샘플링인지 강한 샘플링인지, 특히 교육학적 샘플링인지 비교육학적 샘플링인지를 구분한다. 둘째로, 따라서 학습을 촉진시킬 수 있는 샘플을 선택하기 위해서 교사는 교육학적 추론을 위한 베이지안 모델을 활용하면서 직접적인 강의식 수업과 발견학습 수업을 병행해야 한다. 셋째로, 아동은 때때로 구체적인 규칙들보다는 추상적인 규칙들을 먼저 학습하기도 하지만, 대부분의 영역에서 추상적인 지식의 학습은 구체적인 지식의 학습에 의존한다. 따라서 성공적인 학습을 위해서는 피아제가 강조한 보편적 언어로서 논리적 문법과 그들 사이의 위계성을 고려하는 샘플을 개발하고 제시해야 한다. (shrink)

We routinely observe others’ choices and use them to guide our own. Whose choices influence us more, and why? Prior work has focused on the effect of perceived similarity between two individuals, such as the degree of overlap in past choices or explicitly recognizable group affiliations. In the real world, however, any dyadic relationship is part of a more complex social structure involving multiple social groups that are not directly observable. Here we suggest that human learners go beyond dyadic (...) similarities in choice behaviors or explicit group memberships; they infer the structure of social influence by grouping individuals based on choices, and they use these groups to decide whose choices to follow. We propose a computational model that formalizes this idea, and we test the model predictions in a series of behavioral experiments. In Experiment 1, we reproduce a well-established finding that people's choices are more likely to be influenced by someone whose past choices are more similar to their own past choices, as predicted by our model as well as dyadic similarity models. In Experiments 2–5, we test a set of unique predictions of our model by looking at cases where the degree of choice overlap between individuals is equated, but their choices indicate a latent group structure. We then apply our model to prior empirical results on infants’ understanding of others’ preferences, presenting an alternative account of developmental changes. Finally, we discuss how our model relates to classical findings in the social influence literature and the theoretical implications of our model. Taken together, our findings demonstrate that structure learning is a powerful framework for explaining the influence of social information on decision making in a variety of contexts. (shrink)

Previous studies of auditory statistical learning have typically presented learners with sequential structural information that is uniformly distributed across the entire exposure corpus. Here we present learners with nonuniform distributions of structural information by altering the organization of trisyllabic nonsense words at midstream. When this structural change was unmarked by low‐level acoustic cues, or even when cued by a pitch change, only the first of the two structures was learned. However, both structures were learned when there was an explicit (...) cue to the midstream change or when exposure to the second structure was tripled in duration. These results demonstrate that successful extraction of the structure in an auditory statistical learning task reduces the ability to learn subsequent structures, unless the presence of two structures is marked explicitly or the exposure to the second is quite lengthy. The mechanisms by which learners detect and use changes in distributional information to maintain sensitivity to multiple structures are discussed from both behavioral and computational perspectives. (shrink)

Human language is a salient example of a neurocognitive system that is specialized to process complex dependencies between sensory events distributed in time, yet how this system evolved and specialized remains unclear. Artificial Grammar Learning (AGL) studies have generated a wealth of insights into how human adults and infants process different types of sequencing dependencies of varying complexity. The AGL paradigm has also been adopted to examine the sequence processing abilities of nonhuman animals. We critically evaluate this growing literature (...) in species ranging from mammals (primates and rats) to birds (pigeons, songbirds, and parrots) considering also cross‐species comparisons. The findings are contrasted with seminal studies in human infants that motivated the work in nonhuman animals. This synopsis identifies advances in knowledge and where uncertainty remains regarding the various strategies that nonhuman animals can adopt for processing sequencing dependencies. The paucity of evidence in the few species studied to date and the need for follow‐up experiments indicate that we do not yet understand the limits of animal sequence processing capacities and thereby the evolutionary pattern. This vibrant, yet still budding, field of research carries substantial promise for advancing knowledge on animal abilities, cognitive substrates, and language evolution. (shrink)

Appreciating human movement can be a powerful aesthetic experience. We have used apparent biological motion to investigate the aesthetic effects of three levels of movement representation: body postures, movement transitions and choreographic structure. Symmetrical and asymmetrical sequences of apparent movement were created from static postures, and were presented in an artificial grammar learning paradigm. Additionally, “good” continuation of apparent movements was manipulated by changing the number of movement path reversals within a sequence. In an initial exposure phase, one (...) group of participants saw only symmetrical sequences, while another group saw only asymmetrical sequences. In a subsequent test phase, both groups rated all sequences on an aesthetic evaluation scale. We found that posture, movement, and choreographic structure all influenced aesthetic ratings. Separate ratings for the static body postures presented individually showed that both groups preferred a posture that maximized spatial symmetry. Ratings for the experimental sequences showed that both groups gave higher ratings to symmetrical sequences with “good” continuation and lower ratings to sequences with many path reversals. Further, participants who had been initially familiarized with asymmetrical sequences showed increased liking for asymmetrical sequences, suggesting a structural mere exposure effect. Aesthetic preferences thus depend on body postures, apparent movement continuation and choreographic structure. We propose a hierarchical model of aesthetic perception of human movement with distinct processing levels for body postures, movements and choreographic structure. (shrink)

The study aims to help characterize the sort of structures about which people can acquire unconscious knowledge. It is already well established that people can implicitly learn n-grams and also repetition patterns. We explore the acquisition of unconscious structural knowledge of symmetry. Chinese Tang poetry uses a specific sort of mirror symmetry, an inversion rule with respect to the tones of characters in successive lines of verse. We show, using artificial poetry to control both n-gram structure and repetition patterns, (...) that people can implicitly learn to discriminate inversions from non-inversions, presenting a challenge to existing models of implicit learning. (shrink)

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the following: (...) there is an infinite learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

Musical knowledge is largely implicit. It is acquired without awareness of its complex rules, through interaction with a large number of samples during musical enculturation. Whereas several studies explored implicit learning of mostly abstract and less ecologically valid features of Western music, very little work has been done with respect to ecologically valid stimuli as well as non-Western music. The present study investigated implicit learning of modal melodic features in North Indian classical music in a realistic and ecologically (...) valid way. It employed a cross-grammar design, using melodic materials from two modes that use the same scale. Findings indicated that Western participants unfamiliar with Indian music incidentally learned to identify distinctive features of each mode. Confidence ratings suggest that participants' performance was consistently correlated with confidence, indicating that they became aware of whether they were right in their responses; that is, they possessed explicit judgment knowledge. Altogether our findings show incidental learning in a realistic ecologically valid context during only a very short exposure, they provide evidence that incidental learning constitutes a powerful mechanism that plays a fundamental role in musical acquisition. (shrink)

Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine, a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning (...) and can encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models. We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. (shrink)

To learn a visual code in an unsupervised manner, one may attempt to capture those features of the stimulus set that would contribute significantly to a statistically efficient representation. Paradoxically, all the candidate features in this approach need to be known before statistics over them can be computed. This paradox may be circumvented by confining the repertoire of candidate features to actual scene fragments, which resemble the “what+where” receptive fields found in the ventral visual stream in primates. We describe a (...) single-layer network that learns such fragments from unsegmented raw images of structured objects. The learning method combines fast imprinting in the feedforward stream with lateral interactions to achieve single-epoch unsupervised acquisition of spatially localized features that can support systematic treatment of structured objects [1]. (shrink)

Reflecting on the past is often a critical ingredient for successful learning. The current research investigated how counterfactual thinking, reflecting on how prior experiences might have been different, motivates effective learning from these previous experiences. Specifically, we explored how the structure of counterfactual reflection – their additive (‘‘If only I had”) versus subtractive (‘‘If only I had not”) nature – influences performance in dyadic-level strategic interactions. Building on the functionalist account of counterfactuals, we found across two experiments (...) that generating additive counterfactuals about a previous negotiation produced an advantage for negotiators over their previous performance compared to subtractive counterfactuals, both in terms of obtaining value for oneself and conceiving creative agreements. Additive counterfactuals enabled negotiators to more effectively extract lessons from past experiences to improve their current negotiation performance. (shrink)

One of the most challenging tasks when adopting Bayesian networks is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions and by the fact that the problem isNP-hard. Hence, a full enumeration of all the possible solutions is not always feasible and approximations are often required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this (...) problem has never been done before. For this reason, in this work, we provide a detailed comparison of many different state-of-the-art methods for structural learning on simulated data considering both BNs with discrete and continuous variables and with different rates of noise in the data. In particular, we investigate the performance of different widespread scores and algorithmic approaches proposed for the inference and the statistical pitfalls within them. (shrink)

Even if one can experiment on relevant factors, learning the causal structure of a dynamical system can be quite difficult if the relevant measurement processes occur at a much slower sampling rate than the “true” underlying dynamics. This problem is exacerbated if the degree of mismatch is unknown. This paper gives a formal characterization of this learning problem, and then provides two sets of results. First, we prove a set of theorems characterizing how causal structures change under (...) undersampling. Second, we develop an algorithm for inferring aspects of the causal structure at the “true” timescale from the causal structure learned from the undersampled data. Research on causal learning in dynamical contexts has largely ignored the challenges of undersampling, but this paper provides a framework and foundation for learning causal structure from this type of complex time series data. (shrink)

There is an extensive body of work that has previously examined the teaching of ethics in business schools whereby it is hoped that the values and behaviours of students might be provoked to show positive and enduring change. Rather than dealing with the content issues of particular business ethics courses per se, this article explores the philosophical foundations and the structural conditions for developing ethical training programs in business schools. It is informed by historical analysis, specifically, an examination of Platonic (...) and Aristotelian philosophies that inspires virtue ethics, and together provides four conditions for consideration: respect for law, dialectics, imitation and deliberation. We outline the necessary structural conditions for implementing these requirements as well as suggesting the necessary pedagogical protocol applicable to all courses. It is argued that reference to our two ancient Greek philosophers provide many valuable and insightful lessons for the implementation of ethical training today including choice of theoretical content and the approach towards learning. Further, the enactment of a pedagogical protocol requires a policy of recruiting and managing business school teachers-instructors that takes into account, and consciously encourages, intellectual, relational and spiritual pedagogical qualities. (shrink)

Analogical reasoning is a foundational tool for human learning, allowing learners to recognize relational structures in new events and domains. Here I sketch some grounds for understanding and applying analogical reasoning in social learning. The social world is fundamentally characterized by relations between people, with common relational structures—such as kinships and social hierarchies—forming social units that dictate social behaviors. Just as young learners use analogical reasoning for learning relational structures in other domains—spatial relations, verbs, relational categories—analogical reasoning (...) ought to be a useful cognitive tool for acquiring social relations and structures. (shrink)

This paper proposes a learning-efficiency explanation of modular structure in language. An optimal grammar arises as the solution to the problem of learning a language from a minimal number of observations of instances of the use of the language. Agents face symmetry constraints that limit their ability to make a priori distinctions among symbols used in the language and among objects (interpreted as facts, events, speaker’s intentions) that are to be represented by messages in the language. It (...) is shown that if it is commonly known that the object space is modular and messages are strings, then modularity of the language is sufficient and (essentially) necessary for learning efficiency. Journal of Economic Literature Classification Number: C72. (shrink)

We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause, if such exists; (2) return information about the causal relations among the latent factors so identified. We prove the procedure is point-wise consistent assuming (a) the causal relations can be represented by a directed acyclic graph (DAG) satisfying the Markov Assumption and the Faithfulness Assumption; (b) unrecorded variables are not caused by recorded (...) variables; and (c) dependencies are linear. We compare the procedure with standard approaches over a variety of simulated structures and sample sizes, and illustrate its practical value with brief studies of social science data sets. Finally, we consider generalizations for non-linear systems. Keywords: latent variable models, causality, graphical models.. (shrink)

Vaccine hesitancy is a major public health challenge, and racial disparities in the acceptance of vaccines is a particular concern. In this essay, we draw on interviews with mothers of Black male adolescents to offer insights into the reasons for the low rate of vaccination against the human papillomavirus among this group of adolescents. Based on these conversations, we argue that increasing the acceptance of HPV and other vaccines cannot be accomplished merely by providing people with more facts. Instead, we (...) must address the pervasive racial discrimination in the United States that undermines trust in social institutions, including the health care system. In the short term, it may be helpful to increase the number of clinicians of color working in the health system, but more fundamental changes are required. The U.S. must adopt and implement policies that dismantle structural racism if it hopes to produce greater trust and community‐oriented thinking on behalf of people who have been exploited for centuries. (shrink)

The structural-parametric synthesis of neural networks of deep learning, in particular convolutional neural networks used in image processing, is considered. The classification of modern architectures of convolutional neural networks is given. It is shown that almost every convolutional neural network, depending on its topology, has unique blocks that determine its essential features, Residual block, Inception module, ResNeXt block. It is stated the problem of structural-parametric synthesis of convolutional neural networks, for the solution of which it is proposed to use (...) a genetic algorithm. The genetic algorithm is used to effectively overcome a large search space: on the one hand, to generate possible topologies of the convolutional neural network, namely the choice of specific blocks and their locations in the structure of the convolutional neural network, and on the other hand to solve the problem of structural-parametric synthesis of convolutional neural network of selected topology. The most significant parameters of the convolutional neural network are determined. An encoding method is proposed that allows to repre- sent each network structure in the form of a string of fixed length in binary format. After that, several standard genetic operations were identified, i.e. selection, mutation and crossover, which eliminate weak individuals of the previous generation and use them to generate competitive ones. An example of solving this problem is given, a database of patients with thyroid disease was used as a training sample. (shrink)