Search

Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the $m$th derivatives $q_k^{(m)}$, in a root-sparse open set $U$, as $k\to\infty$. More precisely, if the root distributions $\mu_k$ of $q_k$ converge weak* to some compactly supported measure $\mu$, whose potential is nowhere locally constant on a root-sparse open set $U$, then we link the roots of the $m$th derivative $q_k^{m}$, for an arbitrary $m>0$, to the roots of $q_k$ and the critical points of the potential $p_\mu$ on compact subsets of $U$. We apply this result in a polynomial dynamics setting to obtain convergence results for the roots of the $m$th derivative of iterates of a polynomial outside the filled-in Julia set. We also apply our result in the setting of extremal polynomials.

Data from the Gaia mission shows prominent phase-space spirals that are the signatures of disequilibrium in the Milky Way (MW) disc. In this work, we present a novel perspective on the phase-space spiral in angular momentum (AM) space. Using Gaia DR3, we detect a prominent AM spiral in the solar neighbourhood. We demonstrate the relation of AM to the $z-v_z$ spiral and show that we can map to this space from angular momentum through simplifying assumptions. By modelling the orbit of stars in AM, we develop a generative model for the spiral where the disc is perturbed by a bulk tilt at an earlier time. Our model successfully describes the salient features of the AM spiral in the data. Modelling the phase spiral in AM is a promising method to constrain both perturbation and MW potential parameters. Our AM framework simplifies the interpretation of the spiral and offers a robust approach to modelling disequilibrium in the MW disc using all six dimensions of phase space simultaneously., Comment: 10 pages, 5 figures

Multi-agent systems are increasingly applied in space missions, including distributed space systems, resilient constellations, and autonomous rendezvous and docking operations. A critical emerging application is collaborative spacecraft servicing, which encompasses on-orbit maintenance, space debris removal, and swarm-based satellite repositioning. These missions involve servicing spacecraft interacting with malfunctioning or defunct spacecraft under challenging conditions, such as limited state information, measurement inaccuracies, and erratic target behaviors. Existing approaches often rely on assumptions of full state knowledge or single-integrator dynamics, which are impractical for real-world applications involving second-order spacecraft dynamics. This work addresses these challenges by developing a distributed state estimation and tracking framework that requires only relative position measurements and operates under partial state information. A novel $\rho$-filter is introduced to reconstruct unknown states using locally available information, and a Lyapunov-based deep neural network adaptive controller is developed that adaptively compensates for uncertainties stemming from unknown spacecraft dynamics. To ensure the collaborative spacecraft regulation problem is well-posed, a trackability condition is defined. A Lyapunov-based stability analysis is provided to ensure exponential convergence of errors in state estimation and spacecraft regulation to a neighborhood of the origin under the trackability condition. The developed method eliminates the need for expensive velocity sensors or extensive pre-training, offering a practical and robust solution for spacecraft servicing in complex, dynamic environments., Comment: 24 pages, 4 Figures, Journal

Ultrasound localization microscopy (ULM) enables microvascular imaging at spatial resolutions beyond the acoustic diffraction limit, offering significant clinical potentials. However, ULM performance relies heavily on microbubble (MB) signal sparsity, the number of detected MBs, and signal-to-noise ratio (SNR), all of which vary in clinical scenarios involving bolus MB injections. These sources of variations underscore the need to optimize MB dosage, data acquisition timing, and imaging settings in order to standardize and optimize ULM of microvasculature. This pilot study investigated temporal changes in MB signals during bolus injections in both pig and human models to optimize data acquisition for clinical ULM. Quantitative indices were developed to evaluate MB signal quality, guiding selection of acquisition timing that balances the MB localization quality and adequate MB counts. The effects of transmitted voltage and dosage were also explored. In the pig model, a relatively short window (approximately 10 seconds) for optimal acquisition was identified during the rapid wash-out phase, highlighting the need for real-time MB signal monitoring during data acquisition. The slower wash-out phase in humans allowed for a more flexible imaging window of 1-2 minutes, while trade-offs were observed between localization quality and MB density (or acquisition length) at different wash-out phase timings. Guided by these findings, robust ULM imaging was achieved in both pig and human kidneys using a short period of data acquisition, demonstrating its feasibility in clinical practice. This study provides insights into optimizing data acquisition for consistent and reproducible ULM, paving the way for its standardization and broader clinical applications., Comment: 33 pages, 9 figures

We introduce a general framework to study the local dynamics of near-parabolic maps using the meromorphic $1$-form introduced by X.~Buff. As a sample application of this setup, we prove the following tameness result on invariant curves of near-parabolic maps: Let $g(z)=\lambda z+O(z^2)$ have a non-degenerate parabolic fixed point at $0$ with multiplier $\lambda$ a primitive $q$th root of unity, and let $\gamma: \, ]-\infty,0] \to {\mathbb D}(0,r)$ be a $g^{\circ q}$-invariant curve landing at $0$ in the sense that $g^{\circ q}(\gamma(t))=\gamma(t+1)$ and $\lim_{t \to -\infty} \gamma(t)=0$. Take a sequence $g_n(z)=\lambda_n z+O(z^2)$ with $|\lambda_n|\neq 1$ such that $g_n \to g$ uniformly on ${\mathbb D}(0,r)$ and suppose each $g_n$ admits a $g_n^{\circ q}$-invariant curve $\gamma_n: \, ]-\infty,0] \to {\mathbb C}$ such that $\gamma_n \to \gamma$ uniformly on the fundamental segment $[-1,0]$. If $\lambda_n^q \to 1$ non-tangentially, then $\gamma_n$ lands at a repelling periodic point near $0$, and $\gamma_n \to \gamma$ uniformly on $]-\infty,0]$. In the special case of polynomial maps, this proves Hausdorff continuity of external rays of a given periodic angle when the associated multipliers approach a root of unity non-tangentially., Comment: 32 pages, 8 figures

