Search

Natural data is often organized as a hierarchical composition of features. How many samples do generative models need to learn the composition rules, so as to produce a combinatorial number of novel data? What signal in the data is exploited to learn? We investigate these questions both theoretically and empirically. Theoretically, we consider diffusion models trained on simple probabilistic context-free grammars - tree-like graphical models used to represent the structure of data such as language and images. We demonstrate that diffusion models learn compositional rules with the sample complexity required for clustering features with statistically similar context, a process similar to the word2vec algorithm. However, this clustering emerges hierarchically: higher-level, more abstract features associated with longer contexts require more data to be identified. This mechanism leads to a sample complexity that scales polynomially with the said context size. As a result, diffusion models trained on intermediate dataset size generate data coherent up to a certain scale, but that lacks global coherence. We test these predictions in different domains, and find remarkable agreement: both generated texts and images achieve progressively larger coherence lengths as the training time or dataset size grows. We discuss connections between the hierarchical clustering mechanism we introduce here and the renormalization group in physics.

How much data is required to learn the structure of a language via next-token prediction? We study this question for synthetic datasets generated via a Probabilistic Context-Free Grammar (PCFG) -- a tree-like generative model that captures many of the hierarchical structures found in natural languages. We determine token-token correlations analytically in our model and show that they can be used to build a representation of the grammar's hidden variables, the longer the range the deeper the variable. In addition, a finite training set limits the resolution of correlations to an effective range, whose size grows with that of the training set. As a result, a Language Model trained with increasingly many examples can build a deeper representation of the grammar's structure, thus reaching good performance despite the high dimensionality of the problem. We conjecture that the relationship between training set size and effective range of correlations holds beyond our synthetic datasets. In particular, our conjecture predicts how the scaling law for the test loss behaviour with training set size depends on the length of the context window, which we confirm empirically in Shakespeare's plays and Wikipedia articles., Comment: NeurIPS 2024

Deep learning algorithms demonstrate a surprising ability to learn high-dimensional tasks from limited examples. This is commonly attributed to the depth of neural networks, enabling them to build a hierarchy of abstract, low-dimensional data representations. However, how many training examples are required to learn such representations remains unknown. To quantitatively study this question, we introduce the Random Hierarchy Model: a family of synthetic tasks inspired by the hierarchical structure of language and images. The model is a classification task where each class corresponds to a group of high-level features, chosen among several equivalent groups associated with the same class. In turn, each feature corresponds to a group of sub-features chosen among several equivalent ones and so on, following a hierarchy of composition rules. We find that deep networks learn the task by developing internal representations invariant to exchanging equivalent groups. Moreover, the number of data required corresponds to the point where correlations between low-level features and classes become detectable. Overall, our results indicate how deep networks overcome the curse of dimensionality by building invariant representations, and provide an estimate of the number of data required to learn a hierarchical task., Comment: 9 pages, 8 figures

Lecture notes from the course given by Professor Julia Kempe at the summer school "Statistical physics of Machine Learning" in Les Houches. The notes discuss the so-called NTK approach to problems in machine learning, which consists of gaining an understanding of generally unsolvable problems by finding a tractable kernel formulation. The notes are mainly focused on practical applications such as data distillation and adversarial robustness, examples of inductive bias are also discussed., Comment: These are notes from the lecture of Julia Kempe given at the summer school "Statistical Physics \& Machine Learning", that took place in Les Houches School of Physics in France from 4th to 29th July 2022

A central question of machine learning is how deep nets manage to learn tasks in high dimensions. An appealing hypothesis is that they achieve this feat by building a representation of the data where information irrelevant to the task is lost. For image datasets, this view is supported by the observation that after (and not before) training, the neural representation becomes less and less sensitive to diffeomorphisms acting on images as the signal propagates through the net. This loss of sensitivity correlates with performance, and surprisingly correlates with a gain of sensitivity to white noise acquired during training. These facts are unexplained, and as we demonstrate still hold when white noise is added to the images of the training set. Here, we (i) show empirically for various architectures that stability to image diffeomorphisms is achieved by both spatial and channel pooling, (ii) introduce a model scale-detection task which reproduces our empirical observations on spatial pooling and (iii) compute analitically how the sensitivity to diffeomorphisms and noise scales with depth due to spatial pooling. The scalings are found to depend on the presence of strides in the net architecture. We find that the increased sensitivity to noise is due to the perturbing noise piling up during pooling, after being rectified by ReLU units.

