Search

The observation of X-rays during quiescence from transiently accreting neutron stars provides unique clues about the nature of dense matter. This, however, requires extensive modeling of the crusts and matching the results to observations. The pycnonuclear fusion reaction rates implemented in these models are theoretically calculated by extending phenomenological expressions and have large uncertainties spanning many orders of magnitude. We present the first sensitivity studies of these pycnonuclear fusion reactions in realistic network calculations. We also couple the reaction network with the thermal evolution code dStar to further study their impact on the neutron star cooling curves in quiescence. Varying the pycnonuclear fusion reaction rates alters the depth at which nuclear heat is deposited although the total heating remains constant. The enhancement of the pycnonuclear fusion reaction rates leads to an overall shallower deposition of nuclear heat. The impurity factors are also altered depending on the type of ashes deposited on the crust. These total changes correspond to a variation of up to 9 eV in the modeled cooling curves. While this is not sufficient to explain the shallow heat source, it is comparable to the observational uncertainties and can still be important for modeling the neutron star crust., Comment: AASTeX63, 11 pages with 9 figures

In the absence of a complete theory of quantum gravity, phenomenological models built upon minimal assumptions have been explored for the analysis of possible quantum effects in gravitational systems. Implications of a superposition of geometries have been considered in such models, including the occurrence of processes with indefinite order. In a gravitational quantum switch, in particular, the order of operations applied by two agents on a target system is entangled with the state of the geometry. We consider a model describing the superposition of geometries produced by distinct arrangements of spherical mass shells, and show that a protocol for the implementation of a gravitational quantum switch can be formulated in such a system. The geometries in superposition are identical in an exterior region outside a given radius, and differ within such a radius. The exterior region provides a classical frame from which the superposition of geometries in the interior region can be probed. One of the agents crosses the interior region and becomes entangled with the geometry, which is explored as a resource for the implementation of the quantum switch. Novel features of the protocol include the superposition of nonisometric geometries, the existence of a region with a definite geometry, and the fact that the agent that experiences the superposition of geometries is in free fall, preventing information on the global geometry to be obtained from within its laboratory., Comment: 25 pages, 5 figures. Updated abstract

Ultra-low temperature (ULT) freezers store perishable bio-contents and have high energy consumption, which highlight a demand for reliable methods for intelligent surveillance and smart energy management. This study introduces a novel grey-box modelling approach based on stochastic differential equations to describe the heat dynamics of the ULT freezing chambers. The proposed modelling approach only requires temperature data measured by the embedded sensors and uses data from the regular operation periods for model identification. The model encompasses three states: chamber temperature, envelope temperature, and local evaporator temperature. Special attention is given to the local evaporator temperature state, which is modelled as a time-variant system, to characterize the time delay and dynamic variations in cooling intensity. Two ULT freezers with different operational patterns are modelled. The unknown model parameters are estimated using the maximum likelihood method. The results demonstrate that the models can accurately predict the chamber temperature measured by the control probe (RMSE < 0.19 {\deg}C) and are promising to be applied for forecasting future states. In addition, the model for local evaporator temperature can effectively adapt to different operational patterns and provide insight into the local cooling supply status. The proposed approach greatly promotes the practical feasibility of grey-box modelling of the heat dynamics for ULT freezers and can serve several potential digital applications. A major limitation of the modelling approach is the low identifiability, which can potentially be addressed by inferring model parameters based on relative parameter changes.

Hierarchical Bayesian models of perception and learning feature prominently in contemporary cognitive neuroscience where, for example, they inform computational concepts of mental disorders. This includes predictive coding and hierarchical Gaussian filtering (HGF), which differ in the nature of hierarchical representations. Predictive coding assumes that higher levels in a given hierarchy influence the state (value) of lower levels. In HGF, however, higher levels determine the rate of change at lower levels. Here, we extend the space of generative models underlying HGF to include a form of nonlinear hierarchical coupling between state values akin to predictive coding and artificial neural networks in general. We derive the update equations corresponding to this generalization of HGF and conceptualize them as connecting a network of (belief) nodes where parent nodes either predict the state of child nodes or their rate of change. This enables us to (1) create modular architectures with generic computational steps in each node of the network, and (2) disclose the hierarchical message passing implied by generalized HGF models and to compare this to comparable schemes under predictive coding. We find that the algorithmic architecture instantiated by the generalized HGF is largely compatible with that of predictive coding but extends it with some unique predictions which arise from precision and volatility related computations. Our developments enable highly flexible implementations of hierarchical Bayesian models for empirical data analysis and are available as open source software.

