arXiv subjects

Francesco Borra

Publications and source records attributed to Francesco Borra.

9 recordsLinked to original sources

arXiv2025

Bayesian network 3D event reconstruction in the Cygno optical TPC for dark matter direct detection

The CYGNO experiment is developing a high-resolution gaseous Time Projection Chamber with optical readout for directional dark matter searches. The detector uses a helium-tetrafluoromethane (He:CF$_4$ 60:40) gas mixture at atmospheric pressure and a triple Gas Electron Multiplier amplification stage, coupled with a scientific camera for high-resolution 2D imaging and fast photomultipliers for time-resolved scintillation light detection. This setup enables 3D event reconstruction: photomultipliers signals provide depth information, while the camera delivers high-precision transverse resolution. In this work, we present a Bayesian Network-based algorithm designed to reconstruct the events using only the photomultipliers signals, yielding a full 3D description of the particle trajectories. The algorithm models the light collection process probabilistically and estimates spatial and intensity parameters on the Gas Electron Multiplier plane, where light emission occurs. It is implemented within the Bayesian Analysis Toolkit and uses Markov Chain Monte Carlo sampling for posterior inference. Validation using data from the CYGNO LIME prototype shows accurate reconstruction of localized and extended tracks. Results demonstrate that the Bayesian approach enables robust 3D description and, when combined with camera data, further improves the precision of track reconstruction. This methodology represents a significant step forward in directional dark matter detection, enhancing the identification of nuclear recoil tracks with high spatial resolution.

physics.ins-det↗

arXiv2024

Task learning through stimulation-induced plasticity in neural networks

Synaptic plasticity dynamically shapes the connectivity of neural systems and is key to learning processes in the brain. To what extent the mechanisms of plasticity can be exploited to drive a neural network and make it perform some kind of computational task remains unclear. This question, relevant in a bioengineering context, can be formulated as a control problem on a high-dimensional system with strongly constrained and non-linear dynamics. We present a self-contained procedure which, through appropriate spatio-temporal stimulations of the neurons, is able to drive rate-based neural networks with arbitrary initial connectivity towards a desired functional state. We illustrate our approach on two different computational tasks: a non-linear association between multiple input stimulations and activity patterns (representing digit images), and the construction of a continuous attractor encoding a collective variable in a neural population. Our work thus provides a proof of principle for emerging paradigms of in vitro computation based on real neurons.

q-bio.NC↗

arXiv2023

Optimal tracking strategies in a turbulent flow

Pursuing a drifting target in a turbulent flow is an extremely difficult task whenever the searcher has limited propulsion and maneuvering capabilities. Even in the case when the relative distance between pursuer and target stays below the turbulent dissipative scale, the chaotic nature of the trajectory of the target represents a formidable challenge. Here, we show how to successfully apply optimal control theory to find navigation strategies that overcome chaotic dispersion and allow the searcher to reach the target in a minimal time. We contrast the results of optimal control -- which requires perfect observability and full knowledge of the dynamics of the environment -- with heuristic algorithms that are reactive -- relying on local, instantaneous information about the flow. While the latter display significantly worse performances, optimally controlled pursuers can track the target for times much longer than the typical inverse Lyapunov exponent and are considerably more robust.

physics.flu-dyn↗

arXiv2022

Taming Lagrangian Chaos with Multi-Objective Reinforcement Learning

We consider the problem of two active particles in 2D complex flows with the multi-objective goals of minimizing both the dispersion rate and the energy consumption of the pair. We approach the problem by means of Multi Objective Reinforcement Learning (MORL), combining scalarization techniques together with a Q-learning algorithm, for Lagrangian drifters that have variable swimming velocity. We show that MORL is able to find a set of trade-off solutions forming an optimal Pareto frontier. As a benchmark, we show that a set of heuristic strategies are dominated by the MORL solutions. We consider the situation in which the agents cannot update their control variables continuously, but only after a discrete (decision) time, $τ$. We show that there is a range of decision times, in between the Lyapunov time and the continuous updating limit, where Reinforcement Learning finds strategies that significantly improve over heuristics. In particular, we discuss how large decision times require enhanced knowledge of the flow, whereas for smaller $τ$ all a priori heuristic strategies become Pareto optimal.

