Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “cond-mat.dis-nn”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30Linked to original sources

Deep learning systems as complex networks

Thanks to the availability of large scale digital datasets and massive amounts of computational power, deep learning algorithms can learn representations of data by exploiting multiple levels of abstraction. These machine learning methods have greatly improved the state-of-the-art in many challenging cognitive tasks, such as visual object recognition, speech processing, natural language understanding and automatic translation. In particular, one class of deep learning models, known as deep belief networks, can discover intricate statistical structure in large data sets in a completely unsupervised fashion, by learning a generative model of the data using Hebbian-like learning mechanisms. Although these self-organizing systems can be conveniently formalized within the framework of statistical mechanics, their internal functioning remains opaque, because their emergent dynamics cannot be solved analytically. In this article we propose to study deep belief networks using techniques commonly employed in the study of complex networks, in order to gain some insights into the structural and functional properties of the computational graph resulting from the learning process.

cond-mat.dis-nn↗

All-optical Nonlinear Activation Function for Photonic Neural Networks

With the recent successes of neural networks (NN) to perform machine-learning tasks, photonic-based NN designs may enable high throughput and low power neuromorphic compute paradigms since they bypass the parasitic charging of capacitive wires. Thus, engineering data-information processors capable of executing NN algorithms with high efficiency is of major importance for applications ranging from pattern recognition to classification. Our hypothesis is therefore, that if the time-limiting electro-optic conversion of current photonic NN designs could be postponed until the very end of the network, then the execution time of the photonic algorithm is simple the delay of the time-of-flight of photons through the NN, which is on the order of picoseconds for integrated photonics. Exploring such all-optical NN, in this work we discuss two independent approaches of implementing the optical perceptrons nonlinear activation function based on nanophotonic structures exhibiting i) induced transparency and ii) reverse saturated absorption. Our results show that the all-optical nonlinearity provides about 3 and 7 dB extinction ratio for the two systems considered, respectively, and classification accuracies of an exemplary MNIST task of 97% and near 100% are found, which rivals that of software based trained NNs, yet with ignored noise in the network. Together with a developed concept for an all-optical perceptron, these findings point to the possibility of realizing pure photonic NNs with potentially unmatched throughput and even energy consumption for next generation information processing hardware.

physics.app-ph↗

A Microscopic Model of Holography: Survival by the Burden of Memory

An explicit microscopic realization of the phenomenon of holography is provided by a class of simple quantum theories of a bosonic field inhabiting a d-dimensional space and experiencing a momentum dependent attractive interaction. An exact mode counting reveals a family of holographic states. In each a set of gapless modes emerges with their number equal to the area of a (d-1)-dimensional sphere. These modes store an exponentially large number of patterns within a microscopic energy gap. The resulting micro-state entropy obeys the area-law reminiscent of a black hole entropy. We study the time-evolution of the stored patterns and observe the following phenomenon: Among the degenerate micro-states the ones with heavier loaded memories survive longer than those that store emptier patterns. Thus, a state gets stabilized by the burden of its own memory. From time to time the information pattern gets off-loaded from one holographic state into another but cannot escape the system. During this process the pattern becomes highly entangled and scrambled. We suggest that this phenomenon is universal in systems with enhanced memory storage capacity, such as black holes or critical neural networks. This universality sheds an interesting light on the puzzle of why, despite the evaporation, is a black hole forced to maintain information internally for a very long time.

hep-th↗

First principles modeling of the structural, electronic, and vibrational properties of Ni$_{40}$Pd$_{40}$P$_{20}$ bulk metallic glass

The structural, vibrational, and electronic properties of Ni$_{40}$Pd$_{40}$P$_{20}$ bulk metallic glass have been studied using ${\it ab\,initio}$ molecular-dynamics simulations and total-energy optimization. Structural analyses of the resulting ${\it ab\,initio}$ models show the presence of few to no P-P bonds and two main building blocks, consisting of tricapped trigonal prism (TTP) and capped square anti-prism (CSAP) with P as the center of these blocks. The computed Pd and Ni K-edge spectra of extended x-ray absorption fine structure (EXAFS) are found to be in good agreement with experimental data. The configurational-average static structure factor and the generalized vibrational density of states are also observed to be in good agreement with experimental data.

cond-mat.dis-nn↗

Distribution of S-matrix poles for one-dimensional disordered wires

