SearcharxivSearch

arXiv subjects

Marta Chinnici

Publications and source records attributed to Marta Chinnici.

5 recordsLinked to original sources

Emotional regulation improves deep learning-based image classification

Emotion significantly influences cognition, enhancing memory and learning under certain conditions. Drawing on this principle, emotion-augmented deep learning investigates how affective states can improve neural network architectures and learning paradigms, achieving better generalization than non-emotional models. However, existing methods often rely solely on objective neurophysiological factors, neglecting the role of subjectivity in emotion. To bridge this gap, the present study introduces Emotional Regulation, a novel framework for modeling emotion in deep learning through artificial subjective experience. The method employs pre-training based on affective stimuli, balancing non-emotional and emotionally-influenced responses in downstream task optimization. Extensive experimentation was conducted in image classification, pre-training ResNet and ViT architectures on four emotional datasets, using CIFAR-10 and -100 as target benchmarks. Results reveal improvements over the aforementioned backbones, providing evidence of Emotional Regulation as a promising method for defining emotion-augmented deep learning through artificial subjective experience. Furthermore, the proposed approach overcomes the related work in image classification based on CIFAR, revealing Emotional Regulation as the new state-of-the-art in emotion-augmented deep learning for large-scale vision datasets. The study also enforces evidence of the impact of affective states in improving machine learning tasks' optimization, encouraging further investigation on emotion-inspired architectures.

cs.LG

Identifying sparse and dense sub-graphs in large graphs with a fast algorithm

Identifying the nodes of small sub-graphs with no a priori information is a hard problem. In this work, we want to find each node of a sparse sub-graph embedded in both dynamic and static background graphs, of larger average degree. We show that exploiting the summability over several background realizations of the Estrada-Benzi communicability and the Krylov approximation of the matrix exponential, it is possible to recover the sub-graph with a fast algorithm with computational complexity O(N n). Relaxing the problem to complete sub-graphs, the same performance is obtained with a single background. The worst case complexity for the single background is O(n log(n)).

cs.DS

Node seniority ranking

Recent advances in graph theory suggest that is possible to identify the oldest nodes of a network using only the graph topology. Here we report on applications to heterogeneous real world networks. To this end, and in order to gain new insights, we propose the theoretical framework of the Estrada communicability. We apply it to two technological networks (an underground, the diffusion of a software worm in a LAN) and to a third network representing a cholera outbreak. In spite of errors introduced in the adjacency matrix of their graphs, the identification of the oldest nodes is feasible, within a small margin of error, and extremely simple. Utilizations include the search of the initial disease-spreader (patient zero problem), rumors in social networks, malware in computer networks, triggering events in blackouts, oldest urban sites recognition.

physics.soc-ph

Predicting the sources of an outbreak with a spectral technique

The epidemic spreading of a disease can be described by a contact network whose nodes are persons or centers of contagion and links heterogeneous relations among them. We provide a procedure to identify multiple sources of an outbreak or their closer neighbors. Our methodology is based on a simple spectral technique requiring only the knowledge of the undirected contact graph. The algorithm is tested on a variety of graphs collected from outbreaks including fluency, H5N1, Tbc, in urban and rural areas. Results show that the spectral technique is able to identify the source nodes if the graph approximates a tree sufficiently.

math-ph

A PCG Implementation of an Elliptic Kernel in an Ocean Global Circulation Model Based on GPU Libraries

In this paper an inverse preconditioner for the numerical solution of an elliptic Laplace prob- lem of a global circulation ocean model is presented. The inverse preconditiong technique is adopted in order to efficiently compute the numerical solution of the elliptic kernel by using the Conjugate Gradient (CG) method. We show how the performance and the rate of conver- gence of the solver are linked to the discretized grid resolution and to the Laplace coefficients of the oceanic model. Finally, we describe an easy-to-implement version of the solver on the Graphical Processing Units (GPUs) by means of scientific computing libraries and we discuss its performance.

math.NA