Understanding how convolutional neural networks (CNNs) can efficiently learn high-dimensional functions remains a fundamental challenge. A popular belief is that these models harness the local and hierarchical structure of natural data such as images. Yet, we lack a quantitative understanding of how such structure affects performance, e.g., the rate of decay of the generalisation error with the number of training samples. In this paper, we study infinitely-wide deep CNNs in the kernel regime. First, we show that the spectrum of the corresponding kernel inherits the hierarchical structure of the network, and we characterise its asymptotics. Then, we use this result together with generalisation bounds to prove that deep CNNs adapt to the spatial scale of the target function. In particular, we find that if the target function depends on low-dimensional subsets of adjacent input variables, then the decay of the error is controlled by the effective dimensionality of these subsets. Conversely, if the target function depends on the full set of input variables, then the error decay is controlled by the input dimension. We conclude by computing the generalisation error of a deep CNN trained on the output of another deep CNN with randomly-initialised parameters. Interestingly, we find that, despite their hierarchical structure, the functions generated by infinitely-wide deep CNNs are too rich to be efficiently learnable in high dimension.

It is widely believed that the success of deep networks lies in their ability to learn a meaningful representation of the features of the data. Yet, understanding when and how this feature learning improves performance remains a challenge: for example, it is beneficial for modern architectures trained to classify images, whereas it is detrimental for fully-connected networks trained for the same task on the same data. Here we propose an explanation for this puzzle, by showing that feature learning can perform worse than lazy training (via random feature kernel or the NTK) as the former can lead to a sparser neural representation. Although sparsity is known to be essential for learning anisotropic data, it is detrimental when the target function is constant or smooth along certain directions of input space. We illustrate this phenomenon in two settings: (i) regression of Gaussian random functions on the d-dimensional unit sphere and (ii) classification of benchmark datasets of images. For (i), we compute the scaling of the generalization error with number of training points, and show that methods that do not learn features generalize better, even when the dimension of the input space is large. For (ii), we show empirically that learning features can indeed lead to sparse and thereby less smooth representations of the image predictors. This fact is plausibly responsible for deteriorating the performance, which is known to be correlated with smoothness along diffeomorphisms.

Localization in the environment is an essential navigational capability for animals and mobile robots. In the indoor environment, the global localization problem remains challenging to be perfectly solved with probabilistic methods. However, animals are able to instinctively localize themselves with much less effort. Therefore, it is intriguing and promising to seek biological inspiration from animals. In this paper, we present a biologically-inspired global localization system using a LiDAR sensor that utilizes a hippocampal model and a landmark-based re-localization approach. The experiment results show that the proposed method is competitive to Monte Carlo Localization, and the results demonstrate the high accuracy, applicability, and reliability of the proposed biologically-inspired localization system in different localization scenarios.