By the use of the effective non-Hermitian Hamiltonian approach to scattering we study the distribution of the scattering matrix (S-matrix) poles in one-dimensional (1D) models with various types of diagonal disorder. We consider the case of 1D tight-binding wires, with both on-site uncorrelated and correlated disorder, coupled to the continuum through leads attached to the wire edges. In particular, we focus on the location of the S-matrix poles in the complex plane as a function of the coupling strength and the disorder strength. Specific interest is paid to the super-radiance transition emerging at the perfect coupling between wire and leads. We also study the effects of correlations intentionally imposed to the wire disorder.

cond-mat.dis-nn↗

Replica Analysis for Maximization of Net Present Value

In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formulate the maximization of the net present value as an optimization problem under budget and investment concentration constraints. Furthermore, we confirm that a common approach from operations research underestimates the true maximal net present value as the maximal expected net present value by comparing our results with the maximal expected net present value as derived in operations research. Moreover, it is shown that the conventional method for estimating the net present value does not consider variance in the cash flow.

q-fin.PM↗

The critical Barkhausen avalanches in thin random-field ferromagnets with an open boundary

The interplay between the critical fluctuations and the sample geometry is investigated numerically using thin random-field ferromagnets exhibiting the field-driven magnetisation reversal on the hysteresis loop. The system is studied along the theoretical critical line in the plane of random-field disorder and thickness. The thickness is varied to consider samples of various geometry between a two-dimensional plane and a complete three-dimensional lattice with an open boundary in the direction of the growing thickness. We perform a multi-fractal analysis of the Barkhausen noise signals and scaling of the critical avalanches of the domain wall motion. Our results reveal that, for sufficiently small thickness, the sample geometry profoundly affects the dynamics by modifying the spectral segments that represent small fluctuations and promoting the time-scale dependent multi-fractality. Meanwhile, the avalanche distributions display two distinct power-law regions, in contrast to those in the two-dimensional limit, and the average avalanche shapes are asymmetric. With increasing thickness, the scaling characteristics and the multi-fractal spectrum in thicker samples gradually approach the hysteresis loop criticality in three-dimensional systems. Thin ferromagnetic films are growing in importance technologically, and our results illustrate some new features of the domain wall dynamics induced by magnetisation reversal in these systems.

cond-mat.dis-nn↗

Delocalization and ergodicity of the Anderson model on Bethe lattices

We review the state of the art on the delocalized non-ergodic regime of the Anderson model on Bethe lattices. We also present new results using Belief Propagation, which consists in solving the self-consistent recursion relations for the Green's functions directly on a given sample. This allows us to numerically study very large system sizes and to directly access observables related to the eigenfunctions and energy level statistics. In agreement with recent works, we establish the existence of a delocalized non-ergodic phase on Cayley trees. On random regular graphs instead our results indicate that ergodicity is recovered when the system size is larger than a cross-over scale $N_c (W)$, which diverges exponentially fast approaching the localization transition. This scale corresponds to the size at which the mean-level spacing becomes smaller than the Thouless energy $E_{Th} (W)$. Such energy scale, which vanishes exponentially fast approaching the localization transition, is the one below which ergodicity in the level statistics is restored in the thermodynamic limit. Remarkably, the behavior of random regular graphs below $N_c (W)$ coincides with the one found close to the root of loop-less infinite Cayley trees, {\it i.e.} only above $N_c (W)$ the effects of loops emerge and random regular graphs behave differently from Cayley trees. Our results indicate that ergodicity is recovered in the thermodynamic limit on random regular graph. However, all observables probing volumes smaller than $N_c(W)$ and times smaller than $\hbar/E_{Th} (W)$ are expected to behave as if there were an intermediate phase. Given the very fast divergence of $N_c(W)$ and $\hbar/E_{Th} (W)$ these non-ergodic effects are very pronounced in a large region preceding the localization transition, and they can be related to the intermediate phase present on Cayley trees.

cond-mat.dis-nn↗

Learning Sparse Neural Networks via Sensitivity-Driven Regularization

