Self-supervised learning (SSL) has empirically shown its data representation learnability in many downstream tasks. There are only a few theoretical works on learnability, and of those focus final representation, treating the nonlinear neural network as ``black box". However, accurate results networks crucial for describing distribution features learned by SSL models. Our paper is first to anal...

Preserving the Malay heritage, like traditional houses, through virtual reality (VR) technology benefits tourists in terms of learnability and initial experience. Through this technology, have opportunity to experience surroundings a house without being physically present it. To investigate tourists’ towards house, their perception needs be studied. Hence, study was conducted six measurements: ...

Consider a two-player discounted infinitely repeated game. A player’s belief is a probability distribution over the opponent’s repeated game strategies. This paper shows that, for a large class of repeated games, there are no beliefs that satisfy three properties: learnability, a diversity of belief condition called CSP, and consistency. Loosely, if players learn to forecast the path of play wh...

We discuss a class of constraint-based grammars, Lexicalized Well-Founded Grammars (LWFGs) and present the theoretical underpinnings for learning these grammars from a representative set of positive examples. Given several assumptions, we define the search space as a complete grammar lattice. In order to prove a learnability theorem, we give a general algorithm through which the top and bottom ...

This paper investigated the learnability and generalizability of French schwa alternation by Dutch low-proficiency second language learners. We trained 40 participants on 24 new schwa words by exposing them equally often to the reduced and full forms of these words. We then assessed participants' accuracy and reaction times to these newly learnt words as well as 24 previously encountered schwa ...

Three notions dependent theory, VC-dimension, and PAC-learnability have been found to be closely related. In addition to the known relation among these notions in model theory, finite combinatorics and probability theory, Chernikov, Palacin, and Takeuchi found a relation between n-dependence and VCn-dimension, which are generalizations of dependence and VC-dimension respectively. We are now wor...

We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is insufficient to prove the PAC-learnability of monotone Boolean functions, thereby demonstrating a counter-example to a recent claim to the contrary. We further dis...