This paper investigates the linear response of a series of spheroidal stellar clusters, the Kuzmin-Kutuzov St\"ackel family, which exhibit a continuous range of flattening and rotation, extending from an isochrone sphere to a Toomre disk. The method successfully replicates the growing modes previously identified in published $N$-body simulations. It relies on the efficiency of the matrix method to quantify systematically the effects of rotation and flattening on the eigenmodes of the galaxy. We identify two types of bi-symmetric instabilities for the flatter models - the so-called bending and bar-growing modes - the latter of which persists even for very round models. As anticipated, in its least unstable configurations, the system becomes flatter as its rotational speed increases. More realistic equilibria will be required to achieve a better match to the main sequence of fast-slow rotators. The corresponding code is made public., Comment: 20 pages, 15 figures. Submitted to ApJ

We consider the challenge of black-box optimization within hybrid discrete-continuous and variable-length spaces, a problem that arises in various applications, such as decision tree learning and symbolic regression. We propose DisCo-DSO (Discrete-Continuous Deep Symbolic Optimization), a novel approach that uses a generative model to learn a joint distribution over discrete and continuous design variables to sample new hybrid designs. In contrast to standard decoupled approaches, in which the discrete and continuous variables are optimized separately, our joint optimization approach uses fewer objective function evaluations, is robust against non-differentiable objectives, and learns from prior samples to guide the search, leading to significant improvement in performance and sample efficiency. Our experiments on a diverse set of optimization tasks demonstrate that the advantages of DisCo-DSO become increasingly evident as the complexity of the problem increases. In particular, we illustrate DisCo-DSO's superiority over the state-of-the-art methods for interpretable reinforcement learning with decision trees., Comment: Accepted at AAAI-25

New proposals for causal discovery algorithms are typically evaluated using simulations and a few select real data examples with known data generating mechanisms. However, there does not exist a general guideline for how such evaluation studies should be designed, and therefore, comparing results across different studies can be difficult. In this article, we propose a common evaluation baseline by posing the question: Are we doing better than random guessing? For the task of graph skeleton estimation, we derive exact distributional results under random guessing for the expected behavior of a range of typical causal discovery evaluation metrics (including precision and recall). We show that these metrics can achieve very large values under random guessing in certain scenarios, and hence warn against using them without also reporting negative control results, i.e., performance under random guessing. We also propose an exact test of overall skeleton fit, and showcase its use on a real data application. Finally, we propose a general pipeline for using random controls beyond the skeleton estimation task, and apply it both in a simulated example and a real data application.

We prove that a classifier with a Barron-regular decision boundary can be approximated with a rate of high polynomial degree by ReLU neural networks with three hidden layers when a margin condition is assumed. In particular, for strong margin conditions, high-dimensional discontinuous classifiers can be approximated with a rate that is typically only achievable when approximating a low-dimensional smooth function. We demonstrate how these expression rate bounds imply fast-rate learning bounds that are close to $n^{-1}$ where $n$ is the number of samples. In addition, we carry out comprehensive numerical experimentation on binary classification problems with various margins. We study three different dimensions, with the highest dimensional problem corresponding to images from the MNIST data set.

This letter presents the measurement of the energy-dependent neutrino-nucleon cross section in tungsten and the differential flux of muon neutrinos and anti-neutrinos. The analysis is performed using proton-proton collision data at a center-of-mass energy of $13.6 \, {\rm TeV}$ and corresponding to an integrated luminosity of $(65.6 \pm 1.4) \, \mathrm{fb^{-1}}$. Using the active electronic components of the FASER detector, $338.1 \pm 21.0$ charged current muon neutrino interaction events are identified, with backgrounds from other processes subtracted. We unfold the neutrino events into a fiducial volume corresponding to the sensitive regions of the FASER detector and interpret the results in two ways: We use the expected neutrino flux to measure the cross section, and we use the predicted cross section to measure the neutrino flux. Both results are presented in six bins of neutrino energy, achieving the first differential measurement in the TeV range. The observed distributions align with Standard Model predictions. Using this differential data, we extract the contributions of neutrinos from pion and kaon decays.

We study an extended Proca model with one scalar field and one massive vector field in one space and one time dimensions. We construct the soliton solution and subsequently compute the vacuum polarization energy (VPE) which is the leading quantum correction to the classical energy of the soliton. For this calculation we adopt the spectral methods approach which heavily relies on the analytic properties of the Jost function. This function is extracted from the interaction of the quantum fluctuations with a background potential generated by the soliton. Particularly we explore eventual non-analytical components that may be induced by mass gaps and the unconventional normalization for the longitudinal component of the vector field fluctuations. By numerical simulation we verify that these obstacles do actually not arise and that the real and imaginary momentum formulations of the VPE yield equal results. The Born approximation to the Jost function is crucial when implementing standard renormalization conditions. In this context we solve problems arising from the Born approximation being imaginary for real momenta associated with energies in the mass gap., Comment: 13 pages, content matches journal version

