Search

We propose an inertial variant of the strongly convergent inexact proximal-point (PP) method of Solodov and Svaiter (2000) for monotone inclusions. We prove strong convergence of our main algorithm under less restrictive assumptions on the inertial parameters when compared to previous analysis of inertial PP-type algorithms, which makes our method of interest even in finite-dimensional settings. We also performed an iteration-complexity analysis and applied our main algorithm to variational inequalities for monotone operators, obtaining strongly convergent (inertial) variants of Korpolevich's extragradient, forward-backward and Tseng's modified forward-backward methods.

We propose MomentsNeRF, a novel framework for one- and few-shot neural rendering that predicts a neural representation of a 3D scene using Orthogonal Moments. Our architecture offers a new transfer learning method to train on multi-scenes and incorporate a per-scene optimization using one or a few images at test time. Our approach is the first to successfully harness features extracted from Gabor and Zernike moments, seamlessly integrating them into the NeRF architecture. We show that MomentsNeRF performs better in synthesizing images with complex textures and shapes, achieving a significant noise reduction, artifact elimination, and completing the missing parts compared to the recent one- and few-shot neural rendering frameworks. Extensive experiments on the DTU and Shapenet datasets show that MomentsNeRF improves the state-of-the-art by {3.39\;dB\;PSNR}, 11.1% SSIM, 17.9% LPIPS, and 8.3% DISTS metrics. Moreover, it outperforms state-of-the-art performance for both novel view synthesis and single-image 3D view reconstruction. The source code is accessible at: https://amughrabi.github.io/momentsnerf/.

Accurate food volume estimation is essential for dietary assessment, nutritional tracking, and portion control applications. We present VolETA, a sophisticated methodology for estimating food volume using 3D generative techniques. Our approach creates a scaled 3D mesh of food objects using one- or few-RGBD images. We start by selecting keyframes based on the RGB images and then segmenting the reference object in the RGB images using XMem++. Simultaneously, camera positions are estimated and refined using the PixSfM technique. The segmented food images, reference objects, and camera poses are combined to form a data model suitable for NeuS2. Independent mesh reconstructions for reference and food objects are carried out, with scaling factors determined using MeshLab based on the reference object. Moreover, depth information is used to fine-tune the scaling factors by estimating the potential volume range. The fine-tuned scaling factors are then applied to the cleaned food meshes for accurate volume measurements. Similarly, we enter a segmented RGB image to the One-2-3-45 model for one-shot food volume estimation, resulting in a mesh. We then leverage the obtained scaling factors to the cleaned food mesh for accurate volume measurements. Our experiments show that our method effectively addresses occlusions, varying lighting conditions, and complex food geometries, achieving robust and accurate volume estimations with 10.97% MAPE using the MTF dataset. This innovative approach enhances the precision of volume assessments and significantly contributes to computational nutrition and dietary monitoring advancements.

PLATO (PLAnetary Transits and Oscillations of stars) is ESA's M3 mission designed to detect and characterise extrasolar planets and perform asteroseismic monitoring of a large number of stars. PLATO will detect small planets (down to <2 R_(Earth)) around bright stars (<11 mag), including terrestrial planets in the habitable zone of solar-like stars. With the complement of radial velocity observations from the ground, planets will be characterised for their radius, mass, and age with high accuracy (5 %, 10 %, 10 % for an Earth-Sun combination respectively). PLATO will provide us with a large-scale catalogue of well-characterised small planets up to intermediate orbital periods, relevant for a meaningful comparison to planet formation theories and to better understand planet evolution. It will make possible comparative exoplanetology to place our Solar System planets in a broader context. In parallel, PLATO will study (host) stars using asteroseismology, allowing us to determine the stellar properties with high accuracy, substantially enhancing our knowledge of stellar structure and evolution. The payload instrument consists of 26 cameras with 12cm aperture each. For at least four years, the mission will perform high-precision photometric measurements. Here we review the science objectives, present PLATO's target samples and fields, provide an overview of expected core science performance as well as a description of the instrument and the mission profile at the beginning of the serial production of the flight cameras. PLATO is scheduled for a launch date end 2026. This overview therefore provides a summary of the mission to the community in preparation of the upcoming operational phases.

Machine-learning techniques, especially deep convolutional neural networks, are pivotal for image-based identification of biological species in many Citizen Science platforms. In this paper, we describe the construction of a dataset for the Portuguese native flora based on publicly available research-grade datasets, and the derivation of a high-accuracy model from it using off-the-shelf deep convolutional neural networks. We anchored the dataset in high-quality data provided by Sociedade Portuguesa de Bot\^anica and added further sampled data from research-grade datasets available from GBIF. We find that with a careful dataset design, off-the-shelf machine-learning cloud services such as Google's AutoML Vision produce accurate models, with results comparable to those of Pl@ntNet, a state-of-the-art citizen science platform. The best model we derived, dubbed Floralens, has been integrated into the public website of Project Biolens, where we gather models for other taxa as well. The dataset used to train the model is also publicly available on Zenodo.

Magnetic skyrmions are promising candidates for information and storage technologies. In the last years, magnetic multilayer systems have been tuned to enable room-temperature skyrmions, stable even in the absence of external magnetic field. There are several models describing the properties of an isolated skyrmion in a homogeneous background for single repetition multilayer stack, however, the description on how the equilibrium skyrmion size in lattices scales with increasing the number of repetitions of the stack remains unaddressed. This question is essential for fundamental and practical perspectives, as the behaviour of an ensemble of skyrmions differs from the isolated case. Based on a multilayer stack hosting a skyrmion lattice, we have carried out a series of imaging experiments scaling up the dipolar interaction by repeating $n$ times the multilayer unit, from $n =1$ up to $n=30$. We have developed an analytical description for the skyrmion radius in the whole multilayer regime, $i.e.$, from thin to thick film limits. Furthermore, we provide insight on how nucleation by an externally applied field can give rise to a lattice with more skyrmions (thus, overfilled) than the predicted by the calculations., Comment: 9 pages, 3 figures