In situations with non-manipulable exposures, interventions can be targeted to shift the distribution of intermediate variables between exposure groups to define interventional disparity indirect effects. In this work, we present a theoretical study of identification and nonparametric estimation of the interventional disparity indirect effect among the exposed. The targeted estimand is intended for applications examining the outcome risk among an exposed population for which the risk is expected to be reduced if the distribution of a mediating variable was changed by a (hypothetical) policy or health intervention that targets the exposed population specifically. We derive the nonparametric efficient influence function, study its double robustness properties and present a targeted minimum loss-based estimation (TMLE) procedure. All theoretical results and algorithms are provided for both uncensored and right-censored survival outcomes. With offset in the ongoing discussion of the interpretation of non-manipulable exposures, we discuss relevant interpretations of the estimand under different sets of assumptions of no unmeasured confounding and provide a comparison of our estimand to other related estimands within the framework of interventional (disparity) effects. Small-sample performance and double robustness properties of our estimation procedure are investigated and illustrated in a simulation study., Comment: 35 pages, 1 figure

The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the variational determination of the geometric measure of entanglement for a large number of qubits. The method is based on measuring compatible two-qubit local functions whose optimization allows for achieving a well-suited initial condition, from which a global function can be further optimized without encountering a barren plateau. We analytically demonstrate that the local functions can be efficiently estimated and optimized. Numerical simulations up to 18-qubit GHZ and W states demonstrate that the method converges to the exact value. In particular, the method allows for escaping from barren plateaus induced by hardware noise or global functions defined on high-dimensional systems. Numerical simulations with noise are in agreement with experiments carried out on IBM's quantum processors for 7 qubits.

In the realm of Computational Social Science (CSS), practitioners often navigate complex, low-resource domains and face the costly and time-intensive challenges of acquiring and annotating data. We aim to establish a set of guidelines to address such challenges, comparing the use of human-labeled data with synthetically generated data from GPT-4 and Llama-2 in ten distinct CSS classification tasks of varying complexity. Additionally, we examine the impact of training data sizes on performance. Our findings reveal that models trained on human-labeled data consistently exhibit superior or comparable performance compared to their synthetically augmented counterparts. Nevertheless, synthetic augmentation proves beneficial, particularly in improving performance on rare classes within multi-class tasks. Furthermore, we leverage GPT-4 and Llama-2 for zero-shot classification and find that, while they generally display strong performance, they often fall short when compared to specialized classifiers trained on moderately sized training sets., Comment: Accepted at EACL 2024. 14 pages, 4 figures, 2 tables

We prove a rigidity result for mean curvature self-translating solitons, characterizing the grim reaper cylinder as the only finite entropy self-translating 2-surface in $\mathbb{R}^3$ of width $\pi$ and bounded from below. The proof makes use of parabolicity in a weighted setting applied to a suitable universally $L$-superharmonic function defined on translaters in such slabs., Comment: Expanded introduction. New result added (Theorem 1.6). All comments are welcome!

The formation of dispersive shock waves in the one-dimensional Bose gas represents a limitation of Generalized Hydrodynamics (GHD) due to the coarse-grained nature of the theory. Nevertheless, GHD accurately captures the long wavelength behavior indicating an implicit knowledge of the underlying microscopic physics. Such representation are already known through the Whitham modulation theory, where dispersion-less equations describe the evolution of the slowly varying shock wave parameters. Here we study the correspondence between Whithams approach to the Gross-Pitaevskii equation and GHD in the semi-classical limit. Our findings enable the recovery of the shock wave solution directly from GHD simulations, which we demonstrate for both zero and finite temperature. Additionally, we study how free expansion protocols affect the shock wave density and their implications for experimental detection. The combined picture of Whitham and GHD lends itself to additional physical interpretation regarding the formation of shock waves. Further, this picture exhibits clear analogies to the theory of Quantum GHD, and we discuss possible routes to establish an explicit connection between them., Comment: 17 pages, 9 figures

Domain shift significantly influences the performance of deep learning algorithms, particularly for object detection within volumetric 3D images. Annotated training data is essential for deep learning-based object detection. However, annotating densely packed objects is time-consuming and costly. Instead, we suggest training models on individually scanned objects, causing a domain shift between training and detection data. To address this challenge, we introduce the BugNIST dataset, comprising 9154 micro-CT volumes of 12 bug types and 388 volumes of tightly packed bug mixtures. This dataset is characterized by having objects with the same appearance in the source and target domains, which is uncommon for other benchmark datasets for domain shift. During training, individual bug volumes labeled by class are utilized, while testing employs mixtures with center point annotations and bug type labels. Together with the dataset, we provide a baseline detection analysis, with the aim of advancing the field of 3D object detection methods., Comment: 31 pages, 12 figures, 5 tables