Here, we present the outcomes from the second Large Language Model (LLM) Hackathon for Applications in Materials Science and Chemistry, which engaged participants across global hybrid locations, resulting in 34 team submissions. The submissions spanned seven key application areas and demonstrated the diverse utility of LLMs for applications in (1) molecular and material property prediction; (2) molecular and material design; (3) automation and novel interfaces; (4) scientific communication and education; (5) research data management and automation; (6) hypothesis generation and evaluation; and (7) knowledge extraction and reasoning from scientific literature. Each team submission is presented in a summary table with links to the code and as brief papers in the appendix. Beyond team results, we discuss the hackathon event and its hybrid format, which included physical hubs in Toronto, Montreal, San Francisco, Berlin, Lausanne, and Tokyo, alongside a global online hub to enable local and virtual collaboration. Overall, the event highlighted significant improvements in LLM capabilities since the previous year's hackathon, suggesting continued expansion of LLMs for applications in materials science and chemistry research. These outcomes demonstrate the dual utility of LLMs as both multipurpose models for diverse machine learning tasks and platforms for rapid prototyping custom applications in scientific research., Comment: Updating author information, the submission remains largely unchanged. 98 pages total

We present a novel technique using Fourier series and Laguerre polynomials to represent morphological features of disc galaxies. To demonstrate the utility of this technique, we study the evolution of asymmetry in a sample of disc galaxies drawn from the Extended Groth Strip and imaged by the JWST Cosmic Evolution Early Release Science Survey as well as archival HST observations. We measure disc asymmetry as the amplitude of the of the m = 1 Fourier harmonic for galaxies within redshift ranges of 1 < z < 4. We show that when viewed in shorter rest frame wavelengths, disc galaxies have a higher asymmetry as the flux is dominated by star forming regions. We find generally low asymmetry at rest frame infrared wavelengths, where our metric tracks asymmetry in morphological features such as bars and spiral arms. We show that higher mass galaxies have lower asymmetry and vice versa. Higher asymmetry in lower mass galaxies comes from lower mass galaxies (typically) having higher star formation rates. We measure the relation between disc galaxy asymmetry and redshift and find no conclusive relationship between them. We demonstrate the utility of the Fourier-Laguerre technique for recovering physically informative asymmetry measurements as compared to rotational asymmetry measurements. We also release the software pipeline and quantitative analysis for each galaxy., Comment: 12 pages and 11 figures. Under review in MNRAS and comments welcome

The dissociative photoionization of \textit{tert}-butyl methyl methacrylate, a monomer unit found in many ESCAP resists, was investigated in a gas phase photoelectron photoion coincidence experiment employing extreme ultraviolet (EUV) synchrotron radiation at 13.5 nm. It was found that the interaction of EUV photons with the molecules leads almost exclusively to dissociation. However, the ionization can also directly deprotect the ester function, thus inducing the solubility switch wanted in a resist film. These results serve as a building block to reconstruct the full picture of the mechanism in widely used chemically amplified resist thin films, provide a knob to tailor more performant resist materials, and will aid interpreting advanced ultrafast time-resolved experiments.

Cervical cancer remains a major worldwide health issue, with early identification and risk assessment playing critical roles in effective preventive interventions. This paper presents the Cervix-AID-Net model for cervical precancer risk classification. The study designs and evaluates the proposed Cervix-AID-Net model based on patients colposcopy images. The model comprises a Convolutional Block Attention Module (CBAM) and convolutional layers that extract interpretable and representative features of colposcopic images to distinguish high-risk and low-risk cervical precancer. In addition, the proposed Cervix-AID-Net model integrates four explainable techniques, namely gradient class activation maps, Local Interpretable Model-agnostic Explanations, CartoonX, and pixel rate distortion explanation based on output feature maps and input features. The evaluation using holdout and ten-fold cross-validation techniques yielded a classification accuracy of 99.33\% and 99.81\%. The analysis revealed that CartoonX provides meticulous explanations for the decision of the Cervix-AID-Net model due to its ability to provide the relevant piece-wise smooth part of the image. The effect of Gaussian noise and blur on the input shows that the performance remains unchanged up to Gaussian noise of 3\% and blur of 10\%, while the performance reduces thereafter. A comparison study of the proposed model's performance compared to other deep learning approaches highlights the Cervix-AID-Net model's potential as a supplemental tool for increasing the effectiveness of cervical precancer risk assessment. The proposed method, which incorporates the CBAM and explainable artificial integration, has the potential to influence cervical cancer prevention and early detection, improving patient outcomes and lowering the worldwide burden of this preventable disease., Comment: 19 pages, 9 figure, and 7 tables

