The ever-increasing number of detections of gravitational waves (GWs) from compact binaries by the Advanced LIGO and Advanced Virgo detectors allows us to perform ever-more sensitive tests of general relativity (GR) in the dynamical and strong-field regime of gravity. We perform a suite of tests of GR using the compact binary signals observed during the second half of the third observing run of those detectors. We restrict our analysis to the 15 confident signals that have false alarm rates $\leq 10^{-3}\, {\rm yr}^{-1}$. In addition to signals consistent with binary black hole (BH) mergers, the new events include GW200115_042309, a signal consistent with a neutron star--BH merger. We find the residual power, after subtracting the best fit waveform from the data for each event, to be consistent with the detector noise. Additionally, we find all the post-Newtonian deformation coefficients to be consistent with the predictions from GR, with an improvement by a factor of ~2 in the -1PN parameter. We also find that the spin-induced quadrupole moments of the binary BH constituents are consistent with those of Kerr BHs in GR. We find no evidence for dispersion of GWs, non-GR modes of polarization, or post-merger echoes in the events that were analyzed. We update the bound on the mass of the graviton, at 90% credibility, to $m_g \leq 2.42 \times 10^{-23} \mathrm{eV}/c^2$. The final mass and final spin as inferred from the pre-merger and post-merger parts of the waveform are consistent with each other. The studies of the properties of the remnant BHs, including deviations of the quasi-normal mode frequencies and damping times, show consistency with the predictions of GR. In addition to considering signals individually, we also combine results from the catalog of GW signals to calculate more precise population constraints. We find no evidence in support of physics beyond GR.

A lot of recent machine learning research papers have ``open-ended learning'' in their title. But very few of them attempt to define what they mean when using the term. Even worse, when looking more closely there seems to be no consensus on what distinguishes open-ended learning from related concepts such as continual learning, lifelong learning or autotelic learning. In this paper, we contribute to fixing this situation. After illustrating the genealogy of the concept and more recent perspectives about what it truly means, we outline that open-ended learning is generally conceived as a composite notion encompassing a set of diverse properties. In contrast with previous approaches, we propose to isolate a key elementary property of open-ended processes, which is to produce elements from time to time (e.g., observations, options, reward functions, and goals), over an infinite horizon, that are considered novel from an observer's perspective. From there, we build the notion of open-ended learning problems and focus in particular on the subset of open-ended goal-conditioned reinforcement learning problems in which agents can learn a growing repertoire of goal-driven skills. Finally, we highlight the work that remains to be performed to fill the gap between our elementary definition and the more involved notions of open-ended learning that developmental AI researchers may have in mind.

Regular expression (RE) matching is a very common functionality that scans a text to find occurrences of patterns specified by an RE; it includes the simpler function of RE recognition. Here we address RE parsing, which subsumes matching by providing not just the pattern positions in the text, but also the syntactic structure of each pattern occurrence, in the form of a tree representing how the RE operators produced the patterns. RE parsing increases the selectivity of matching, yet avoiding the complications of context-free grammar parsers. Our parser manages ambiguous REs and texts by returning the set of all syntax trees, compressed into a Shared-Packed-Parse-Forest data-structure. We initially convert the RE into a serial parser, which simulates a finite automaton (FA) so that the states the automaton passes through encode the syntax tree of the input. On long texts, serial matching and parsing may be too slow for time-constrained applications. Therefore, we present a novel efficient parallel parser for multi-processor computing platforms; its speed-up over the serial algorithm scales well with the text length. We innovatively apply to RE parsing the approach typical of parallel RE matchers / recognizers, where the text is split into chunks to be parsed in parallel and then joined together. Such an approach suffers from the so-called speculation overhead, due to the lack of knowledge by a chunk processor about the state reached at the end of the preceding chunk; this forces each chunk processor to speculatively start in all its states. We introduce a novel technique that minimizes the speculation overhead. The multi-threaded parser program, written in Java, has been validated and its performance has been measured on a commodity multi-core computer, using public and synthetic RE benchmarks. The speed-up over serial parsing, parsing times, and parser construction times are reported.