The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of $n$ points in $\mathbb{R}^d$ into $m=O(\varepsilon^{-2} \lg n)$ dimensions while preserving all pairwise distances to within $1 \pm \varepsilon$. Each input point $x$ is embedded to $Ax$, where $A$ is an $m \times d$ matrix having $s$ non-zeros per column, allowing for an embedding time of $O(s \|x\|_0)$. Since the sparsity of $A$ governs the embedding time, much work has gone into improving the sparsity $s$. The current state-of-the-art by Kane and Nelson (JACM'14) shows that $s = O(\varepsilon ^{-1} \lg n)$ suffices. This is almost matched by a lower bound of $s = \Omega(\varepsilon ^{-1} \lg n/\lg(1/\varepsilon))$ by Nelson and Nguyen (STOC'13). Previous work thus suggests that we have near-optimal embeddings. In this work, we revisit sparse embeddings and identify a loophole in the lower bound. Concretely, it requires $d \geq n$, which in many applications is unrealistic. We exploit this loophole to give a sparser embedding when $d = o(n)$, achieving $s = O(\varepsilon^{-1}(\lg n/\lg(1/\varepsilon)+\lg^{2/3}n \lg^{1/3} d))$. We also complement our analysis by strengthening the lower bound of Nelson and Nguyen to hold also when $d \ll n$, thereby matching the first term in our new sparsity upper bound. Finally, we also improve the sparsity of the best oblivious subspace embeddings for optimal embedding dimensionality.

Many sectors nowadays require accurate and coherent predictions across their organization to effectively operate. Otherwise, decision-makers would be planning using disparate views of the future, resulting in inconsistent decisions across their sectors. To secure coherency across hierarchies, recent research has put forward hierarchical learning, a coherency-informed hierarchical regressor leveraging the power of machine learning thanks to a custom loss function founded on optimal reconciliation methods. While promising potentials were outlined, results exhibited discordant performances in which coherency information only improved hierarchical forecasts in one setting. This work proposes to tackle these obstacles by investigating custom neural network designs inspired by the topological structures of hierarchies. Results unveil that, in a data-limited setting, structural models with fewer connections perform overall best and demonstrate the coherency information value for both accuracy and coherency forecasting performances, provided individual forecasts were generated within reasonable accuracy limits. Overall, this work expands and improves hierarchical learning methods thanks to a structurally-scaled learning mechanism extension coupled with tailored network designs, producing a resourceful, data-efficient, and information-rich learning process., Comment: arXiv admin note: text overlap with arXiv:2301.12967

For the fundamental problem of allocating a set of resources among individuals with varied preferences, the quality of an allocation relates to the degree of fairness and the collective welfare achieved. Unfortunately, in many resource-allocation settings, it is computationally hard to maximize welfare while achieving fairness goals. In this work, we consider ex-ante notions of fairness; popular examples include the \emph{randomized round-robin algorithm} and \emph{sortition mechanism}. We propose a general framework to systematically study the \emph{interpolation} between fairness and welfare goals in a multi-criteria setting. We develop two efficient algorithms ($\varepsilon-Mix$ and $Simple-Mix$) that achieve different trade-off guarantees with respect to fairness and welfare. $\varepsilon-Mix$ achieves an optimal multi-criteria approximation with respect to fairness and welfare, while $Simple-Mix$ achieves optimality up to a constant factor with zero computational overhead beyond the underlying \emph{welfare-maximizing mechanism} and the \emph{ex-ante fair mechanism}. Our framework makes no assumptions on either of the two underlying mechanisms, other than that the fair mechanism produces a distribution over the set of all allocations. Indeed, if these mechanisms are themselves approximation algorithms, our framework will retain the approximation factor, guaranteeing sensitivity to the quality of the underlying mechanisms, while being \emph{oblivious} to them. We also give an extensive experimental analysis for the aforementioned ex-ante fair mechanisms on real data sets, confirming our theoretical analysis.