The ever-increasing number of parameters in deep neural networks poses challenges for memory-limited applications. Regularize-and-prune methods aim at meeting these challenges by sparsifying the network weights. In this context we quantify the output sensitivity to the parameters (i.e. their relevance to the network output) and introduce a regularization term that gradually lowers the absolute value of parameters with low sensitivity. Thus, a very large fraction of the parameters approach zero and are eventually set to zero by simple thresholding. Our method surpasses most of the recent techniques both in terms of sparsity and error rates. In some cases, the method reaches twice the sparsity obtained by other techniques at equal error rates.

cs.LG↗

Dreaming neural networks: forgetting spurious memories and reinforcing pure ones

The standard Hopfield model for associative neural networks accounts for biological Hebbian learning and acts as the harmonic oscillator for pattern recognition, however its maximal storage capacity is $α\sim 0.14$, far from the theoretical bound for symmetric networks, i.e. $α=1$. Inspired by sleeping and dreaming mechanisms in mammal brains, we propose an extension of this model displaying the standard on-line (awake) learning mechanism (that allows the storage of external information in terms of patterns) and an off-line (sleep) unlearning$\&$consolidating mechanism (that allows spurious-pattern removal and pure-pattern reinforcement): this obtained daily prescription is able to saturate the theoretical bound $α=1$, remaining also extremely robust against thermal noise. Both neural and synaptic features are analyzed both analytically and numerically. In particular, beyond obtaining a phase diagram for neural dynamics, we focus on synaptic plasticity and we give explicit prescriptions on the temporal evolution of the synaptic matrix. We analytically prove that our algorithm makes the Hebbian kernel converge with high probability to the projection matrix built over the pure stored patterns. Furthermore, we obtain a sharp and explicit estimate for the "sleep rate" in order to ensure such a convergence. Finally, we run extensive numerical simulations (mainly Monte Carlo sampling) to check the approximations underlying the analytical investigations (e.g., we developed the whole theory at the so called replica-symmetric level, as standard in the Amit-Gutfreund-Sompolinsky reference framework) and possible finite-size effects, finding overall full agreement with the theory.

cs.NE↗

Theory for Inverse Stochastic Resonance in Nature

The inverse stochastic resonance (ISR) phenomenon consists in an unexpected depression in the response of a system under external noise, e.g., as observed in the behavior of the mean-firing rate in some pacemaker neurons in the presence of moderate values of noise. A possible requirement for such behavior is the existence of a bistable regime in the behavior of these neurons. We here explore theoretically the possible emergence of this behavior in a general bistable system, and conclude on conditions the potential function which drives the dynamics must accomplish. We show that such an intriguing, and apparently widely observed, phenomenon ensues in the case of an asymmetric potential function when the high activity minimum state of the system is metastable with the largest basin of attraction and the low activity state is the global minimum with a smaller basin of attraction. We discuss on the relevance of such a picture to understand the ISR features and to predict its general appearance in other natural systems that share the requirements described here. Finally, we report another intriguing non-standard stochastic resonance in our system, which occurs in the absence of any weak signal input into the system and whose emergence can be explained, with the ISR, within our theoretical framework in this paper in terms of the shape of the potential function.

cond-mat.stat-mech↗

Many-Body Localization in Two Dimensions from Projected Entangled-Pair States

Using projected entangled-pair states (PEPS) we analyze the localization properties of two-dimensional systems on a square lattice. We compare the dynamics found for three different disorder types: (i) quenched disorder, (ii) sum of two quasi-periodic potentials along both spatial dimensions and (iii) a single quasi-periodic potential rotated with respect to the underlying lattice by a given angle. We establish the rate of loss of information, a quantity measuring the error made while simulating the dynamics, as a good hallmark of localization physics by comparing to entanglement build-up as well as the inverse participation ratio in exactly solvable limits. We find that the disorder strength needed to localize the system increases both with the dimensionality of as well as the interaction strength in the system. The first two cases of potential (i) and (ii) behave similar, while case (iii) requires larger disorder strength to localize.

cond-mat.dis-nn↗

Conformal Bootstrap Analysis for Localization: Symplectic Case

The localization phenomena due to the random potential scattering is widely discussed in the electron and photon systems, where the theoretical approach is the nonlinear $σ$ model with the replica method or with the supersymmetry. In this article, we discuss the application of the conformal bootstrap method to the localization by the small determinants. The possible correspondence to the symplectic Anderson localization is discussed.

cond-mat.dis-nn↗

A novel derivation of the Marchenko-Pastur law through analog bipartite spin-glasses

