Search

Parallel decoding methods such as Jacobi decoding show promise for more efficient LLM inference as it breaks the sequential nature of the LLM decoding process and transforms it into parallelizable computation. However, in practice, it achieves little speedup compared to traditional autoregressive (AR) decoding, primarily because Jacobi decoding seldom accurately predicts more than one token in a single fixed-point iteration step. To address this, we develop a new approach aimed at realizing fast convergence from any state to the fixed point on a Jacobi trajectory. This is accomplished by refining the target LLM to consistently predict the fixed point given any state as input. Extensive experiments demonstrate the effectiveness of our method, showing 2.4$\times$ to 3.4$\times$ improvements in generation speed while preserving generation quality across both domain-specific and open-domain benchmarks., Comment: In the proceedings of the 41st International Conference on Machine Learning (ICML) 2024

Recent Imaging X-ray Polarimetry Explorer (IXPE) observations of blazars tend to support the shock model for the X-ray emission, but report a low polarization degree ($\Pi\sim 10\%$) in X-rays compared with the previous theoretical expectations in the shock model. In order to reconcile the theoretical expectations with observations, we revisit the polarization of the shock emission by considering different kind of direction distribution for the shock-generated magnetic fields (sgMFs). Here, $w'_{\rm sg}\propto(\sin\theta')^{\zeta_{\rm sg}}$ with $\theta'=0$ along the shock normal direction is used to describe the direction distribution of the sgMFs in the shock co-moving frame. It is found that the polarization in the X-ray and radio emission for a general jet in blazars can be described as $\Pi\sim 44.5[1-\exp(-\zeta_{\rm sg}/2.6)]\%$ and $\Pi\sim 20[1-\exp(-\zeta_{\rm sg}/2.4)]\%$, respectively. Correspondingly, one can have $\zeta_{\rm sg}\sim 1-1.5$ according to the IXPE observations. Besides the sgMFs, the magnetic fields generated by the Richmyer-Meshkov instability (rmMFs) is supposed to present in the jets. The direction of the rmMFs is mainly distributed along the shock normal in the simulations and thus $w'_{\rm rm}\propto(\cos \theta')^{\zeta_{\rm rm}}$ is adopted to describe the direction distribution of rmMFs. We find that the rmMFs is likely to significantly affect the polarization properties at the low-frequency emission, especially when the sgMFs decay rapidly. Based on the contemporaneous radio and X-ray observations, we find the the emission of the electrons in the rmMFs make a significant contribution in the low-frequency emission and the the ordered background magnetic fields (obMFs) can be neglected.

Superconductivity in semiconductor nanostructures contains fascinating physics due to the interplay between Andreev reflection, spin, and orbital interactions. New material hybrids can access new quantum regimes and phenomena. Here, we report the realization of epitaxial indium thin films on PbTe nanowires.The film is continuous and forms an atomically sharp interface with PbTe.Tunneling devices reveal a hard superconducting gap.The gap size, 1.08 to 1.18 meV, is twice as large as bulk indium (around 0.5 meV), due to the presence of PbTe. A similar enhancement is also observed in the critical temperature of In on a PbTe substrate. Zero bias conductance peaks appear at finite magnetic fields. The effective g-factor (15 to 45) is notably enhanced compared to bare PbTe wires (less than 10) due to the presence of In, differing from Al-hybrids. Josephson devices exhibit gate-tunable supercurrents. The PbTe-In hybrid enhances the properties of both, the superconductivity of In and g-factors of PbTe, and thus may enable exotic phases of matter such as topological superconductivity.

We present AnaMoDiff, a novel diffusion-based method for 2D motion analogies that is applied to raw, unannotated videos of articulated characters. Our goal is to accurately transfer motions from a 2D driving video onto a source character, with its identity, in terms of appearance and natural movement, well preserved, even when there may be significant discrepancies between the source and driving characters in their part proportions and movement speed and styles. Our diffusion model transfers the input motion via a latent optical flow (LOF) network operating in a noised latent space, which is spatially aware, efficient to process compared to the original RGB videos, and artifact-resistant through the diffusion denoising process even amid dense movements. To accomplish both motion analogy and identity preservation, we train our denoising model in a feature-disentangled manner, operating at two noise levels. While identity-revealing features of the source are learned via conventional noise injection, motion features are learned from LOF-warped videos by only injecting noise with large values, with the stipulation that motion properties involving pose and limbs are encoded by higher-level features. Experiments demonstrate that our method achieves the best trade-off between motion analogy and identity preservation.

Quantum operations by utilizing the underlying geometric phases produced in physical systems are favoured due to its potential robustness. When a system in a non-degenerate eigenstate undergoes an adiabatically cyclic evolution dominated by its Hamiltonian, it will get a geometric phase, referred to as the Berry Phase. While a non-adiabatically cyclic evolution produces an Aharonov-Anandan geometric phase. The two types of Abelian geometric phases are extended to the non-Abelian cases, where the phase factors become matrix-valued and the transformations associated with different loops are non-commutable. Abelian and non-Abelian (holonomic) operations are prevalent in discrete variable systems, whose limited (say, two) energy levels, form the qubit. While their developments in continuous systems have also been investigated, mainly due to that, bosonic modes (in, such as, cat states) with large Hilbert spaces, provide potential advantages in fault-tolerant quantum computation. Here we propose a feasible scheme to realize non-adiabatic holonomic quantum logic operations in continuous variable systems with cat codes. We construct arbitrary single-qubit (two-qubit) gates with the combination of single- and two-photon drivings applied to a Kerr Parametric Oscillator (KPO) (the coupled KPOs). Our scheme relaxes the requirements of the previously proposed quantum geometric operation strategies in continuous variable systems, providing an effective way for quantum control.

This paper introduces a new approach based on a coupled representation and a neural volume optimization to implicitly perform 3D shape editing in latent space. This work has three innovations. First, we design the coupled neural shape (CNS) representation for supporting 3D shape editing. This representation includes a latent code, which captures high-level global semantics of the shape, and a 3D neural feature volume, which provides a spatial context to associate with the local shape changes given by the editing. Second, we formulate the coupled neural shape optimization procedure to co-optimize the two coupled components in the representation subject to the editing operation. Last, we offer various 3D shape editing operators, i.e., copy, resize, delete, and drag, and derive each into an objective for guiding the CNS optimization, such that we can iteratively co-optimize the latent code and neural feature volume to match the editing target. With our approach, we can achieve a rich variety of editing results that are not only aware of the shape semantics but are also not easy to achieve by existing approaches. Both quantitative and qualitative evaluations demonstrate the strong capabilities of our approach over the state-of-the-art solutions.

The orbital energy and momentum of the compact binary systems will loss due to gravitational radiation. Based on the mass and mass-current multipole moments of the binary system with the spin vector defined by Boh\'{e} et al. [Class. Quantum Grav. 30, 075017 (2013)], we calculate the loss rates of energy, angular and linear momentum induced by the next-to-leading spin-orbit effects. For the case of circular orbit, the formulations for these losses are given in terms of the orbital frequency., Comment: 18 pages

Material challenges are the key issue in Majorana nanowires where surface disorder constrains device performance. Here, we tackle this challenge by embedding PbTe nanowires within a latticematched crystal, an oxide-free environment. The wire edges are shaped by self-organized growth instead of lithography, resulting in nearly-atomic-flat facets along both cross-sectional and longitudinal directions. Quantized conductance plateaus are observed at zero magnetic field with channel lengths reaching 1.54 $\mu$m, significantly surpassing the state-of-the-art of III-V nanowires (nearly an order-of-magnitude improvement compared to InSb). Coupling PbTe to a Pb film unveils a flat interface spanning microns and a large superconducting gap of 1 meV. Our results meet the stringent low-disorder requirement for the definitive observation of Majoranas.

Autoregressive decoding of large language models (LLMs) is memory bandwidth bounded, resulting in high latency and significant wastes of the parallel processing power of modern accelerators. Existing methods for accelerating LLM decoding often require a draft model (e.g., speculative decoding), which is nontrivial to obtain and unable to generalize. In this paper, we introduce Lookahead decoding, an exact, parallel decoding algorithm that accelerates LLM decoding without needing auxiliary models or data stores. It allows trading per-step log(FLOPs) to reduce the number of total decoding steps, is more parallelizable on single or multiple modern accelerators, and is compatible with concurrent memory-efficient attention (e.g., FlashAttention). Our implementation of Lookahead decoding can speed up autoregressive decoding by up to 1.8x on MT-bench and 4x with strong scaling on multiple GPUs in code completion tasks. Our code is avialable at https://github.com/hao-ai-lab/LookaheadDecoding

Large language models are increasingly integrated with external environments, tools, and agents like ChatGPT plugins to extend their capability beyond language-centric tasks. However, today's LLM inference systems are designed for standalone LLMs. They treat each external interaction as the end of LLM generation and form a new request when the interaction finishes, causing unnecessary recomputation of already computed contexts, which accounts for 37-40% of total model forwarding time. This paper presents InferCept, the first LLM inference framework targeting augmented LLMs and supporting the efficient interception of LLM generation. InferCept minimizes the GPU resource waste caused by LLM interceptions and dedicates saved memory for serving more requests. InferCept improves the overall serving throughput by 1.6x-2x and completes 2x more requests per second compared to the state-of-the-art LLM inference systems.

We discuss a class of selection rules which i) do not come from group actions on fields, ii) are exact at tree level in perturbation theory, iii) are increasingly violated as the loop order is raised, and iv) eventually reduce to selection rules associated with an ordinary group symmetry. We start from basic field-theoretical examples in which fields are labeled by conjugacy classes rather than representations of a group, and discuss generalizations using fusion algebras or hypergroups. We also discuss how such selection rules arise naturally in string theory, such as for non-Abelian orbifolds or other cases with non-invertible worldsheet symmetries., Comment: 22 pages + three appendices

