Search

Graphs and hypergraphs provide powerful abstractions for modeling interactions among a set of entities of interest and have been attracting a growing interest in the literature thanks to many successful applications in several fields. In particular, they are rapidly expanding in domains such as chemistry and biology, especially in the areas of drug discovery and molecule generation. One of the areas witnessing the fasted growth is the chemical reactions field, where chemical reactions can be naturally encoded as directed hyperedges of a hypergraph. In this paper, we address the chemical reaction classification problem by introducing the notation of a Directed Line Graph (DGL) associated with a given directed hypergraph. On top of it, we build the Directed Line Graph Network (DLGNet), the first spectral-based Graph Neural Network (GNN) expressly designed to operate on a hypergraph via its DLG transformation. The foundation of DLGNet is a novel Hermitian matrix, the Directed Line Graph Laplacian, which compactly encodes the directionality of the interactions taking place within the directed hyperedges of the hypergraph thanks to the DLG representation. The Directed Line Graph Laplacian enjoys many desirable properties, including admitting an eigenvalue decomposition and being positive semidefinite, which make it well-suited for its adoption within a spectral-based GNN. Through extensive experiments on chemical reaction datasets, we show that DGLNet significantly outperforms the existing approaches, achieving on a collection of real-world datasets an average relative-percentage-difference improvement of 33.01%, with a maximum improvement of 37.71%.

We study non-equilibrium properties of a chain of $N$ oscillators with both long-ranged harmonic interactions and long-range conservative noise that exchange momenta of particle pairs. We derive exact expressions for the (deterministic) energy-current auto-correlation at equilibrium, based on the kinetic approximation of the normal mode dynamics. In all cases the decay is algebraic in the thermodynamic limit. We distinguish four distinct regimes of correlation decay depending on the exponents controlling the range of deterministic and stochastic interactions. Surprisingly, we find that long-range noise breaks down the long-range correlations characteristic of low dimensional models, suggesting a normal regime in which heat transport becomes diffusive. For finite systems, we do also derive exact expressions for the finite-size corrections to the algebraic decay of the correlation. In certain regimes, these corrections are considerably large, rendering hard the estimation of transport properties from numerical data for the finite chains. Our results are tested against numerical simulations, performed with an efficient algorithm., Comment: Submitted to Journal of Statistical Physics

Bayesian Neural Networks represent a fascinating confluence of deep learning and probabilistic reasoning, offering a compelling framework for understanding uncertainty in complex predictive models. In this paper, we investigate the use of the preconditioned Crank-Nicolson algorithm and its Langevin version to sample from the reparametrised posterior distribution of the weights as the widths of Bayesian Neural Networks grow larger. In addition to being robust in the infinite-dimensional setting, we prove that the acceptance probabilities of the proposed methods approach 1 as the width of the network increases, independently of any stepsize tuning. Moreover, we examine and compare how the mixing speeds of the underdamped Langevin Monte Carlo, the preconditioned Crank-Nicolson and the preconditioned Crank-Nicolson Langevin samplers are influenced by changes in the network width in some real-world cases. Our findings suggest that, in wide Bayesian Neural Networks configurations, the preconditioned Crank-Nicolson method allows for more efficient sampling of the reparametrised posterior distribution, as evidenced by a higher effective sample size and improved diagnostic results compared with the other analysed algorithms.

Introduction. Here we reported the virological, entomological and epidemiological characteristics of the large autochthonous outbreak of dengue (DENV) occurred in a small village of the Lombardy region (Northern Italy) during summer 2023. Methods. After the diagnosis of the first autochthonous case on 18 August 2023, public health measures, including epidemiological investigation and vector control measures, were carried out. A serological screening for DENV antibodies detection was offered to the population. In the case of positive DENV IgM, a second sample was collected to detect DENV RNA and verify seroconversion. Entomological and epidemiological investigations were also performed. A modeling analysis was conducted to estimate the dengue generation time, transmission potential, distance of transmission, and assess diagnostic delays. Results. Overall, 416 subjects participated to the screening program and 20 were identified as DENV-1 cases (15 confirmed and 5 probable). In addition, DENV-1 infection was diagnosed in 24 symptomatic subjects referred to the local Emergency Room Department for suggestive symptoms and 1 case was identified through blood donation screening. The average generation time was estimated to be 18.3 days (95% CI: 13.1-23.5 days). R0 was estimated at 1.31 (95% CI: 0.76-1.98); 90% of transmission occurred within 500m. Entomological investigations performed in 46 pools of mosquitoes revealed the presence of only one positive pool for DENV-1. Discussion. This report highlights the importance of synergic surveillance, including virological, entomological and public health measures to control the spread of arboviral infections.

Hole spin qubits are rapidly emerging as the workhorse of semiconducting quantum processors because of their large spin-orbit interaction, enabling fast all-electric operations at low power. However, spin-orbit interaction also causes non-uniformities in devices, resulting in locally varying qubit energies and site-dependent anisotropies. While these anisotropies can be used to drive single-spins, if not properly harnessed, they can hinder the path toward large-scale quantum processors. Here, we report on a qubit in planar germanium, where we control the anisotropy of two spins in a double quantum dot. By characterising microwave-driven singlet-triplet qubits, we show two distinct operating regimes depending on the magnetic field direction. For in-plane fields, the two spins are largely anisotropic, enabling to measure all the available transitions; coherence times exceeding 3 $\mu$s are extracted. For out-of-plane fields, they have an isotropic response but preserve the substantial energy difference required to address the singlet-triplet qubit. Even in this field direction, where the qubit lifetime is strongly affected by nuclear spins, we find 400 ns coherence times. Our work adds a valuable tool to investigate and harness the anisotropy of spin qubits and can be implemented in any large-scale NxN device, facilitating the path towards scalable quantum processors.

In the current era of quantum computing, robust and efficient tools are essential to bridge the gap between simulations and quantum hardware execution. In this work, we introduce a machine learning approach to characterize the noise impacting a quantum chip and emulate it during simulations. Our algorithm leverages reinforcement learning, offering increased flexibility in reproducing various noise models compared to conventional techniques such as randomized benchmarking or heuristic noise models. The effectiveness of the RL agent has been validated through simulations and testing on real superconducting qubits. Additionally, we provide practical use-case examples for the study of renowned quantum algorithms., Comment: 13 pages, 9 figures

