Search arXiv⌕ Search

arXiv · cond-mat/0204224

What can be learned from the schematic mode-coupling approach to experimental data ?

Abstract

We propose a detailed investigation of the schematic mode-coupling approach to experimental data, a method based on the use of simple mode-coupling equations to analyze the dynamics of supercooled liquids. Our aim here is to clarify different aspects of this approach that appeared so far uncontrolled or arbitrary, and to validate the results obtained from previous works. Analyzing the theoretical foundations of the approach, we first identify the parameters of the theory playing a key role and obtain simple requirements to be met by a schematic model for its use in this context. Then we compare the results obtained from the schematic analysis of a given set of experimental data with a variety of models and show that they are all perfectly consistent. A number of potential biases in the method are identified and ruled out by the choice of appropriate models. Finally, reference spectra computed from the mode-coupling theory for a model simple liquid are analyzed along the same lines as experimental data, allowing us to show that, despite the strong simplification in the description of the dynamics it involves, the method is free from spurious artifacts and provides accurate estimates of important parameters of the theory. The only exception is the exponent parameter, the evaluation of which is hindered, as for other methods, by corrections to the asymptotic laws of the theory present when the dynamics is known only in a limited time or frequency range.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. Krakoviack, C. Alba-Simionesco. 2002-04-10. What can be learned from the schematic mode-coupling approach to experimental data ?. https://doi.org/10.1063/1.1489895

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗

Neural Networks with Exciton-Polariton Waveguides

We propose and numerically study a scheme for neural networks using exciton-polariton waveguide meshes. These enable arbitrary programmable interlayer couplings suited to a restricted Boltzmann machine architecture where polariton phases act as stochastic network variables. We show that such a network can be trained using unsupervised Hebbian and anti-Hebbian updates. This allows the implementation of an associative memory, where the network recovers learned patterns from imperfect inputs.

cond-mat.dis-nn↗

Finite-width shift of the edge of chaos in deep neural networks

Deep neural networks train best when they are initialised at the edge of chaos, the critical line in the plane of weight and bias variances on which the distance between two inputs neither grows nor shrinks with depth. The line is known for infinitely wide networks; at finite width it moves, and how it moves has been disputed. We treat the logarithm of the distance between two inputs through a network of width $N$ as a random walk and compute its drift and variance to order $1/N$. The edge of chaos moves to a larger weight variance, by $Δσ_w^2=-a_1/(N\,\partial_{σ_w^2}\lnχ_1)$, about $8/N$ for $\tanh$ networks at a bias variance of $0.05$, confirmed by simulations of the exact finite-width recursion. The shift describes a typical network; the average over many networks is dominated by rare networks in which the distance grows, and its critical point moves the other way, which explains why calculations and simulations have disagreed. Backpropagation follows the same random walk, so the shift applies to gradients unchanged. Along the edge of chaos, the information about the similarity of two inputs is constant until the compression over the depth exceeds about one nat, which fixes where to sit on the line. The results give an initialisation rule, Crinit, that places a network on its finite-width edge of chaos without a search. On MNIST and Fashion-MNIST at width $64$ it is more accurate than the standard rules at their usual settings, by a small margin in shallow networks and a large one in deep networks, where most standard rules fail; it trains in fewer steps, and it matches or beats the standard rules with a tuned gain.

cond-mat.dis-nn↗