Activity detection is an important task in the next generation grant-free multiple access. While there are a number of existing algorithms designed for this purpose, they mostly require precise information about the network, such as large-scale fading coefficients, small-scale fading channel statistics, noise variance at the access points, and user activity probability. Acquiring these information would take a significant overhead and their estimated values might not be accurate. This problem is even more severe in cell-free networks as there are many of these parameters to be acquired. Therefore, this paper sets out to investigate the activity detection problem without the above-mentioned information. In order to handle so many unknown parameters, this paper employs the Bayesian approach, where the unknown variables are endowed with prior distributions which effectively act as regularizations. Together with the likelihood function, a maximum a posteriori (MAP) estimator and a variational inference algorithm are derived. Extensive simulations demonstrate that the proposed methods, even without the knowledge of these system parameters, perform better than existing state-of-the-art methods, such as covariance-based and approximate message passing methods., Comment: 16 pages, 9 figures, accepted for publication in IEEE Transactions on Signal Processing

While perception systems in Connected and Autonomous Vehicles (CAVs), which encompass both communication technologies and advanced sensors, promise to significantly reduce human driving errors, they also expose CAVs to various cyberattacks. These include both communication and sensing attacks, which potentially jeopardize not only individual vehicles but also overall traffic safety and efficiency. While much research has focused on communication attacks, sensing attacks, which are equally critical, have garnered less attention. To address this gap, this study offers a comprehensive review of potential sensing attacks and their impact on target vehicles, focusing on commonly deployed sensors in CAVs such as cameras, LiDAR, Radar, ultrasonic sensors, and GPS. Based on this review, we discuss the feasibility of integrating hardware-in-the-loop experiments with microscopic traffic simulations. We also design baseline scenarios to analyze the macro-level impact of sensing attacks on traffic flow. This study aims to bridge the research gap between individual vehicle sensing attacks and broader macroscopic impacts, thereby laying the foundation for future systemic understanding and mitigation.