We introduce a new class of functional correlated disordered materials, termed Gyromorphs, which uniquely combine liquid-like translational disorder with quasi-long-range rotational order, induced by a ring of $G$ delta peaks in their structure factor. We generate gyromorphs in $2d$ and $3d$ by spectral optimization methods, verifying that they display strong discrete rotational order but no long-range translational order, while maintaining rotational isotropy at short range for sufficiently large $G$. We show that they are distinct from quasicrystals, which we argue are akin to Fourier ''duals'' of gyromorphs. Using a coupled dipole approximation, we show that these structures outperform quasicrystals, stealthy hyperuniformity, and Vogel spirals in the formation of isotropic bandgaps in $2d$, for both scalar and vector waves, and open complete isotropic bandgaps in $3d$. Finally, we introduce ''polygyromorphs'' with several rotational symmetries at different length scales (i.e., multiple rings of delta peaks), enabling the formation of multiple bandgaps in a single structure, thereby paving the way for fine control over optical properties., Comment: 9 pages, 10 figures including appendix

We study the Mabuchi functional associated to a big cohomology class. We define an invariant associated to transcendental Fujita approximations, whose vanishing is related to the Yau-Tian Donaldson conjecture. Assuming vanishing (finiteness) of this invariant we establish (almost) convexity along weak geodesics. As an application, we give an explicit expression of the distance $d_p$ in the big setting for finite entropy potentials., Comment: 37 pages

This paper presents MEMROC (Multi-Eye to Mobile RObot Calibration), a novel motion-based calibration method that simplifies the process of accurately calibrating multiple cameras relative to a mobile robot's reference frame. MEMROC utilizes a known calibration pattern to facilitate accurate calibration with a lower number of images during the optimization process. Additionally, it leverages robust ground plane detection for comprehensive 6-DoF extrinsic calibration, overcoming a critical limitation of many existing methods that struggle to estimate the complete camera pose. The proposed method addresses the need for frequent recalibration in dynamic environments, where cameras may shift slightly or alter their positions due to daily usage, operational adjustments, or vibrations from mobile robot movements. MEMROC exhibits remarkable robustness to noisy odometry data, requiring minimal calibration input data. This combination makes it highly suitable for daily operations involving mobile robots. A comprehensive set of experiments on both synthetic and real data proves MEMROC's efficiency, surpassing existing state-of-the-art methods in terms of accuracy, robustness, and ease of use. To facilitate further research, we have made our code publicly available at https://github.com/davidea97/MEMROC.git.

We present multi-epoch optical spectropolarimetric and imaging polarimetric observations of the nearby Type II supernova (SN) 2023ixf discovered in M101 at a distance of 6.85 Mpc. The first imaging polarimetric observations were taken +2.33 days (60085.08 MJD) after the explosion, while the last imaging polarimetric data points (+73.19 and +76.19 days) were acquired after the fall from the light curve plateau. At +2.33 days there is strong evidence of circumstellar material (CSM) interaction in the spectra and the light curve. A significant level of polarization $P_r = 0.88\pm 0.06 \% $ seen during this phase indicates that this CSM is aspherical. We find that the polarization evolves with time toward the interstellar polarization level ($0.35\%$) during the photospheric phase, which suggests that the recombination photosphere is spherically symmetric. There is a jump in polarization ($P_r =0.65 \pm 0.08 \% $) at +73.19 days when the light curve falls from the plateau. This is a phase where polarimetric data is sensitive to non-spherical inner ejecta or a decrease in optical depth into the single scattering regime. We also present spectropolarimetric data that reveal line (de)polarization during most of the observed epochs. In addition, at +14.50 days we see an "inverse P Cygn" profile in the H and He line polarization, which clearly indicates the presence of asymmetrically distributed material overlying the photosphere. The overall temporal evolution of polarization is typical for Type II SNe, but the high level of polarization during the rising phase has only been observed in SN 2023ixf., Comment: 14 pages, 7 figures, submitted to ApJL, comments welcome

We deal with the problem of gradient estimation for stochastic differentiable relaxations of algorithms, operators, simulators, and other non-differentiable functions. Stochastic smoothing conventionally perturbs the input of a non-differentiable function with a differentiable density distribution with full support, smoothing it and enabling gradient estimation. Our theory starts at first principles to derive stochastic smoothing with reduced assumptions, without requiring a differentiable density nor full support, and we present a general framework for relaxation and gradient estimation of non-differentiable black-box functions $f:\mathbb{R}^n\to\mathbb{R}^m$. We develop variance reduction for gradient estimation from 3 orthogonal perspectives. Empirically, we benchmark 6 distributions and up to 24 variance reduction strategies for differentiable sorting and ranking, differentiable shortest-paths on graphs, differentiable rendering for pose estimation, as well as differentiable cryo-ET simulations.

Algorithmic Recourse (AR) aims to provide users with actionable steps to overturn unfavourable decisions made by machine learning predictors. However, these actions often take time to implement (e.g., getting a degree can take years), and their effects may vary as the world evolves. Thus, it is natural to ask for recourse that remains valid in a dynamic environment. In this paper, we study the robustness of algorithmic recourse over time by casting the problem through the lens of causality. We demonstrate theoretically and empirically that (even robust) causal AR methods can fail over time except in the - unlikely - case that the world is stationary. Even more critically, unless the world is fully deterministic, counterfactual AR cannot be solved optimally. To account for this, we propose a simple yet effective algorithm for temporal AR that explicitly accounts for time. Our simulations on synthetic and realistic datasets show how considering time produces more resilient solutions to potential trends in the data distribution.

