SearcharxivSearch

arXiv subjects

Thorben Menne

Publications and source records attributed to Thorben Menne.

3 recordsLinked to original sources

Comparative Study of Neural Surrogate Architectures for Autoregressive Prediction of Internal Battery States

The Doyle-Fuller-Newman (DFN) model resolves internal electrochemical states in lithium-ion batteries with high fidelity. However, the numerical solution of its governing equations is computationally prohibitive for real-time deployment, limiting scalability from individual cells to pack and fleet-scale applications. While machine learning surrogates can substantially reduce inference latency through GPU acceleration, most existing approaches learn solution approximations tied to specific operating conditions rather than learning generalizable state-evolution dynamics. This work presents a systematic comparison of four neural network architectures (MLP, ResNet, U-Net, FNO) formulated as autoregressive state-transition operators that predict full DFN internal states across a wide range of operating conditions. To ensure a controlled architectural comparison, all models are trained under a unified framework using multi-step unrolling and current-conditioning, isolating the impact of spatial inductive bias. Results demonstrate that the U-Net's multi-scale feature hierarchy achieves a mean final-step nRMSE of 3% averaged across all internal state variables after 300-step autoregressive rollouts, while providing a 5.38x speed-up over the numerical solver. These findings highlight spatial inductive bias as a critical determinant of surrogate performance, advancing the development of surrogates for internal state observability for next-generation battery management systems and digital twins.

cs.LG

Density-clustering of continuous gravitational wave candidates from large surveys

Searches for continuous gravitational waves target nearly monochromatic gravitational wave emission from e.g. non-axysmmetric fast-spinning neutron stars. Broad surveys often require to explicitly search for a very large number of different waveforms, easily exceeding $\sim10^{17}$ templates. In such cases, for practical reasons, only the top, say $\sim10^{10}$, results are saved and followed-up through a hierarchy of stages. Most of these candidates are not completely independent of neighbouring ones, but arise due to some common cause: a fluctuation, a signal or a disturbance. By judiciously clustering together candidates stemming from the same root cause, the subsequent follow-ups become more effective. A number of clustering algorithms have been employed in past searches based on iteratively finding symmetric and compact over-densities around candidates with high detection statistic values. The new clustering method presented in this paper is a significant improvement over previous methods: it is agnostic about the shape of the over-densities, is very efficient and it is effective: at a very high detection efficiency, it has a noise rejection of $99.99\%$ , is capable of clustering two orders of magnitude more candidates than attainable before and, at fixed sensitivity it enables more than a factor of 30 faster follow-ups. We also demonstrate how to optimally choose the clustering parameters.

gr-qc

Recent Improvements for the Lepton Propagator PROPOSAL

The lepton propagator PROPOSAL is a Monte-Carlo Simulation library written in C++, propagating high energy muons and other charged particles through large distances of media. In this article, a restructuring of the code is described, which yields a performance improvement of up to $30\,\%$. For an improved accuracy of the propagation processes, more exact calculations of the leptonic and hadronic decay process and more precise parametrizations for the interaction cross sections are now available. The new modular structure allows a more flexible and custom usage, which is further facilitated with a python interface.

hep-ph