Search

We perform a first study of the impact of varying two components of the initial conditions in binary population synthesis of compact binary mergers - the initial mass function, which is made metallicity- and star formation rate-dependent, and the orbital parameter (orbital period, mass ratio and eccentricity) distributions, which are assumed to be correlated - within a larger grid of initial condition models also including alternatives for the primary mass-dependent binary fraction and the metallicity-specific cosmic star formation history. We generate the initial populations with the sampling code BOSSA and evolve them with the rapid population synthesis code COMPAS. We find strong suggestions that the main role of initial conditions models is to set the relative weights of key features defined by the evolution models. In the two models we compare, black hole-black hole (BHBH) mergers are the most strongly affected, which we connect to a shift from the common envelope to the stable Roche lobe overflow formation channels with decreasing redshift. We also characterize variations in the black hole-neutron star (BHNS) and neutron star-neutron star (NSNS) final parameter distributions. We obtain the merger rate evolution for BHBH, BHNS and NSNS mergers up to $z=10$, and find a variation by a factor of $\sim50-60$ in the local BHBH and BHNS merger rates, suggesting a more important contribution from initial conditions than previously thought, and calling for a complete exploration of the initial conditions model permutations., Comment: 28 pages, 14 figures, 3 tables. Accepted for publication in MNRAS. Code/data to be made publicly available

Dense linear layers are the dominant computational bottleneck in large neural networks, presenting a critical need for more efficient alternatives. Previous efforts focused on a small number of hand-crafted structured matrices and neglected to investigate whether these structures can surpass dense layers in terms of compute-optimal scaling laws when both the model size and training examples are optimally allocated. In this work, we present a unifying framework that enables searching among all linear operators expressible via an Einstein summation. This framework encompasses many previously proposed structures, such as low-rank, Kronecker, Tensor-Train, Block Tensor-Train (BTT), and Monarch, along with many novel structures. To analyze the framework, we develop a taxonomy of all such operators based on their computational and algebraic properties and show that differences in the compute-optimal scaling laws are mostly governed by a small number of variables that we introduce. Namely, a small $\omega$ (which measures parameter sharing) and large $\psi$ (which measures the rank) reliably led to better scaling laws. Guided by the insight that full-rank structures that maximize parameters per unit of compute perform the best, we propose BTT-MoE, a novel Mixture-of-Experts (MoE) architecture obtained by sparsifying computation in the BTT structure. In contrast to the standard sparse MoE for each entire feed-forward network, BTT-MoE learns an MoE in every single linear layer of the model, including the projection matrices in the attention blocks. We find BTT-MoE provides a substantial compute-efficiency gain over dense layers and standard MoE., Comment: NeurIPS 2024. Code available at https://github.com/AndPotap/einsum-search

With plasma currents up to 8.7 MA, the SPARC tokamak runs the risk of forming multi-MA beams of relativistic "runaway" electrons (REs) which could damage plasma facing components if unmitigated. The infrared (IR) and visible imaging and visible spectroscopy systems in SPARC are designed with measurements of synchrotron emission from REs in mind. Synchrotron radiation is emitted by REs along their direction of motion, opposite the plasma current. Matched clockwise and counterclockwise wide views are proposed to detect synchrotron and background radiation, allowing observation of RE synchrotron emission in both plasma current configurations. Due to SPARC's high toroidal magnetic field strength, 12.2 T on axis, the synchrotron light spectrum is expected to peak in the visible-IR wavelength range. The synthetic diagnostic tool SOFT (Synchrotron Orbit-Following Toolkit) is used to model synchrotron images and spectra for three scenarios, with appropriate magnetic equilibria for each: REs generated during plasma current ramp-up, steady-state flattop (although unlikely, but serving as a reference), and disruptions. Required time resolutions, achievable spatial coverage, and appropriate spectral ranges for various RE energies are assessed.

We present the first theoretical study of heavy-flavor jet angularities ($\lambda_{\kappa}^{\alpha}$) in Pb+Pb collisions at $\sqrt{s_{\rm NN}}=$ 5.02 TeV. The initial production of heavy-flavor jets is carried out using the POWHEG+PYTHIA8 prescription, while the jet evolution in the quark-gluon plasma (QGP) is described by the SHELL transport model. In p+p collisions, we observe narrower angularity distributions for the D$^0$-tagged jets compared to inclusive jets, consistent with the ALICE preliminary results. We then demonstrate that jet quenching in the QGP may slightly widen the angularity distributions of both inclusive and D$^0$-tagged jets in Pb+Pb collisions relative to p+p at $10< p_{\rm T,jet} < 20$ GeV/c. Additionally, by comparing the averaged angularities $\langle \lambda^{\kappa}_{\alpha} \rangle$ of inclusive, D$^0$-tagged and B$^0$-tagged jets with varying $\alpha$ and $\kappa$, we show that the larger the quark mass is, the lower the jet's $\langle \lambda^{\kappa}_{\alpha} \rangle$ values are. As a result of the slenderer initial distribution, we predict that as compared to inclusive jets, the heavy-flavor jets, especially the B$^0$-tagged one, will suffer more distinct modifications of $\langle \lambda^{\kappa}_{\alpha} \rangle$ in Pb+Pb relative to p+p at $10 < p_{\rm T,jet} < 20$ GeV/c. For a larger jet radius, a more significant broadening of jet angularities could be obtained because of the enhanced contributions of the wide-angle particles. It is also noted that the angularity distributions of inclusive and D$^0$-tagged jets become narrower in Pb+Pb collisions relative to p+p at $p_{\rm T,jet} > 20$ GeV/c due to the strong influence of the selection bias., Comment: 8 pages, 6 figures