The rise of online platforms exacerbated the spread of hate speech, demanding scalable and effective detection. However, the accuracy of hate speech detection systems heavily relies on human-labeled data, which is inherently susceptible to biases. While previous work has examined the issue, the interplay between the characteristics of the annotator and those of the target of the hate are still unexplored. We fill this gap by leveraging an extensive dataset with rich socio-demographic information of both annotators and targets, uncovering how human biases manifest in relation to the target's attributes. Our analysis surfaces the presence of widespread biases, which we quantitatively describe and characterize based on their intensity and prevalence, revealing marked differences. Furthermore, we compare human biases with those exhibited by persona-based LLMs. Our findings indicate that while persona-based LLMs do exhibit biases, these differ significantly from those of human annotators. Overall, our work offers new and nuanced results on human biases in hate speech annotations, as well as fresh insights into the design of AI-driven hate speech detection systems.

Among sub-optimal Multi-Agent Path Finding (MAPF) solvers, rule-based algorithms are particularly appealing since they are complete. Even in crowded scenarios, they allow finding a feasible solution that brings each agent to its target, preventing deadlock situations. However, generally, rule-based algorithms provide much longer solutions than the shortest one. The main contribution of this paper is introducing a new local search procedure for improving a known feasible solution. We start from a feasible sub-optimal solution, and perform a local search in a neighborhood of this solution. If we are able to find a shorter solution, we repeat this procedure until the solution cannot be shortened anymore. At the end, we obtain a solution that is still sub-optimal, but generally of much better quality than the initial one. We propose two different local search policies. In the first, we explore all paths in which the agents positions remain in a neighborhood of the corresponding positions of the reference solution. In the second, we set an upper limit to the number of agents that can change their path with respect to the reference solution. These two different policies can also be alternated. We explore the neighborhoods by dynamic programming. The fact that our search is local is fundamental in terms of time complexity. Indeed, if the dynamic programming approach is applied to the full MAPF problem, the number of explored states grows exponentially with the number of agents. Instead, the introduction of a locality constraint allows exploring the neghborhoods in a time that grows polynomially with respect to the number of agents., Comment: arXiv admin note: text overlap with arXiv:2304.01765

This paper presents a three-layered architecture that enables stylistic locomotion with online contact location adjustment. Our method combines an autoregressive Deep Neural Network (DNN) acting as a trajectory generation layer with a model-based trajectory adjustment and trajectory control layers. The DNN produces centroidal and postural references serving as an initial guess and regularizer for the other layers. Being the DNN trained on human motion capture data, the resulting robot motion exhibits locomotion patterns, resembling a human walking style. The trajectory adjustment layer utilizes non-linear optimization to ensure dynamically feasible center of mass (CoM) motion while addressing step adjustments. We compare two implementations of the trajectory adjustment layer: one as a receding horizon planner (RHP) and the other as a model predictive controller (MPC). To enhance MPC performance, we introduce a Kalman filter to reduce measurement noise. The filter parameters are automatically tuned with a Genetic Algorithm. Experimental results on the ergoCub humanoid robot demonstrate the system's ability to prevent falls, replicate human walking styles, and withstand disturbances up to 68 Newton. Website: https://sites.google.com/view/dnn-mpc-walking Youtube video: https://www.youtube.com/watch?v=x3tzEfxO-xQ, Comment: This paper has been accepted for publication at the 2024 IEEE-RAS International Conference on Humanoid Robots,(Humanoids) Nancy, France, 2024

We demonstrate dual-frequency stabilization of a hybrid-integrated multi-channel laser to an integrated high Q-factor silicon nitride (SiN) coil resonator with more than 40 dB frequency noise suppression. The frequency locked channels are utilized for a proof-of-concept fiber sensing experiment., Comment: 4 pages, 3 figures, European Conference on Optical Communication (ECOC)

Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such operations can be readily implemented with scalable photonic hardware: resource states can be deterministically generated by quantum emitters and fusions require only shallow linear-optical circuits. Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters. We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well below coherence times for typical spin-photon interfaces. Our construction and analysis provide guidelines for the development of photonic quantum hardware targeting fault-tolerant applications with quantum emitters.

The landscape of cyber threats grows more complex by the day. Advanced Persistent Threats carry out systematic attack campaigns against which cybersecurity practitioners must defend. Examples of such organized attacks are operations Dream Job, Wocao, WannaCry or the SolarWinds Compromise. To evaluate which risks are most threatening, and which campaigns to prioritize against when defending, cybersecurity experts must be equipped with the right toolbox. In particular, they must be able to (a) obtain likelihood values for each attack campaign recorded in the wild and (b) reliably and transparently operationalize these values to carry out quantitative comparisons among campaigns. This will allow security experts to perform quantitatively-informed decision making that is transparent and accountable. In this paper we construct such a framework by: (1) quantifying the likelihood of attack campaigns via data-driven procedures on the MITRE knowledge base and (2) introducing a methodology for automatic modelling of MITRE intelligence data: this is complete in the sense that it captures any attack campaign via template attack tree models. (3) We further propose a computational framework to carry out this comparisons based on the cATM formal logic, and implement this into an open-source Python tool. Finally, we validate our approach by quantifying the likelihood of all MITRE campaigns, and comparing the likelihood of the Wocao and Dream Job MITRE campaigns -- generated with our proposed approach -- against "ad hoc" traditionally-built attack tree models, demonstrating how our methodology is substantially lighter in modelling effort, and still capable of capturing all the quantitative relevant data.

We employ dynamical mean-field theory (DMFT) combined with density functional theory (DFT) and the non-equilibrium Green's function technique to investigate the steady-state transport properties of an Fe/MgO/Fe magnetic tunnel junction (MTJ), focusing on the impact of dynamical electron correlations on the Fe $3d$ orbitals. By applying the rigid shift approximation, we extend the calculations from zero- to finite-bias in a simple and computationally efficient manner, obtaining the bias-dependent electronic structure and current-versus-voltage characteristic curve in both the parallel and antiparallel configurations. In particular, we find that dynamical electron correlation manifests as a reduction in the spin splitting of the Fe $3d_{z^2}$ state compared to DFT predictions and introduces a finite relaxation time. The impact of these effects on the transport properties, however, varies significantly between magnetic configurations. In the parallel configuration, the characteristic curves obtained with DFT and DMFT are similar, as the transport is mostly due to the coherent transmission of spin-up electrons through the MgO barrier. Conversely, in the antiparallel configuration, correlation effects become more significant, with DMFT predicting a sharp current increase due to bias-driven inelastic electron-electron scattering. As a consequence, DMFT gives a lower bias threshold for the suppression of the tunneling magnetoresistance ratio compared to DFT, matching experimental data more closely.