The study of spin-glass dynamics, long considered the paradigmatic complex system, has reached important milestones. The availability of single crystals has allowed the experimental measurement of spin-glass coherence lengths of almost macroscopic dimensions, while the advent of special-purpose computers enables dynamical simulations that approach experimental scales. This review provides an account of the quantitative convergence of these two avenues of research, with precise experimental measurements of the expected scaling laws and numerical reproduction of classic experimental results, such as memory and rejuvenation. The article opens with a brief review of the defining spin-glass properties, randomness and frustration, and their experimental consequences. These apparently simple characteristics are shown to generate rich and complex physics. Models are introduced that enable quantitative dynamical descriptions. After a summary of the main numerical results in equilibrium, paying particular attention to temperature chaos, this review examines off-equilibrium dynamics in the absence of a magnetic field and shows how it can be related to equilibrium structures through the fluctuation-dissipation relations. The nonlinear response at a given temperature is then developed, including experiments and scaling in the vicinity of the transition temperature $T_\mathrm{g}$. The consequences of temperature change $\unicode{x2013}$including temperature chaos, rejuvenation, and memory$\unicode{x2013}$ are reviewed. The interpretation of these phenomena requires identifying several length scales relevant to dynamics, which, in turn, generate new insights. Finally, issues for future investigations are introduced, including what is to be nailed down theoretically, why the Ising Edwards-Anderson model is so successful at modeling spin-glass dynamics, and experiments yet to be undertaken.

Glasses are amorphous solids whose constituent particles are caged by their neighbors and thus cannot flow. This sluggishness is often ascribed to the free energy landscape containing multiple minima (basins) separated by high barriers. Here we show, using theory and numerical simulation, that the landscape is much rougher than is classically assumed. Deep in the glass, it undergoes a "roughness transition" to fractal basins. This brings about isostaticity at jamming and marginality of glassy states near jamming. Critical exponents for the basin width, the weak force distribution, and the spatial spread of quasi-contacts at jamming can be analytically determined. Their value is found to be compatible with numerical observations. This advance therefore incorporates the jamming transition of granular materials into the framework of glass theory. Because temperature and pressure control which features of the landscape are experienced, glass mechanics and transport are expected to reflect the features of the topology we discuss here. Hitherto mysterious properties of low-temperature glasses could be explained by this approach.

Optimizing highly complex cost/energy functions over discrete variables is at the heart of many open problems across different scientific disciplines and industries. A major obstacle is the emergence of many-body effects among certain subsets of variables in hard instances leading to critical slowing down or collective freezing for known stochastic local search strategies. An exponential computational effort is generally required to unfreeze such variables and explore other unseen regions of the configuration space. Here, we introduce a quantum-inspired family of nonlocal Nonequilibrium Monte Carlo (NMC) algorithms by developing an adaptive gradient-free strategy that can efficiently learn key instance-wise geometrical features of the cost function. That information is employed on-the-fly to construct spatially inhomogeneous thermal fluctuations for collectively unfreezing variables at various length scales, circumventing costly exploration versus exploitation trade-offs. We apply our algorithm to two of the most challenging combinatorial optimization problems: random k-satisfiability (k-SAT) near the computational phase transitions and Quadratic Assignment Problems (QAP). We observe significant speedup and robustness over both specialized deterministic solvers and generic stochastic solvers. In particular, for 90% of random 4-SAT instances we find solutions that are inaccessible for the best specialized deterministic algorithm known as Survey Propagation (SP) with an order of magnitude improvement in the quality of solutions for the hardest 10% instances. We also demonstrate two orders of magnitude improvement in time-to-solution over the state-of-the-art generic stochastic solver known as Adaptive Parallel Tempering (APT).

We analyze the recently observed breakdown of the integer quantum Hall effect in a two-dimensional electron gas embedded in a metallic split-ring resonator. By accounting for both the quantized vacuum field and electrostatic boundary modifications, we identify a mechanism that could potentially explain this breakdown in terms of non-chiral edge channels arising from electrostatic boundary effects. For experimentally relevant geometries, a minimal single-electron model of this mechanism predicts characteristic signatures and energy scales consistent with those observed in experiments. These predictions can be directly tested against alternative, purely vacuum-induced explanations to shed further light on the origin of this puzzling phenomenon.

