SearcharxivSearch

arXiv subjects

Alberto Lovison

Publications and source records attributed to Alberto Lovison.

6 recordsLinked to original sources

A new mathematical model for brain memory working. Optimal control behavior for Hopfield networks

Recent works have highlighted the need for a new dynamical paradigm in the modeling of brain function and evolution. Specifically, these models should incorporate non-constant and asymmetric synaptic weights $T_{ij}$ in the neuron-neuron interaction matrix, moving beyond the classical Hopfield framework. Krotov and Hopfield proposed a non-constant yet symmetric model, resulting in a vector field that describes gradient-type dynamics, which includes a Lyapunov-like energy function. Firstly, we will outline the general conditions for generating a Hopfield-like vector field of gradient type, recovering the Krotov-Hopfield condition as a particular case. Secondly, we address the issue of symmetry, which we abandon for two key physiological reasons: (1) actual neural connections have a distinctly directional character (axons and dendrites), and (2) the gradient structure derived from symmetry forces the dynamics towards stationary points, leading for every pattern to a recognition or to a free association, if the equilibrium is rather far from the input. We propose a novel model that incorporates a set of limited but variable controls $|\xi_{ij}|\leq K$, which are used to adjust an initially constant interaction matrix, $T_{ij}=A_{ij}+\xi_{ij}$ according to a controlled variational functional. We simulate three potential outcomes when a pattern is submitted: (1) if the dynamics converges to an existing stationary point without activating controls, the system has \emph{recognized} an incoming pattern; (2) if a new stationary point is reached through control activation, the system has \emph{learned} a new pattern; and (3) if the dynamics \emph{wanders}, the system is unable to recognize or learn the submitted pattern. An additional feature (4) models the processes of \emph{forgetting and restoring} memory. Numerical simulations on a basic neural network model support the theoretical results.

q-bio.NC

Approximate Inertial Manifold Approach to Non-Equilibrium Thermodynamics

In this paper a reaction-diffusion type equation is the starting point for setting up a genuine thermodynamic reduction, i.e. involving a finite number of parameters or collective variables, of the initial system. This program is carried over by firstly operating a finite Lyapunov-Schmidt reduction of the cited reaction-diffusion equation when reformulated as a variational problem. In this way we gain an approximate finite-dimensional o.d.e. description of the initial system which preserves the gradient structure of the original one and that is similar to the approximate inertial manifold description of a p.d.e. introduced by Temam and coworkers. Secondly, we resort to the stochastic version of the o.d.e., taking into account in this way the uncertainty (loss of information) introduced with the above mentioned reduction. We study this reduced stochastic system using classical tools from large deviations, viscosity solutions and weak KAM Hamilton-Jacobi theory. In the last part we highlight some essential similarities existing between our approach and the comprehensive treatment non equilibrium thermodynamics given by Jona-Lasinio and coworkers. The starting point of their axiomatic theory --motivated by large deviations description of lattice gas models-- of systems in a stationary non equilibrium state is precisely a conservation/balance law which is akin to our simple model of reaction-diffusion equation.

math-ph

New activity pattern in human interactive dynamics

We investigate the response function of human agents as demonstrated by written correspondence, uncovering a new universal pattern for how the reactive dynamics of individuals is distributed across the set of each agent's contacts. In long-term empirical data on email, we find that the set of response times considered separately for the messages to each different correspondent of a given writer, generate a family of heavy-tailed distributions, which have largely the same features for all agents, and whose characteristic times grow exponentially with the rank of each correspondent. We furthermore show that this universal behavioral pattern emerges robustly by considering weighted moving averages of the priority-conditioned response-time probabilities generated by a basic prioritization model. Our findings clarify how the range of priorities in the inputs from one's environment underpin and shape the dynamics of agents embedded in a net of reactive relations. These newly revealed activity patterns might be present in other general interactive environments, and constrain future models of communication and interaction networks, affecting their architecture and evolution.

physics.soc-ph

Hierarchical stratification of Pareto sets

In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the individual functions and the $(k-1)$-dimensional facets are the Pareto optimal set of $k$ functions subproblems. Such a hierarchy of submanifolds is a geometrical object called stratification and the union of such manifolds, in this case the set of Pareto optima, is called a stratified set. We discuss how these geometrical structures generalize in the non convex cases, we survey the known results and deduce possible suggestions for the design of dedicated optimization strategies.

math.OC

Finite Mechanical Proxies for a Class of Reducible Continuum Systems

We present the exact finite reduction of a class of nonlinearly perturbed wave equations, based on the Amann-Conley-Zehnder paradigm. By solving an inverse eigenvalue problem, we establish an equivalence between the spectral finite description derived from A-C-Z and a discrete mechanical model, a well definite finite spring-mass system. By doing so, we decrypt the abstract information encoded in the finite reduction and obtain a physically sound proxy for the continuous problem.

math-ph

Singular Continuation: Generating Piece-wise Linear Approximations to Pareto Sets via Global Analysis

We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of the Pareto sets, approximating Pareto optima by means of simplicial complexes. The method distinguishes the hierarchy between singular set, Pareto critical set and stable Pareto critical set, and can handle the problem of superposition of local Pareto fronts, occurring in the general nonconvex case. Furthermore, a quadratic convergence result in a suitable set-wise sense is proven and tested in a number of numerical examples.

math.OC