We present a CloseUpAvatar - a novel approach for articulated human avatar representation dealing with more general camera motions, while preserving rendering quality for close-up views. CloseUpAvatar represents an avatar as a set of textured planes with two sets of learnable textures for low and high-frequency detail. The method automatically switches to high-frequency textures only for cameras positioned close to the avatar's surface and gradually reduces their impact as the camera moves farther away. Such parametrization of the avatar enables CloseUpAvatar to adjust rendering quality based on camera distance ensuring realistic rendering across a wider range of camera orientations than previous approaches. We provide experiments using the ActorsHQ dataset with high-resolution input images. CloseUpAvatar demonstrates both qualitative and quantitative improvements over existing methods in rendering from novel wide range camera positions, while maintaining high FPS by limiting the number of required primitives.

Wide-scale use of visual surveillance in public spaces puts individual privacy at stake while increasing resource consumption (energy, bandwidth, and computation). Neuromorphic vision sensors (event-cameras) have been recently considered a valid solution to the privacy issue because they do not capture detailed RGB visual information of the subjects in the scene. However, recent deep learning architectures have been able to reconstruct images from event cameras with high fidelity, reintroducing a potential threat to privacy for event-based vision applications. In this paper, we aim to anonymize event-streams to protect the identity of human subjects against such image reconstruction attacks. To achieve this, we propose an end-to-end network architecture jointly optimized for the twofold objective of preserving privacy and performing a downstream task such as person ReId. Our network learns to scramble events, enforcing the degradation of images recovered from the privacy attacker. In this work, we also bring to the community the first ever event-based person ReId dataset gathered to evaluate the performance of our approach. We validate our approach with extensive experiments and report results on the synthetic event data simulated from the publicly available SoftBio dataset and our proposed Event-ReId dataset.

Kernel methods provide a powerful framework for non parametric learning. They are based on kernel functions and allow learning in a rich functional space while applying linear statistical learning tools, such as Ridge Regression or Support Vector Machines. However, standard kernel methods suffer from a quadratic time and memory complexity in the number of data points and thus have limited applications in large-scale learning. In this paper, we propose Snacks, a new large-scale solver for Kernel Support Vector Machines. Specifically, Snacks relies on a Nyström approximation of the kernel matrix and an accelerated variant of the stochastic subgradient method. We demonstrate formally through a detailed empirical evaluation, that it competes with other SVM solvers on a variety of benchmark datasets.

Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector space representations of entire knowledge graphs. The proposed method is related to holographic models of associative memory in that it employs circular correlation to create compositional representations. By using correlation as the compositional operator HolE can capture rich interactions but simultaneously remains efficient to compute, easy to train, and scalable to very large datasets. In extensive experiments we show that holographic embeddings are able to outperform state-of-the-art methods for link prediction in knowledge graphs and relational learning benchmark datasets.

A search for Dark Sectors is performed using the unique M2 beam line at the CERN Super Proton Synchrotron. New particles ($X$) could be produced in the bremsstrahlung-like reaction of high energy 160 GeV muons impinging on an active target, $\mu N\rightarrow\mu NX$, followed by their decays, $X\rightarrow\text{invisible}$. The experimental signature would be a scattered single muon from the target, with about less than half of its initial energy and no activity in the sub-detectors located downstream the interaction point. The full sample of the 2022 run is analyzed through the missing energy/momentum channel, with a total statistics of $(1.98\pm0.02)\times10^{10}$ muons on target. We demonstrate that various muon-philic scenarios involving different types of mediators, such as scalar or vector particles, can be probed simultaneously with such a technique. For the vector-case, besides a $L_\mu-L_\tau$ $Z'$ vector boson, we also consider an invisibly decaying dark photon ($A'\rightarrow\text{invisible}$). This search is complementary to NA64 running with electrons and positrons, thus, opening the possibility to expand the exploration of the thermal light dark matter parameter space by combining the results obtained with the three beams.