We present a novel approach to generate a fingerprint for crystalline materials that balances efficiency for machine processing and human interpretability, allowing its application in both machine learning inference and understanding of structure-property relationships. Our proposed fingerprint has two components: one representing the crystal structure and the other characterizing the chemical composition. To represent the latter we construct a non-orthogonal space where each axis represents a chemical element and where the angle between the axes quantifies a measure of the similarity between them. The chemical composition is then defined by the point on the unit sphere in this non-orthogonal space. By utilizing dimension reduction techniques we can construct a two-dimensional global map of the space of the thermodynamically stable crystalline compounds. Despite their simplicity, such maps succeed in providing a physical separation of material classes according to basic physical properties. Moreover, this compositional fingerprint can be used as a versatile input for machine learning algorithms, supplanting conventional one-hot representations of the chemical composition.

Modern NLP tasks increasingly rely on dense retrieval methods to access up-to-date and relevant contextual information. We are motivated by the premise that retrieval benefits from segments that can vary in size such that a content's semantic independence is better captured. We propose LumberChunker, a method leveraging an LLM to dynamically segment documents, which iteratively prompts the LLM to identify the point within a group of sequential passages where the content begins to shift. To evaluate our method, we introduce GutenQA, a benchmark with 3000 "needle in a haystack" type of question-answer pairs derived from 100 public domain narrative books available on Project Gutenberg. Our experiments show that LumberChunker not only outperforms the most competitive baseline by 7.37% in retrieval performance (DCG@20) but also that, when integrated into a RAG pipeline, LumberChunker proves to be more effective than other chunking methods and competitive baselines, such as the Gemini 1.5M Pro. Our Code and Data are available at https://github.com/joaodsmarques/LumberChunker

The increasing share of distributed energy sources enhances the participation potential of distributed flexibility in the provision of system services. However, this participation can endanger the grid-safety of the distribution networks (DNs) from which this flexibility originates. In this paper, the use of operating envelopes (OE) to enable the grid-safe procurement of distributed flexibility in centralized balancing markets is proposed. Two classes of approaches for calculating OEs (one-step and two-step methods) are compared in terms of the level of distribution grid safety they can provide, the impact they can have on the market efficiency, and the volume of discarded flexibility they can yield. A case study considering different system scenarios, based on Monte Carlo simulations, highlights a trade-off between the market efficiency, DN flexibility resource utilization, and the grid safety delivered by the different OE methods. The results showcase that the use of the two-step OE approach results in a more grid-secure albeit less-efficient use of distributed flexibility., Comment: 5 pages

In settings where only a budgeted amount of labeled data can be afforded, active learning seeks to devise query strategies for selecting the most informative data points to be labeled, aiming to enhance learning algorithms' efficiency and performance. Numerous such query strategies have been proposed and compared in the active learning literature. However, the community still lacks standardized benchmarks for comparing the performance of different query strategies. This particularly holds for the combination of query strategies with different learning algorithms into active learning pipelines and examining the impact of the learning algorithm choice. To close this gap, we propose ALPBench, which facilitates the specification, execution, and performance monitoring of active learning pipelines. It has built-in measures to ensure evaluations are done reproducibly, saving exact dataset splits and hyperparameter settings of used algorithms. In total, ALPBench consists of 86 real-world tabular classification datasets and 5 active learning settings, yielding 430 active learning problems. To demonstrate its usefulness and broad compatibility with various learning algorithms and query strategies, we conduct an exemplary study evaluating 9 query strategies paired with 8 learning algorithms in 2 different settings. We provide ALPBench here: https://github.com/ValentinMargraf/ActiveLearningPipelines.

Classical statistics deals with determined and precise data analysis. But in reality, there are many cases where the information is not accurate and a degree of impreciseness, uncertainty, incompleteness, and vagueness is observed. In these situations, uncertainties can make classical statistics less accurate. That is where neutrosophic statistics steps in to improve accuracy in data analysis. In this article, we consider the Birnbaum-Saunders distribution (BSD) which is very flexible and practical for real world data modeling. By integrating the neutrosophic concept, we improve the BSD's ability to manage uncertainty effectively. In addition, we provide maximum likelihood parameter estimates. Subsequently, we illustrate the practical advantages of the neutrosophic model using two cases from the industrial and environmental fields. This paper emphasizes the significance of the neutrosophic BSD as a robust solution for modeling and analysing imprecise data, filling a crucial gap left by classical statistical methods., Comment: 20 pages, 24 figures

Designing new, technologically relevant superconductors has long been at the forefront of solid-state physics and chemistry research. However, developing efficient approaches for modeling the thermodynamics of superconducting alloys while accurately evaluating their physical properties has proven to be a very challenging task. To fill this gap, we propose an ab initio thermodynamic statistical method, the Extended Generalized Quasichemical Approximation (EGQCA), to describe off-stoichiometric superconductors. Within EGQCA, one can predict any computationally accessible property of the alloy, such as the critical temperature in superconductors and the electron-phonon coupling parameter, as a function of composition and crystal growth conditions by computing the cluster occurrence probabilities that minimize the overall mixing Gibbs free energy. Importantly, EGQCA incorporates directly chemical ordering, lattice distortions, and vibrational contributions. As a proof of concept, we applied EGQCA to the well-known Al-doped MgB$_2$ and to niobium alloyed with titanium and vanadium, showing a remarkable agreement with the experimental data. Additionally, we model the near-room temperature sodalite-like Y$_{1-x}$Ca$_x$H$_6$ superconducting solid solution, demonstrating that EGQCA particularly possesses a promising potential for designing in silico high-$T_{\text{c}}$ superhydride alloys. Our approach notably enables the high-throughput screening of complex superconducting solid solutions, intrinsically providing valuable insights into the interplay between synthesis, thermodynamics, and physical properties.

