Search

We consider the rare decay channels of the $Z$ boson: $Z \to \text{two}\ \textrm{jets} + \gamma$ and $Z \to \text{two}\ \textrm{jets} +2\, \gamma$. To obtain the widths and distributions for these processes, we compute the effect of NLO QCD corrections to the processes $Z \to q {\bar q}+ \gamma$ and $Z \to q {\bar q} +2\, \gamma$. We find that these corrections reduce the widths of these processes by about $6.03\%$ and $12.39\%$, respectively. The reduction in the partial widths is larger at the jet level. These NLO-improved decay observables may be tested in future runs of the LHC or at future $e^{+}e^{-}$ colliders., Comment: 20 pages, 16 figures, 2 tables

Fairness in multi-document summarization of user-generated content remains a critical challenge in natural language processing (NLP). Existing summarization methods often fail to ensure equitable representation across different social groups, leading to biased outputs. In this paper, we introduce two novel methods for fair extractive summarization: FairExtract, a clustering-based approach, and FairGPT, which leverages GPT-3.5-turbo with fairness constraints. We evaluate these methods using Divsumm summarization dataset of White-aligned, Hispanic, and African-American dialect tweets and compare them against relevant baselines. The results obtained using a comprehensive set of summarization quality metrics such as SUPERT, BLANC, SummaQA, BARTScore, and UniEval, as well as a fairness metric F, demonstrate that FairExtract and FairGPT achieve superior fairness while maintaining competitive summarization quality. Additionally, we introduce composite metrics (e.g., SUPERT+F, BLANC+F) that integrate quality and fairness into a single evaluation framework, offering a more nuanced understanding of the trade-offs between these objectives. This work highlights the importance of fairness in summarization and sets a benchmark for future research in fairness-aware NLP models., Comment: Accepted at Algorithmic Fairness through the Lens of Metrics and Evaluation Workshop @ NeurIPS 2024

We consider quantum networks, where entangled photon pairs are distributed using fibre optic links from a centralized source to entangling nodes. The entanglement is then stored (via an entanglement swap) in entangling nodes' quantum memories until used in, e.g., distributed quantum computing, quantum key distribution, quantum sensing, and other applications. Due to the fibre loss, some photons are lost in transmission. Noise in the transmission link and the quantum memory also reduces fidelity. Thus, entangling nodes must keep updated records of photon-pair arrivals to each destination, and their use by the applications. This coordination requires classical information exchange between each entangled node pair. However, the same fibre link may not admit both classical and quantum transmissions, as the classical channels can generate enough noise (i.e., via spontaneous Raman scattering) to make the quantum link unusable. Here, we consider coordinating entanglement distribution using a standard Internet protocol (IP) network instead, and propose a control protocol to enable such. We analyse the increase in latency from transmission over an IP network, together with the effect of photon loss, quantum memory noise and buffer size, to determine the fidelity and rate of entangled pairs. We characterize the relationship between the latency of the non-ideal IP network and the decoherence time of the quantum memories, providing a comparison of promising quantum memory technologies.

Distributing entanglement over long distances remains a challenge due to its fragility when exposed to environmental effects. In this work, we compare various entanglement distribution protocols in a realistic noisy fiber network. We focus specifically on two schemes that only require the sending of a non-entangled carrier photon to remote nodes of the network. These protocols rely on optical CNOT gates and we vary the probability with which they can be successfully performed. Encoding our entangled states in photon polarization, we analyse the effect of depolarizing noise on the photonic states as the carrier passes through the fibers. Building a robust model of photon loss and calculating the distillable entanglement of the noisy states, we find the entanglement distribution rate. We discover that methods involving a separable carrier can reach a higher rate than the standard entanglement distribution protocol, provided that the success probability of the optical CNOT gates is sufficiently high., Comment: 12 pages, 10 figures. Comments welcome

Reinforcement learning (RL) has been proven to be an effective and robust method for training neural machine translation systems, especially when paired with powerful reward models that accurately assess translation quality. However, most research has focused on RL methods that use sentence-level feedback, which leads to inefficient learning signals due to the reward sparsity problem -- the model receives a single score for the entire sentence. To address this, we introduce a novel approach that leverages fine-grained token-level reward mechanisms with RL methods. We use xCOMET, a state-of-the-art quality estimation system as our token-level reward model. xCOMET provides detailed feedback by predicting fine-grained error spans and their severity given source-translation pairs. We conduct experiments on small and large translation datasets to compare the impact of sentence-level versus fine-grained reward signals on translation quality. Our results show that training with token-level rewards improves translation quality across language pairs over baselines according to automatic and human evaluation. Furthermore, token-level reward optimization also improves training stability, evidenced by a steady increase in mean rewards over training epochs., Comment: 10 pages, work-in-progress