Hard X-ray-selected samples of Active Galactic Nuclei (AGN) provide one of the cleanest views of supermassive black hole accretion, but are biased against objects obscured by Compton-thick gas column densities of $N_{\rm H}$ $>$ 10$^{24}$ cm$^{-2}$. To tackle this issue, we present the NuSTAR Local AGN $N_{\rm H}$ Distribution Survey (NuLANDS)$-$a legacy sample of 122 nearby ($z$ $<$ 0.044) AGN primarily selected to have warm infrared colors from IRAS between 25$-$60 $\mu$m. We show that optically classified type 1 and 2 AGN in NuLANDS are indistinguishable in terms of optical [OIII] line flux and mid-to-far infrared AGN continuum bolometric indicators, as expected from an isotropically selected AGN sample, while type 2 AGN are deficient in terms of their observed hard X-ray flux. By testing many X-ray spectroscopic models, we show the measured line-of-sight column density varies on average by $\sim$ 1.4 orders of magnitude depending on the obscurer geometry. To circumvent such issues we propagate the uncertainties per source into the parent column density distribution, finding a directly measured Compton-thick fraction of 35 $\pm$ 9%. By construction, our sample will miss sources affected by severe narrow-line reddening, and thus segregates sources dominated by small-scale nuclear obscuration from large-scale host-galaxy obscuration. This bias implies an even higher intrinsic obscured AGN fraction may be possible, although tests for additional biases arising from our infrared selection find no strong effects on the measured column-density distribution. NuLANDS thus holds potential as an optimized sample for future follow-up with current and next-generation instruments aiming to study the local AGN population in an isotropic manner., Comment: Accepted for publication in ApJ. 50 pages (78 including appendix and bibliography), 21 figures

The feedback from active galactic nuclei (AGN) plays a crucial role in regulating the thermodynamics and the dynamics of the intracluster medium (ICM). Studying the turbulent patterns of the hot and warm ionized phases may allow us to determine how these phases are involved in the AGN cycle and the amount of turbulent pressure generated by the latter. In this work, we use new simulations to study the turbulent motions created by different types of AGN feedback in a cool core cluster and predict the observable signatures with the latest X-ray telescopes (e.g. XRISM). We run several hydrodynamic simulations with ENZO, simulating the self-regulated cycles of AGN feedback, starting from a static ICM in a cluster that represents the Perseus cluster. We study in detail different feedback modes: from pure kinetic precessing jets up to almost pure thermal feedback. Our analysis reveals that the gas velocity dispersion in the center of the cluster correlates in time with the peaks of the AGN activity and that more than 50% of the time, different feedback modalities produce the velocity dispersion observed in the Perseus cluster while leading to distinct geometrical distributions and velocity dispersion profiles. Moreover, we do not find a significant kinematic coupling between the hot and the cold phase kinematics. We find a correlation between the AGN activity and the steepening of the velocity function structure (VSF) and that the projected 2D VSF slopes are never trivially correlated with the 3D VSF ones. This line of research will allow us to use incoming detections of gas turbulent motions detectable by XRISM (or future instruments) to better constrain the duty cycle, energetics and energy dissipation modalities of AGN feedback in massive clusters of galaxies., Comment: 20 pages, 12 figures, 1 table. Submitted to A&A

As large language models (LLMs) become increasingly integrated into society, their alignment with human morals is crucial. To better understand this alignment, we created a large corpus of human- and LLM-generated responses to various moral scenarios. We found a misalignment between human and LLM moral assessments; although both LLMs and humans tended to reject morally complex utilitarian dilemmas, LLMs were more sensitive to personal framing. We then conducted a quantitative user study involving 230 participants (N=230), who evaluated these responses by determining whether they were AI-generated and assessed their agreement with the responses. Human evaluators preferred LLMs' assessments in moral scenarios, though a systematic anti-AI bias was observed: participants were less likely to agree with judgments they believed to be machine-generated. Statistical and NLP-based analyses revealed subtle linguistic differences in responses, influencing detection and agreement. Overall, our findings highlight the complexities of human-AI perception in morally charged decision-making.

We propose a novel feature-centric approach to surrogate modeling of dynamical systems driven by time-varying exogenous excitations. This approach, named Functional Nonlinear AutoRegressive with eXogenous inputs (F-NARX), aims to approximate the system response based on temporal features of both the exogenous inputs and the system response, rather than on their values at specific time lags. This is a major step away from the discrete-time-centric approach of classical NARX models, which attempts to determine the relationship between selected time steps of the input/output time series. By modeling the system in a time-feature space instead of the original time axis, F-NARX can provide more stable long-term predictions and drastically reduce the reliance of the model performance on the time discretization of the problem. F-NARX, like NARX, acts as a framework and is not tied to a single implementation. In this work, we introduce an F-NARX implementation based on principal component analysis and polynomial basis functions. To further improve prediction accuracy and computational efficiency, we also introduce a strategy to identify and fit a sparse model structure, thanks to a modified hybrid least angle regression approach that minimizes the expected forecast error, rather than the one-step-ahead prediction error. Since F-NARX is particularly well-suited to modeling engineering structures typically governed by physical processes, we investigate the behavior and capabilities of our F-NARX implementation on two case studies: an eight-story building under wind loading and a three-story steel frame under seismic loading. Our results demonstrate that F-NARX has several favorable properties over classical NARX, making it well suited to emulate engineering systems with high accuracy over extended time periods.

