SearcharxivSearch

arXiv subjects

Francesco Rossi

Publications and source records attributed to Francesco Rossi.

At least 19 recordsLinked to original sources

Far from the Crowd: Scalable Self-Supervised Learning via Geographic Isolation

Self-supervised pretraining on remote sensing imagery typically treats all samples as equally informative, despite large variability in geographic and visual structure. We propose a curriculum learning strategy for self-supervised Earth observation that ranks samples by geographic isolation, a label-free proxy derived entirely from geolocation metadata already present in geospatial datasets, requiring no image decoding, no model feedback, and no manual annotation. Unlike visual complexity proxies, it scales as O(D log D) with dataset size D and is well-defined for both contrastive and reconstructive objectives. We integrate the proposed measure into MoCoV2 and MAE pretraining and evaluate across three downstream tasks from CopernicusBench (BigEarthNet, DFC-2020, LCZ). Our curriculum reaches baseline final-epoch performance using as few as 20% of the training budget (MAE) and at most 40% (MoCo) of the training budget, and improves final downstream performance by up to +5 mAP on BigEarthNet, with gains of 1-5 points across benchmarks, matching visual-complexity curricula while reducing pre-computation cost by more than 140x (4 s vs. 568 s on SSL4EO). A CKA and effective-rank analysis further reveals that curriculum-trained encoders develop higher-dimensional, more uniformly utilized embedding spaces throughout training.

cs.CV

Exponential convergence of multiagent systems with lack of connection

Finding conditions ensuring consensus, i.e. convergence to a common value, for a networked system is of crucial interest, both for theoretical reasons and applications. This goal is harder to achieve when connections between agents are temporarily lost. Here, we prove that known conditions (introduced by Moreau) ensure an exponential convergence to consensus, with explicit rate of convergence. The key result is related to the length of the graph (i.e. the number of connections to reach a common agent): if this is large, then convergence is slow. This general result also provides conditions for convergence of second-order cooperative systems with lack of connections.

math.OC

Optimizing Multi-Task Learning for Accurate Spacecraft Pose Estimation

Accurate satellite pose estimation is crucial for autonomous guidance, navigation, and control (GNC) systems in in-orbit servicing (IOS) missions. This paper explores the impact of different tasks within a multi-task learning (MTL) framework for satellite pose estimation using monocular images. By integrating tasks such as direct pose estimation, keypoint prediction, object localization, and segmentation into a single network, the study aims to evaluate the reciprocal influence between tasks by testing different multi-task configurations thanks to the modularity of the convolutional neural network (CNN) used in this work. The trends of mutual bias between the analyzed tasks are found by employing different weighting strategies to further test the robustness of the findings. A synthetic dataset was developed to train and test the MTL network. Results indicate that direct pose estimation and heatmap-based pose estimation positively influence each other in general, while both the bounding box and segmentation tasks do not provide significant contributions and tend to degrade the overall estimation accuracy.

cs.LG

Consensus in Multiagent Systems under communication failure

We consider multi-agent systems with cooperative interactions and study the convergence to consensus in the case of time-dependent connections, with possible communication failure. We prove a new condition ensuring consensus: we define a graph in which directed arrows correspond to connection functions that converge (in the weak sense) to some function with a positive integral on all intervals of the form $[t,+\infty)$. If the graph has a node reachable from all other indices, i.e.~``globally reachable'', then the system converges to consensus. We show that this requirement generalizes some known sufficient conditions for convergence, such as Moreau's or the Persistent Excitation one. We also give a second new condition, transversal to the known ones: total connectedness of the undirected graph formed by the non-vanishing of limiting functions.

math.OC

Consensus and Flocking under Communication Failure

For networked systems, Persistent Excitation and Integral Scrambling Condition are conditions ensuring that communication failures between agents can occur, but a minimal level of service is ensured. We consider cooperative multi-agent systems satisfying either of such conditions. For first-order systems, we prove that consensus is attained. For second-order systems, flocking is attained under a standard condition of nonintegrability of the interaction function. In both cases and under both conditions, the original goal is reached under no additional hypotheses on the system with respect to the case of no communication failures.