The atoms of the Schanuel topos can be described as the pairs $(n,G)$ where $n$ is a finite set and $G$ is a subgroup of $\operatorname{Aut}(n)$. We give a general criterion on an atomic site ensuring that the atoms of the topos of sheaves on that site can be described in a similar fashion. We deduce that these toposes are locally finitely presentable. By applying this to the Malitz-Gregory atomic topos, we obtain a counter-example to the conjecture that every locally finitely presentable topos has enough points. We also work out a combinatorial property satisfied exactly when the sheaves for the atomic topology are the pullback-preserving functors. In this case, the category of atoms is particularly simple to describe.

Efficient and accurate 3D reconstruction is crucial for various applications, including augmented and virtual reality, medical imaging, and cinematic special effects. While traditional Multi-View Stereo (MVS) systems have been fundamental in these applications, using neural implicit fields in implicit 3D scene modeling has introduced new possibilities for handling complex topologies and continuous surfaces. However, neural implicit fields often suffer from computational inefficiencies, overfitting, and heavy reliance on data quality, limiting their practical use. This paper presents an enhanced MVS framework that integrates multi-view 360-degree imagery with robust camera pose estimation via Structure from Motion (SfM) and advanced image processing for point cloud densification, mesh reconstruction, and texturing. Our approach significantly improves upon traditional MVS methods, offering superior accuracy and precision as validated using Chamfer distance metrics on the Realistic Synthetic 360 dataset. The developed MVS technique enhances the detail and clarity of 3D reconstructions and demonstrates superior computational efficiency and robustness in complex scene reconstruction, effectively handling occlusions and varying viewpoints. These improvements suggest that our MVS framework can compete with and potentially exceed current state-of-the-art neural implicit field methods, especially in scenarios requiring real-time processing and scalability., Comment: The work is under review

JWST is uncovering the properties of ever increasing numbers of galaxies at z>6, during the epoch of reionization. Connecting these observed populations to the process of reionization requires understanding how efficiently they produce Lyman continuum (LyC) photons and what fraction (fesc) of these photons escape into the intergalactic medium. By applying the Cox proportional hazards model, a survival analysis technique, to the Low-redshift Lyman Continuum Survey (LzLCS), we develop new, empirical, multivariate predictions for fesc. The models developed from the LzLCS reproduce the observed fesc for z~3 samples, which suggests that LyC emitters may share similar properties at low and high redshift. Our best-performing models for the z~3 galaxies include information about dust attenuation, ionization, and/or morphology. We then apply these models to z$\gtrsim$6 galaxies. For large photometric samples, we find a median predicted fesc=0.047-0.14. For smaller spectroscopic samples, which may include stronger emission line galaxies, we find that $\geq$33% of the galaxies have fesc >0.2, and we identify several candidate extreme leakers with fesc $\geq$0.5. The current samples show no strong trend between predicted fesc and UV magnitude, but limited spectroscopic information makes this result uncertain. Multivariate predictions can give significantly different results from single variable predictions, and the predicted fesc for high-redshift galaxies can differ significantly depending on whether star formation rate surface density or radius is used as a measure of galaxy morphology. We provide all parameters necessary to predict fesc for additional samples of high-redshift galaxies using these models., Comment: Accepted for publication in ApJ. 33 pages, 9 figures, 10 tables, plus appendix

To understand how galaxies reionized the universe, we must determine how the escape fraction of Lyman Continuum (LyC) photons (fesc) depends on galaxy properties. Using the z~0.3 Low-redshift Lyman Continuum Survey (LzLCS), we develop and analyze new multivariate predictors of fesc. These predictions use the Cox proportional hazards model, a survival analysis technique that incorporates both detections and upper limits. Our best model predicts the LzLCS fesc detections with a root-mean-square (RMS) scatter of 0.31 dex, better than single-variable correlations. According to ranking techniques, the most important predictors of fesc are the equivalent width (EW) of Lyman-series absorption lines and the UV dust attenuation, which track line-of-sight absorption due to HI and dust. The HI absorption EW is uniquely crucial for predicting fesc for the strongest LyC emitters, which show properties similar to weaker LyC emitters and whose high fesc may therefore result from favorable orientation. In the absence of HI information, star formation rate surface density ($\Sigma_{\rm SFR}$) and [O III]/[O II] ratio are the most predictive variables and highlight the connection between feedback and fesc. We generate a model suitable for z>6, which uses only the UV slope, $\Sigma_{\rm SFR}$, and [O III]/[O II]. We find that $\Sigma_{\rm SFR}$ is more important in predicting fesc at higher stellar masses, whereas [O III]/[O II] plays a greater role at lower masses. We also analyze predictions for other parameters, such as the ionizing-to-non ionizing flux ratio and Ly=alpha escape fraction. These multivariate models represent a promising tool for predicting fesc at high redshift., Comment: Accepted for publication in ApJ. 34 pages + appendix, 12 figures

Interest in bilevel optimization has grown in recent years, partially due to its applications to tackle challenging machine-learning problems. Several exciting recent works have been centered around developing efficient gradient-based algorithms that can solve bilevel optimization problems with provable guarantees. However, the existing literature mainly focuses on bilevel problems either without constraints, or featuring only simple constraints that do not couple variables across the upper and lower levels, excluding a range of complex applications. Our paper studies this challenging but less explored scenario and develops a (fully) first-order algorithm, which we term BLOCC, to tackle BiLevel Optimization problems with Coupled Constraints. We establish rigorous convergence theory for the proposed algorithm and demonstrate its effectiveness on two well-known real-world applications - hyperparameter selection in support vector machine (SVM) and infrastructure planning in transportation networks using the real data from the city of Seville., Comment: In this version, we have made the following updates: (1) Added a sensitivity analysis of the algorithm's hyperparameters (stepsize and penalty constant) in Appendix G. (2) Included a computational complexity analysis and comparison in Appendix H. (3) Explicitly stated the inner-loop stepsizes in Remarks 2 and 3