Convolutional neural networks perform a local and translationally-invariant treatment of the data: quantifying which of these two aspects is central to their success remains a challenge. We study this problem within a teacher-student framework for kernel regression, using `convolutional' kernels inspired by the neural tangent kernel of simple convolutional architectures of given filter size. Using heuristic methods from physics, we find in the ridgeless case that locality is key in determining the learning curve exponent $\beta$ (that relates the test error $\epsilon_t\sim P^{-\beta}$ to the size of the training set $P$), whereas translational invariance is not. In particular, if the filter size of the teacher $t$ is smaller than that of the student $s$, $\beta$ is a function of $s$ only and does not depend on the input dimension. We confirm our predictions on $\beta$ empirically. We conclude by proving, using a natural universality assumption, that performing kernel regression with a ridge that decreases with the size of the training set leads to similar learning curve exponents to those we obtain in the ridgeless case., Comment: 32 pages, 7 figures

Motivated by experimental observations of patterning at the leading edge of motile eukaryotic cells, we introduce a general model for the dynamics of nearly-flat fluid membranes driven from within by an ensemble of activators. We include, in particular, a kinematic coupling between activator density and membrane slope which generically arises whenever the membrane has a non-vanishing normal speed. We unveil the phase diagram of the model by means of a perturbative field-theoretical renormalization group analysis. Due to the aforementioned kinematic coupling the natural dynamical scaling is acoustic, that is the dynamical critical exponent is 1. However, as soon as the the normal velocity of the membrane is tuned to zero, the system crosses over to diffusive dynamic scaling in mean field. Distinct critical points can be reached depending on how the limit of vanishing velocity is realised: in each of them corrections to scaling due to nonlinear coupling terms must be taken into accounts. The detailed analysis of these critical points reveals novel scaling regimes wich can be accessed with perturbative methods, together with signs of strong coupling behaviour, which establishes a promising ground for further non-perturbative calculations. Our results unify several previous studies on the dynamics of active membrane, while also identifying nontrivial scaling regimes which cannot be captured by passive theories of fluctuating interfaces and are relevant for the physics of living membranes.

We put forward a general field theory for membranes with embedded activators and analyse their critical properties using renormalization group techniques. Depending on the membrane-activator coupling, we find a crossover between acoustic and diffusive scaling regimes, with mean-field dynamical critical exponents z = 1 and 2 respectively. We argue that the acoustic scaling, which is exact in all spatial dimensions, is a suitable candidate for the universal description of the spatiotemporal patterns observed at the leading edge of motile cells. Furthermore, one-loop corrections to the diffusive mean-field exponents reveal universal behaviour distinct from the Kardar-Parisi-Zhang scaling of passive interfaces and signs of strong-coupling behaviour., Comment: 5 pages, 3 figures

We study the large deviations of the power injected by the active force for an Active Ornstein-Uhlenbeck Particle (AOUP), free or in a confining potential. For the free-particle case, we compute the rate function analytically in d-dimensions from a saddle-point expansion, and numerically in two dimensions by it a) direct sampling of the active work in numerical solutions of the AOUP equations and b) Legendre-Fenchel transform of the scaled cumulant generating function obtained via a cloning algorithm. The rate function presents asymptotically linear branches on both sides and it is independent of the system's dimensionality, apart from a multiplicative factor. For the confining potential case, we focus on two-dimensional systems and obtain the rate function numerically using both methods a) and b). We find a different scenario for harmonic and anharmonic potentials: in the former case, the phenomenology of fluctuations is analogous to that of a free particle, but the rate function might be non-analytic; in the latter case the rate functions are analytic, but fluctuations are realised by entirely different means, which rely strongly on the particle-potential interaction. Finally, we check the validity of a fluctuation relation for the active work distribution. In the free-particle case, the relation is satisfied with a slope proportional to the bath temperature. The same slope is found for the harmonic potential, regardless of activity, and for an anharmonic potential with low activity. In the anharmonic case with high activity, instead, we find a different slope which is equal to an effective temperature obtained from the fluctuation-dissipation theorem., Comment: 33 pages, 12 figures

We study the large deviations of the distribution P(W_\tau) of the work associated with the propulsion of individual active brownian particles in a time interval \tau, in the region of the phase diagram where macroscopic phase separation takes place. P(W_\tau) is characterised by two peaks, associated to particles in the gaseous and in the clusterised phases, and two separate non-convex branches. Accordingly, the generating function of W_\tau cumulants displays a double singularity. We discuss the origin of such non-convex branches in terms of the peculiar dynamics of the system phases, and the relation between the observation time \tau and the typical persistence times of the particles in the two phases., Comment: 7 pages, 5 figures

The essential features of many interfaces driven out of equilibrium are described by the same equation---the Kardar-Parisi-Zhang (KPZ) equation. How do living interfaces, such as the cell membrane, fit into this picture? In an endeavour to answer such a question, we proposed in [F. Cagnetta, M. R. Evans, D. Marenduzzo, PRL 120, 258001 (2018)] an idealised model for the membrane of a moving cell. Here we discuss how the addition of simple ingredients inspired by the dynamics of the membrane of moving cells affects common kinetic roughening theories such as the KPZ and Edwards-Wilkinson equations., Comment: 5 pages, 4 figures, FisMat 2019

Vital biological processes such as genome repair require fast and efficient binding of selected proteins to specific target sites on DNA. Here we propose an active target search mechanism based on "chromophoresis", the dynamics of DNA-binding proteins up or down gradients in the density of epigenetic marks, or colours (biochemical tags on the genome). We focus on a set of proteins that deposit marks from which they are repelled---a case which is only encountered away from thermodynamic equilibrium. For suitable ranges of kinetic parameter values, chromophoretic proteins can perform unidirectional motion and are optimally redistributed along the genome. Importantly, they can also locally unravel a region of the genome which is collapsed due to self-interactions and "dive" deep into its core, for a striking enhancement of the efficiency of target search on such an inaccessible substrate. We discuss the potential relevance of chromophoresis for the location of DNA lesions., Comment: 5 pages, 5 figures

By conditioning a stochastic process on the value of an observable, one obtains a new stochastic process with different properties. We apply this idea in the context of active matter, and condition interacting self-propelled particles on their individual motility. Using the effective process formalism from dynamical large deviations theory, we derive the interactions that actuate the imposed mobility against jamming interactions in two toy models---the totally asymmetric exclusion process and run-and-tumble particles, \emil{in the case of two or three particles}. We provide a framework which takes into account the energy-consumption required for self-propulsion, and address the question of how energy-efficient the emergent interactions are. Upon conditioning, run-and-tumble particles develop an alignment interaction and achieve a higher gain in efficiency than TASEP particles. A point of diminishing returns in efficiency is reached beyond a certain level of conditioning. With recourse to a general formula for the change in energy efficiency upon conditioning, we conclude that the most significant gains occur when there are large fluctuations in mobility to exploit. From a detailed comparison of the emergent effective interaction in a two- versus a three-body scenario, we discover evidence of a screening effect which suggests that conditioning can produce topological rather than metric interactions., Comment: 11 pages, 9 figures

We present a detailed solution of the active interface equations in the inviscid limit. The active interface equations were previously introduced as a toy model of membrane-protein systems: they describe a stochastic interface where growth is stimulated by inclusions which themselves move on the interface. In the inviscid limit, the equations reduce to a pair of coupled conservation laws. After discussing how the inviscid limit is obtained, we turn to the corresponding Riemann problem: the solution of the set of conservation laws with discontinuous initial condition. In particular, by considering two physically meaningful initial conditions, a giant trough and a giant peak in the interface, we elucidate the generation of shock waves and rarefaction fans in the system. Then, by combining several Riemann problems, we construct an oscillating solution of the active interface with periodic boundaries conditions. The existence of this oscillating state reflects the reciprocal coupling between the two conserved quantities in our system., Comment: 22 pages, 11 figures

We study the statistical mechanics of a single active slider on a fluctuating interface, by means of numerical simulations and theoretical arguments. The slider, which moves by definition towards the interface minima, is active as it also stimulates growth of the interface. Even though such a particle has no counterpart in thermodynamic systems, active sliders may provide a simple model for ATP-dependent membrane proteins that activate cytoskeletal growth. We find a wide range of dynamical regimes according to the ratio between the timescales associated with the slider motion and the interface relaxation. If the interface dynamics is slow, the slider behaves like a random walker in a random envinronment which, furthermore, is able to escape environmental troughs by making them grow. This results in different dynamic exponens to the interface and the particle: the former behaves as an Edward-Wilkinson surface with dynamic exponent 2 whereas the latter has dynamic exponent 3/2. When the interface is fast, we get sustained ballistic motion with the particle surfing a membrane wave created by itself. However, if the interface relaxes immediately (i.e., it is infinitely fast), particle motion becomes symmetric and goes back to diffusive. Due to such a rich phenomenology, we propose the active slider as a toy model of fundamental interest in the field of active membranes and, generally, whenever the system constituent can alter the environment by spending energy., Comment: 13 pages, 19 figures

Inspired by recent experimental observation of patterning at the membrane of a living cell, we propose a generic model for the dynamics of a fluctuating interface driven by particle-like inclusions which stimulate its growth. We find that the coupling between interfacial and inclusions dynam- ics yields microphase separation and the self-organisation of travelling waves. These patterns are strikingly similar to those detected in the aforementioned experiments on actin-protein systems. Our results further show that the active growth kinetics does not fall into the Kardar-Parisi-Zhang universality class for growing interfaces, displaying instead a novel superposition of equilibrium-like scaling and sustained oscillations., Comment: 5 pages, 5 figures

We study the statistics, in stationary conditions, of the work $W_\tau$ done by the active force in different systems of self-propelled particles in a time $\tau$. We show the existence of a critical value $W_\tau ^\dag$ such that fluctuations with $W_\tau >W_\tau ^\dag$ correspond to configurations where interaction between particles plays a minor role whereas those with $W_\tau < W_\tau ^\dag$ represent states with single particles dragged by clusters. This two-fold behavior is fully mirrored by the probability distribution $P(W_\tau)$ of the work, which does not obey the large-deviation principle for $W_\tau