Causal learning is the cognitive process of developing the capability of making causal inferences based on available information, often guided by normative principles. This process is prone to errors and biases, such as the illusion of causality, in which people perceive a causal relationship between two variables despite lacking supporting evidence. This cognitive bias has been proposed to underlie many societal problems, including social prejudice, stereotype formation, misinformation, and superstitious thinking. In this research, we investigate whether large language models (LLMs) develop causal illusions, both in real-world and controlled laboratory contexts of causal learning and inference. To this end, we built a dataset of over 2K samples including purely correlational cases, situations with null contingency, and cases where temporal information excludes the possibility of causality by placing the potential effect before the cause. We then prompted the models to make statements or answer causal questions to evaluate their tendencies to infer causation erroneously in these structured settings. Our findings show a strong presence of causal illusion bias in LLMs. Specifically, in open-ended generation tasks involving spurious correlations, the models displayed bias at levels comparable to, or even lower than, those observed in similar studies on human subjects. However, when faced with null-contingency scenarios or temporal cues that negate causal relationships, where it was required to respond on a 0-100 scale, the models exhibited significantly higher bias. These findings suggest that the models have not uniformly, consistently, or reliably internalized the normative principles essential for accurate causal learning.

To date, galaxy image simulations for weak lensing surveys usually approximate the light profiles of all galaxies as a single or double Sérsic profile, neglecting the influence of galaxy substructures and morphologies deviating from such a simplified parametric characterization. While this approximation may be sufficient for previous data sets, the stringent cosmic shear calibration requirements and the high quality of the data in the upcoming Euclid survey demand a consideration of the effects that realistic galaxy substructures have on shear measurement biases. Here we present a novel deep learning-based method to create such simulated galaxies directly from HST data. We first build and validate a convolutional neural network based on the wavelet scattering transform to learn noise-free representations independent of the point-spread function of HST galaxy images that can be injected into simulations of images from Euclid's optical instrument VIS without introducing noise correlations during PSF convolution or shearing. Then, we demonstrate the generation of new galaxy images by sampling from the model randomly and conditionally. Next, we quantify the cosmic shear bias from complex galaxy shapes in Euclid-like simulations by comparing the shear measurement biases between a sample of model objects and their best-fit double-Sérsic counterparts. Using the KSB shape measurement algorithm, we find a multiplicative bias difference between these branches with realistic morphologies and parametric profiles on the order of $6.9\times 10^{-3}$ for a realistic magnitude-Sérsic index distribution. Moreover, we find clear detection bias differences between full image scenes simulated with parametric and realistic galaxies, leading to a bias difference of $4.0\times 10^{-3}$ independent of the shape measurement method. This makes it relevant for stage IV weak lensing surveys such as Euclid.

Cosmic rays are mostly composed of protons accelerated to relativistic speeds. When those protons encounter interstellar material, they produce neutral pions which in turn decay into gamma rays. This offers a compelling way to identify the acceleration sites of protons. A characteristic hadronic spectrum, with a low-energy break around 200 MeV, was detected in the gamma-ray spectra of four Supernova Remnants (SNRs), IC 443, W44, W49B and W51C, with the Fermi Large Area Telescope. This detection provided direct evidence that cosmic-ray protons are (re-)accelerated in SNRs. Here, we present a comprehensive search for low-energy spectral breaks among 311 4FGL catalog sources located within 5 degrees from the Galactic plane. Using 8 years of data from the Fermi Large Area Telescope between 50 MeV and 1 GeV, we find and present the spectral characteristics of 56 sources with a spectral break confirmed by a thorough study of systematic uncertainty. Our population of sources includes 13 SNRs for which the proton-proton interaction is enhanced by the dense target material; the high-mass gamma-ray binary LS~I +61 303; the colliding wind binary eta Carinae; and the Cygnus star-forming region. This analysis better constrains the origin of the gamma-ray emission and enlarges our view to potential new cosmic-ray acceleration sites.