In this work we consider the {\em analog bipartite spin-glass} (or {\em real-valued restricted Boltzmann machine} in a neural network jargon), whose variables (those quenched as well as those dynamical) share standard Gaussian distributions. First, via Guerra's interpolation technique, we express its quenched free energy in terms of the natural order parameters of the theory (namely the self- and two-replica overlaps), then, we re-obtain the same result by using the replica-trick: a mandatory tribute, given the special occasion. Next, we show that the quenched free energy of this model is the functional generator of the moments of the correlation matrix among the weights connecting the two layers of the spin-glass (i.e., the Wishart matrix in random matrix theory or the Hebbian coupling in neural networks): as weights are quenched stochastic variables, this plays as a novel tool to inspect random matrices. In particular, we find that the Stieltjes transform of the spectral density of the correlation matrix is determined by the (replica-symmetric) quenched free energy of the bipartite spin-glass model. In this setup, we re-obtain the Marchenko-Pastur law in a very simple way.

cond-mat.dis-nn↗

N-vicinity method and 1D Ising Model

For a 1D Ising model, we obtained an exact expression for the spectral density in an n-vicinity of the ground state and explained why our n-vicinity method with the Gaussian approximation of the spectral density did not applicable in this case. We also found an analytical expression for the distribution of magnetization at an arbitrary temperature. When the temperature tends to zero the distribution of magnetization gradually flattens.

cond-mat.dis-nn↗

Synchronization in time-varying random networks with vanishing connectivity

A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase oscillators in which the links mediating the interactions are constantly rearranged with a characteristic timescale and, possibly, an extremely low instantaneous connectivity. We show that, provided strong coupling and fast enough rewiring are considered, the network is able to reach partial synchronization even in the vanishing connectivity limit. We also provide an intuitive analytical argument, based on the comparison between the different characteristic timescales of our system in the low connectivity regime, which is able to predict the transition to synchronization threshold with satisfactory precision. In the formal fast switching limit, finally, we argue that the onset of collective synchronization is captured by the time-averaged connectivity network. Our results may be relevant to qualitatively describe the emergence of consensus in social communities with time-varying interactions and to study the onset of collective behavior in engineered systems of mobile units with limited wireless capabilities.

nlin.CD↗

The most probable neural circuit exhibits low-dimensional sustained activity

Cortical neurons whose activity is recorded in behavioral experiments has been classified into several types such as stimulus-related neurons, delay-period neurons, and reward-related neurons. Moreover, the population activity of neurons during a reaching task can be described by dynamics in low-dimensional space. These results suggest that the low-dimensional dynamics of a few types of neurons emerge in the cerebral cortex that is trained to perform a task. This study investigates a simple neural circuit emerges with a few types of neurons. Assuming an infinite number of neurons in the circuit with connection weights drawn from a Gaussian distribution, we model the dynamics of neurons by using a kernel function. Given that the system is infinitely large, almost all capable circuits approximate the most probable circuit for the task. We simulate two delayed response tasks and a motor-pattern generation task. The model network exhibits low-dimensional dynamics in all tasks. Considering that the connection weights are drawn from a Gaussian distribution, the most probable circuit is the circuit with the smallest connection weight; that is, the simplest circuit with the simplest dynamics. Finally, we relate the dynamics to algorithmic information theory.

q-bio.NC↗

Decoupling between thermodynamics and dynamics during rejuvenation in colloidal glasses

We rejuvenate well-aged quasi-2D binary colloidal glasses by thermal cycling, and systematically measure both the statistical responses and particle-level structural evolutions during rejuvenation. While the moduli and boson peak are continuously rejuvenated with increasing number of cycles, the mean square displacement (MSD) fluctuates significantly between different groups of thermal cycles. The decoupling between the thermodynamical and dynamical evolutions suggests different microscopic origins for different bulk properties of glasses. We find that a small fraction of structural rearrangements triggered by thermal cycling could alter the whole elastic continuum and lead to the significant thermodynamic rejuvenation, while localized defects could be activated and deactivated at the positions close to the rearrangements with significantly high mobility change and hence result in the fluctuated dynamics even with only about 10% of particles as fast regions. Our results offer a comprehensive picture for the microscopic mechanisms underlying bulk glass rejuvenation, which could be readily used to refine glass properties or to formulate further statistical theories in glassy systems.

cond-mat.soft↗