We propose estimating Gaussian graphical models (GGMs) that are fair with respect to sensitive nodal attributes. Many real-world models exhibit unfair discriminatory behavior due to biases in data. Such discrimination is known to be exacerbated when data is equipped with pairwise relationships encoded in a graph. Additionally, the effect of biased data on graphical models is largely underexplored. We thus introduce fairness for graphical models in the form of two bias metrics to promote balance in statistical similarities across nodal groups with different sensitive attributes. Leveraging these metrics, we present Fair GLASSO, a regularized graphical lasso approach to obtain sparse Gaussian precision matrices with unbiased statistical dependencies across groups. We also propose an efficient proximal gradient algorithm to obtain the estimates. Theoretically, we express the tradeoff between fair and accurate estimated precision matrices. Critically, this includes demonstrating when accuracy can be preserved in the presence of a fairness regularizer. On top of this, we study the complexity of Fair GLASSO and demonstrate that our algorithm enjoys a fast convergence rate. Our empirical validation includes synthetic and real-world simulations that illustrate the value and effectiveness of our proposed optimization problem and iterative algorithm.

We report the discovery of a compact star-forming galaxy at $z=9.380$ in the GOODS-North field (named GN-z9p4) which shows numerous strong UV-optical emission lines and a single UV line, NIV] 1486. This makes GN-z9p4 the third-highest redshift N-emitter known to date. We determine the nebular abundances of H, C, N, O and Ne, size, and other physical properties of this object, and compare them to those of the other N-emitters known so far and to other star-forming galaxies. Using the direct method we find a metallicity 12+log(O/H)$=7.37 \pm 0.15$, one of the lowest among the N-emitters. The N/O abundance ratio is highly super-solar, and C/O and Ne/O normal compared to other galaxies at low metallicity. We show that the compactness of GN-z9p4 (with effective radius $118\pm16$ pc at 2 micron) and other N-emitters translates into very high stellar mass and SFR surface densities, which could be a criterium to identify other N-emitters. Future studies and larger samples are needed to understand these recently discovered, rare, and enigmatic objects., Comment: 6 pages, 4 figures. Astronomy & Astrophysics Letters, in press

The CYGNO experiment aims to build a large ($\mathcal{O}(10)$ m$^3$) directional detector for rare event searches, such as nuclear recoils (NRs) induced by dark matter (DM), such as weakly interactive massive particles (WIMPs). The detector concept comprises a time projection chamber (TPC), filled with a He:CF$_4$ 60/40 scintillating gas mixture at room temperature and atmospheric pressure, equipped with an amplification stage made of a stack of three gas electron multipliers (GEMs) which are coupled to an optical readout. The latter consists in scientific CMOS (sCMOS) cameras and photomultipliers tubes (PMTs). The maximisation of the light yield of the amplification stage plays a major role in the determination of the energy threshold of the experiment. In this paper, we simulate the effect of the addition of a strong electric field below the last GEM plane on the GEM field structure and we experimentally test it by means of a 10$\times$10 cm$^2$ readout area prototype. The experimental measurements analyse stacks of different GEMs and helium concentrations in the gas mixture combined with this extra electric field, studying their performances in terms of light yield, energy resolution and intrinsic diffusion. It is found that the use of this additional electric field permits large light yield increases without degrading intrinsic characteristics of the amplification stage with respect to the regular use of GEMs., Comment: Correction of typos in Section 2 and 6. Improved quality of plots with some modifications to clarify the content

Multi-dimensional Fourier transforms are key mathematical building blocks that appear in a wide range of applications from materials science, physics, chemistry and even machine learning. Over the past years, a multitude of software packages targeting distributed multi-dimensional Fourier transforms have been developed. Most variants attempt to offer efficient implementations for single transforms applied on data mapped onto rectangular grids. However, not all scientific applications conform to this pattern, i.e. plane wave Density Functional Theory codes require multi-dimensional Fourier transforms applied on data represented as batches of spheres. Typically, the implementations for this use case are hand-coded and tailored for the requirements of each application. In this work, we present the Fastest Fourier Transform from Berkeley (FFTB) a distributed framework that offers flexible implementations for both regular/non-regular data grids and batched/non-batched transforms. We provide a flexible implementations with a user-friendly API that captures most of the use cases. Furthermore, we provide implementations for both CPU and GPU platforms, showing that our approach offers improved execution time and scalability on the HP Cray EX supercomputer. In addition, we outline the need for flexible implementations for different use cases of the software package., Comment: 17 pages, 9 figures

This paper investigates sequential flexibility markets consisting of a first market layer for distribution system operators (DSOs) to procure local flexibility to resolve their own needs (e.g., congestion management) followed by a second layer, in which the transmission system operator (TSO) procures remaining flexibility forwarded from the distribution system layer as well as flexibility from its own system for providing system services. As the TSO does not necessarily have full knowledge of the distribution grid constraints, this bid forwarding can cause an infeasibility problem for distribution systems, i.e., cleared distribution-level bids in the TSO layer might not satisfy local network constraints. To address this challenge, we introduce and examine three methods aiming to enable the grid-safe use of distribution-located resources in markets for system services, namely: a corrective three-layer market scheme, a bid prequalification/filtering method, and a bid aggregation method. Technically, we provide conditions under which these methods can produce a grid-safe use of distributed flexibility. We also characterize the efficiency of the market outcome under these methods. Finally, we carry out a representative case study to evaluate the performances of the three methods, focusing on economic efficiency, grid-safety, and computational load.