Sequential or chained models are increasingly prevalent in machine learning for scientific applications, due to their flexibility and ease of development. Chained models are particularly useful when a task is separable into distinct steps with a hierarchy of meaningful intermediate representations. In reliability-critical tasks, it is important to quantify the confidence of model inferences. However, chained models pose an additional challenge for uncertainty quantification, especially when input uncertainties need to be propagated. In such cases, a fully uncertainty-aware chain of models is required, where each step accepts a probability distribution over the input space, and produces a probability distribution over the output space. In this work, we present a case study for adapting a single model within an existing chain, designed for reconstruction within neutrino-Argon interactions, developed for neutrino oscillation experiments such as MicroBooNE, ICARUS, and the future DUNE experiment. We test the performance of an input uncertainty-enabled model against an uncertainty-blinded model using a method for generating synthetic noise. By comparing these two, we assess the increase in inference quality achieved by exposing models to upstream uncertainty estimates.

In this paper, an $\mathscr{H}_2$ norm-based model reduction method for linear quantum systems is presented, which can obtain a physically realizable model with a reduced order for closely approximating the original system. The model reduction problem is described as an optimization problem, whose objective is taken as an $\mathscr{H}_2$ norm of the difference between the transfer function of the original system and that of the reduced one. Different from classical model reduction problems, physical realizability conditions for guaranteeing that the reduced-order system is also a quantum system should be taken as nonlinear constraints in the optimization. To solve the optimization problem with such nonlinear constraints, we employ a matrix inequality approach to transform nonlinear inequality constraints into readily solvable linear matrix inequalities (LMIs) and nonlinear equality constraints, so that the optimization problem can be solved by a lifting variables approach. We emphasize that different from existing work, which only introduces a criterion to evaluate the performance after model reduction, we guide our method to obtain an optimal reduced model with respect to the $\mathscr{H}_2$ norm. In addition, the above approach for model reduction is extended to passive linear quantum systems. Finally, examples of active and passive linear quantum systems validate the efficacy of the proposed method., Comment: 13 pages,3 figures

In recent work it has been shown that determining a feedforward ReLU neural network to within high uniform accuracy from point samples suffers from the curse of dimensionality in terms of the number of samples needed. As a consequence, feedforward ReLU neural networks are of limited use for applications where guaranteed high uniform accuracy is required. We consider the question of whether the sampling complexity can be improved by restricting the specific neural network architecture. To this end, we investigate invertible residual neural networks which are foundational architectures in deep learning and are widely employed in models that power modern generative methods. Our main result shows that the residual neural network architecture and invertibility do not help overcome the complexity barriers encountered with simpler feedforward architectures. Specifically, we demonstrate that the computational complexity of approximating invertible residual neural networks from point samples in the uniform norm suffers from the curse of dimensionality. Similar results are established for invertible convolutional Residual neural networks.

With the increasing inference cost of machine learning models, there is a growing interest in models with fast and efficient inference. Recently, an approach for learning logic gate networks directly via a differentiable relaxation was proposed. Logic gate networks are faster than conventional neural network approaches because their inference only requires logic gate operators such as NAND, OR, and XOR, which are the underlying building blocks of current hardware and can be efficiently executed. We build on this idea, extending it by deep logic gate tree convolutions, logical OR pooling, and residual initializations. This allows scaling logic gate networks up by over one order of magnitude and utilizing the paradigm of convolution. On CIFAR-10, we achieve an accuracy of 86.29% using only 61 million logic gates, which improves over the SOTA while being 29x smaller., Comment: Published at NeurIPS 2024 (Oral)

In this paper, we develop an online optimization algorithm for solving a class of nonconvex optimization problems with a linearly varying optimal point. The global convergence of the algorithm is guaranteed using the circle criterion for the class of functions whose gradient is bounded within a sector. Also, we show that the corresponding Lur\'e-type nonlinear system involves a double integrator, which demonstrates its ability to track a linearly varying optimal point with zero steady-state error. The algorithm is applied to solving a time-of-arrival based localization problem with constant velocity and the results show that the algorithm is able to estimate the source location with zero steady-state error., Comment: 8 pages, 7 figures, submitted to 2025 American Control Conference

We consider the training of the first layer of vision models and notice the clear relationship between pixel values and gradient update magnitudes: the gradients arriving at the weights of a first layer are by definition directly proportional to (normalized) input pixel values. Thus, an image with low contrast has a smaller impact on learning than an image with higher contrast, and a very bright or very dark image has a stronger impact on the weights than an image with moderate brightness. In this work, we propose performing gradient descent on the embeddings produced by the first layer of the model. However, switching to discrete inputs with an embedding layer is not a reasonable option for vision models. Thus, we propose the conceptual procedure of (i) a gradient descent step on first layer activations to construct an activation proposal, and (ii) finding the optimal weights of the first layer, i.e., those weights which minimize the squared distance to the activation proposal. We provide a closed form solution of the procedure and adjust it for robust stochastic training while computing everything efficiently. Empirically, we find that TrAct (Training Activations) speeds up training by factors between 1.25x and 4x while requiring only a small computational overhead. We demonstrate the utility of TrAct with different optimizers for a range of different vision models including convolutional and transformer architectures., Comment: Published at NeurIPS 2024