Recent advances in diffusion models have demonstrated exceptional capabilities in image and video generation, further improving the effectiveness of 4D synthesis. Existing 4D generation methods can generate high-quality 4D objects or scenes based on user-friendly conditions, benefiting the gaming and video industries. However, these methods struggle to synthesize significant object deformation of complex 4D transitions and interactions within scenes. To address this challenge, we propose Trans4D, a novel text-to-4D synthesis framework that enables realistic complex scene transitions. Specifically, we first use multi-modal large language models (MLLMs) to produce a physic-aware scene description for 4D scene initialization and effective transition timing planning. Then we propose a geometry-aware 4D transition network to realize a complex scene-level 4D transition based on the plan, which involves expressive geometrical object deformation. Extensive experiments demonstrate that Trans4D consistently outperforms existing state-of-the-art methods in generating 4D scenes with accurate and high-quality transitions, validating its effectiveness. Code: https://github.com/YangLing0818/Trans4D, Comment: Project: https://github.com/YangLing0818/Trans4D

Large vision and language assistants have enabled new capabilities for interpreting natural images. These approaches have recently been adapted to earth observation data, but they are only able to handle single image inputs, limiting their use for many real-world tasks. In this work, we develop a new vision and language assistant called TEOChat that can engage in conversations about temporal sequences of earth observation data. To train TEOChat, we curate an instruction-following dataset composed of many single image and temporal tasks including building change and damage assessment, semantic change detection, and temporal scene classification. We show that TEOChat can perform a wide variety of spatial and temporal reasoning tasks, substantially outperforming previous vision and language assistants, and even achieving comparable or better performance than specialist models trained to perform these specific tasks. Furthermore, TEOChat achieves impressive zero-shot performance on a change detection and change question answering dataset, outperforms GPT-4o and Gemini 1.5 Pro on multiple temporal tasks, and exhibits stronger single image capabilities than a comparable single EO image instruction-following model. We publicly release our data, models, and code at https://github.com/ermongroup/TEOChat .

When dealing with multimedia data, source attribution is a key challenge from a forensic perspective. This task aims to determine how a given content was captured, providing valuable insights for various applications, including legal proceedings and integrity investigations. The source attribution problem has been addressed in different domains, from identifying the camera model used to capture specific photographs to detecting the synthetic speech generator or microphone model used to create or record given audio tracks. Recent advancements in this area rely heavily on machine learning and data-driven techniques, which often outperform traditional signal processing-based methods. However, a drawback of these systems is their need for large volumes of training data, which must reflect the latest technological trends to produce accurate and reliable predictions. This presents a significant challenge, as the rapid pace of technological progress makes it difficult to maintain datasets that are up-to-date with real-world conditions. For instance, in the task of smartphone model identification from audio recordings, the available datasets are often outdated or acquired inconsistently, making it difficult to develop solutions that are valid beyond a research environment. In this paper we present POLIPHONE, a dataset for smartphone model identification from audio recordings. It includes data from 20 recent smartphones recorded in a controlled environment to ensure reproducibility and scalability for future research. The released tracks contain audio data from various domains (i.e., speech, music, environmental sounds), making the corpus versatile and applicable to a wide range of use cases. We also present numerous experiments to benchmark the proposed dataset using a state-of-the-art classifier for smartphone model identification from audio recordings., Comment: Submitted to IEEE Access

Starting from a uniquely ergodic action of a locally compact group $G$ on a compact space $X_0$, we consider non-commutative skew-product extensions of the dynamics, on the crossed product $C(X_0)\rtimes_\alpha\mathbb{Z}$, through a $1$-cocycle of $G$ in $\mathbb{T}$, with $\alpha$ commuting with the given dynamics. We first prove that any such two skew-product extensions are conjugate if and only if the corresponding cocycles are cohomologous. We then study unique ergodicity and unique ergodicity w.r.t. the fixed-point subalgebra by characterizing both in terms of the cocycle assigning the dynamics. The set of all invariant states is also determined: it is affinely homeomorphic with $\mathcal{P}(\mathbb{T})$, the Borel probability measures on the one-dimensional torus $\mathbb{T}$, as long as the system is not uniquely ergodic. Finally, we show that unique ergodicity w.r.t. the fixed-point subalgebra of a skew-product extension amounts to the uniqueness of an invariant conditional expectation onto the fixed-point subalgebra, Comment: 28 pages

Holomorphic functions are fundamental in operator theory and their Cauchy formula is a crucial tool for defining functions of operators. The Fueter-Sce extension theorem (often called Fueter-Sce mapping theorem) provides a two-step procedure for extending holomorphic functions to hyperholomorphic functions. In the first step, slice hyperholomorphic functions are obtained, and their associated Cauchy formula establishes the $S$-functional calculus for noncommuting operators on the $S$-spectrum. The second step produces axially monogenic functions, which lead to the development of the monogenic functional calculus. In this review paper we discuss the second operator in the Fueter-Sce mapping theorem that takes slice hyperholomorphic to axially monogenic functions. This operator admits several factorizations which generate various function spaces and their corresponding functional calculi, thereby forming the so-called fine structures of spectral theories on the $S$-spectrum., Comment: To appear in the Special Volume of ICHAA 2024. arXiv admin note: substantial text overlap with arXiv:2303.00253

The interplay between missing data and model uncertainty -- two classic statistical problems -- leads to primary questions that we formally address from an objective Bayesian perspective. For the general regression problem, we discuss the probabilistic justification of Rubin's rules applied to the usual components of Bayesian variable selection, arguing that prior predictive marginals should be central to the pursued methodology. In the regression settings, we explore the conditions of prior distributions that make the missing data mechanism ignorable. Moreover, when comparing multiple linear models, we provide a complete methodology for dealing with special cases, such as variable selection or uncertainty regarding model errors. In numerous simulation experiments, we demonstrate that our method outperforms or equals others, in consistently producing results close to those obtained using the full dataset. In general, the difference increases with the percentage of missing data and the correlation between the variables used for imputation. Finally, we summarize possible directions for future research.

Environmentally-benign, non-toxic electrolytes with combinatorial design spaces are excellent candidates for green solvents, green leaching agents, and carbon capture sources. Here, we examine one particular green solvent, ethaline, a 2:1 molar ratio of ethylene glycol and choline chloride. Despite its touted green credentials, we find partial decomposition of ethaline into toxic chloromethane and dimethylaminoethanol at room temperature, limiting its sustainable advantage. We experimentally characterize these decomposition products and computationally develop a general, quantum chemically-accurate workflow to understand decomposition. We find that fluctuations of the hydrogen bonds bind chloride near reaction sites, initiating the reaction between choline cations and chloride anions. In summary, in the design of green solvents, we do not recommend the use of choline chloride due to its susceptibility to undergo decomposition in strongly hydrogen-bound mixtures.