Optimal decision-making compels us to anticipate the future at different horizons. However, in many domains connecting together predictions from multiple time horizons and abstractions levels across their organization becomes all the more important, else decision-makers would be planning using separate and possibly conflicting views of the future. This notably applies to smart grid operation. To optimally manage energy flows in such systems, accurate and coherent predictions must be made across varying aggregation levels and horizons. With this work, we propose a novel multi-dimensional hierarchical forecasting method built upon structurally-informed machine-learning regressors and established hierarchical reconciliation taxonomy. A generic formulation of multi-dimensional hierarchies, reconciling spatial and temporal hierarchies under a common frame is initially defined. Next, a coherency-informed hierarchical learner is developed built upon a custom loss function leveraging optimal reconciliation methods. Coherency of the produced hierarchical forecasts is then secured using similar reconciliation technics. The outcome is a unified and coherent forecast across all examined dimensions. The method is evaluated on two different case studies to predict building electrical loads across spatial, temporal, and spatio-temporal hierarchies. Although the regressor natively profits from computationally efficient learning, results displayed disparate performances, demonstrating the value of hierarchical-coherent learning in only one setting. Yet, supported by a comprehensive result analysis, existing obstacles were clearly delineated, presenting distinct pathways for future work. Overall, the paper expands and unites traditionally disjointed hierarchical forecasting methods providing a fertile route toward a novel generation of forecasting regressors.