Smart cities have been a very active research area in the past 20 years, while continuously adapting to new technological advancements and keeping up with the times regarding sustainability and climate change. In this context, there have been numerous proposals to expand the scope of smart cities, focusing on resilience and sustainability, among other aspects, resulting in terms like smart sustainable cities. At the same time, there is an ongoing discussion regarding the degree in which smart cities put people at their centre. In this work, we argue toward expanding the current smart city definition by integrating the circular economy as one of its central pillars and adopting the term smart (and) circular city. We discuss the ways a smart and circular city encompasses both sustainability and smartness in an integral manner, while also being well-positioned to foster novel business activity and models and helping to place citizens at the heart of the smart city. In this sense, we also argue that previous research in smart cities and technologies, such as those related to Industry 4.0, can serve as a cornerstone to implement circular economy activities within cities, at a scale that exceeds current activities that are based on more conventional approaches. We also outline current open challenges in this domain and research questions that still need to be addressed., Comment: Preprint submitted to the 10th IEEE International Smart Cities Conference 2024 (ISC2 2024)

When training neural networks with custom objectives, such as ranking losses and shortest-path losses, a common problem is that they are, per se, non-differentiable. A popular approach is to continuously relax the objectives to provide gradients, enabling learning. However, such differentiable relaxations are often non-convex and can exhibit vanishing and exploding gradients, making them (already in isolation) hard to optimize. Here, the loss function poses the bottleneck when training a deep neural network. We present Newton Losses, a method for improving the performance of existing hard to optimize losses by exploiting their second-order information via their empirical Fisher and Hessian matrices. Instead of training the neural network with second-order techniques, we only utilize the loss function's second-order information to replace it by a Newton Loss, while training the network with gradient descent. This makes our method computationally efficient. We apply Newton Losses to eight differentiable algorithms for sorting and shortest-paths, achieving significant improvements for less-optimized differentiable algorithms, and consistent improvements, even for well-optimized differentiable algorithms., Comment: Published at NeurIPS 2024

Scanning objects with a more tightly focused beam (for example of photons or electrons) can provide higher-resolution images. However the stronger localisation of energy deposition can damage tissues in organic samples or may rearrange the chemical structure or physical properties of inorganic materials. Scanning an object with a broad beam can deliver an equivalent probe energy but spreads it over a much wider footprint. Sharp images can be reconstructed from the diffuse implanted signal when a decoding step can recover a delta-like impulse response. Huffman sequences, by design, have the optimal delta-like autocorrelation for aperiodic (non-cyclic) convolution and are well-conditioned. Here we adapt 1D Huffman sequences to design 2D Huffman-like discrete arrays that have spatially broad, relatively thin and uniform intensity profiles that retain excellent aperiodic autocorrelation metrics. Examples of broad shaped diffuse beams were developed for the case of x-ray imaging. A variety of masks were fabricated by the deposition of finely structured layers of tantalum on a silicon oxide wafer. The layers form a pattern of discrete pixels that modify the shape of an incident uniform beam of low energy x-rays as it passes through the mask. The intensity profiles of the x-ray beams after transmission through these masks were validated, first by acquiring direct-detector x-ray images of the masks, and second by raster scanning a pinhole over each mask pattern, pixel-by-pixel, collecting "bucket" signals as applied in traditional ghost imaging. The masks were then used to raster scan the shaped x-ray beam over several simple binary and "gray" test objects, again producing bucket signals, from which sharp reconstructed object images were obtained by deconvolving their bucket images.

In this paper, we quantify voltage and current phasor-based measurement requirements for the unique identification of the electric grid topology and admittance parameters. Our approach is underpinned by the concept of a rigidity matrix that has been extensively studied in graph rigidity theory. Specifically, we show that the rank of the rigidity matrix is the same as that of a voltage coefficient matrix in a corresponding electric power system. Accordingly, we show that there is a minimum number of measurements required to uniquely identify the admittance matrix and corresponding grid topology. By means of a numerical example on the IEEE 4-node radial network, we demonstrate that our approach is suitable for applications in electric power grids.

We describe observations of low energy excess (LEE) events (background events observed in all light dark matter direct detection calorimeters) and noise in a two-channel silicon athermal phonon detector with 375 meV baseline energy resolution. We measure two distinct LEE populations: ``shared'' multichannel events with a pulse shape consistent with athermal phonon events, and sub-eV events which couple nearly exclusively to a single channel with a significantly faster pulse shape. These ``singles'' are consistent with events occurring within the aluminum athermal phonon collection fins. Similarly, our measured detector noise is higher than the theoretical expectation. Measured noise can be split into an uncorrelated component, consistent with shot noise from small energy depositions within the athermal phonon sensor itself, and a correlated component, consistent with shot noise from energy depositions within the silicon crystal's phonon system., Comment: 6 pages, 5 figures

The first FASER search for a light, long-lived particle decaying into a pair of photons is reported. The search uses LHC proton-proton collision data at $\sqrt{s}=13.6~\text{TeV}$ collected in 2022 and 2023, corresponding to an integrated luminosity of $57.7\text{fb}^{-1}$. A model with axion-like particles (ALPs) dominantly coupled to weak gauge bosons is the primary target. Signal events are characterised by high-energy deposits in the electromagnetic calorimeter and no signal in the veto scintillators. One event is observed, compared to a background expectation of $0.44 \pm 0.39$ events, which is entirely dominated by neutrino interactions. World-leading constraints on ALPs are obtained for masses up to $300~\text{MeV}$ and couplings to the Standard Model W gauge boson, $g_{aWW}$, around $10^{-4}$ GeV$^{-1}$, testing a previously unexplored region of parameter space. Other new particle models that lead to the same experimental signature, including ALPs coupled to gluons or photons, U(1)$_B$ gauge bosons, up-philic scalars, and a Type-I two-Higgs doublet model, are also considered for interpretation, and new constraints on previously viable parameter space are presented in this paper., Comment: 37 pages, 22 figures