In recent years, the impact of machine learning (ML) and artificial intelligence (AI) in society has been absolutely remarkable. This impact is expected to continue in the foreseeable future. However,the adoption of AI/ML is also a cause of grave concern. The operation of the most advances AI/ML models is often beyond the grasp of human decision makers. As a result, decisions that impact humans may not be understood and may lack rigorous validation. Explainable AI (XAI) is concerned with providing human decision-makers with understandable explanations for the predictions made by ML models. As a result, XAI is a cornerstone of trustworthy AI. Despite its strategic importance, most work on XAI lacks rigor, and so its use in high-risk or safety-critical domains serves to foster distrust instead of contributing to build much-needed trust. Logic-based XAI has recently emerged as a rigorous alternative to those other non-rigorous methods of XAI. This paper provides a technical survey of logic-based XAI, its origins, the current topics of research, and emerging future topics of research. The paper also highlights the many myths that pervade non-rigorous approaches for XAI.

With software development increasingly reliant on innovative technologies, there is a growing interest in exploring the potential of generative AI tools to streamline processes and enhance productivity. In this scenario, this paper investigates the integration of generative AI tools within software development, focusing on understanding their uses, benefits, and challenges to software professionals, in particular, looking at aspects of productivity. Through a pilot case study involving software practitioners working in different roles, we gathered valuable experiences on the integration of generative AI tools into their daily work routines. Our findings reveal a generally positive perception of these tools in individual productivity while also highlighting the need to address identified limitations. Overall, our research sets the stage for further exploration into the evolving landscape of software development practices with the integration of generative AI tools.

With stunning clarity, JWST has revealed the Universe's first billion years. The scientific community is analyzing a wealth of JWST imaging and spectroscopic data from that era, and is in the process of rewriting the astronomy textbooks. Here, 1.5 years into the JWST science mission, we provide a snapshot of the great progress made towards understanding the initial chapters of our cosmic history. We highlight discoveries and breakthroughs, topics and issues that are not yet understood, and questions that will be addressed in the coming years, as JWST continues its revolutionary observations of the Early Universe. While this compendium is written by a small number of authors, invited to ISSI Bern in March 2024 as part of the 2024 ISSI Breakthrough Workshop, we acknowledge the work of a large community that is advancing our collective understanding of the evolution of the Early Universe., Comment: review article written by the attendees of the 2024 ISSI breakthrough workshop "The first billion year of the Universe", submitted. Comments welcome

The NEXT-White detector, a high-pressure gaseous xenon time projection chamber, demonstrated the excellence of this technology for future neutrinoless double beta decay searches using photomultiplier tubes (PMTs) to measure energy and silicon photomultipliers (SiPMs) to extract topology information. This analysis uses $^{83m}\text{Kr}$ data from the NEXT-White detector to measure and understand the energy resolution that can be obtained with the SiPMs, rather than with PMTs. The energy resolution obtained of (10.9 $\pm$ 0.6) $\%$, full-width half-maximum, is slightly larger than predicted based on the photon statistics resulting from very low light detection coverage of the SiPM plane in the NEXT-White detector. The difference in the predicted and measured resolution is attributed to poor corrections, which are expected to be improved with larger statistics. Furthermore, the noise of the SiPMs is shown to not be a dominant factor in the energy resolution and may be negligible when noise subtraction is applied appropriately, for high-energy events or larger SiPM coverage detectors. These results, which are extrapolated to estimate the response of large coverage SiPM planes, are promising for the development of future, SiPM-only, readout planes that can offer imaging and achieve similar energy resolution to that previously demonstrated with PMTs.

A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and structure-from-motion, the problem of synchronizing rotations also finds applications in visual simultaneous localization and mapping, where it is used as an initialization for iterative solvers, and camera network calibration. Nevertheless, this optimization problem is both non-convex and high-dimensional. In this paper, we address it from a maximum likelihood estimation standpoint and make a twofold contribution. Firstly, we set forth a novel primal-dual method, motivated by the widely accepted spectral initialization. Further, we characterize stationary points of rotation averaging in cycle graphs topologies and contextualize this result within spectral graph theory. We benchmark the proposed method in multiple settings and certify our solution via duality theory, achieving a significant gain in precision and performance., Comment: arXiv admin note: text overlap with arXiv:2109.08046

The CYGNO collaboration is developing next generation directional Dark Matter (DM) detection experiments, using gaseous Time Projection Chambers (TPCs), as a robust method for identifying Weakly Interacting Massive Particles (WIMPs) below the Neutrino Fog. SF6 is potentially ideal for this since it provides a high fluorine content, enhancing sensitivity to spin-dependent interactions and, as a Negative Ion Drift (NID) gas, reduces charge diffusion leading to improved positional resolution. CF4, although not a NID gas, has also been identified as a favourable gas target as it provides a scintillation signal which can be used for a complimentary light/charge readout approach. These gases can operate at low pressures to elongate Nuclear Recoil (NR) tracks and facilitate directional measurements. In principle, He could be added to low pressure SF6/CF4 without significant detriment to the length of 16S, 12C, and 19F recoils. This would improve the target mass, sensitivity to lower WIMP masses, and offer the possibility of atmospheric operation; potentially reducing the cost of a containment vessel. In this article, we present gas gain and energy resolution measurements, taken with a Multi-Mesh Thick Gaseous Electron Multiplier (MMThGEM), in low pressure SF6 and CF4:SF6 mixtures following the addition of He. We find that the CF4:SF6:He mixtures tested were able to produce gas gains on the order of 10^4 up to a total pressure of 100 Torr. These results demonstrate an order of magnitude improvement in charge amplification in NID gas mixtures with a He component., Comment: Corresponding Author: A.G. McLean