The heterotic $SU(3)$ system, also known as the Hull--Strominger system, arises from compactifications of heterotic string theory to six dimensions. This paper investigates the local structure of the moduli space of solutions to this system on a compact 6-manifold $X$, using a vector bundle $Q=(T^{1,0}X)^* \oplus {End}(E) \oplus T^{1,0}X$, where $E\to X$ is the classical gauge bundle arising in the system. We establish that the moduli space has an expected dimension of zero. We achieve this by studying the deformation complex associated to a differential operator $\bar{D}$, which emulates a holomorphic structure on $Q$, and demonstrating an isomorphism between the two cohomology groups which govern the infinitesimal deformations and obstructions in the deformation theory for the system. We also provide a Dolbeault-type theorem linking these cohomology groups to \v{C}ech cohomology, a result which might be of independent interest, as well as potentially valuable for future research., Comment: v2: 34 pages, expanded introduction, example added, references updated

Automatic facial action unit (AU) recognition is used widely in facial expression analysis. Most existing AU recognition systems aim for cross-participant non-calibrated generalization (NCG) to unseen faces without further calibration. However, due to the diversity of facial attributes across different identities, accurately inferring AU activation from single images of an unseen face is sometimes infeasible, even for human experts -- it is crucial to first understand how the face appears in its neutral expression, or significant bias may be incurred. Therefore, we propose to perform one-frame calibration (OFC) in AU recognition: for each face, a single image of its neutral expression is used as the reference image for calibration. With this strategy, we develop a Calibrating Siamese Network (CSN) for AU recognition and demonstrate its remarkable effectiveness with a simple iResNet-50 (IR50) backbone. On the DISFA, DISFA+, and UNBC-McMaster datasets, we show that our OFC CSN-IR50 model (a) substantially improves the performance of IR50 by mitigating facial attribute biases (including biases due to wrinkles, eyebrow positions, facial hair, etc.), (b) substantially outperforms the naive OFC method of baseline subtraction as well as (c) a fine-tuned version of this naive OFC method, and (d) also outperforms state-of-the-art NCG models for both AU intensity estimation and AU detection.

Medium modification of jet substructure within the hot and dense nuclear matter has attracted enormous interest from the heavy-ion physics community in recent years. Measurements of inclusive jet show the angular narrowing in nucleus-nucleus collisions, while the recent CMS results of the photon-tagged jets ($\gamma-$jet) indicate hints of broadening. In this work, we conduct a theoretical study on the angular structure of inclusive jet and $\gamma-$jet with a transport approach considering the jet energy loss and the medium response in the quark-gluon plasma. We carry out the girth modification of $\gamma-$jet in $0-30\%$ PbPb collisions at $\sqrt{s_{NN}}=$ 5.02 TeV, which shows a satisfactory agreement with the recent CMS measurement. We explore the connection between the selection bias and the jet kinematics when choosing different $x_{j\gamma}=p_T^{\rm jet}/p_T^{\gamma}$ threshold. Importantly, we quantitatively demonstrate that $\gamma-$jet provides significant advantages to reduce the selection bias and can effectively collect jets sufficiently quenched in PbPb collisions compared to the inclusive jet, which is critical to capture the jet angular broadening observed by CMS. We further estimate the contributions of the medium-induced gluon radiation and the medium response to the broadening of the jet angular substructure., Comment: 8 pages, 5 figures

Ambient backscatter communications (AmBC) are a promising technology for addressing the energy consumption challenge in wireless communications through the reflection or absorption of surrounding radio frequency (RF) signals. However, it grapples with the intricacies of ambient RF signal and the round-trip path loss. For traditional detectors, the incorporation of pilot sequences results in a reduction in spectral efficiency. Furthermore, traditional energy-based detectors are inherently susceptible to a notable error floor issue, attributed to the co-channel direct link interference (DLI). Consequently, this paper proposes a blind symbol detector without the prior knowledge of the channel state information, signal variance, and noise variance. By leveraging the intra-symbol differential amplitude shift keying (IDASK) scheme, this detector effectively redirects the majority of the DLI energy towards the largest eigenvalue of the received sample covariance matrix, thereby utilizing the second largest eigenvalue for efficient symbol detection. In addition, this paper conducts theoretical performance analyses of the proposed detector in terms of the false alarm probability, missed detection probability, and the bit-error rate (BER) lower bound. Simulation results demonstrate that the proposed blind detector exhibits a significant enhancement in symbol detection performance compared to its traditional counterparts.

Molecular dynamics triggered by interaction with light often involve the excitation of several electronic, vibrational, and rotational states. Characterizing the resulting coupled electronic and nuclear wave packet motion represents a severe challenge, even for small polyatomic systems. In this Letter, we demonstrate how the interplay between vibrational, rotational, and electronic degrees of freedom governs the evolution of molecular wave packets in the low-lying states of strong-field-ionized sulfur dioxide. Using time-resolved Coulomb explosion imaging (CEI) in combination with quantum mechanical wave packet simulations, we directly map bending vibrations of the molecule, show how the vibrational wave packet is influenced by molecular alignment, and elucidate the role of the coupling between the two lowest electronic states of the cation. A conical intersection between these states couples the bending and asymmetric stretching coordinates, which is clearly reflected in the correlated fragment momenta. Our results suggest that multi-coincident CEI represents an efficient experimental tool for characterizing coupled electronic and nuclear motion in polyatomic molecules.

Coulomb explosion imaging (CEI) with x-ray free electron lasers has recently been shown to be a powerful method for obtaining detailed structural information of gas-phase planar ring molecules [R. Boll et al. Nat. Phys. 18, 423-428 (2022)]. In this Letter, we investigate the potential of CEI driven by a tabletop laser and extend this approach to differentiating three-dimensional (3D) structures. We study the static CEI patterns of planar and nonplanar organic molecules that resemble the structures of typical products formed in ring-opening reactions. Our results reveal that each molecule exhibits a well-localized and distinctive pattern in 3D fragment-ion momentum space. We find that these patterns yield direct information about the molecular structures and can be qualitatively reproduced using a classical Coulomb explosion simulation. Our findings suggest that laser-induced CEI can serve as a robust method for differentiating molecular structures of organic ring and chain molecules. As such, it holds great promise as a method for following ultrafast structural changes, e.g., during ring-opening reactions, by tracking the motion of individual atoms in pump-probe experiments.