Recommender systems continuously interact with users, creating feedback loops that shape both individual behavior and collective market dynamics. This paper introduces a simulation framework to model these loops in online retail environments, where recommenders are periodically retrained on evolving user-item interactions. Using the Amazon e-Commerce dataset, we analyze how different recommendation algorithms influence diversity, purchase concentration, and user homogenization over time. Results reveal a systematic trade-off: while the feedback loop increases individual diversity, it simultaneously reduces collective diversity and concentrates demand on a few popular items. Moreover, for some recommender systems, the feedback loop increases user homogenization over time, making user purchase profiles increasingly similar. These findings underscore the need for recommender designs that balance personalization with long-term diversity.

Query recommendation systems are ubiquitous in modern search engines, assisting users in producing effective queries to meet their information needs. However, these systems require a large amount of data to produce good recommendations, such as a large collection of documents to index and query logs. In particular, query logs and user data are not available in cold start scenarios. Query logs are expensive to collect and maintain and require complex and time-consuming cascading pipelines for creating, combining, and ranking recommendations. To address these issues, we frame the query recommendation problem as a generative task, proposing a novel approach called Generative Query Recommendation (GQR). GQR uses an LLM as its foundation and does not require to be trained or fine-tuned to tackle the query recommendation problem. We design a prompt that enables the LLM to understand the specific recommendation task, even using a single example. We then improved our system by proposing a version that exploits query logs called Retriever-Augmented GQR (RA-GQR). RA-GQr dynamically composes its prompt by retrieving similar queries from query logs. GQR approaches reuses a pre-existing neural architecture resulting in a simpler and more ready-to-market approach, even in a cold start scenario. Our proposed GQR obtains state-of-the-art performance in terms of NDCG@10 and clarity score against two commercial search engines and the previous state-of-the-art approach on the Robust04 and ClueWeb09B collections, improving on average the NDCG@10 performance up to ~4% on Robust04 and ClueWeb09B w.r.t the previous best competitor. RA-GQR further improve the NDCG@10 obtaining an increase of ~11%, ~6\% on Robust04 and ClueWeb09B w.r.t the best competitor. Furthermore, our system obtained ~59% of user preferences in a blind user study, proving that our method produces the most engaging queries.

Magnetic resonance imaging (MRI) scanners have advanced significantly, with a growing use of highfield 3 T systems. This evolution gives rise to safety concerns for healthcare personnel working in proximity to MRI equipment. While manufacturers provide theoretical Gauss line projections, these are typically derived under ideal open-environment conditions and may not reflect real-world installations. For this reason, identical MRI models can produce markedly different fringe field distributions depending on shielding and room configurations. The present study proposes an experimental methodology for the mapping of the fringe magnetic field in the vicinity of three 3 T MRI scanners. Field measurements were interpolated to generate threedimensional magnetic field maps. A comparative analysis was conducted, which revealed notable differences among the scanners. These differences serve to highlight the influence of site-specific factors on magnetic field propagation.

Mass currents in astrophysics generate gravitomagnetic fields of enormous complexity. Gravitomagnetic helicity, in direct analogy with magnetic helicity, is a measure of entwining of the gravitomagnetic field lines. We discuss gravitomagnetic helicity within the gravitoelectromagnetic (GEM) framework of linearized general relativity. Furthermore, we employ the spacetime curvature approach to GEM in order to determine the gravitomagnetic helicity for static observers in Kerr spacetime.

We introduce TURB-Scalar, an open-access database comprising approximately $400$ uncorrelated snapshots of two-dimensional turbulent velocity and passive scalar fields, obtained from the turbulent inverse cascade regime. These data are generated through Direct Numerical Simulations (DNS) of the advection-diffusion equation for a passive scalar, $\theta$, with resolution $N=4096$. The database serves as a versatile benchmark for the development and testing of both physics-based and data-driven modeling approaches. The scalar field exhibits intermittent statistics with universal anomalous scaling, making TURB-Scalar a valuable resource for studying turbulent transport phenomena. The database is available at this http URL.