math.OC

Machine Learning in Space: Surveying the Robustness of on-board ML models to Radiation

Modern spacecraft are increasingly relying on machine learning (ML). However, physical equipment in space is subject to various natural hazards, such as radiation, which may inhibit the correct operation of computing devices. Despite plenty of evidence showing the damage that naturally-induced faults can cause to ML-related hardware, we observe that the effects of radiation on ML models for space applications are not well-studied. This is a problem: without understanding how ML models are affected by these natural phenomena, it is uncertain "where to start from" to develop radiation-tolerant ML software. As ML researchers, we attempt to tackle this dilemma. By partnering up with space-industry practitioners specialized in ML, we perform a reflective analysis of the state of the art. We provide factual evidence that prior work did not thoroughly examine the impact of natural hazards on ML models meant for spacecraft. Then, through a "negative result", we show that some existing open-source technologies can hardly be used by researchers to study the effects of radiation for some applications of ML in satellites. As a constructive step forward, we perform simple experiments showcasing how to leverage current frameworks to assess the robustness of practical ML models for cloud detection against radiation-induced faults. Our evaluation reveals that not all faults are as devastating as claimed by some prior work. By publicly releasing our resources, we provide a foothold -- usable by researchers without access to spacecraft -- for spearheading development of space-tolerant ML models.

cs.LG

On the continuum limit of the Follow-the-Leader model and its stability

We consider the Follow-the-Leader (FtL) model and study which properties of the initial positioning of the vehicles ensure its convergence to the classical Lighthill-Whitham-Richards (LWR) model for traffic flow. Robustness properties of both FtL and LWR models with respect to the initial discretization schemes are investigated. Some numerical simulations are also discussed.

math.CA

Consensus under Persistence Excitation

We prove that a first-order cooperative system of interacting agents converges to consensus if the so-called Persistence Excitation condition holds. This condition requires that the interaction function between any pair of agents satisfies an integral lower bound. The interpretation is that the interaction needs to ensure a minimal amount of service.

math.OC

Stabilization via localized controls in nonlocal models of crowd dynamics

We consider a control system driven by a nonlocal continuity equation. Admissible controls are Lipschitz vector fields acting inside a fixed open set. We demonstrate that small perturbations of the initial measure, traced along Wasserstein geodesics, may be neutralized by admissible controls. More specifically, initial perturbations of order $\varepsilon$ can be reduced to order $\varepsilon^{1+κ}$, where $κ$ is a positive constant.

math.OC

Trajectory stabilization of nonlocal continuity equations by localized controls

We discuss stabilization around trajectories of the continuity equation with nonlocal vector fields, where the control is localized, i.e., it acts on a fixed subset of the configuration space. We first show that the correct definition of stabilization is the following: given an initial error of order $\varepsilon$, measured in Wasserstein distance, one can improve the final error to an order $\varepsilon^{1+κ}$ with $κ>0$. We then prove the main result: assuming that the trajectory crosses the subset of control action, stabilization can be achieved. The key problem lies in regularity issues: the reference trajectory needs to be absolutely continuous, while the initial state to be stabilized needs to be realized by a small Lipschitz perturbation or being in a very small neighborhood of it.

math.OC

Jointly Equivariant Dynamics for Interacting Particles

Let a finite set of interacting particles be given, together with a symmetry Lie group $G$. Here we describe all possible dynamics that are jointly equivariant with respect to the action of $G$. This is relevant e.g., when one aims to describe collective dynamics that are independent of any coordinate change or external influence. We particularize the results to some key examples, i.e. for the most basic low dimensional symmetries that appear in collective dynamics on manifolds.

math.DS

Vanishing viscosity in mean-field optimal control

We show the existence of Lipschitz-in-space optimal controls for a class of mean-field control problems with dynamics given by a non-local continuity equation. The proof relies on a vanishing viscosity method: we prove the convergence of the same problem where a diffusion term is added, with a small viscosity parameter. By using stochastic optimal control, we first show the existence of a sequence of optimal controls for the problem with diffusion. We then build the optimizer of the original problem by letting the viscosity parameter go to zero.