3D Content Generation is at the heart of many computer graphics applications, including video gaming, film-making, virtual and augmented reality, etc. This paper proposes a novel deep-learning based approach for automatically generating interactive and playable 3D game scenes, all from the user's casual prompts such as a hand-drawn sketch. Sketch-based input offers a natural, and convenient way to convey the user's design intention in the content creation process. To circumvent the data-deficient challenge in learning (i.e. the lack of large training data of 3D scenes), our method leverages a pre-trained 2D denoising diffusion model to generate a 2D image of the scene as the conceptual guidance. In this process, we adopt the isometric projection mode to factor out unknown camera poses while obtaining the scene layout. From the generated isometric image, we use a pre-trained image understanding method to segment the image into meaningful parts, such as off-ground objects, trees, and buildings, and extract the 2D scene layout. These segments and layouts are subsequently fed into a procedural content generation (PCG) engine, such as a 3D video game engine like Unity or Unreal, to create the 3D scene. The resulting 3D scene can be seamlessly integrated into a game development environment and is readily playable. Extensive tests demonstrate that our method can efficiently generate high-quality and interactive 3D game scenes with layouts that closely follow the user's intention., Comment: Project Page: https://xrvisionlabs.github.io/Sketch2Scene/

Inspired by the BESIII newest observation of X(2370) glueball-like particle, we search its productions in both $e^+e^-$ collisions at $\sqrt{s}=$ 4.95 GeV and proton-proton (pp) collisions at $\sqrt{s}=$ 13 TeV with a parton and hadron cascade model PACIAE. In this model, the final partonic state (FPS) and the final hadronic state (FHS) are consecutively simulated and recorded. The X(2370) glueball- or tetraquark-state is then, respectively, recombined by two gluons or four quarks $ss\bar{s}\bar{s}$ in the FPS using the quantum statistical mechanics inspired dynamically constrained phase-space coalescence (DCPC) model. The X(2370) molecular-state is recombined by the baryon-antibaryon of $\Lambda$-$\bar{\Lambda}$ or $\Sigma$-$\bar{\Sigma}$, or by three mesons of $\pi^+\pi^{-}\eta'$, $K^+K^-\eta'$, or $K_S^0K_S^0\eta'$ in the FHS using DCPC model. In both $e^+e^-$ and pp collisions, significant discrepancies in the yields, the transverse momentum spectra and the rapidity distributions among the X(2370) glueball-, tetraquark-, and molecular-state are observed. These discrepancies are proposed as valuable criteria identifying the X(2370) different states from each other. Our results not only support the BESIII observation of glueball-like particle $\rm X(2370)$ production in $e^+e^-$ collisions, but also serve as a prediction for the $\rm X(2370)$ production in pp collisions. We strongly suggest the experimental measurement of the X(2370) glueball-like particle production in pp collisions at the LHC energies., Comment: 6 pages, 5 figures

Machine learning (ML) is revolutionising drug discovery by expediting the prediction of small molecule properties essential for developing new drugs. These properties -- including absorption, distribution, metabolism and excretion (ADME)-- are crucial in the early stages of drug development since they provide an understanding of the course of the drug in the organism, i.e., the drug's pharmacokinetics. However, existing methods lack personalisation and rely on manually crafted ML algorithms or pipelines, which can introduce inefficiencies and biases into the process. To address these challenges, we propose a novel evolutionary-based automated ML method (AutoML) specifically designed for predicting small molecule properties, with a particular focus on pharmacokinetics. Leveraging the advantages of grammar-based genetic programming, our AutoML method streamlines the process by automatically selecting algorithms and designing predictive pipelines tailored to the particular characteristics of input molecular data. Results demonstrate AutoML's effectiveness in selecting diverse ML algorithms, resulting in comparable or even improved predictive performances compared to conventional approaches. By offering personalised ML-driven pipelines, our method promises to enhance small molecule research in drug discovery, providing researchers with a valuable tool for accelerating the development of novel therapeutic drugs., Comment: Paper accepted and presented at the 14th Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA), which happened during the Genetic and Evolutionary Computation Conference (GECCO)