The (efficient and parsimonious) decomposition of higher-order tensors is a fundamental problem with numerous applications in a variety of fields. Several methods have been proposed in the literature to that end, with the Tucker and PARAFAC decompositions being the most prominent ones. Inspired by the latter, in this work we propose a multi-resolution low-rank tensor decomposition to describe (approximate) a tensor in a hierarchical fashion. The central idea of the decomposition is to recast the tensor into \emph{multiple} lower-dimensional tensors to exploit the structure at different levels of resolution. The method is first explained, an alternating least squares algorithm is discussed, and preliminary simulations illustrating the potential practical relevance are provided.

Animals chain movements into long-lived motor strategies, exhibiting variability across scales that reflects the interplay between internal states and environmental cues. To reveal structure in such variability, we build Markov models of movement sequences that bridges across time scales and enables a quantitative comparison of behavioral phenotypes among individuals. Applied to larval zebrafish responding to diverse sensory cues, we uncover a hierarchy of long-lived motor strategies, dominated by changes in orientation distinguishing cruising versus wandering strategies. Environmental cues induce preferences along these modes at the population level: while fish cruise in the light, they wander in response to aversive stimuli, or in search for appetitive prey. As our method encodes the behavioral dynamics of each individual fish in the transitions among coarse-grained motor strategies, we use it to uncover a hierarchical structure in the phenotypic variability that reflects exploration-exploitation trade-offs. Across a wide range of sensory cues, a major source of variation among fish is driven by prior and/or immediate exposure to prey that induces exploitation phenotypes. A large degree of variability that is not explained by environmental cues unravels motivational states that override the sensory context to induce contrasting exploration-exploitation phenotypes. Altogether, by extracting the timescales of motor strategies deployed during navigation, our approach exposes structure among individuals and reveals internal states tuned by prior experience., Comment: 31 pages, 7 main figures, 1 supplementary table and 8 supplementary figures

Let $K$ be a field, $I\subset R=K[x_1,\dots,x_n]$ and $J\subset T=K[y_1,\dots,y_m]$ be graded ideals. Set $S=R\otimes_KT$ and let $L=IS+JS$. The behaviour of the $\text{v}$-function $\text{v}(L^k)$ in terms of the $\text{v}$-functions $\text{v}(I^k)$ and $\text{v}(J^k)$ is investigated. When $I$ and $J$ are monomial ideals, we describe $\text{v}(L^k)$, giving an explicit formula involving $\text{v}(I^k)$ and $\text{v}(J^k)$.

The goal of reinforcement learning is estimating a policy that maps states to actions and maximizes the cumulative reward of a Markov Decision Process (MDP). This is oftentimes achieved by estimating first the optimal (reward) value function (VF) associated with each state-action pair. When the MDP has an infinite horizon, the optimal VFs and policies are stationary under mild conditions. However, in finite-horizon MDPs, the VFs (hence, the policies) vary with time. This poses a challenge since the number of VFs to estimate grows not only with the size of the state-action space but also with the time horizon. This paper proposes a non-parametric low-rank stochastic algorithm to approximate the VFs of finite-horizon MDPs. First, we represent the (unknown) VFs as a multi-dimensional array, or tensor, where time is one of the dimensions. Then, we use rewards sampled from the MDP to estimate the optimal VFs. More precisely, we use the (truncated) PARAFAC decomposition to design an online low-rank algorithm that recovers the entries of the tensor of VFs. The size of the low-rank PARAFAC model grows additively with respect to each of its dimensions, rendering our approach efficient, as demonstrated via numerical experiments.

Estimating a policy that maps states to actions is a central problem in reinforcement learning. Traditionally, policies are inferred from the so called value functions (VFs), but exact VF computation suffers from the curse of dimensionality. Policy gradient (PG) methods bypass this by learning directly a parametric stochastic policy. Typically, the parameters of the policy are estimated using neural networks (NNs) tuned via stochastic gradient descent. However, finding adequate NN architectures can be challenging, and convergence issues are common as well. In this paper, we put forth low-rank matrix-based models to estimate efficiently the parameters of PG algorithms. We collect the parameters of the stochastic policy into a matrix, and then, we leverage matrix-completion techniques to promote (enforce) low rank. We demonstrate via numerical studies how low-rank matrix-based policy models reduce the computational and sample complexities relative to NN models, while achieving a similar aggregated reward.

Most methods in reinforcement learning use a Policy Gradient (PG) approach to learn a parametric stochastic policy that maps states to actions. The standard approach is to implement such a mapping via a neural network (NN) whose parameters are optimized using stochastic gradient descent. However, PG methods are prone to large policy updates that can render learning inefficient. Trust region algorithms, like Trust Region Policy Optimization (TRPO), constrain the policy update step, ensuring monotonic improvements. This paper introduces low-rank matrix-based models as an efficient alternative for estimating the parameters of TRPO algorithms. By gathering the stochastic policy's parameters into a matrix and applying matrix-completion techniques, we promote and enforce low rank. Our numerical studies demonstrate that low-rank matrix-based policy models effectively reduce both computational and sample complexities compared to NN models, while maintaining comparable aggregated rewards.

In this paper, we describe the intersection between geodesic and conformal currents on closed hyperbolic three-manifolds. We use this to prove some sharp bounds which involve the Liouville entropy of a negatively curved metric, the minimal surface entropy, and the area ratio. Using these ideas we also give a new proof of the Mostow Rigidity Theorem in the three-dimensional case., Comment: 35 pages