Conversational recommender systems (CRS) aim to recommend relevant items to users by eliciting user preference through natural language conversation. Prior work often utilizes external knowledge graphs for items' semantic information, a language model for dialogue generation, and a recommendation module for ranking relevant items. This combination of multiple components suffers from a cumbersome training process, and leads to semantic misalignment issues between dialogue generation and item recommendation. In this paper, we represent items in natural language and formulate CRS as a natural language processing task. Accordingly, we leverage the power of pre-trained language models to encode items, understand user intent via conversation, perform item recommendation through semantic matching, and generate dialogues. As a unified model, our PECRS (Parameter-Efficient CRS), can be optimized in a single stage, without relying on non-textual metadata such as a knowledge graph. Experiments on two benchmark CRS datasets, ReDial and INSPIRED, demonstrate the effectiveness of PECRS on recommendation and conversation. Our code is available at: https://github.com/Ravoxsg/efficient_unified_crs., Comment: 9 pages, 4 figures, 8 tables, EACL 2024 conference, fixed typo

We introduce Grounded SAM, which uses Grounding DINO as an open-set object detector to combine with the segment anything model (SAM). This integration enables the detection and segmentation of any regions based on arbitrary text inputs and opens a door to connecting various vision models. As shown in Fig.1, a wide range of vision tasks can be achieved by using the versatile Grounded SAM pipeline. For example, an automatic annotation pipeline based solely on input images can be realized by incorporating models such as BLIP and Recognize Anything. Additionally, incorporating Stable-Diffusion allows for controllable image editing, while the integration of OSX facilitates promptable 3D human motion analysis. Grounded SAM also shows superior performance on open-vocabulary benchmarks, achieving 48.7 mean AP on SegInW (Segmentation in the wild) zero-shot benchmark with the combination of Grounding DINO-Base and SAM-Huge models.