Learning the intents of an agent, defined by its goals or motion style, is often extremely challenging from just a few examples. We refer to this problem as task concept learning and present our approach, Few-Shot Task Learning through Inverse Generative Modeling (FTL-IGM), which learns new task concepts by leveraging invertible neural generative models. The core idea is to pretrain a generative model on a set of basic concepts and their demonstrations. Then, given a few demonstrations of a new concept (such as a new goal or a new action), our method learns the underlying concepts through backpropagation without updating the model weights, thanks to the invertibility of the generative model. We evaluate our method in five domains -- object rearrangement, goal-oriented navigation, motion caption of human actions, autonomous driving, and real-world table-top manipulation. Our experimental results demonstrate that via the pretrained generative model, we successfully learn novel concepts and generate agent plans or motion corresponding to these concepts in (1) unseen environments and (2) in composition with training concepts.

The pendulum is one of the oldest gravimeters, featuring frequency-based readout limited by geometric nonlinearity. While modern gravimeters focus on displacement-based spring-mass or free-fall designs, the advent of nanofabrication techniques invites a revisiting of the pendulum, motivated by the prospect of low-loss, compact, isochronous operation, leveraging precise dimensional control. Here we exploit advances in strain-engineered nanomechanics -- specifically, strained Si$_3$N$_4$ nanoribbon suspensions -- to realize a $0.1$ mg, $32$ Hz torsion pendulum with an ultralow damping rate of $16\,\mu$Hz and a parametric gravity sensitivity of $5$ Hz/$g_0$ ($g_0 = 9.8\;\text{m}/\text{s}^2)$. The low thermal acceleration of the pendulum, $2\times 10^{-9}g_0/\sqrt{\text{Hz}}$, gives access to a parametric gravity resolution of $10^{-8}g_0$ for drive amplitudes of $10\;\text{mrad}$ and integration times within the free decay time, of interest for both commercial applications and fundamental experiments. We present progress toward this goal, demonstrating free and self-sustained oscillators with frequency stabilities as little as $2.5\,\mu$Hz at 200 s, corresponding to a gravity resolution of $5\times 10^{-7}g_0$. We also show how the Duffing nonlinearity of the suspension can be used to cancel the pendulum nonlinearity, paving the way toward a fully isochronous, high-$Q$ micromechanical clock., Comment: 9 pages, 7 figures

Spiking Neural Networks (SNNs), with their inherent recurrence, offer an efficient method for processing the asynchronous temporal data generated by Dynamic Vision Sensors (DVS), making them well-suited for event-based vision applications. However, existing SNN accelerators suffer from limitations in adaptability to diverse neuron models, bit precisions and network sizes, inefficient membrane potential (Vmem) handling, and limited sparse optimizations. In response to these challenges, we propose a scalable and reconfigurable digital compute-in-memory (CIM) SNN accelerator \chipname with a set of key features: 1) It uses in-memory computations and reconfigurable operating modes to minimize data movement associated with weight and Vmem data structures while efficiently adapting to different workloads. 2) It supports multiple weight/Vmem bit precision values, enabling a trade-off between accuracy and energy efficiency and enhancing adaptability to diverse application demands. 3) A zero-skipping mechanism for sparse inputs significantly reduces energy usage by leveraging the inherent sparsity of spikes without introducing high overheads for low sparsity. 4) Finally, the asynchronous handshaking mechanism maintains the computational efficiency of the pipeline for variable execution times of different computation units. We fabricated \chipname in 65 nm Taiwan Semiconductor Manufacturing Company (TSMC) low-power (LP) technology. It demonstrates competitive performance (scaled to the same technology node) to other digital SNN accelerators proposed in the recent literature and supports advanced reconfigurability. It achieves up to 5 TOPS/W energy efficiency at 95% input sparsity with 4-bit weights and 7-bit Vmem precision., Comment: 9 pages, 17 figures