Lagrangian acceleration has been investigated both experimentally and numerically in the past, and it has been shown to exhibit extreme fluctuations, which have been rationalized as events in which tracer particles get trapped into vortical structures such as vortex tubes or filaments. Here, we consider the statistics of acceleration within the multifractal framework, as in Biferale et al. Phys. Rev. Lett. 93 064502 (2004), and investigate the statistics of Lagrangian acceleration using shell models of turbulence, as in G. Boffetta et al. Phys. Rev. E 66, 066307 (2002), that -- by construction -- do not contain vortical structures. Our analysis shows that, even in the absence of coherent vortex structures, the multifractal model accurately captures the extreme intermittent fluctuations observed in the acceleration, with predictions that remain robust across a wide range of Reynolds numbers.

We present the results of an operational use of experimentally measured optical tomograms to determine state characteristics (purity) avoiding any reconstruction of quasiprobabilities. We also develop a natural way how to estimate the errors (including both statistical and systematic ones) by an analysis of the experimental data themselves. Precision of the experiment can be increased by postselecting the data with minimal (systematic) errors. We demonstrate those techniques by considering coherent and photon-added coherent states measured via the time-domain improved homodyne detection. The operational use and precision of the data allowed us to check for the first time purity-dependent uncertainty relations and uncertainty relations for Shannon and Rényi entropies.

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.

We study the Glauber dynamics at zero temperature of spins placed on the vertices of an uncorrelated network with a power-law degreedistribution. Application of mean-field theory yields as main prediction that for symmetric disordered initial conditions the mean time to reach full order is finite or diverges as a logarithm of the system size N, depending on the exponent of the degree distribution. Extensive numerical simulations contradict these results and clearly show that the mean-field assumption is not appropriate to describe this problem.

We show that the null geodesic radial action for unbound orbits in the Kerr spacetime, and consequently the scattering angle, can be resummed in terms of hypergeometric functions, extending previous results [M.~M.~Ivanov, et al. arXiv:2504.07862]. We provide explicit expressions as series expansions in powers of the Kerr rotational parameter up the fourth order included. We finally use the Mano-Suzuki-Takasugi formalism to prove the relation between the renormalized angular momentum and the radial action highlighted in previous works.

Counterfactual learning for dealing with missing-not-at-random data (MNAR) is an intriguing topic in the recommendation literature since MNAR data are ubiquitous in modern recommender systems. Missing-at-random (MAR) data, namely randomized controlled trials (RCTs), are usually required by most previous counterfactual learning methods for debiasing learning. However, the execution of RCTs is extraordinarily expensive in practice. To circumvent the use of RCTs, we build an information-theoretic counterfactual variational information bottleneck (CVIB), as an alternative for debiasing learning without RCTs. By separating the task-aware mutual information term in the original information bottleneck Lagrangian into factual and counterfactual parts, we derive a contrastive information loss and an additional output confidence penalty, which facilitates balanced learning between the factual and counterfactual domains. Empirical evaluation on real-world datasets shows that our CVIB significantly enhances both shallow and deep models, which sheds light on counterfactual learning in recommendation that goes beyond RCTs.

As clinical data are becoming increasingly available, machine learning methods have been employed to extract knowledge from them and predict clinical events. While promising, approaches suffer from at least two main issues: low availability of labelled data and data heterogeneity leading to missing values. This work proposes the use of self-supervised auto-encoders to efficiently address these challenges. We apply our methodology to a clinical dataset from patients with ischaemic heart disease. Patient data is embedded in a latent space, built using unlabelled data, which is then used to train a neural network classifier to predict cardiovascular death. Results show improved balanced accuracy compared to applying the classifier directly to the raw data, demonstrating that this solution is promising, especially in conditions where availability of unlabelled data could increase.

Here we will give a perspective on new possible interplays between Machine Learning and Quantum Physics, including also practical cases and applications. We will explore the ways in which machine learning could benefit from new quantum technologies and algorithms to find new ways to speed up their computations by breakthroughs in physical hardware, as well as to improve existing models or devise new learning schemes in the quantum domain. Moreover, there are lots of experiments in quantum physics that do generate incredible amounts of data and machine learning would be a great tool to analyze those and make predictions, or even control the experiment itself. On top of that, data visualization techniques and other schemes borrowed from machine learning can be of great use to theoreticians to have better intuition on the structure of complex manifolds or to make predictions on theoretical models. This new research field, named as Quantum Machine Learning, is very rapidly growing since it is expected to provide huge advantages over its classical counterpart and deeper investigations are timely needed since they can be already tested on the already commercially available quantum machines.