Let $L$ be a sectorial operator of type $\alpha$ ($0 \leq \alpha < \pi/2$) on $L^2(\mathbb{R}^d)$ with the kernels of $\{e^{-tL}\}_{t>0}$ satisfying certain size and regularity conditions. Define $$ S_{q,L}(f)(x) = \left(\int_0^{\infty}\int_{|y-x| < t} \|tL{e^{-tL}} (f)(y) \|_X^q \,\frac{{\rm d} y{\rm d} t}{t^{d+1}} \right)^{\frac{1}{q}},$$ $$G_{q,{L}}(f)=\left( \int_0^{\infty} \left\|t{L}{e^{-t{L}}} (f)(y) \right\|_X^q \,\frac{{\rm d} t}{t}\right)^{\frac{1}{q}}.$$ We show that for $\underline{\mathrm{any}}$ Banach space $X$, $1 \leq p < \infty$ and $1 < q < \infty$ and $f\in C_c(\mathbb R^d)\otimes X$, there hold \begin{align*} p^{-\frac{1}{q}}\| S_{q,{\sqrt{\Delta}}}(f) \|_p \lesssim_{d, \gamma, \beta} \| S_{q,L}(f) \|_p \lesssim_{d, \gamma, \beta} p^{\frac{1}{q}}\| S_{q,{\sqrt{\Delta}}}(f) \|_p, \end{align*} \begin{align*} p^{-\frac{1}{q}}\| S_{q,L}(f) \|_p \lesssim_{d, \gamma, \beta} \| G_{q,L}(f) \|_p \lesssim_{d, \gamma, \beta} p^{\frac{1}{q}}\| S_{q,L}(f) \|_p, \end{align*} where $\Delta$ is the standard Laplacian; moreover all the orders appeared above are {\it optimal} as $p\rightarrow1$. This, combined with the existing results in [29, 33], allows us to resolve partially Problem 1.8, Problem A.1 and Conjecture A.4 regarding the optimal Lusin type constant and the characterization of martingale type in a recent remarkable work due to Xu [48]. Several difficulties originate from the arbitrariness of $X$, which excludes the use of vector-valued Calder\'on-Zygmund theory. To surmount the obstacles, we introduce the novel vector-valued Hardy and BMO spaces associated with sectorial operators; in addition to Mei's duality techniques and Wilson's intrinsic square functions developed in this setting, the key new input is the vector-valued tent space theory and its unexpected amalgamation with these `old' techniques.