The strong spin-orbit interaction in silicon and germanium hole quantum dots enables all-electric microwave control of single spins but is unsuited for multi-spin exchange-only qubits that rely on scalable discrete signals to suppress cross-talk and heating effects in large quantum processors. Here, we propose an exchange-only spin-orbit qubit that utilizes spin-orbit interactions to implement qubit gates and keeps the beneficial properties of the original encoding. Our encoding is robust to significant local variability in hole spin properties and, because it operates with two degenerate states, it eliminates the need for the rotating frame, avoiding the technologically demanding constraints of fast clocks and precise signal calibration. Unlike current exchange-only qubits, which require complex multi-step sequences prone to leakage, our qubit design enables low-leakage two-qubit gates in a single step, addressing critical challenges in scaling spin qubits.

We present a detailed analysis of JWST/NIRSpec and NIRCam observations of ZF-UDS-7329, a massive, quiescent galaxy at redshift $z=3.2$, which has been put forward to challenge cosmology and galaxy formation physics. Our study extends previous works by focusing on the impact of different star formation history (SFH) priors, stellar libraries, metallicity, and initial mass function assumptions. Our results show that ZF-UDS-7329, with a formed stellar mass of $M_{\star} \approx 10^{11.4}~M_{\odot}$ and a specific star formation rate of $\mathrm{sSFR} \approx 0.03$ Gyr$^{-1}$, formed efficiently in the first billion years of the Universe. In agreement with previous work, we find that the spectrum is consistent with mass-weighted stellar ages of $1.3-1.8$ Gyr, depending on the SFH prior used. A physically motivated rising SFH prior makes the formation history of ZF-UDS-7329 compatible with stellar mass and star-formation rate estimates of high-redshift ($z>6$) galaxies. Using NIRCam imaging, we identify a colour gradient indicative of an old, quiescent bulge and a younger disc component, as expected from a complex formation history. The inferred SFH is consistent a high stellar fraction of $f_{\star}=M_{\star}/(f_b \cdot M_{\rm h}) \approx 100\%$ at $z=7-12$, implying an extremely high integrated star-formation efficiency. However, when considering cosmic variance and possible mergers as expected in over-dense environments - as traced by ZF-UDS-7329 - the stellar fractions could be reduced to $f_{\star} \approx 50\%$, which is more consistent with galaxy formation models and the stellar-to-halo mass relation at lower redshifts. We conclude that ZF-UDS-7329 forms extremely efficient in the early universe, but does not necessitate unseen galaxies at higher redshifts since the inferred SFR of ancestors are consistent with those seen in $z>6$ galaxies., Comment: 15 pages and 8 figures (+appendix), submitted to MNRAS

As fully fault-tolerant quantum computers capable of solving useful problems remain a future goal, we anticipate an era of "early fault tolerance" allowing for limited error correction. We propose a framework for designing early fault-tolerant algorithms by trading between error correction overhead and residual logical noise, and apply it to quantum phase estimation (QPE). We develop a quantum-Fourier-transform (QFT)-based QPE technique that is robust to global depolarising noise and outperforms the previous state of the art at low and moderate noise rates. We further develop a data processing technique, Explicitly Unbiased Maximum Likelihood Estimation (EUMLE), allowing us to mitigate arbitrary error on QFT-based QPE schemes in a consistent, asymptotically normal way. This extends quantum error mitigation techniques beyond expectation value estimation, which was labeled an open problem for the field. Applying this scheme to the ground state problem of the two-dimensional Hubbard model and various molecular Hamiltonians, we find we can roughly halve the number of physical qubits with a $\sim10\times$ wall-clock time overhead, but further reduction causes a steep runtime increase. This work provides an end-to-end analysis of early fault-tolerance cost reductions and space-time trade-offs, and identifies which areas can be improved in the future., Comment: 37 pages, 10 figures

Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to $25$ decoding rounds and a mean decoding time per round below $1$ ${\mu}s$, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of $9.6$ ${\mu}s$ for a total of $9$ measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation., Comment: 11 pages, 4 figures, Supplementary Information

Machine Translation (MT) evaluation metrics assess translation quality automatically. Recently, researchers have employed MT metrics for various new use cases, such as data filtering and translation re-ranking. However, most MT metrics return assessments as scalar scores that are difficult to interpret, posing a challenge to making informed design choices. Moreover, MT metrics' capabilities have historically been evaluated using correlation with human judgment, which, despite its efficacy, falls short of providing intuitive insights into metric performance, especially in terms of new metric use cases. To address these issues, we introduce an interpretable evaluation framework for MT metrics. Within this framework, we evaluate metrics in two scenarios that serve as proxies for the data filtering and translation re-ranking use cases. Furthermore, by measuring the performance of MT metrics using Precision, Recall, and F-score, we offer clearer insights into their capabilities than correlation with human judgments. Finally, we raise concerns regarding the reliability of manually curated data following the Direct Assessments+Scalar Quality Metrics (DA+SQM) guidelines, reporting a notably low agreement with Multidimensional Quality Metrics (MQM) annotations., Comment: Accepted at EMNLP 2024 Main Conference. 26 pages

The solar wind, a stream of charged particles originating from the Sun and transcending interplanetary space, poses risks to technology and astronauts. In this work, we present a prediction model to forecast the solar wind speed at the Earth, focusing on high-speed streams (HSSs) and their solar source regions, coronal holes. As input features, we use the coronal hole area, extracted from solar extreme ultraviolet (EUV) images and mapped on a fixed grid, as well as the solar wind speed 27 days before. We use a polynomial regression model and a distribution transformation to predict the solar wind speed with a lead time of four days. Our forecast achieves a root mean square error (RMSE) of 68.1 km/s for the solar wind speed prediction and an RMSE of 76.8 km/s for the HSS peak velocity prediction for the period 2010 to 2019. The study shows that a small number of physical features explains most of the solar wind variation, and that focusing on these features with simple but robust machine learning algorithms even outperforms current approaches based on deep neural networks. In addition, we explain why the typically used loss function, the mean squared error, systematically underestimates the HSS peak velocities and effectively aggravates the space weather forecasts in operational settings. We show how a distribution transformation can resolve this issue.