math.OC

Retracing Reconstruction. Establishing an analytical method for the comprehension and systematisation of urban metamorphosis following extreme events

The problem of identifying models of post-disaster reconstruction is an issue that has been dealt with in depth in a number of works, mostly dedicated to individual cases or to the comparison of models. There are also a number of works that have attempted a systematisation on an historiographic basis. To date, however, there is no overall work aimed at constructing a quantitative method for evaluating and comparing reconstruction experiences. This article proposes to establish a scientific method for the systematic classification of post-disaster reconstructions, based on data analysis. The method consists of four phases: the redrawing of cases with a precise replicable technique; the choice of indicators; the measurement of urban development; the classification of cases. The method is applied to cases that are comparable with each other in terms of type of event and period: we have chosen post-World War II reconstructions in Europe given the larger availability of documentation. The paper leads both to the consolidation of the model as effective and replicable and to the construction of the application, which revises the qualitative classification of most of the addressed cases.

physics.soc-ph

Obstructions to extension of Wasserstein distances for variable masses

We study the possibility of defining a distance on the whole space of measures, with the property that the distance between two measures having the same mass is the Wasserstein distance, up to a scaling factor. We prove that, under very weak and natural conditions, if the base space is unbounded, then the scaling factor must be constant, independently of the mass. Moreover, no such distance can exist, if we include the zero measure. Instead, we provide examples with non-constant scaling factors for the case of bounded base spaces.

math.MG

Controlling swarms towards flocks and mills

Self-organization and control around flocks and mills is studied for second-order swarming systems involving self-propulsion and potential terms. It is shown that through the action of constrained control, is it possible to control any initial configuration to a flock or a mill. The proof builds on an appropriate combination of several arguments: LaSalle invariance principle and Lyapunov-like decreasing functionals, control linearization techniques, and quasi-static deformations. A stability analysis of the second-order system guides the design of feedback laws for the stabilization to flock and mills, which are also assessed computationally.

math.OC

On the Lebesgue measure of the boundary of the evoluted set

The evoluted set is the set of configurations reached from an initial set via a fixed flow for all times in a fixed interval. We find conditions on the initial set and on the flow ensuring that the evoluted set has negligible boundary (i.e. its Lebesgue measure is zero). We also provide several counterexample showing that the hypotheses of our theorem are close to sharp.

math.OC

On-device neural speech synthesis

Recent advances in text-to-speech (TTS) synthesis, such as Tacotron and WaveRNN, have made it possible to construct a fully neural network based TTS system, by coupling the two components together. Such a system is conceptually simple as it only takes grapheme or phoneme input, uses Mel-spectrogram as an intermediate feature, and directly generates speech samples. The system achieves quality equal or close to natural speech. However, the high computational cost of the system and issues with robustness have limited their usage in real-world speech synthesis applications and products. In this paper, we present key modeling improvements and optimization strategies that enable deploying these models, not only on GPU servers, but also on mobile devices. The proposed system can generate high-quality 24 kHz speech at 5x faster than real time on server and 3x faster than real time on mobile devices.

eess.AS

Variance Optimization and Control Regularity for Mean-Field Dynamics

We study a family of optimal control problems in which one aims at minimizing a cost that mixes a quadratic control penalization and the variance of the system, both for finitely many agents and for the mean-field dynamics as their number goes to infinity. While solutions of the discrete problem always exist in a unique and explicit form, the behavior of their macroscopic counterparts is very sensitive to the magnitude of the time horizon and penalization parameter. When one minimizes the final variance, there always exists a Lipschitz-in-space optimal controls for the infinite dimensional problem, which can be obtained as a suitable extension of the optimal controls for the finite-dimensional problems. The same holds true for variance maximizations whenever the time horizon is sufficiently small. On the contrary, for large final times (or equivalently for small penalizations of the control cost), it can be proven that there does not exist Lipschitz-regular optimal controls for the macroscopic problem.

math.OC