Bounding box regression plays a crucial role in the field of object detection, and the positioning accuracy of object detection largely depends on the loss function of bounding box regression. Existing researchs improve regression performance by utilizing the geometric relationship between bounding boxes, while ignoring the impact of difficult and easy sample distribution on bounding box regression. In this article, we analyzed the impact of difficult and easy sample distribution on regression results, and then proposed Focaler-IoU, which can improve detector performance in different detection tasks by focusing on different regression samples. Finally, comparative experiments were conducted using existing advanced detectors and regression methods for different detection tasks, and the detection performance was further improved by using the method proposed in this paper.Code is available at \url{https://github.com/malagoutou/Focaler-IoU}., Comment: arXiv admin note: substantial text overlap with arXiv:2312.17663

DistServe improves the performance of large language models (LLMs) serving by disaggregating the prefill and decoding computation. Existing LLM serving systems colocate the two phases and batch the computation of prefill and decoding across all users and requests. We find that this strategy not only leads to strong prefill-decoding interferences but also couples the resource allocation and parallelism plans for both phases. LLM applications often emphasize individual latency for each phase: time to first token (TTFT) for the prefill phase and time per output token (TPOT) of each request for the decoding phase. In the presence of stringent latency requirements, existing systems have to prioritize one latency over the other, or over-provision compute resources to meet both. DistServe assigns prefill and decoding computation to different GPUs, hence eliminating prefill-decoding interferences. Given the application's TTFT and TPOT requirements, DistServe co-optimizes the resource allocation and parallelism strategy tailored for each phase. DistServe also places the two phases according to the serving cluster's bandwidth to minimize the communication caused by disaggregation. As a result, DistServe significantly improves LLM serving performance in terms of the maximum rate that can be served within both TTFT and TPOT constraints on each GPU. Our evaluations show that on various popular LLMs, applications, and latency requirements, DistServe can serve 7.4x more requests or 12.6x tighter SLO, compared to state-of-the-art systems, while staying within latency constraints for > 90% of requests., Comment: OSDI 2024

Real-time characterization of microresonator dynamics is important for many applications. In particular it is critical for near-field sensing and understanding light-matter interactions. Here, we report camera-facilitated imaging and analysis of standing wave patterns in optical ring resonators. The standing wave pattern is generated through bi-directional pumping of a microresonator and the scattered light from the microresonator is collected by a short-wave infrared (SWIR) camera. The recorded scattering patterns are wavelength dependent, and the scattered intensity exhibits a linear relation with the circulating power within the microresonator. By modulating the relative phase between the two pump waves, we can control the generated standing waves movements and characterize the resonator with the SWIR camera. The visualized standing wave enables subwavelength distance measurements of scattering targets with nanometer-level accuracy. This work opens new avenues for applications in on-chip near-field (bio-)sensing, real time characterization of photonic integrated circuits and backscattering control in telecom systems.

With the increased capabilities at the edge (e.g., mobile device) and more stringent privacy requirement, it becomes a recent trend for deep learning-enabled applications to pre-process sensitive raw data at the edge and transmit the features to the backend cloud for further processing. A typical application is to run machine learning (ML) services on facial images collected from different individuals. To prevent identity theft, conventional methods commonly rely on an adversarial game-based approach to shed the identity information from the feature. However, such methods can not defend against adaptive attacks, in which an attacker takes a countermove against a known defence strategy. We propose Crafter, a feature crafting mechanism deployed at the edge, to protect the identity information from adaptive model inversion attacks while ensuring the ML tasks are properly carried out in the cloud. The key defence strategy is to mislead the attacker to a non-private prior from which the attacker gains little about the private identity. In this case, the crafted features act like poison training samples for attackers with adaptive model updates. Experimental results indicate that Crafter successfully defends both basic and possible adaptive attacks, which can not be achieved by state-of-the-art adversarial game-based methods.

Table-based reasoning with large language models (LLMs) is a promising direction to tackle many table understanding tasks, such as table-based question answering and fact verification. Compared with generic reasoning, table-based reasoning requires the extraction of underlying semantics from both free-form questions and semi-structured tabular data. Chain-of-Thought and its similar approaches incorporate the reasoning chain in the form of textual context, but it is still an open question how to effectively leverage tabular data in the reasoning chain. We propose the Chain-of-Table framework, where tabular data is explicitly used in the reasoning chain as a proxy for intermediate thoughts. Specifically, we guide LLMs using in-context learning to iteratively generate operations and update the table to represent a tabular reasoning chain. LLMs can therefore dynamically plan the next operation based on the results of the previous ones. This continuous evolution of the table forms a chain, showing the reasoning process for a given tabular problem. The chain carries structured information of the intermediate results, enabling more accurate and reliable predictions. Chain-of-Table achieves new state-of-the-art performance on WikiTQ, FeTaQA, and TabFact benchmarks across multiple LLM choices., Comment: Accepted to ICLR 2024

Video Captioning (VC) is a challenging multi-modal task since it requires describing the scene in language by understanding various and complex videos. For machines, the traditional VC follows the "imaging-compression-decoding-and-then-captioning" pipeline, where compression is pivot for storage and transmission. However, in such a pipeline, some potential shortcomings are inevitable, i.e., information redundancy resulting in low efficiency and information loss during the sampling process for captioning. To address these problems, in this paper, we propose a novel VC pipeline to generate captions directly from the compressed measurement, which can be captured by a snapshot compressive sensing camera and we dub our model SnapCap. To be more specific, benefiting from the signal simulation, we have access to obtain abundant measurement-video-annotation data pairs for our model. Besides, to better extract language-related visual representations from the compressed measurement, we propose to distill the knowledge from videos via a pre-trained CLIP with plentiful language-vision associations to guide the learning of our SnapCap. To demonstrate the effectiveness of SnapCap, we conduct experiments on two widely-used VC datasets. Both the qualitative and quantitative results verify the superiority of our pipeline over conventional VC pipelines. In particular, compared to the "caption-after-reconstruction" methods, our SnapCap can run at least 3$\times$ faster, and achieve better caption results., Comment: Preprint; Under Review

Large language models are known for encoding a vast amount of factual knowledge, but they often becomes outdated due to the ever-changing nature of external information. A promising solution to this challenge is the utilization of model editing methods to update the knowledge in an efficient manner. However, the majority of existing model editing techniques are limited to monolingual frameworks, thus failing to address the crucial issue of cross-lingual knowledge synchronization for multilingual models. To tackle this problem, we propose a simple yet effective method that trains multilingual patch neuron to store cross-lingual knowledge. It can be easily adapted to existing approaches to enhance their cross-lingual editing capabilities. To evaluate our method, we conduct experiments using both the XNLI dataset and a self-constructed XFEVER dataset. Experimental results demonstrate that our proposed method achieves improved performance in cross-lingual editing tasks without requiring excessive modifications to the original methodology, thereby showcasing its user-friendly characteristics. Codes will be released soon., Comment: Work in progress

The success of the GAN-NeRF structure has enabled face editing on NeRF to maintain 3D view consistency. However, achieving simultaneously multi-view consistency and temporal coherence while editing video sequences remains a formidable challenge. This paper proposes a novel face video editing architecture built upon the dynamic face GAN-NeRF structure, which effectively utilizes video sequences to restore the latent code and 3D face geometry. By editing the latent code, multi-view consistent editing on the face can be ensured, as validated by multiview stereo reconstruction on the resulting edited images in our dynamic NeRF. As the estimation of face geometries occurs on a frame-by-frame basis, this may introduce a jittering issue. We propose a stabilizer that maintains temporal coherence by preserving smooth changes of face expressions in consecutive frames. Quantitative and qualitative analyses reveal that our method, as the pioneering 4D face video editor, achieves state-of-the-art performance in comparison to existing 2D or 3D-based approaches independently addressing identity and motion. Codes will be released., Comment: Our code will be available at: https://github.com/ZHANG1023/FED-NeRF

We present enhanced sensing of radio frequency (RF) electric fields (E-fields) by the combined polarizability of Rydberg atoms and the optimized local oscillator (LO) fields of supergheterodyne receiving. Our modified theoretical model reveals the dependencies of sensitivity of E-field amplitude measurement on the polarizability of Rydberg states and the strength of the LO RF field. The enhanced sensitivity of megahertz(MHz) E-field are demonstrated at an optimal LO field for three different Rydberg states $\rm 43D_{5/2}$, $\rm 60S_{1/2}$, and $\rm 90S_{1/2}$. The sensitivity of 63 MHz for the $\rm 90S_{1/2}$ state reaches 0.96 $\mu \rm V/cm/\sqrt{Hz}$ that is about an order of magnitude higher than those already published. This result closely approaches the theoretical sensitivity limit of RF dipole antennas, and indicates the potential for breaking the limit in measuring sub-MHz E-fields. This atomic sensor based on Rydberg Stark effect with heterodyne technique is expected to boost an alternative solution to electric dipole antennas.

Microwave electric field sensing is of importance for a wide range of applications in areas of remote sensing, radar astronomy and communications. Over the past decade, Rydberg atoms, owing to their exaggerated response to microwave electric fields, plentiful optional energy levels and integratable preparation methods, have been used in ultra-sensitive, wide broadband, traceable, stealthy microwave electric field sensing. This review first introduces the basic concept of quantum sensing, properties of Rydberg atoms and principles of quantum sensing of microwave electric fields with Rydberg atoms. Then an overview of this very active research direction is gradually expanded, covering progresses of sensitivity and bandwidth in Rydberg atoms based icrowavesensing,uperheterodyne quantum sensing with microwave-dressed Rydberg atoms, quantum-enhanced sensing of microwave electric field, recent advanced quantum measurement systems and approaches to further improve the performance of microwave electric field sensing. Finally, a brief outlook on future development directions is discussed.

As an important component of the detector localization branch, bounding box regression loss plays a significant role in object detection tasks. The existing bounding box regression methods usually consider the geometric relationship between the GT box and the predicted box, and calculate the loss by using the relative position and shape of the bounding boxes, while ignoring the influence of inherent properties such as the shape and scale of the bounding boxes on bounding box regression. In order to make up for the shortcomings of existing research, this article proposes a bounding box regression method that focuses on the shape and scale of the bounding box itself. Firstly, we analyzed the regression characteristics of the bounding boxes and found that the shape and scale factors of the bounding boxes themselves will have an impact on the regression results. Based on the above conclusions, we propose the Shape IoU method, which can calculate the loss by focusing on the shape and scale of the bounding box itself, thereby making the bounding box regression more accurate. Finally, we validated our method through a large number of comparative experiments, which showed that our method can effectively improve detection performance and outperform existing methods, achieving state-of-the-art performance in different detection tasks.Code is available at https://github.com/malagoutou/Shape-IoU

Multi-modal Magnetic Resonance Imaging (MRI) offers complementary diagnostic information, but some modalities are limited by the long scanning time. To accelerate the whole acquisition process, MRI reconstruction of one modality from highly undersampled k-space data with another fully-sampled reference modality is an efficient solution. However, the misalignment between modalities, which is common in clinic practice, can negatively affect reconstruction quality. Existing deep learning-based methods that account for inter-modality misalignment perform better, but still share two main common limitations: (1) The spatial alignment task is not adaptively integrated with the reconstruction process, resulting in insufficient complementarity between the two tasks; (2) the entire framework has weak interpretability. In this paper, we construct a novel Deep Unfolding Network with Spatial Alignment, termed DUN-SA, to appropriately embed the spatial alignment task into the reconstruction process. Concretely, we derive a novel joint alignment-reconstruction model with a specially designed cross-modal spatial alignment term. By relaxing the model into cross-modal spatial alignment and multi-modal reconstruction tasks, we propose an effective algorithm to solve this model alternatively. Then, we unfold the iterative steps of the proposed algorithm and design corresponding network modules to build DUN-SA with interpretability. Through end-to-end training, we effectively compensate for spatial misalignment using only reconstruction loss, and utilize the progressively aligned reference modality to provide inter-modality prior to improve the reconstruction of the target modality. Comprehensive experiments on three real datasets demonstrate that our method exhibits superior reconstruction performance compared to state-of-the-art methods.

Generating user-friendly explanations regarding why an item is recommended has become increasingly common, largely due to advances in language generation technology, which can enhance user trust and facilitate more informed decision-making when using online services. However, existing explainable recommendation systems focus on using small-size language models. It remains uncertain what impact replacing the explanation generator with the recently emerging large language models (LLMs) would have. Can we expect unprecedented results? In this study, we propose LLMXRec, a simple yet effective two-stage explainable recommendation framework aimed at further boosting the explanation quality by employing LLMs. Unlike most existing LLM-based recommendation works, a key characteristic of LLMXRec is its emphasis on the close collaboration between previous recommender models and LLM-based explanation generators. Specifically, by adopting several key fine-tuning techniques, including parameter-efficient instructing tuning and personalized prompt techniques, controllable and fluent explanations can be well generated to achieve the goal of explanation recommendation. Most notably, we provide three different perspectives to evaluate the effectiveness of the explanations. Finally, we conduct extensive experiments over several benchmark recommender models and publicly available datasets. The experimental results not only yield positive results in terms of effectiveness and efficiency but also uncover some previously unknown outcomes. To facilitate further explorations in this area, the full code and detailed original results are open-sourced at https://github.com/GodFire66666/LLM_rec_explanation/.

We demonstrate Kerr soliton frequency comb generation that is seeded by a cascaded Brillouin scattering process. In this process, a pump laser is used to generate multiple orders of Brillouin sidebands in a microresonator, which in turn generate the soliton. In such a process, even orders of Brillouin scattering sidebands are co-propagating with respect to the pump laser while odd orders of Brillouin scattering are backwards propagating. In this work we present the generation of forward propagating Kerr solitons via a forward propagating second order Brillouin scattering process in a fused silica rod resonator. Importantly, we show that the Brillouin scattering process can bridge the gap between different microresonator mode families, such that the repetition rate of the Kerr soliton is independent from the Brillouin gain frequency shift (about 10 GHz in fused silica). In our work we demonstrate this by generating soliton pulse trains with a repetition rate of 107 GHz. Our work opens up a new way for using cascaded Brillouin lasing as a seed for microresonator frequency comb generation. This can be of particular interest for the realization of soliton frequency combs with low noise properties from Brillouin lasing while still having arbitrary repetition rates that are determined by the resonator size. Applications range from optical communication to LIDAR systems and photonic signal generation., Comment: 4 pages, 4 figures

Language agents have shown impressive problem-solving skills within defined settings and brief timelines. Yet, with the ever-evolving complexities of open-world simulations, there's a pressing need for agents that can flexibly adapt to complex environments and consistently maintain a long-term memory to ensure coherent actions. To bridge the gap between language agents and open-world games, we introduce Language Agent for Role-Playing (LARP), which includes a cognitive architecture that encompasses memory processing and a decision-making assistant, an environment interaction module with a feedback-driven learnable action space, and a postprocessing method that promotes the alignment of various personalities. The LARP framework refines interactions between users and agents, predefined with unique backgrounds and personalities, ultimately enhancing the gaming experience in open-world contexts. Furthermore, it highlights the diverse uses of language models in a range of areas such as entertainment, education, and various simulation scenarios. The project page is released at https://miao-ai-lab.github.io/LARP/., Comment: 12 pages, 4 figures

De novo drug design is a pivotal issue in pharmacology and a new area of focus in AI for science research. A central challenge in this field is to generate molecules with specific properties while also producing a wide range of diverse candidates. Although advanced technologies such as transformer models and reinforcement learning have been applied in drug design, their potential has not been fully realized. Therefore, we propose MolRL-MGPT, a reinforcement learning algorithm with multiple GPT agents for drug molecular generation. To promote molecular diversity, we encourage the agents to collaborate in searching for desirable molecules in diverse directions. Our algorithm has shown promising results on the GuacaMol benchmark and exhibits efficacy in designing inhibitors against SARS-CoV-2 protein targets. The codes are available at: https://github.com/HXYfighter/MolRL-MGPT., Comment: Accepted by NeurIPS 2023

Parametrically driven nonlinear resonators represent a building block for realizing fault-tolerant quantum computation and are useful for critical quantum sensing. From a fundamental viewpoint, the most intriguing feature of such a system is perhaps the critical phenomena, which can occur without interaction with any other quantum system. The non-analytic behaviors of its eigenspectrum have been substantially investigated, but those associated with the ground state wavefunction have largely remained unexplored. Using the quantum ground state geometric tensor as an indicator, we comprehensively establish a phase diagram involving the driving parameter $\varepsilon$ and phase $\phi$. The results reveal that with the increase in $\varepsilon$, the system undergoes a quantum phase transition from the normal to the superradiant phase, with the critical point unaffected by $\phi$. Furthermore, the critical exponent and scaling dimension are obtained by an exact numerical method, which is consistent with previous works. Our numerical results show that the phase transition falls within the universality class of the quantum Rabi model. This work reveals that the quantum metric and Berry curvature display diverging behaviors across the quantum phase transition., Comment: Any comments or suggestions are welcome !

Language-enabled robots have been widely studied over the past years to enable natural human-robot interaction and teaming in various real-world applications. Language-enabled robots must be able to comprehend referring expressions to identify a particular object from visual perception using a set of referring attributes extracted from natural language. However, visual observations of an object may not be available when it is referred to, and the number of objects and attributes may also be unbounded in open worlds. To address the challenges, we implement an attribute-based compositional zero-shot learning method that uses a list of attributes to perform referring expression comprehension in open worlds. We evaluate the approach on two datasets including the MIT-States and the Clothing 16K. The preliminary experimental results show that our implemented approach allows a robot to correctly identify the objects referred to by human commands., Comment: Equal contribution from the first two authors

We study the conditional upper bounds and extreme values of derivatives of the Riemann zeta function and Dirichlet $L$-functions near the 1-line. Let $\ell$ be a fixed natural number. We show that, if $|\sigma-1|\ll1/\log_2t$, then $|\zeta^{(\ell)}(\sigma+ it)|$ has the same maximal order (up to the leading coefficients) as $|\zeta^{(\ell)}(1+ it)|$ when $t\to\infty$. The range $1-\sigma\ll1/\log_2t$ is wide enough, since we also show that $(1-\sigma) \log_2t \to \infty\; (t \to \infty)$ implies $\limsup_{t\to\infty}|\zeta^{(\ell)}(\sigma+ it)| / (\log_2t)^{\ell+1} = \infty$. Similar results can be obtained for Dirichlet $L$-functions $L^{(\ell)}(\sigma,\chi)$ with $\chi\pmod q$., Comment: 18 pages

Classification and probability estimation have broad applications in modern machine learning and data science applications, including biology, medicine, engineering, and computer science. The recent development of a class of weighted Support Vector Machines (wSVMs) has shown great values in robustly predicting the class probability and classification for various problems with high accuracy. The current framework is based on the $\ell^2$-norm regularized binary wSVMs optimization problem, which only works with dense features and has poor performance at sparse features with redundant noise in most real applications. The sparse learning process requires a prescreen of the important variables for each binary wSVMs for accurately estimating pairwise conditional probability. In this paper, we proposed novel wSVMs frameworks that incorporate automatic variable selection with accurate probability estimation for sparse learning problems. We developed efficient algorithms for effective variable selection for solving either the $\ell^1$-norm or elastic net regularized binary wSVMs optimization problems. The binary class probability is then estimated either by the $\ell^2$-norm regularized wSVMs framework with selected variables or by elastic net regularized wSVMs directly. The two-step approach of $\ell^1$-norm followed by $\ell^2$-norm wSVMs show a great advantage in both automatic variable selection and reliable probability estimators with the most efficient time. The elastic net regularized wSVMs offer the best performance in terms of variable selection and probability estimation with the additional advantage of variable grouping in the compensation of more computation time for high dimensional problems. The proposed wSVMs-based sparse learning methods have wide applications and can be further extended to $K$-class problems through ensemble learning.

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size., Comment: Submission to SciPost. 27 pages, 6 figures. Typos corrected, added additional minor comments to derivations