The aim of this work is to develop a study from the perspective of Abstract Algebraic Logic of some bilattice-based logical systems introduced in the nineties by Ofer Arieli and Arnon Avron. The motivation for such an investigation has two main roots. On the one hand there is an interest in bilattices as an elegant formalism that gave rise in the last two decades to a variety of applications, especially in the field of Theoretical Computer Science and Artificial Intelligence. In this respect, the present study aims to be a contribution to a better understanding of the mathematical and logical framework that underlie these applications. On the other hand, our interest in bilattice-based logics comes from Abstract Algebraic Logic. In very general terms, algebraic logic can be described as the study of the connections between algebra and logic. One of the main reasons that motivate this study is the possibility to treat logical problems with algebraic methods and viceversa: this is accomplished by associating to a logical system a class of algebraic models that can be regarded as the algebraic counterpart of that logic. Starting from the work of Tarski and his collaborators, the method of algebraizing logics has been increasingly developed and generalized. In the last two decades, algebraic logicians have focused their attention on the process of algebraization itself: this kind of investigation forms now a subfield of algebraic logic known as Abstract Algebraic Logic (which we abbreviate AAL).

This paper proposes a data-driven approach for constructing firmly nonexpansive operators. We demonstrate its applicability in Plug-and-Play (PnP) methods, where classical algorithms such as Forward-Backward splitting, Chambolle-Pock primal-dual iteration, Douglas-Rachford iteration or alternating directions method of multipliers (ADMM), are modified by replacing one proximal map by a learned firmly nonexpansive operator. We provide sound mathematical background to the problem of learning such an operator via expected and empirical risk minimization. We prove that, as the number of training points increases, the empirical risk minimization problem converges (in the sense of Gamma-convergence) to the expected risk minimization problem. Further, we derive a solution strategy that ensures firmly nonexpansive and piecewise affine operators within the convex envelope of the training set. We show that this operator converges to the best empirical solution as the number of points in the envelope increases in an appropriate way. Finally, the experimental section details practical implementations of the method and presents an application in image denoising, where we consider a novel, interpretable PnP Chambolle-Pock primal-dual iteration.