Protecting the intellectual property of machine learning models is a hot topic and many watermarking schemes for deep neural networks have been proposed in the literature. Unfortunately, prior work largely neglected the investigation of watermarking techniques for other types of models, including decision tree ensembles, which are a state-of-the-art model for classification tasks on non-perceptual data. In this paper, we present the first watermarking scheme designed for decision tree ensembles, focusing in particular on random forest models. We discuss watermark creation and verification, presenting a thorough security analysis with respect to possible attacks. We finally perform an experimental evaluation of the proposed scheme, showing excellent results in terms of accuracy and security against the most relevant threats., Comment: 7 pages, 5 figures, 2 tables

This paper introduces to a structured application of the One-Class approach and the One-Class-One-Network model for supervised classification tasks, specifically addressing a vowel phonemes classification case study within the Automatic Speech Recognition research field. Through pseudo-Neural Architecture Search and Hyper-Parameters Tuning experiments conducted with an informed grid-search methodology, we achieve classification accuracy comparable to nowadays complex architectures (90.0 - 93.7%). Despite its simplicity, our model prioritizes generalization of language context and distributed applicability, supported by relevant statistical and performance metrics. The experiments code is openly available at our GitHub., Comment: Accepted at "2024 29th IEEE Symposium on Computers and Communications (ISCC): workshop on Next-Generation Multimedia Services at the Edge: Leveraging 5G and Beyond (NGMSE2024)". arXiv admin note: text overlap with arXiv:2410.04098

We present a novel class of cloaking in which a region of space is concealed from an ensemble of diffusing particles whose individual trajectories are governed by a stochastic (Langevin) equation. In particular, we simulate how different interpretations of the Langevin equation affect the cloaking performance of an annular single-layer invisibility cloak of smoothly varying diffusivity in two dimensions. Near-perfect cloaking is achieved under the Ito convention, indicated by the cloak preventing particles from accessing an inner core while simultaneously preserving the particle density outside the cloak relative to simulations involving no protected region (and no cloak). Even better cloaking performance can be achieved by regularising the singular behaviour of the cloak -- which we demonstrate through two different approaches. These results establish the foundations of ``stochastic cloaking'', which we believe to be a significant milestone following that of optical and thermal cloaking., Comment: 12 pages (6 pages main), 4 figures (2 figures main)

This paper explores a structured application of the One-Class approach and the One-Class-One-Network model for supervised classification tasks, focusing on vowel phonemes classification and speakers recognition for the Automatic Speech Recognition (ASR) domain. For our case-study, the ASR model runs on a proprietary sensing and lightning system, exploited to monitor acoustic and air pollution on urban streets. We formalize combinations of pseudo-Neural Architecture Search and Hyper-Parameters Tuning experiments, using an informed grid-search methodology, to achieve classification accuracy comparable to nowadays most complex architectures, delving into the speaker recognition and energy efficiency aspects. Despite its simplicity, our model proposal has a very good chance to generalize the language and speaker genders context for widespread applicability in computational constrained contexts, proved by relevant statistical and performance metrics. Our experiments code is openly accessible on our GitHub., Comment: Accepted at "IEEE 5th International Symposium on the Internet of Sounds, 30 Sep / 2 Oct 2024, Erlangen, Germany"

Physical layer message authentication in underwater acoustic networks (UWANs) leverages the characteristics of the underwater acoustic channel (UWAC) as a fingerprint of the transmitting device. However, as the device moves its UWAC changes, and the authentication mechanism must track such variations. In this paper, we propose a context-based authentication mechanism operating in two steps: first, we estimate the position of the underwater device, then we predict its future position based on the previously estimated ones. To check the authenticity of the transmission, we compare the estimated and the predicted position. The location is estimated using a convolutional neural network taking as input the sample covariance matrix of the estimated UWACs. The prediction uses either a Kalman filter or a recurrent neural network (RNN). The authentication check is performed on the squared error between the predicted and estimated positions. The solution based on the Kalman filter outperforms that built on the RNN when the device moves according to a correlated Gauss-Markov mobility model, which reproduces a typical underwater motion., Comment: Article submitted to IEEE Transaction on Wireless Communications

While biological neurons ensure unidirectional signalling, scalable integrated photonic neurons, such as silicon microresonators, respond the same way regardless of excitation direction due to the Lorentz reciprocity principle. Here, we show that a non-linear Taiji microresonator is a proper optical analogous of a biological neuron showing both a spiking response as well as a direction dependence response., Comment: 4 pages and 2 figures

Visual document understanding (VDU) is a challenging task that involves understanding documents across various modalities (text and image) and layouts (forms, tables, etc.). This study aims to enhance generalizability of small VDU models by distilling knowledge from LLMs. We identify that directly prompting LLMs often fails to generate informative and useful data. In response, we present a new framework (called DocKD) that enriches the data generation process by integrating external document knowledge. Specifically, we provide an LLM with various document elements like key-value pairs, layouts, and descriptions, to elicit open-ended answers. Our experiments show that DocKD produces high-quality document annotations and surpasses the direct knowledge distillation approach that does not leverage external document knowledge. Moreover, student VDU models trained with solely DocKD-generated data are not only comparable to those trained with human-annotated data on in-domain tasks but also significantly excel them on out-of-domain tasks., Comment: Accepted to EMNLP 2024