Learning representations that capture rich semantic relationships and accommodate propositional calculus poses a significant challenge. Existing approaches are either contrastive, lacking theoretical guarantees, or fall short in effectively representing the partial orders inherent to rich visual-semantic hierarchies. In this paper, we propose a novel approach for learning visual representations that not only conform to a specified semantic structure but also facilitate probabilistic propositional reasoning. Our approach is based on a new nuclear norm-based loss. We show that its minimum encodes the spectral geometry of the semantics in a subspace lattice, where logical propositions can be represented by projection operators.

In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of vertices $n$ and number of edges $e$, the graphs having minimum spectral radius (the minimizer graphs) must be almost regular, meaning that the difference between their maximum degree and their minimum degree is at most one. In this paper, we answer Hong's question positively for various values of $n$ and $e$ and in several cases, we determined the graphs with minimum spectral radius., Comment: 22 pages, 6 figures, revised paper taking into consideration the comments from the referees

Understanding of unconventional superconductivity is crucial for engineering materials with specific order parameters or elevated superconducting transition temperatures. However, for many materials, the pairing mechanism and symmetry of the order parameter remain unclear: reliable and efficient methods of predicting the order parameter and its response to tuning parameters are lacking. Here, we investigate the response of superconductivity in Sr$_2$RuO$_4$ to structural distortions via the random phase approximation (RPA) and functional renormalization group (FRG), starting from realistic models of the electronic structure. Our results suggest that RPA misses the interplay of competing fluctuation channels. FRG reproduces key experimental findings. We predict a magic octahedral rotation angle, maximizing the superconducting $T_c$ and a dominant $d_{x^2-y^2}$ pairing symmetry. To enable experimental verification, we provide calculations of the phase-referenced Bogoliubov Quasiparticle Interference imaging. Our work demonstrates a designer approach to tuning unconventional superconductivity with relevance and applicability for a wide range of quantum materials., Comment: 16 pages, 7 figures in main text, published version

Federated learning (FL) has enabled distributed learning of a model across multiple clients in a privacy-preserving manner. One of the main challenges of FL is to accommodate clients with varying hardware capacities; clients have differing compute and memory requirements. To tackle this challenge, recent state-of-the-art approaches leverage the use of early exits. Nonetheless, these approaches fall short of mitigating the challenges of joint learning multiple exit classifiers, often relying on hand-picked heuristic solutions for knowledge distillation among classifiers and/or utilizing additional layers for weaker classifiers. In this work, instead of utilizing multiple classifiers, we propose a recurrent early exit approach named ReeFL that fuses features from different sub-models into a single shared classifier. Specifically, we use a transformer-based early-exit module shared among sub-models to i) better exploit multi-layer feature representations for task-specific prediction and ii) modulate the feature representation of the backbone model for subsequent predictions. We additionally present a per-client self-distillation approach where the best sub-model is automatically selected as the teacher of the other sub-models at each client. Our experiments on standard image and speech classification benchmarks across various emerging federated fine-tuning baselines demonstrate ReeFL's effectiveness over previous works., Comment: Accepted at the 41st International Conference on Machine Learning (ICML 2024)

Several open-source systems, such as Flower and NVIDIA FLARE, have been developed in recent years while focusing on different aspects of federated learning (FL). Flower is dedicated to implementing a cohesive approach to FL, analytics, and evaluation. Over time, Flower has cultivated extensive strategies and algorithms tailored for FL application development, fostering a vibrant FL community in research and industry. Conversely, FLARE has prioritized the creation of an enterprise-ready, resilient runtime environment explicitly designed for FL applications in production environments. In this paper, we describe our initial integration of both frameworks and show how they can work together to supercharge the FL ecosystem as a whole. Through the seamless integration of Flower and FLARE, applications crafted within the Flower framework can effortlessly operate within the FLARE runtime environment without necessitating any modifications. This initial integration streamlines the process, eliminating complexities and ensuring smooth interoperability between the two platforms, thus enhancing the overall efficiency and accessibility of FL applications., Comment: Added a figure comparing running a Flower application natively or within FLARE

We derive new constraints on the $E_G$ statistic as a test of gravity, combining the CMB lensing map estimated from Data Release 6 (DR6) of the Atacama Cosmology Telescope with SDSS BOSS CMASS and LOWZ galaxy data. We develop an analysis pipeline to measure the cross-correlation between CMB lensing maps and galaxy data, following a blinding policy and testing the approach through null and consistency checks. By testing the equivalence of the spatial and temporal gravitational potentials, the $E_G$ statistic can distinguish $\Lambda$CDM from alternative models of gravity. We find $E_G= 0.31^{+0.06}_{-0.05}$ for ACT and CMASS data at 68.28\% confidence level, and $E_G = 0.49^{+0.14}_{-0.11}$ for ACT and LOWZ. Systematic errors are estimated to be 3\% and 4\% respectively. Including CMB lensing information from Planck PR4 results in $E_G = 0.34^{+0.05}_{-0.05}$ with CMASS and $E_G= 0.43^{+0.11}_{-0.09}$ with LOWZ. These are consistent with predictions for the $\Lambda$CDM model that best fits the Planck CMB anisotropy and SDSS BOSS BAO, where $E_G^{\rm GR} (z_{\rm eff} = 0.555) = 0.401\pm 0.005$ for CMB lensing combined with CMASS and $E_G^{\rm GR} (z_{\rm eff} = 0.316) = 0.452\pm0.005$ combined with LOWZ. We also find $E_G$ to be scale independent, with PTE $>5\%$, as predicted by general relativity. The methods developed in this work are also applicable to improved future analyses with upcoming spectroscopic galaxy samples and CMB lensing measurements., Comment: 33 pages, 21 figures, prepared for submission to PRD