AdaBoost is a classic boosting algorithm for combining multiple inaccurate classifiers produced by a weak learner, to produce a strong learner with arbitrarily high accuracy when given enough training data. Determining the optimal number of samples necessary to obtain a given accuracy of the strong learner, is a basic learning theoretic question. Larsen and Ritzert (NeurIPS'22) recently presented the first provably optimal weak-to-strong learner. However, their algorithm is somewhat complicated and it remains an intriguing question whether the prototypical boosting algorithm AdaBoost also makes optimal use of training samples. In this work, we answer this question in the negative. Concretely, we show that the sample complexity of AdaBoost, and other classic variations thereof, are sub-optimal by at least one logarithmic factor in the desired accuracy of the strong learner.

"Generalized Hydrodynamics" (GHD) stands for a model that describes one-dimensional \textit{integrable} systems in quantum physics, such as ultra-cold atoms or spin chains. Mathematically, GHD corresponds to nonlinear equations of kinetic type, where the main unknown, a statistical distribution function $f(t,z,\theta)$, lives in a phase space which is constituted by a one-dimensional position variable $z$, and a one-dimensional "kinetic" variable $\theta$, actually a wave-vector, called "rapidity". Two key features of GHD equations are first a non-local and nonlinear coupling in the advection term, and second an infinite set of conserved quantities, which prevent the system from thermalizing. To go beyond this, we consider the dissipative GHD equations, which are obtained by supplementing the right-hand side of the GHD equations with a non-local and nonlinear diffusion operator or a Boltzmann-type collision integral. In this paper, we deal with new high-order numerical methods to efficiently solve these kinetic equations. In particular, we devise novel backward semi-Lagrangian methods for solving the advective part (the so-called Vlasov equation) by using a high-order time-Taylor series expansion for the advection fields, whose successive time derivatives are obtained by a recursive procedure. This high-order temporal approximation of the advection fields are used to design new implicit/explicit Runge-Kutta semi-Lagrangian methods, which are compared to Adams-Moulton semi-Lagrangian schemes. For solving the source terms, constituted by the diffusion and collision operators, we use and compare different numerical methods of the literature., Comment: 35 pages, 8 figures, 1 table

There is a lack of point process models on linear networks. For an arbitrary linear network, we consider new models for a Cox process with an isotropic pair correlation function obtained in various ways by transforming an isotropic Gaussian process which is used for driving the random intensity function of the Cox process. In particular we introduce three model classes given by log Gaussian, interrupted, and permanental Cox processes on linear networks, and consider for the first time statistical procedures and applications for parametric families of such models. Moreover, we construct new simulation algorithms for Gaussian processes on linear networks and discuss whether the geodesic metric or the resistance metric should be used for the kind of Cox processes studied in this paper.

The space of possible human cultures is vast, but some cultural configurations are more consistent with cognitive and social constraints than others. This leads to a ``landscape'' of possibilities that our species has explored over millennia of cultural evolution. But what does this fitness landscape, which constrains and guides cultural evolution, look like? The machine-learning algorithms that can answer these questions are typically developed for large-scale datasets. Applications to the sparse, inconsistent, and incomplete data found in the historical record have received less attention, and standard recommendations can lead to bias against marginalized, under-studied, or minority cultures. We show how to adapt the Minimum Probability Flow algorithm and the Inverse Ising model, a physics-inspired workhorse of machine learning, to the challenge. A series of natural extensions -- including dynamical estimation of missing data, and cross-validation with regularization -- enables reliable reconstruction of the underlying constraints. We demonstrate our methods on a curated subset of the Database of Religious History: records from 407 religious groups throughout human history, ranging from the Bronze Age to the present day. This reveals a complex, rugged, landscape, with both sharp, well-defined peaks where state-endorsed religions tend to concentrate, and diffuse cultural floodplains where evangelical religions, non-state spiritual practices, and mystery religions can be found., Comment: 29 pages, 4 figures, 8 tables. In review

The study of the properties of galaxies in the first billion years after the Big Bang is one of the major topic of current astrophysics. Optical/near-infrared spectroscopy of the afterglows of long Gamma-ray bursts (GRBs) provide a powerful diagnostic tool to probe the interstellar medium (ISM) of their host galaxies and foreground absorbers, even up to the highest redshifts. We analyze the VLT/X-shooter afterglow spectrum of GRB 210905A, triggered by the Swift Neil Gehrels Observatory, and detect neutral-hydrogen, low-ionization, high-ionization, and fine-structure absorption lines from a complex system at z=6.3118, that we associate with the GRB host galaxy. We study the ISM properties of the host system, revealing the metallicity, kinematics and chemical abundance pattern. The total metallicity of the z~6.3 system is [M/H]=-1.72+/-0.13, after correcting for dust-depletion and taking into account alpha-element enhancement. In addition, we determine the overall amount of dust and dust-to-metal mass ratio (DTM) ([Zn/Fe]_fit=0.33+/-0.09, DTM=0.18+/-0.03). We find indications of nucleosynthesis due to massive stars and evidence of peculiar over-abundance of aluminium. From the analysis of fine-structure lines, we determine distances of several kpc for the low-ionization gas clouds closest to the GRB. Those farther distances are possibly due to the high number of ionizing photons. Using the HST/F140W image of the GRB field, we show the GRB host galaxy as well as multiple objects within 2" from the GRB. We discuss the galaxy structure and kinematics that could explain our observations, also taking into account a tentative detection of Lyman-alpha emission. Deep spectroscopic observations with VLT/MUSE and JWST will offer the unique possibility of combining our results with the ionized-gas properties, with the goal of better understanding how galaxies in the reionization era form and evolve., Comment: Accepted Publication (In Press on A&A) - 22 pages, 10 figures, 6 tables - Appendix: 6 figures, 3 tables

We present the Active Galactic Nuclei (AGN) classifier as currently implemented within the Fink broker. Features were built upon summary statistics of available photometric points, as well as color estimation enabled by symbolic regression. The learning stage includes an active learning loop, used to build an optimized training sample from labels reported in astronomical catalogs. Using this method to classify real alerts from the Zwicky Transient Facility (ZTF), we achieved 98.0% accuracy, 93.8% precision and 88.5% recall. We also describe the modifications necessary to enable processing data from the upcoming Vera C. Rubin Observatory Large Survey of Space and Time (LSST), and apply them to the training sample of the Extended LSST Astronomical Time-series Classification Challenge (ELAsTiCC). Results show that our designed feature space enables high performances of traditional machine learning algorithms in this binary classification task., Comment: Accepted for the Machine learning and the Physical Sciences workshop of NeurIPS 2022

An open question in mechanics is whether mechanical resonators can be made nonlinear with vibrations approaching the quantum ground state. This requires engineering a mechanical nonlinearity far beyond what has been realized thus far. Here we discovered a mechanism to boost the Duffing nonlinearity by coupling the vibrations of a nanotube resonator to single-electron tunneling and by operating the system in the ultrastrong coupling regime. Remarkably, thermal vibrations become highly nonlinear when lowering the temperature. The average vibration amplitude at the lowest temperature is 13 times the zero-point motion, with approximately 42% of the thermal energy stored in the anharmonic part of the potential. Our work paves the way for realizing mechanical Schrodinger cat states [1], mechanical qubits [2, 3], and quantum simulators emulating the electron-phonon coupling [4].

The description of distributions related to grain microstructure helps physicists to understand the processes in materials and their properties. This paper presents a general statistical methodology for the analysis of crystallographic orientations of grains in a 3D Laguerre tessellation dataset which represents the microstructure of a polycrystalline material. We introduce complex stochastic models which may substitute expensive laboratory experiments: conditional on the Laguerre tessellation, we suggest interaction models for the distribution of cubic crystal lattice orientations, where the interaction is between pairs of orientations for neighbouring grains in the tessellation. We discuss parameter estimation and model comparison methods based on maximum pseudolikelihood as well as graphical procedures for model checking using simulations. Our methodology is applied for analysing a dataset representing a nickel-titanium shape memory alloy.