We propose a method for metric-scale monocular depth estimation. Inferring depth from a single image is an ill-posed problem due to the loss of scale from perspective projection during the image formation process. Any scale chosen is a bias, typically stemming from training on a dataset; hence, existing works have instead opted to use relative (normalized, inverse) depth. Our goal is to recover metric-scaled depth maps through a linear transformation. The crux of our method lies in the observation that certain objects (e.g., cars, trees, street signs) are typically found or associated with certain types of scenes (e.g., outdoor). We explore whether language descriptions can be used to transform relative depth predictions to those in metric scale. Our method, RSA, takes as input a text caption describing objects present in an image and outputs the parameters of a linear transformation which can be applied globally to a relative depth map to yield metric-scaled depth predictions. We demonstrate our method on recent general-purpose monocular depth models on indoors (NYUv2) and outdoors (KITTI). When trained on multiple datasets, RSA can serve as a general alignment module in zero-shot settings. Our method improves over common practices in aligning relative to metric depth and results in predictions that are comparable to an upper bound of fitting relative depth to ground truth via a linear transformation.

The ultralight dark photon is a well-motivated, hypothetical dark matter candidate. In a dilute plasma, they can resonantly convert into photons, and heat up the intergalactic medium between galaxies. In this work, we explore the dark photon dark matter parameter space by comparing synthetic Lyman-$\alpha$ forest data from cosmological hydrodynamical simulations to observational data from VLT/UVES of the quasar HE0940-1050 ($z_{\rm em}=3.09$). We use a novel flux normalization technique that targets under-dense gas, reshaping the flux probability distribution. Not only do we place robust constraints on the kinetic mixing parameter of dark photon dark matter, but notably our findings suggest that this model can still reconcile simulated and observed Doppler parameter distributions of $z\sim0$ Lyman-$\alpha$ lines, as seen by HST/COS. This work opens new pathways for the use of the Lyman-$\alpha$ forest to explore new physics, and can be extended to other scenarios such as primordial black hole evaporation, dark matter decay, and annihilation., Comment: 14 pages, 7 figures, 1 table

Inference-time computation is a powerful paradigm to enhance the performance of large language models (LLMs), with Best-of-N sampling being a widely used technique. However, this method is computationally expensive, requiring both (1) an external reward model and (2) the generation of multiple samples. In this work, we introduce a new generative self-evaluation scheme designed to adaptively reduce the number of generated samples while maintaining or even improving performance. We use a generative reward model formulation, allowing the LLM to predict mid-generation the probability that restarting the generation will yield a better response. These predictions are obtained without an external reward model and can be used to decide whether or not to generate more samples, prune unpromising samples early on, or to pick the best sample. This capability is very inexpensive as it involves generating a single predefined token. Trained using a dataset constructed with real unfiltered LMSYS user prompts, Llama 3.1 8B's win rate against GPT-4 on AlpacaEval increases from 21% to 34% with 16 samples and math performance on GSM8K improves from 84% to 91%. By sampling only when the LLM determines that it is beneficial to do so and adaptively adjusting temperature annealing, we demonstrate that 74% of the improvement from using 16 samples can be achieved with only 1.2 samples on average. We further demonstrate that 50-75% of samples can be pruned early in generation with minimal degradation in performance. Overall, our methods enable more efficient and scalable compute utilization during inference for LLMs.

Non-line-of-sight (NLOS) operation is one of the open issues to be solved for integrated sensing and communication (ISAC) systems to become a pillar of the future wireless infrastructure above 10 GHz. Existing NLOS countermeasures use either metallic mirrors, that are limited in coverage, or reconfigurable metasurfaces, that are limited in size due to cost. This paper focuses on integrated imaging and communication (IIAC) systems for NLOS exploration, where a base station (BS) serves the users while gathering a high-resolution image of the area. We exploit a large reflection plane, that is phase-configured in space and time jointly with a proper BS beam sweeping to provide a multi-view observation of the area and maximizing the image resolution. Remarkably, we achieve a near-field imaging through successive far-field acquisitions, limiting the design complexity and cost. Numerical results prove the benefits of our proposal., Comment: arXiv admin note: text overlap with arXiv:2408.09883

Graph reachability is the task of understanding whether two distinct points in a graph are interconnected by arcs to which in general a semantic is attached. Reachability has plenty of applications, ranging from motion planning to routing. Improving reachability requires structural knowledge of relations so as to avoid the complexity of traditional depth-first and breadth-first strategies, implemented in logic languages. In some contexts, graphs are enriched with their schema definitions establishing domain and range for every arc. The introduction of a schema-aware formalization for guiding the search may result in a sensitive improvement by cutting out unuseful paths and prioritising those that, in principle, reach the target earlier. In this work, we propose a strategy to automatically exclude and sort certain graph paths by exploiting the higher-level conceptualization of instances. The aim is to obtain a new first-order logic reformulation of the graph reachability scenario, capable of improving the traditional algorithms in terms of time, space requirements, and number of backtracks. The experiments exhibit the expected advantages of the approach in reducing the number of backtracks during the search strategy, resulting in saving time and space as well.

We propose a physics-informed data-driven framework for urban wind estimation. This framework validates and incorporates the Reynolds number independence for turbulent flows, thus allowing the extrapolation for wind conditions far beyond the training data. Another key enabler is a machine-learned non-dimensionalized manifold from snapshot data. The velocity field is modeled using a double encoder-decoder approach. The first encoder normalizes data using the oncoming wind speed, while the second encoder projects this normalized data onto the isometric feature mapping manifold. The decoders reverse this process, with $k$-nearest neighbor performing the first decoding and the second undoing the normalization. The manifold is coarse-grained by clustering to reduce the computational load for de- and encoding. The sensor-based flow estimation is based on the estimate of the oncoming wind speed and a mapping from sensor signal to the manifold latent variables. The proposed machine-learned flow estimation framework is exemplified for the flow above an Unmanned Aerial Vehicle (UAV) vertiport. The wind estimation is shown to generalize well for rare wind conditions, not included in the original database.

The random walk of photons in a tight-binding lattice is known to exhibit diffusive motion similar to classical random walks under decoherence, clearly illustrating the quantum-to-classical transition. In this study, we reveal that the random walk of intense classical light under dephasing dynamics can disentangle quantum and ensemble averaging, making it possible to observe a subdiffusive walker dynamics, i.e. a behavior very distinct from both a classical and a quantum walker. These findings are demonstrated through proposing photonic random walks in synthetic temporal lattices, based on pulse dynamics in coupled fiber loops., Comment: 8 pages, 6 figures, included supplemental document, to appear in Optics Letters