The imaging of individual Ba$^{2+}$ ions in high pressure xenon gas is one possible way to attain background-free sensitivity to neutrinoless double beta decay and hence establish the Majorana nature of the neutrino. In this paper we demonstrate selective single Ba$^{2+}$ ion imaging inside a high-pressure xenon gas environment. Ba$^{2+}$ ions chelated with molecular chemosensors are resolved at the gas-solid interface using a diffraction-limited imaging system with scan area of 1$\times$1~cm$^2$ located inside 10~bar of xenon gas. This new form of microscopy represents an important enabling step in the development of barium tagging for neutrinoless double beta decay searches in $^{136}$Xe, as well as a new tool for studying the photophysics of fluorescent molecules and chemosensors at the solid-gas interface.

The strong coupling of plasmonic resonance modes in conductive pyramidal nanoparticles leads to an increase in the density of free charges on the surface. By ensuring plasmonic coupling in the pyramidal nanoparticle lattice, the achieved field intensity is potentiated. At the same time, a strong coupling between resonant modes is guaranteed, which results in the formation of new hybrid modes. In this manuscript, we demonstrated a tunable double anticrossing interaction that results from the interaction between two Localized Surface Plasmon Resonance (LSPR) modes and a Surface Plasmon Polariton (SPP) wave. The tuning is done as a function of the variation of the angle of incidence of the input electric field. From the double anticrossing, an increase in field intensity in a blue-shifted LSPR mode located in the red wavelength region is observed. This demonstrates that at certain angles of incidence, the intensity field obtained is strongly favored, which would be beneficial for applications such as Surface Enhancement Raman Spectroscopy (SERS). Nanoparticle-based lattices have been widely used for biosensor applications. However, one of the major limitations of this type of device is the low tolerance to high concentrations of biomolecules, which significantly affects their performance. According to the studies carried out for this manuscript, it was demonstrated that the implemented geometry allows for the observation of an LSPR mode, which is responsible for the control and synchronization of other perceived resonances. This mode remains almost invariant when subjected to structural variations or changes in the angle of incidence of the electric field. These characteristics eliminate the limitation mentioned above, allowing for sensitivities 10^3 times higher than those achieved in conventional systems based on LSPR used to detect P. brasiliensis antigen., Comment: 21 pages, 3 figures

A central goal of eXplainable Artificial Intelligence (XAI) is to assign relative importance to the features of a Machine Learning (ML) model given some prediction. The importance of this task of explainability by feature attribution is illustrated by the ubiquitous recent use of tools such as SHAP and LIME. Unfortunately, the exact computation of feature attributions, using the game-theoretical foundation underlying SHAP and LIME, can yield manifestly unsatisfactory results, that tantamount to reporting misleading relative feature importance. Recent work targeted rigorous feature attribution, by studying axiomatic aggregations of features based on logic-based definitions of explanations by feature selection. This paper shows that there is an essential relationship between feature attribution and a priori voting power, and that those recently proposed axiomatic aggregations represent a few instantiations of the range of power indices studied in the past. Furthermore, it remains unclear how some of the most widely used power indices might be exploited as feature importance scores (FISs), i.e. the use of power indices in XAI, and which of these indices would be the best suited for the purposes of XAI by feature attribution, namely in terms of not producing results that could be deemed as unsatisfactory. This paper proposes novel desirable properties that FISs should exhibit. In addition, the paper also proposes novel FISs exhibiting the proposed properties. Finally, the paper conducts a rigorous analysis of the best-known power indices in terms of the proposed properties.

The uses of machine learning (ML) have snowballed in recent years. In many cases, ML models are highly complex, and their operation is beyond the understanding of human decision-makers. Nevertheless, some uses of ML models involve high-stakes and safety-critical applications. Explainable artificial intelligence (XAI) aims to help human decision-makers in understanding the operation of such complex ML models, thus eliciting trust in their operation. Unfortunately, the majority of past XAI work is based on informal approaches, that offer no guarantees of rigor. Unsurprisingly, there exists comprehensive experimental and theoretical evidence confirming that informal methods of XAI can provide human-decision makers with erroneous information. Logic-based XAI represents a rigorous approach to explainability; it is model-based and offers the strongest guarantees of rigor of computed explanations. However, a well-known drawback of logic-based XAI is the complexity of logic reasoning, especially for highly complex ML models. Recent work proposed distance-restricted explanations, i.e. explanations that are rigorous provided the distance to a given input is small enough. Distance-restricted explainability is tightly related with adversarial robustness, and it has been shown to scale for moderately complex ML models, but the number of inputs still represents a key limiting factor. This paper investigates novel algorithms for scaling up the performance of logic-based explainers when computing and enumerating ML model explanations with a large number of inputs.

Large language models (LLMs) have revolutionized Natural Language Processing (NLP), but their size creates computational bottlenecks. We introduce a novel approach to create accurate, sparse foundational versions of performant LLMs that achieve full accuracy recovery for fine-tuning tasks at up to 70% sparsity. We achieve this for the LLaMA-2 7B model by combining the SparseGPT one-shot pruning method and sparse pretraining of those models on a subset of the SlimPajama dataset mixed with a Python subset of The Stack dataset. We exhibit training acceleration due to sparsity on Cerebras CS-3 chips that closely matches theoretical scaling. In addition, we establish inference acceleration of up to 3x on CPUs by utilizing Neural Magic's DeepSparse engine and 1.7x on GPUs through Neural Magic's nm-vllm engine. The above gains are realized via sparsity alone, thus enabling further gains through additional use of quantization. Specifically, we show a total speedup on CPUs for sparse-quantized LLaMA models of up to 8.6x. We demonstrate these results across diverse, challenging tasks, including chat, instruction following, code generation, arithmetic reasoning, and summarization to prove their generality. This work paves the way for rapidly creating smaller and faster LLMs without sacrificing accuracy.