physics.flu-dyn↗

arXiv2022

Reinforcement learning for pursuit and evasion of microswimmers at low Reynolds number

We consider a model of two competing microswimming agents engaged in a pursue-evasion task within a low-Reynolds-number environment. Agents can only perform simple maneuvers and sense hydrodynamic disturbances, which provide ambiguous (partial) information about the opponent's position and motion. We frame the problem as a zero-sum game: The pursuer has to capture the evader in the shortest time, while the evader aims at deferring capture as long as possible. We show that the agents, trained via adversarial reinforcement learning, are able to overcome partial observability by discovering increasingly complex sequences of moves and countermoves that outperform known heuristic strategies and exploit the hydrodynamic environment.

physics.flu-dyn↗

arXiv2021

Optimal collision avoidance in swarms of active Brownian particles

The effectiveness of collective navigation of biological or artificial agents requires to accommodate for contrasting requirements, such as staying in a group while avoiding close encounters and at the same time limiting the energy expenditure for manoeuvring. Here, we address this problem by considering a system of active Brownian particles in a finite two-dimensional domain and ask what is the control that realizes the optimal tradeoff between collision avoidance and control expenditure. We couch this problem in the language of optimal stochastic control theory and by means of a mean-field game approach we derive an analytic mean-field solution, characterized by a second-order phase transition in the alignment order parameter. We find that a mean-field version of a classical model for collective motion based on alignment interactions (Vicsek model) performs remarkably close to the optimal control. Our results substantiate the view that observed group behaviors may be explained as the result of optimizing multiple objectives and offer a theoretical ground for biomimetic algorithms used for artificial agents.

cond-mat.stat-mech↗

arXiv2020

Using machine-learning modelling to understand macroscopic dynamics in a system of coupled maps

Machine learning techniques not only offer efficient tools for modelling dynamical systems from data, but can also be employed as frontline investigative instruments for the underlying physics. Nontrivial information about the original dynamics, which would otherwise require sophisticated ad-hoc techniques, can be obtained by a careful usage of such methods. To illustrate this point, we consider as a case study the macroscopic motion emerging from a system of globally coupled maps. We build a coarse-grained Markov process for the macroscopic dynamics both with a machine learning approach and with a direct numerical computation of the transition probability of the coarse-grained process, and we compare the outcomes of the two analyses. Our purpose is twofold: on the one hand, we want to test the ability of the stochastic machine learning approach to describe nontrivial evolution laws, as the one considered in our study; on the other hand, we aim at gaining some insight into the physics of the macroscopic dynamics by modulating the information available to the network, we are able to infer important information about the effective dimension of the attractor, the persistence of memory effects and the multi-scale structure of the dynamics.

physics.data-an↗

arXiv2020

Effective models and predictability of chaotic multiscale systems via machine learning

We scrutinize the use of machine learning, based on reservoir computing, to build data-driven effective models of multiscale chaotic systems. We show that, for a wide scale separation, machine learning generates effective models akin to those obtained using multiscale asymptotic techniques and, remarkably, remains effective in predictability also when the scale separation is reduced. We also show that predictability can be improved by hybridizing the reservoir with an imperfect model.

nlin.AO↗

arXiv2019

Generalization from correlated sets of patterns in the perceptron

Generalization is a central aspect of learning theory. Here, we propose a framework that explores an auxiliary task-dependent notion of generalization, and attempts to quantitatively answer the following question: given two sets of patterns with a given degree of dissimilarity, how easily will a network be able to "unify" their interpretation? This is quantified by the volume of the configurations of synaptic weights that classify the two sets in a similar manner. To show the applicability of our idea in a concrete setting, we compute this quantity for the perceptron, a simple binary classifier, using the classical statistical physics approach in the replica-symmetric ansatz. In this case, we show how an analytical expression measures the "distance-based capacity", the maximum load of patterns sustainable by the network, at fixed dissimilarity between patterns and fixed allowed number of errors. This curve indicates that generalization is possible at any distance, but with decreasing capacity. We propose that a distance-based definition of generalization may be useful in numerical experiments with real-world neural networks, and to explore computationally sub-dominant sets of synaptic solutions.

cond-mat.dis-nn↗