Most complex diseases, including cancer and non-malignant diseases like asthma, have distinct molecular subtypes that require distinct clinical approaches. However, existing computational patient stratification methods have been benchmarked almost exclusively on cancer omics data and only perform well when mutually exclusive subtypes can be characterized by many biomarkers. Here, we contribute with a massive evaluation attempt, quantitatively exploring the power of 22 unsupervised patient stratification methods using both, simulated and real transcriptome data. From this experience, we developed UnPaSt (https://apps.cosy.bio/unpast/) optimizing unsupervised patient stratification, working even with only a limited number of subtype-predictive biomarkers. We evaluated all 23 methods on real-world breast cancer and asthma transcriptomics data. Although many methods reliably detected major breast cancer subtypes, only few identified Th2-high asthma, and UnPaSt significantly outperformed its closest competitors in both test datasets. Essentially, we showed that UnPaSt can detect many biologically insightful and reproducible patterns in omic datasets., Comment: The first two authors listed are joint first authors. The last two authors listed are joint last authors

Languages continually evolve in response to societal events, resulting in new terms and shifts in meanings. These changes have significant implications for computer applications, including automatic translation and chatbots, making it essential to characterize them accurately. The recent development of LLMs has notably advanced natural language understanding, particularly in sense inference and reasoning. In this paper, we investigate the potential of LLMs in characterizing three types of semantic change: dimension, relation, and orientation. We achieve this by combining LLMs' Chain-of-Thought with rhetorical devices and conducting an experimental assessment of our approach using newly created datasets. Our results highlight the effectiveness of LLMs in capturing and analyzing semantic changes, providing valuable insights to improve computational linguistic applications.

In this article, we investigate a coupled phantom dark-energy cosmological model in which the coupling term between a phantom scalar field with an exponential potential and a pressureless dark-matter fluid is motivated by the warm inflationary paradigm. Using methods of qualitative analysis of dynamical systems, complemented by numerical solutions of the evolution equations, we study the late-time behavior of our model. We show that contrary to the uncoupled scenario, the coupled phantom model admits accelerated scaling solutions. However, they do not correspond to a final state of the universe's evolution and, therefore, cannot be used to solve the cosmological coincidence problem. Furthermore, we show that, for certain coupling parameter values, the total equation-of-state parameter's asymptotic behavior is significantly changed when compared to the uncoupled scenario, allowing for solutions less phantom even for steeper potentials of the phantom scalar field., Comment: 13 pages including references, 3 tables and 4 captioned figures; version accepted by Phys. Rev. D

Recent advances in multimodal LLMs, have led to several video-text models being proposed for critical video-related tasks. However, most of the previous works support visual input only, essentially muting the audio signal in the video. Few models that support both audio and visual input, are not explicitly trained on audio data. Hence, the effect of audio towards video understanding is largely unexplored. To this end, we propose a model architecture that handles audio-visual inputs explicitly. We train our model with both audio and visual data from a video instruction-tuning dataset. Comparison with vision-only baselines, and other audio-visual models showcase that training on audio data indeed leads to improved grounding of responses. For better evaluation of audio-visual models, we also release a human-annotated benchmark dataset, with audio-aware question-answer pairs.

Multi-modality magnetic resonance imaging (MRI) can provide complementary information for computer-aided diagnosis. Traditional deep learning algorithms are suitable for identifying specific anatomical structures segmenting lesions and classifying diseases with magnetic resonance images. However, manual labels are limited due to high expense, which hinders further improvement of model accuracy. Self-supervised learning (SSL) can effectively learn feature representations from unlabeled data by pre-training and is demonstrated to be effective in natural image analysis. Most SSL methods ignore the similarity of multi-modality MRI, leading to model collapse. This limits the efficiency of pre-training, causing low accuracy in downstream segmentation and classification tasks. To solve this challenge, we establish and validate a multi-modality MRI masked autoencoder consisting of hybrid mask pattern (HMP) and pyramid barlow twin (PBT) module for SSL on multi-modality MRI analysis. The HMP concatenates three masking steps forcing the SSL to learn the semantic connections of multi-modality images by reconstructing the masking patches. We have proved that the proposed HMP can avoid model collapse. The PBT module exploits the pyramidal hierarchy of the network to construct barlow twin loss between masked and original views, aligning the semantic representations of image patches at different vision scales in latent space. Experiments on BraTS2023, PI-CAI, and lung gas MRI datasets further demonstrate the superiority of our framework over the state-of-the-art. The performance of the segmentation and classification is substantially enhanced, supporting the accurate detection of small lesion areas. The code is available at https://github.com/LinxuanHan/M2-MAE.

The parton and hadron cascade model {\footnotesize PACIAE} is employed to confirm the BESIII newest observation of glueball-like particle $\rm X(2370)$ production in $e^+e^-$ collisions at $\sqrt{s}=4.95\,\mathrm{GeV}$. We coalesce the $\rm X(2370)$ glueball state with two gluons in the simulated partonic final state by the Dynamically Constrained Phase-space Coalescence ({\footnotesize DCPC}) model. Alternative configuration of $\rm X(2370)$ molecular state is recombined in the simulated hadronic final state with $\pi^{+},\pi^{-},K^{+}, K^{-},K_{S}^{0},K_{S}^{0}$ and $\eta'$ by {\footnotesize DCPC} model. The resulted particle transverse momentum spectrum and rapidity distribution, etc. show a significant discrepancy between the two states. They are not only serving as criteria to distinguish the $\rm X(2370)$ glueball state or molecular state, but also confirming the BESIII observation of glueball-like particle $\rm X(2370)$ productions in $e^+e^-$ collisions., Comment: 4 pages, 2 figures

A framework with sets of attacking arguments (SETAF) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from Normal Logic Programs (NLPs) to SETAFs and vice versa, from SETAFs to NLPs. We show that there is pairwise equivalence between their semantics, including the equivalence between L-stable and semi-stable semantics. Furthermore, for a class of NLPs called Redundancy-Free Atomic Logic Programs (RFALPs), there is also a structural equivalence as these back-and-forth translations are each other's inverse. Then, we show that RFALPs are as expressive as NLPs by transforming any NLP into an equivalent RFALP through a series of program transformations already known in the literature. We also show that these program transformations are confluent, meaning that every NLP will be transformed into a unique RFALP. The results presented in this paper enhance our understanding that NLPs and SETAFs are essentially the same formalism. Under consideration in Theory and Practice of Logic Programming (TPLP)., Comment: 44 pages, 5 figures. Under consideration in Theory and Practice of Logic Programming (TPLP)

This paper initiates a classification programme of flows of $\mathrm{SU}(2)$-structures on $4$-manifolds which have short-time existence and uniqueness. Our approach adapts a representation-theoretic method originally due to Bryant in the context of $\mathrm{G}_2$ geometry. We show how this strategy can also be used to deduce the number of geometric flows of a given $H$-structure; we illustrate this in the $\mathrm{G}_2$, $\mathrm{Spin}(7)$ and $\mathrm{SU}(3)$ cases. Our investigation also leads us to derive explicit expressions for the Ricci and self-dual Weyl curvature in terms of the intrinsic torsion of the underlying $\mathrm{SU}(2)$-structure. We compute the first variation formulae of all the quadratic functionals in the torsion; these provide natural building blocks for $\mathrm{SU}(2)$ gradient flows. In particular, our results demonstrate that both the negative gradient flow of the Dirichlet energy of the intrinsic torsion and the Ricci harmonic flow are parabolic after a modified DeTurck's trick.

Large language model (LLM) serving has transformed from stateless to stateful systems, utilizing techniques like context caching and disaggregated inference. These optimizations extend the lifespan and domain of the KV cache, necessitating a new architectural approach. We present MemServe, a unified system that integrates both inter-request and intra-request optimizations. MemServe introduces MemPool, an elastic memory pool managing distributed memory and KV caches across serving instances. Using MemPool APIs, MemServe combines context caching with disaggregated inference for the first time, supported by a global scheduler that enhances cache reuse through a global prompt tree-based locality-aware policy. Tests show that MemServe significantly improves job completion time and time-to-first-time.

We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the Bernard-LeClair scheme to the arena of classical stochastic processes and leading to a set of up to fifteen allowed symmetry classes. We construct families of solutions of arbitrary matrix dimensions for five of these classes with a simple physical interpretation of particles hopping on multipartite graphs. In the remaining classes, such a simple construction is prevented by the positivity of entries of the generator particular to classical stochastic processes, which imposes a further requirement beyond the usual symmetry classification constraints. We partially overcome this difficulty by resorting to a stochastic optimization algorithm, finding specific examples of generators of small matrix dimensions in six further classes, leaving the existence of the final four allowed classes an open problem. Our symmetry-based results unveil new possibilities in the dynamics of classical stochastic processes: Kramers degeneracy of eigenvalue pairs, dihedral symmetry of the spectra of Markov generators, and time reversal properties of stochastic trajectories and correlation functions., Comment: 28 pages, 2 figures

Bounded Model Checking (BMC) is a widely used software verification technique. Despite its successes, the technique has several limiting factors, from state-space explosion to lack of completeness. Over the years, interval analysis has repeatedly been proposed as a partial solution to these limitations. In this work, we evaluate whether the computational cost of interval analysis yields significant enough improvements in BMC's performance to justify its use. In more detail, we quantify the benefits of interval analysis on two benchmarks: the Intel Core Power Management firmware and 9537 programs in the ReachSafety category of the International Competition on Software Verification. Our results show that interval analysis is essential in solving 203 unique benchmarks., Comment: Submitted to IFM

We explore three versions of the Laplacian coflow of $G_2$-structures on circle fibrations over Calabi--Yau 3-folds, interpreting their dimensional reductions to the K\"ahler geometry of the base. Precisely, we reduce Ans\"atze for the Laplacian coflow, modified or not by de Turck's trick, both on trivial products $CY^3\times S^1$ and on contact Calabi--Yau 7-manifolds, obtaining in each case a natural modification of the K\"ahler--Ricci flow.

We introduce CYBER-0, the first zero-order optimization algorithm for memory-and-communication efficient Federated Learning, resilient to Byzantine faults. We show through extensive numerical experiments on the MNIST dataset and finetuning RoBERTa-Large that CYBER-0 outperforms state-of-the-art algorithms in terms of communication and memory efficiency while reaching similar accuracy. We provide theoretical guarantees on its convergence for convex loss functions.

Post-training quantization (PTQ) reduces the memory footprint of LLMs by quantizing weights to low-precision datatypes. Since LLM inference is usually memory-bound, PTQ methods can improve inference throughput. Recent state-of-the-art PTQ approaches have converged on using vector quantization (VQ) to quantize multiple weights at once, which improves information utilization through better shaping. However, VQ requires a codebook with size exponential in the dimension. This limits current VQ-based PTQ works to low VQ dimensions ($\le 8$) that in turn limit quantization quality. Here, we introduce QTIP, which instead uses trellis coded quantization (TCQ) to achieve ultra-high-dimensional quantization. TCQ uses a stateful decoder that separates the codebook size from the bitrate and effective dimension. QTIP introduces a spectrum of lookup-only to computed lookup-free trellis codes designed for a hardware-efficient "bitshift" trellis structure; these codes achieve state-of-the-art results in both quantization quality and inference speed.

A novel method to reconstruct the energy of hadronic showers in the CMS High Granularity Calorimeter (HGCAL) is presented. The HGCAL is a sampling calorimeter with very fine transverse and longitudinal granularity. The active media are silicon sensors and scintillator tiles readout by SiPMs and the absorbers are a combination of lead and Cu/CuW in the electromagnetic section, and steel in the hadronic section. The shower reconstruction method is based on graph neural networks and it makes use of a dynamic reduction network architecture. It is shown that the algorithm is able to capture and mitigate the main effects that normally hinder the reconstruction of hadronic showers using classical reconstruction methods, by compensating for fluctuations in the multiplicity, energy, and spatial distributions of the shower's constituents. The performance of the algorithm is evaluated using test beam data collected in 2018 prototype of the CMS HGCAL accompanied by a section of the CALICE AHCAL prototype. The capability of the method to mitigate the impact of energy leakage from the calorimeter is also demonstrated., Comment: Prepared for submission to JINST

The identification of Figurative Language (FL) features in text is crucial for various Natural Language Processing (NLP) tasks, where understanding of the author's intended meaning and its nuances is key for successful communication. At the same time, the use of a specific blend of various FL forms most accurately reflects a writer's style, rather than the use of any single construct, such as just metaphors or irony. Thus, we postulate that FL features could play an important role in Authorship Attribution (AA) tasks. We believe that our is the first computational study of AA based on FL use. Accordingly, we propose a Multi-task Figurative Language Model (MFLM) that learns to detect multiple FL features in text at once. We demonstrate, through detailed evaluation across multiple test sets, that the our model tends to perform equally or outperform specialized binary models in FL detection. Subsequently, we evaluate the predictive capability of joint FL features towards the AA task on three datasets, observing improved AA performance through the integration of MFLM embeddings.

In this paper we develop an intrinsic formalism to study the topology, smooth structure, and Riemannian geometry of the Wasserstein space of a closed Riemannian manifold. Our formalism allows for a new characterisation of the Weak topology via convergent sequences of the subjacent space. Applying it we also provide a new proof that Wasserstein spaces of closed manifolds are geodesically convex. Our framework is particularly handy to address the Wasserstein spaces of compact Lie groups, where we refine our formalism and present an explicit example., Comment: 24 pages

We study gradient descent (GD) dynamics on logistic regression problems with large, constant step sizes. For linearly-separable data, it is known that GD converges to the minimizer with arbitrarily large step sizes, a property which no longer holds when the problem is not separable. In fact, the behaviour can be much more complex -- a sequence of period-doubling bifurcations begins at the critical step size $2/\lambda$, where $\lambda$ is the largest eigenvalue of the Hessian at the solution. Using a smaller-than-critical step size guarantees convergence if initialized nearby the solution: but does this suffice globally? In one dimension, we show that a step size less than $1/\lambda$ suffices for global convergence. However, for all step sizes between $1/\lambda$ and the critical step size $2/\lambda$, one can construct a dataset such that GD converges to a stable cycle. In higher dimensions, this is actually possible even for step sizes less than $1/\lambda$. Our results show that although local convergence is guaranteed for all step sizes less than the critical step size, global convergence is not, and GD may instead converge to a cycle depending on the initialization.

Zeroth-order optimization (ZO) is a memory-efficient strategy for fine-tuning Large Language Models using only forward passes. However, the application of ZO fine-tuning in memory-constrained settings such as mobile phones and laptops is still challenging since full precision forward passes are infeasible. In this study, we address this limitation by integrating sparsity and quantization into ZO fine-tuning of LLMs. Specifically, we investigate the feasibility of fine-tuning an extremely small subset of LLM parameters using ZO. This approach allows the majority of un-tuned parameters to be quantized to accommodate the constraint of limited device memory. Our findings reveal that the pre-training process can identify a set of "sensitive parameters" that can guide the ZO fine-tuning of LLMs on downstream tasks. Our results demonstrate that fine-tuning 0.1% sensitive parameters in the LLM with ZO can outperform the full ZO fine-tuning performance, while offering wall-clock time speedup. Additionally, we show that ZO fine-tuning targeting these 0.1% sensitive parameters, combined with 4 bit quantization, enables efficient ZO fine-tuning of an Llama2-7B model on a GPU device with less than 8 GiB of memory and notably reduced latency.

We investigate the static boson star solutions in the so-called Einstein-Friedberg-Lee-Sirlin (E-FLS) theory, performing a complete analysis of the solution space in this model. We study the phenomenological aspects of E-FLS stars, for instance, by investigating the timelike and null geodesics with an emphasis on the analysis of circular timelike orbits and light rings. In order to study the astrophysical signatures of such stars, their images were obtained considering them surrounded by a geometrically thin accretion disk. Our results comprise two different models of accretion disks, namely the optically thin and thick disk models. We present a selection of our findings for the astrophysical images of E-FLS stars and discuss their relevance as a possible black hole mimicker., Comment: 16 pages, 13 figures

Motivated by the experimental observation of spin-charge separation in one-dimensional interacting Fermi gases, we investigate these systems in the presence of spin-orbit coupling and Rabi fields. We demonstrate that spin-charge-separated modes evolve into helical collective modes due to the special mixing of spin and charge induced by spin-orbit coupling and Rabi fields. We obtain the phase diagram of chemical potential versus Rabi fields for given spin-orbit coupling and interactions, and find several topological quantum phase transitions of the Lifshitz type. We show that the velocities of the collective modes are nonanalytic at the boundaries between different phases. Lastly, we analyze the charge-charge, spin-charge and spin-spin dynamical structure factors to show that the dispersions, spectral weights and helicities of the collective modes can be experimentally extracted in systems such as $^{6}{\rm Li}$, $^{40}{\rm K}$ and $^{173}{\rm Yb}$., Comment: 7 pages, 3 figures

We present STAT: a simple algorithm to prune transformer models without any fine-tuning. STAT eliminates both attention heads and neurons from the network, while preserving accuracy by calculating a correction to the weights of the next layer. Each layer block in the network is compressed using a series of principled matrix factorizations that preserve the network structure. Our entire algorithm takes minutes to compress BERT, and less than three hours to compress models with 7B parameters using a single GPU. Using only several hundred data examples, STAT preserves the output of the network and improves upon existing gradient-free pruning methods. It is even competitive with methods that include significant fine-tuning. We demonstrate our method on both encoder and decoder architectures, including BERT, DistilBERT, and Llama-2 using benchmarks such as GLUE, Squad, WikiText2.

Molecular photoabsorption results in an electronic excitation/ionization which couples to the rearrangement of the nuclei. The resulting intertwined change of nuclear and electronic degrees of freedom determines the conversion of photoenergy into other molecular energy forms. Nucleobases are excellent candidates for studying such dynamics, and great effort has been taken in the past to observe the electronic changes induced by the initial excitation in a time-resolved manner using ultrafast electron spectroscopy. The linked geometrical changes during nucleobase photorelaxation have so far not been observed directly in time-resolved experiments. Here, we present a study on a thionucleobase, where we extract comprehensive information on the molecular rearrangement using Coulomb explosion imaging. Our measurement links the extracted deplanarization of the molecular geometry to the previously studied temporal evolution of the electronic properties of the system. In particular, the protons of the exploded molecule are well-suited messengers carrying rich information on the molecule's geometry at distinct times after the initial electronic excitation. The combination of ultrashort laser pulses to trigger molecular dynamics, intense X-ray free-electron laser pulses for the explosion of the molecule, and multi-particle coincidence detection opens new avenues for time-resolved studies of complex molecules in the gas phase., Comment: 19 pages, 8 figures

Between 2021 and 2023, AI-Olympics, a series of online AI competitions was hosted by the online evaluation platform Jidi in collaboration with the IJCAI committee. In these competitions, an agent is required to accomplish diverse sports tasks in a two-dimensional continuous world, while competing against an opponent. This paper provides a brief overview of the competition series and highlights notable findings. We aim to contribute insights to the field of multi-agent decision-making and explore the generalization of agents through engineering efforts., Comment: IJCAI 2024 Demo Track Paper

Background: Timely prioritising and remediating vulnerabilities are paramount in the dynamic cybersecurity field, and one of the most widely used vulnerability scoring systems (CVSS) does not address the increasing likelihood of emerging an exploit code. Aims: We present SecScore, an innovative vulnerability severity score that enhances CVSS Threat metric group with statistical models from empirical evidences of real-world exploit codes. Method: SecScore adjusts the traditional CVSS score using an explainable and empirical method that more accurately and promptly captures the dynamics of exploit code development. Results: Our approach can integrate seamlessly into the assessment/prioritisation stage of several vulnerability management processes, improving the effectiveness of prioritisation and ensuring timely remediation. We provide real-world statistical analysis and models for a wide range of vulnerability types and platforms, demonstrating that SecScore is flexible according to the vulnerability's profile. Comprehensive experiments validate the value and timeliness of SecScore in vulnerability prioritisation. Conclusions: SecScore advances the vulnerability metrics theory and enhances organisational cybersecurity with practical insights.

The growing enrollments in computer science courses and increase in class sizes necessitate scalable, automated tutoring solutions to adequately support student learning. While Large Language Models (LLMs) like GPT-4 have demonstrated potential in assisting students through question-answering, educators express concerns over student overreliance, miscomprehension of generated code, and the risk of inaccurate answers. Rather than banning these tools outright, we advocate for a constructive approach that harnesses the capabilities of AI while mitigating potential risks. This poster introduces CourseAssist, a novel LLM-based tutoring system tailored for computer science education. Unlike generic LLM systems, CourseAssist uses retrieval-augmented generation, user intent classification, and question decomposition to align AI responses with specific course materials and learning objectives, thereby ensuring pedagogical appropriateness of LLMs in educational settings. We evaluated CourseAssist against a baseline of GPT-4 using a dataset of 50 question-answer pairs from a programming languages course, focusing on the criteria of usefulness, accuracy, and pedagogical appropriateness. Evaluation results show that CourseAssist significantly outperforms the baseline, demonstrating its potential to serve as an effective learning assistant. We have also deployed CourseAssist in 6 computer science courses at a large public R1 research university reaching over 500 students. Interviews with 20 student users show that CourseAssist improves computer science instruction by increasing the accessibility of course-specific tutoring help and shortening the feedback loop on their programming assignments. Future work will include extensive pilot testing at more universities and exploring better collaborative relationships between students, educators, and AI that improve computer science learning experiences., Comment: Accepted to SIGCSE Virtual 2024

The behavior and decision making of groups or communities can be dramatically influenced by individuals pushing particular agendas, e.g., to promote or disparage a person or an activity, to call for action, etc.. In the examination of online influence campaigns, particularly those related to important political and social events, scholars often concentrate on identifying the sources responsible for setting and controlling the agenda (e.g., public media). In this article we present a methodology for detecting specific instances of agenda control through social media where annotated data is limited or non-existent. By using a modest corpus of Twitter messages centered on the 2022 French Presidential Elections, we carry out a comprehensive evaluation of various approaches and techniques that can be applied to this problem. Our findings demonstrate that by treating the task as a textual entailment problem, it is possible to overcome the requirement for a large annotated training dataset.

Doubly robust estimators have gained popularity in the field of causal inference due to their ability to provide consistent point estimates when either an outcome or exposure model is correctly specified. However, the influence function based variance estimator frequently used with doubly robust estimators is only consistent when both the outcome and exposure models are correctly specified. Here, use of M-estimation and the empirical sandwich variance estimator for doubly robust point and variance estimation is demonstrated. Simulation studies illustrate the properties of the influence function based and empirical sandwich variance estimators. Estimators are applied to data from the Improving Pregnancy Outcomes with Progesterone (IPOP) trial to estimate the effect of maternal anemia on birth weight among women with HIV. In the example, birth weights if all women had anemia were estimated to be lower than birth weights if no women had anemia, though estimates were imprecise. Variance estimates were more stable under varying model specifications for the empirical sandwich variance estimator than the influence function based variance estimator., Comment: 19 pages, 5 figures, 6 tables

We introduce the coupled instanton equations for a metric, a spinor, a three-form, and a connection on a bundle, over a spin manifold. Special solutions in dimensions $6$ and $7$ arise, respectively, from the Hull--Strominger and the heterotic $\operatorname{G}_2$ system. The equations are motivated by recent developments in theoretical physics and can be recast using generalized geometry; we investigate how coupled instantons relate to generalized Ricci-flat metrics and also to Killing spinors on a Courant algebroid. We present two open questions regarding how these different geometric conditions are intertwined, for which a positive answer is expected from recent developments in the physics literature by De la Ossa, Larfors and Svanes, and in the mathematics literature on Calabi--Yau manifolds, in recent work by the second-named author with Gonz\'alez Molina. We give a complete solution to the first of these problems, providing a new method for the construction of instantons in arbitrary dimensions. For $\operatorname{G}_2$-structures with torsion coupled to $\operatorname{G}_2$-instantons, in dimension $7$, we also establish results around the second problem. The last part of the present work carefully studies the approximate solutions to the heterotic $\operatorname{G}_2$-system constructed by the third and fourth authors on contact Calabi--Yau $7$-manifolds, for which we prove the existence of approximate coupled $\operatorname{G}_2$-instantons and generalized Ricci-flat metrics., Comment: 45 pages, new Theorem 2.32 with complete solution to Problem 1, in arbitrary dimensions. Improved version of Theorem 4.9. New Remark 4.10 about the Spin(7) case. Submitted for consideration in the International Journal of Mathematics special issue "At the interface of complex geometry and string theory"

This work seeks to advance the understanding of the smooth structure of the moduli space of self-dual contact instantons (SDCI) on Sasakian 7-manifolds M. A neighborhood of a smooth point of M is locally modeled on the first cohomological group of an elliptic complex (1.4). There is a cohomological obstruction to the smoothness for the moduli space, in terms of a second basic cohomological group, in this paper we study conditions under which this obstruction disappears, by computing a Weitzenb\"ock formula and using a Bochner-type method to obtain a vanishing theorem. Given an SDCI on a Sasakian bundle E, we find sufficient conditions for the vanishing of the obstruction in the positivity of a couple of operators R and F depending on the curvatures of the connection and the Riemann curvature of the Sasakian metric g. In particular, we find that if M is transversely Ricci positive and F positive, the moduli space of SDCI must be smooth. However, in general, the operator F is not positive definite and we describe bundles over the Stiefel manifold for which it is the case. Finally, we show that when the energy of the curvature is less than the first non-zero eigenvalue of RicT the obstruction vanishes.

With the proliferation of Internet of Things (IoT) devices, ensuring secure communications has become imperative. Due to their low cost and embedded nature, many of these devices operate with computational and energy constraints, neglecting the potential security vulnerabilities that they may bring. This work-in-progress is focused on designing secure communication among remote servers and embedded IoT devices to balance security robustness and energy efficiency. The proposed approach uses lightweight cryptography, optimizing device performance and security without overburdening their limited resources. Our architecture stands out for integrating Edge servers and a central Name Server, allowing secure and decentralized authentication and efficient connection transitions between different Edge servers. This architecture enhances the scalability of the IoT network and reduces the load on each server, distributing the responsibility for authentication and key management., Comment: 6 pages and 2 figures

We investigate a class of free boundary problems with oscillatory singularities within stochastic materials. Our main result yields sharp regularity estimates along the free boundary, provided the power of the singularity varies in a Dini-continuous fashion below a certain threshold. We also reveal an interesting repelling estimate preventing the free boundary from touching the region where the singularity power oscillates above the threshold.

In this correspondence, we propose a movable antenna (MA)-aided multi-user hybrid beamforming scheme with a sub-connected structure, where multiple movable sub-arrays can independently change their positions within different local regions. To maximize the system sum rate, we jointly optimize the digital beamformer, analog beamformer, and positions of subarrays, under the constraints of unit modulus, finite movable regions, and power budget. Due to the non-concave/non-convex objective function/constraints, as well as the highly coupled variables, the formulated problem is challenging to solve. By employing fractional programming, we develop an alternating optimization framework to solve the problem via a combination of Lagrange multipliers, penalty method, and gradient descent. Numerical results reveal that the proposed MA-aided hybrid beamforming scheme significantly improves the sum rate compared to its fixed-position antenna (FPA) counterpart. Moreover, with sufficiently large movable regions, the proposed scheme with sub-connected MA arrays even outperforms the fully-connected FPA array.

In this work, we have adopted the diffusion-based image reconstruction pipeline previously used for fMRI image reconstruction and applied it to Electroencephalography (EEG). The EEG encoding method is very simple, and forms a baseline from which more sophisticated EEG encoding methods can be compared. We have also evaluated the fidelity of the generated image using the same metrics used in the previous functional magnetic resonance imaging (fMRI) and magnetoencephalography (MEG) works. Our results show that while the reconstruction from EEG recorded to rapidly presented images is not as good as reconstructions from fMRI to slower presented images, it holds a surprising amount of information that could be applied in specific use cases. Also, EEG-based image reconstruction works better in some categories-such as land animals and food-than others, shedding new light on previous findings of EEG's sensitivity to those categories and revealing potential for these methods to further understand EEG responses to human visual coding. More investigation should use longer-duration image stimulations to elucidate the later components that might be salient to the different image categories.

Observational data are often used to estimate real-world effectiveness and durability of coronavirus disease 2019 (COVID-19) vaccines. A sequence of nested trials can be emulated to draw inference from such data while minimizing selection bias, immortal time bias, and confounding. Typically, when nested trial emulation (NTE) is employed, effect estimates are pooled across trials to increase statistical efficiency. However, such pooled estimates may lack a clear interpretation when the treatment effect is heterogeneous across trials. In the context of COVID-19, vaccine effectiveness quite plausibly will vary over calendar time due to newly emerging variants of the virus. This manuscript considers a NTE inverse probability weighted estimator of vaccine effectiveness that may vary over calendar time, time since vaccination, or both. Statistical testing of the trial effect homogeneity assumption is considered. Simulation studies are presented examining the finite-sample performance of these methods under a variety of scenarios. The methods are used to estimate vaccine effectiveness against COVID-19 outcomes using observational data on over 120,000 residents of Abruzzo, Italy during 2021., Comment: 27 pages, 2 figures

Text continues to remain a relevant form of representation for information. Text documents are created either in digital native platforms or through the conversion of other media files such as images and speech. While the digital native text is invariably obtained through physical or virtual keyboards, technologies such as OCR and speech recognition are utilized to transform the images and speech signals into text content. All these variety of mechanisms of text generation also introduce errors into the captured text. This project aims at analyzing different kinds of error that occurs in text documents. The work employs two of the advanced deep neural network-based language models, namely, BART and MarianMT, to rectify the anomalies present in the text. Transfer learning of these models with available dataset is performed to finetune their capacity for error correction. A comparative study is conducted to investigate the effectiveness of these models in handling each of the defined error categories. It is observed that while both models can bring down the erroneous sentences by 20+%, BART can handle spelling errors far better (24.6%) than grammatical errors (8.8%).