The inclusion of an additional $U(1)$ gauge $L_\mu-L_\tau$ symmetry would release the tension between the measured and the predicted value of the anomalous muon magnetic moment: this paradigm assumes the existence of a new, light $Z^\prime$ vector boson, with dominant coupling to $\mu$ and $\tau$ leptons and interacting with electrons via a loop mechanism. The $L_\mu-L_\tau$ model can also explain the Dark Matter relic abundance, by assuming that the $Z'$ boson acts as a "portal" to a new Dark Sector of particles in Nature, not charged under known interactions. In this work we present the results of the $Z'$ search performed by the NA64-$e$ experiment at CERN SPS, that collected $\sim 9\times10^{11}$ 100 GeV electrons impinging on an active thick target. Despite the suppressed $Z'$ production yield with an electron beam, NA64-$e$ provides the first accelerator-based results excluding the $g-2$ preferred band of the $Z'$ parameter space in the 1 keV < m_{Z'} \lesssim 2 MeV range, in complementarity with the limits recently obtained by the NA64-$\mu$ experiment with a muon beam.

We search for gravitational-wave signals associated with gamma-ray bursts detected by the Fermi and Swift satellites during the second half of the third observing run of Advanced LIGO and Advanced Virgo (1 November 2019 15:00 UTC-27 March 2020 17:00 UTC).We conduct two independent searches: a generic gravitational-wave transients search to analyze 86 gamma-ray bursts and an analysis to target binary mergers with at least one neutron star as short gamma-ray burst progenitors for 17 events. We find no significant evidence for gravitational-wave signals associated with any of these gamma-ray bursts. A weighted binomial test of the combined results finds no evidence for sub-threshold gravitational wave signals associated with this GRB ensemble either. We use several source types and signal morphologies during the searches, resulting in lower bounds on the estimated distance to each gamma-ray burst. Finally, we constrain the population of low luminosity short gamma-ray bursts using results from the first to the third observing runs of Advanced LIGO and Advanced Virgo. The resulting population is in accordance with the local binary neutron star merger rate.

A cyber range is an environment used for training security experts and testing attack and defence tools and procedures. Usually, a cyber range simulates one or more critical infrastructures that attacking (red) and defending (blue) teams must compromise and protect, respectively. The infrastructure can be physically assembled, but much more convenient is to rely on the Infrastructure as a Service (IaaS) paradigm. Although some modern technologies support the IaaS, the design and deployment of scenarios of interest is mostly a manual operation. As a consequence, it is a common practice to have a cyber range hosting few (sometimes only one), consolidated scenarios. However, reusing the same scenario may significantly reduce the effectiveness of the training and testing sessions. In this paper, we propose a framework for automating the definition and deployment of arbitrarily complex cyber range scenarios. The framework relies on the virtual scenario description language (VSDL), i.e., a domain-specific language for defining high-level features of the desired infrastructure while hiding low-level details. The semantics of VSDL is given in terms of constraints that must be satisfied by the virtual infrastructure. These constraints are then submitted to an SMT solver for checking the satisfiability of the specification. If satisfiable, the specification gives rise to a model that is automatically converted to a set of deployment scripts to be submitted to the IaaS provider.

The TOTEM experiment at the LHC has performed the first measurement at $\sqrt{s} = 13$ TeV of the $\rho$ parameter, the real to imaginary ratio of the nuclear elastic scattering amplitude at $t=0$, obtaining the following results: $\rho = 0.09 \pm 0.01$ and $\rho = 0.10 \pm 0.01$, depending on different physics assumptions and mathematical modelling. The unprecedented precision of the $\rho$ measurement, combined with the TOTEM total cross-section measurements in an energy range larger than 10 TeV (from 2.76 to 13 TeV), has implied the exclusion of all the models classified and published by COMPETE. The $\rho$ results obtained by TOTEM are compatible with the predictions, from alternative theoretical models both in the Regge-like framework and in the QCD framework, of a colourless 3-gluon bound state exchange in the $t$-channel of the proton-proton elastic scattering. On the contrary, if shown that the 3-gluon bound state $t$-channel exchange is not of importance for the description of elastic scattering, the $\rho$ value determined by TOTEM would represent a first evidence of a slowing down of the total cross-section growth at higher energies. The very low-$|t|$ reach allowed also to determine the absolute normalisation using the Coulomb amplitude for the first time at the LHC and obtain a new total proton-proton cross-section measurement $\sigma_{tot} = 110.3 \pm 3.5$ mb, completely independent from the previous TOTEM determination. Combining the two TOTEM results yields $\sigma_{tot} = 110.5 \pm 2.4$ mb.

We analyze the learning properties of the stochastic gradient method when multiple passes over the data and mini-batches are allowed. We study how regularization properties are controlled by the step-size, the number of passes and the mini-batch size. In particular, we consider the square loss and show that for a universal step-size choice, the number of passes acts as a regularization parameter, and optimal finite sample bounds can be achieved by early-stopping. Moreover, we show that larger step-sizes are allowed when considering mini-batches. Our analysis is based on a unifying approach, encompassing both batch and stochastic gradient methods as special cases. As a byproduct, we derive optimal convergence results for batch gradient methods (even in the non-attainable cases).

The LIGO detection of the gravitational wave transient GW150914, from the inspiral and merger of two black holes with masses $\gtrsim 30\, \text{M}_\odot$, suggests a population of binary black holes with relatively high mass. This observation implies that the stochastic gravitational-wave background from binary black holes, created from the incoherent superposition of all the merging binaries in the Universe, could be higher than previously expected. Using the properties of GW150914, we estimate the energy density of such a background from binary black holes. In the most sensitive part of the Advanced LIGO/Virgo band for stochastic backgrounds (near 25 Hz), we predict $\Omega_\text{GW}(f=25 Hz) = 1.1_{-0.9}^{+2.7} \times 10^{-9}$ with 90\% confidence. This prediction is robustly demonstrated for a variety of formation scenarios with different parameters. The differences between models are small compared to the statistical uncertainty arising from the currently poorly constrained local coalescence rate. We conclude that this background is potentially measurable by the Advanced LIGO/Virgo detectors operating at their projected final sensitivity.

In this paper, we use the tools of Gröbner bases and combinatorial secant varieties to study the determinantal ideals $I_t$ of the extended Hankel matrices. Denote by $c$-chain a sequence $a_1,\...,a_k$ with $a_i+c