The notion of defects in crystalline phases of matter has been extremely powerful for understanding crystal growth, deformation and melting. These discontinuities in the periodic order of crystals are mathematically described by the Burgers vector, derived from the particle displacements, which encapsulates the direction and magnitude of slip relative to the undeformed state. Since the reference structure of the crystal is known a priori, the Burgers vector can be determined experimentally using both imaging and diffraction methods to measure the lattice distortion, and thus infer the particle displacements. Glasses have structures that lack the periodicity of crystals, and thus a well-defined reference state. Yet, measurable structural parameters can still be obtained from diffraction from a glass. Here we examine the usefulness of these parameters to probe deformation in glasses. We find that coordinated transformations in the centrosymmetry of local particle arrangements are a strong marker of plastic events. Moreover, we investigate two geometric indicators that can be derived from distortions in local diffraction patterns, namely the continuous Burgers vector and the quadrupolar strain. We find that the Burgers vector again emerges as a robust and sensitive metric for understanding local structural transformations due to mechanical deformation, even in structural glasses., Comment: 13 pages 5 figures

We deal with the problem of gradient estimation for stochastic differentiable relaxations of algorithms, operators, simulators, and other non-differentiable functions. Stochastic smoothing conventionally perturbs the input of a non-differentiable function with a differentiable density distribution with full support, smoothing it and enabling gradient estimation. Our theory starts at first principles to derive stochastic smoothing with reduced assumptions, without requiring a differentiable density nor full support, and we present a general framework for relaxation and gradient estimation of non-differentiable black-box functions $f:\mathbb{R}^n\to\mathbb{R}^m$. We develop variance reduction for gradient estimation from 3 orthogonal perspectives. Empirically, we benchmark 6 distributions and up to 24 variance reduction strategies for differentiable sorting and ranking, differentiable shortest-paths on graphs, differentiable rendering for pose estimation, as well as differentiable cryo-ET simulations.

'lintsampler' provides a Python implementation of a technique we term 'linear interpolant sampling': an algorithm to efficiently draw pseudo-random samples from an arbitrary probability density function (PDF). First, the PDF is evaluated on a grid-like structure. Then, it is assumed that the PDF can be approximated between grid vertices by the (multidimensional) linear interpolant. With this assumption, random samples can be efficiently drawn via inverse transform sampling. lintsampler is primarily written with 'numpy', drawing some additional functionality from 'scipy'. Under the most basic usage of lintsampler, the user provides a Python function defining the target PDF and some parameters describing a grid-like structure to the 'LintSampler' class, and is then able to draw samples via the 'sample' method. Additionally, there is functionality for the user to set the random seed, employ quasi-Monte Carlo sampling, or sample within a premade grid ('DensityGrid') or tree ('DensityTree') structure., Comment: Accepted by Journal of Open Source Software. Describes code repository at https://github.com/aneeshnaik/lintsampler

We introduce a conceptual framework for numerically solving linear elliptic, parabolic, and hyperbolic PDEs on bounded, polytopal domains in euclidean spaces by deep neural networks. The PDEs are recast as minimization of a least-squares (LSQ for short) residual of an equivalent, well-posed first-order system, over parametric families of deep neural networks. The associated LSQ residual is a) equal or proportional to a weak residual of the PDE, b) additive in terms of contributions from localized subnetworks, indicating locally ``out-of-equilibrium'' of neural networks with respect to the PDE residual, c) serves as numerical loss function for neural network training, and d) constitutes, even with incomplete training, a computable, (quasi-)optimal numerical error estimator in the context of adaptive LSQ finite element methods. In addition, an adaptive neural network growth strategy is proposed which, assuming exact numerical minimization of the LSQ loss functional, yields sequences of neural networks with realizations that converge rate-optimally to the exact solution of the first order system LSQ formulation.

In this paper we solve mixed-integer linear programs (MILPs) via distributed asynchronous saddle point computation. This work is motivated by the MILPs being able to model problems in multi-agent autonomy, such as task assignment problems and trajectory planning with collision avoidance constraints in multi-robot systems. To solve a MILP, we relax it with a linear program approximation. We first show that if the linear program relaxation satisfies Slater's condition, then relaxing the problem, solving it, and rounding the relaxed solution produces a point that is guaranteed to satisfy the constraints of the original MILP. Next, we form a Lagrangian saddle point problem that is equivalent to the linear program relaxation, and then we regularize the Lagrangian in both the primal and dual spaces. Doing so gives a regularized Lagrangian that is strongly convex-strongly concave. We then develop a parallelized algorithm to compute saddle points of the regularized Lagrangian, and we show that it is tolerant to asynchrony in the computations and communications of primal and dual variables. Suboptimality bounds and convergence rates are presented for convergence to a saddle point. The suboptimality bound accounts for (i) the error induced by regularizing the Lagrangian and (ii) the suboptimality gap between the solution to the original MILP and the solution to its relaxed form. Simulation results illustrate these theoretical developments in practice, and show that relaxation and regularization combined typically have only a mild impact on the suboptimality of the solution obtained., Comment: 22 pages, 4 figures. arXiv admin note: text overlap with arXiv:2211.11842

Due to climate change the frequency and intensity of extreme rainfall events, which contribute to urban flooding, are expected to increase in many places. These floods can damage transport infrastructure and disrupt mobility, highlighting the need for cities to adapt to escalating risks. Reinforcement learning (RL) serves as a powerful tool for uncovering optimal adaptation strategies, determining how and where to deploy adaptation measures effectively, even under significant uncertainty. In this study, we leverage RL to identify the most effective timing and locations for implementing measures, aiming to reduce both direct and indirect impacts of flooding. Our framework integrates climate change projections of future rainfall events and floods, models city-wide motorized trips, and quantifies direct and indirect impacts on infrastructure and mobility. Preliminary results suggest that our RL-based approach can significantly enhance decision-making by prioritizing interventions in specific urban areas and identifying the optimal periods for their implementation. Our framework is publicly available: \url{https://github.com/MLSM-at-DTU/floods_transport_rl}., Comment: Accepted for presentation at Tackling Climate Change with Machine Learning workshop at NeurIPS 2024

We study the problem of approximating and estimating classification functions that have their decision boundary in the $RBV^2$ space. Functions of $RBV^2$ type arise naturally as solutions of regularized neural network learning problems and neural networks can approximate these functions without the curse of dimensionality. We modify existing results to show that every $RBV^2$ function can be approximated by a neural network with bounded weights. Thereafter, we prove the existence of a neural network with bounded weights approximating a classification function. And we leverage these bounds to quantify the estimation rates. Finally, we present a numerical study that analyzes the effect of different regularity conditions on the decision boundaries.

This paper is concerned with open quantum harmonic oscillators with position-momentum system variables, whose internal dynamics and interaction with the environment are governed by linear quantum stochastic differential equations. A recently proposed approach to such systems as Heisenberg picture quantum memories exploits their ability to approximately retain initial conditions over a decoherence horizon. Using the quantum memory decoherence time defined previously in terms of a fidelity threshold on a weighted mean-square deviation of the system variables from their initial values, we apply this approach to a partially isolated subsystem of the oscillator, which is not directly affected by the external fields. The partial isolation leads to an appropriate system decomposition and a qualitatively different short-horizon asymptotic behaviour of the deviation, which yields a longer decoherence time in the high-fidelity limit. The resulting approximate decoherence time maximization over the energy parameters for improving the quantum memory performance is discussed for a coherent feedback interconnection of such systems., Comment: 9 pages, 3 figures, submitted to ANZCC 2025

Business Process Management (BPM) is mostly centered around finding technical solutions. Nudging is an approach from psychology and behavioral economics to guide people's behavior. In this paper, we show how nudging can be integrated into the different phases of the BPM lifecycle. Further, we outline how nudging can be an alternative strategy for more sustainable business processes. We show how the integration of nudging offers significant opportunities for process mining and business process management in general to be more human-centric. We also discuss challenges that come with the adoption of nudging.

Process models may be automatically generated from event logs that contain as-is data of a business process. While such models generalize over the control-flow of specific, recorded process executions, they are often also annotated with behavioural statistics, such as execution frequencies.Based thereon, once a model is published, certain insights about the original process executions may be reconstructed, so that an external party may extract confidential information about the business process. This work is the first to empirically investigate such reconstruction attempts based on process models. To this end, we propose different play-out strategies that reconstruct the control-flow from process trees, potentially exploiting frequency annotations. To assess the potential success of such reconstruction attacks on process models, and hence the risks imposed by publishing them, we compare the reconstructed process executions with those of the original log for several real-world datasets.

The noncommutative nature of quantum mechanics imposes fundamental constraints on system dynamics, which, in the linear realm, are manifested through the physical realizability conditions on system matrices. These restrictions give system matrices a unique structure. This paper aims to study this structure by investigating the zeros and poles of linear quantum systems. Firstly, it is shown that -s_0 is a transmission zero if and only if s_0 is a pole of the transfer function, and -s_0 is an invariant zero if and only if s_0 is an eigenvalue of the A-matrix, of a linear quantum system. Moreover, s_0 is an output-decoupling zero if and only if -s_0 is an input-decoupling zero. Secondly, based on these zero-pole correspondences, we show that a linear quantum system must be Hurwitz unstable if it is strongly asymptotically left invertible. Two types of stable input observers are constructed for unstable linear quantum systems. Finally, the sensitivity of a coherent feedback network is investigated; in particular, the fundamental tradeoff between ideal input squeezing and system robustness is studied on the basis of system sensitivity analysis., Comment: 16 pages, 2 figures, comments are welcome. arXiv admin note: text overlap with arXiv:2408.03177

Diffusion models have a tendency to exactly replicate their training data, especially when trained on small datasets. Most prior work has sought to mitigate this problem by imposing differential privacy constraints or masking parts of the training data, resulting in a notable substantial decrease in image quality. We present CPSample, a method that modifies the sampling process to prevent training data replication while preserving image quality. CPSample utilizes a classifier that is trained to overfit on random binary labels attached to the training data. CPSample then uses classifier guidance to steer the generation process away from the set of points that can be classified with high certainty, a set that includes the training data. CPSample achieves FID scores of 4.97 and 2.97 on CIFAR-10 and CelebA-64, respectively, without producing exact replicates of the training data. Unlike prior methods intended to guard the training images, CPSample only requires training a classifier rather than retraining a diffusion model, which is computationally cheaper. Moreover, our technique provides diffusion models with greater robustness against membership inference attacks, wherein an adversary attempts to discern which images were in the model's training dataset. We show that CPSample behaves like a built-in rejection sampler, and we demonstrate its capabilities to prevent mode collapse in Stable Diffusion.

The topological Hochschild homology of a ring (or ring spectrum) $R$ is an $S^1$-spectrum, and the fixed points of THH($R$) for subgroups $C_n\subset S^1$ have been widely studied due to their use in algebraic K-theory computations. Hesselholt and Madsen proved that the fixed points of topological Hochschild homology are closely related to Witt vectors. Further, they defined the notion of a Witt complex, and showed that it captures the algebraic structure of the homotopy groups of the fixed points of THH. Recent work of Angeltveit, Blumberg, Gerhardt, Hill, Lawson and Mandell defines a theory of twisted topological Hochschild homology for equivariant rings (or ring spectra) that builds upon Hill, Hopkins and Ravenel's work on equivariant norms. In this paper, we study the algebraic structure of the equivariant homotopy groups of twisted THH. In particular, we define an equivariant Witt complex and prove that the equivariant homotopy of twisted THH has this structure. Our definition of equivariant Witt complexes contributes to a growing body of research in the subject of equivariant algebra., Comment: 35 pages

To study any dynamical system it is useful to find a partition that allows essentially faithful encoding (injective, up to a small exceptional set) into a subshift. Most topological and measure-theoretic systems can be represented by Bratteli-Vershik (or adic, or BV) systems. So it is natural to ask when can a BV system be encoded essentially faithfully. We show here that for BV diagrams defined by homogeneous positive integer multivariable polynomials, and a wide family of their generalizations, which we call polynomial shape diagrams, for every choice of the edge ordering the coding according to initial path segments of a fixed finite length is injective off of a negligible exceptional set.

Individuals with Intellectual and Developmental Disabilities (IDD) have unique needs and challenges when working with data. While visualization aims to make data more accessible to a broad audience, our understanding of how to design cognitively accessible visualizations remains limited. In this study, we engaged 20 participants with IDD as co-designers to explore how they approach and visualize data. Our preliminary investigation paired four participants as data pen-pals in a six-week online asynchronous participatory design workshop. In response to the observed conceptual, technological, and emotional struggles with data, we subsequently organized a two-day in-person co-design workshop with 16 participants to further understand relevant visualization authoring and sensemaking strategies. Reflecting on how participants engaged with and represented data, we propose two strategies for cognitively accessible data visualizations: transforming numbers into narratives and blending data design with everyday aesthetics. Our findings emphasize the importance of involving individuals with IDD in the design process, demonstrating their capacity for data analysis and expression, and underscoring the need for a narrative and tangible approach to accessible data visualization.

Many interventions are both beneficial to initiate and harmful to stop. Traditionally, to determine whether to deploy that intervention in a time-limited way depends on if, on average, the increase in the benefits of starting it outweigh the increase in the harms of stopping it. We propose a novel causal estimand that provides a more nuanced understanding of the effects of such treatments, particularly, how response to an earlier treatment (e.g., treatment initiation) modifies the effect of a later treatment (e.g., treatment discontinuation), thus learning if there are effects among the (un)affected. Specifically, we consider a marginal structural working model summarizing how the average effect of a later treatment varies as a function of the (estimated) conditional average effect of an earlier treatment. We allow for estimation of this conditional average treatment effect using machine learning, such that the causal estimand is a data-adaptive parameter. We show how a sequentially randomized design can be used to identify this causal estimand, and we describe a targeted maximum likelihood estimator for the resulting statistical estimand, with influence curve-based inference. Throughout, we use the Adaptive Strategies for Preventing and Treating Lapses of Retention in HIV Care trial (NCT02338739) as an illustrative example, showing that discontinuation of conditional cash transfers for HIV care adherence was most harmful among those who most had an increase in benefits from them initially.

To promote sustainable business practices, and to achieve climate neutrality by 2050, the EU has developed the taxonomy of sustainable activities, which describes when exactly business practices can be considered sustainable. While the taxonomy has only been recently established, progressively more companies will have to report how much of their revenue was created via sustainably executed business processes. To help companies prepare to assess whether their business processes comply with the constraints outlined in the taxonomy, we investigate in how far these criteria can be used for conformance checking, that is, assessing in a data-driven manner, whether business process executions adhere to regulatory constraints. For this, we develop a few-shot learning pipeline to characterize the constraints of the taxonomy with the help of an LLM as to the process dimensions they relate to. We find that many constraints of the taxonomy are useable for conformance checking, particularly in the sectors of energy, manufacturing, and transport. This will aid companies in preparing to monitor regulatory compliance with the taxonomy automatically, by characterizing what kind of information they need to extract, and by providing a better understanding of sectors where such an assessment is feasible and where it is not.