Search

Designing effective prompts can empower LLMs to understand user preferences and provide recommendations by leveraging LLMs' intent comprehension and knowledge utilization capabilities. However, existing research predominantly concentrates on task-wise prompting, developing fixed prompt templates composed of four patterns (i.e., role-playing, history records, reasoning guidance, and output format) and applying them to all users for a given task. Although convenient, task-wise prompting overlooks individual user differences, leading to potential mismatches in capturing user preferences. To address it, we introduce the concept of instance-wise prompting to personalize discrete prompts for individual users and propose Reinforced Prompt Personalization (RPP) to optimize the four patterns in prompts using multi-agent reinforcement learning (MARL). To boost efficiency, RPP formulates prompt personalization as selecting optimal sentences holistically across the four patterns, rather than optimizing word-by-word. To ensure the quality of prompts, RPP meticulously crafts diverse expressions for each of the four patterns, considering multiple analytical perspectives for specific recommendation tasks. In addition to RPP, our proposal of RPP+ aims to enhance the scalability of action space by dynamically refining actions with LLMs throughout the iterative process. We evaluate the effectiveness of RPP/RPP+ in ranking tasks over various datasets. Experimental results demonstrate the superiority of RPP/RPP+ over traditional recommender models, few-shot methods, and other prompt-based methods, underscoring the significance of instance-wise prompting for LLMs in recommendation tasks and validating the effectiveness of RPP/RPP+. Our code is available at https://github.com/maowenyu-11/RPP.

This paper proposes a joint active and passive beamforming design for reconfigurable intelligent surface (RIS)-aided wireless communication systems, adopting a piece-wise near-field channel model. While a traditional near-field channel model, applied without any approximations, offers higher modeling accuracy than a far-field model, it renders the system design more sensitive to channel estimation errors (CEEs). As a remedy, we propose to adopt a piece-wise near-field channel model that leverages the advantages of the near-field approach while enhancing its robustness against CEEs. Our study analyzes the impact of different channel models, including the traditional near-field, the proposed piece-wise near-field and far-field channel models, on the interference distribution caused by CEEs and model mismatches. Subsequently, by treating the interference as noise, we formulate a joint active and passive beamforming design problem to maximize the spectral efficiency (SE). The formulated problem is then recast as a mean squared error (MSE) minimization problem and a suboptimal algorithm is developed to iteratively update the active and passive beamforming strategies. Simulation results demonstrate that adopting the piece-wise near-field channel model leads to an improved SE compared to both the near-field and far-field models in the presence of CEEs. Furthermore, the proposed piece-wise near-field model achieves a good trade-off between modeling accuracy and system's degrees of freedom (DoF)., Comment: 28pages

Large model training has been using recomputation to alleviate the memory pressure and pipelining to exploit the parallelism of data, tensor, and devices. The existing recomputation approaches may incur up to 40% overhead when training real-world models, e.g., the GPT model with 22B parameters. This is because they are executed on demand in the critical training path. In this paper, we design a new recomputation framework, Lynx, to reduce the overhead by overlapping the recomputation with communication occurring in training pipelines. It consists of an optimal scheduling algorithm (OPT) and a heuristic-based scheduling algorithm (HEU). OPT achieves a global optimum but suffers from a long search time. HEU was designed based on our observation that there are identical structures in large DNN models so that we can apply the same scheduling policy to all identical structures. HEU achieves a local optimum but reduces the search time by 99% compared to OPT. Our comprehensive evaluation using GPT models with 1.3B-20B parameters shows that both OPT and HEU outperform the state-of-the-art recomputation approaches (e.g., Megatron-LM and Checkmake) by 1.02-1.53x. HEU achieves a similar performance as OPT with a search time of 0.16s on average., Comment: 13 pages

We experimentally study the transient dynamics of a dissipative superconducting qubit under periodic drive towards its nonequilibrium steady states. The corresponding stroboscopic evolution, given by the qubit states at times equal to integer multiples of the drive period, is determined by a (generically non-Hermitian) Floquet Liouvillian. The drive period controls both the transients across its non-Hermitian degeneracies and the resulting nonequilibrium steady states. These steady states can exhibit higher purity compared to those achieved with a constant drive. We further study the dependence of the steady states on the direction of parameter variation and relate these findings to the recent studies of dynamically encircling exceptional points. Our work provides a new approach to control non-Hermiticity in dissipative quantum systems and presents a new paradigm in quantum state preparation and stabilization., Comment: 9 pages, 8 figures

Chiral state transfer along closed loops in the vicinity of an exceptional point is one of the many counter-intuitive observations in non-Hermitian physics. The application of this property beyond proof-of-principle, specifically in quantum physics, is an open question. In this work, we demonstrate chiral state conversion between singlet and triplet Bell states through fully-quantum Liouvillian dynamics. Crucially, we demonstrate that this property can be used for the chiral production of Bell states from separable states with a high fidelity and for a large range of parameters. Additionally, we show that the removal of quantum jumps from the dynamics through postselection can result in near-perfect Bell states from initially separable states. Our work paves the way to a novel type of quantum control and a potential application of non-Hermitian physics in quantum information processing., Comment: 5+4 pages, 5 figures

Thermodynamics constrains changes to the energy of a system, both deliberate and random, via its first and second laws. When the system is not in equilibrium, fluctuation theorems such as the Jarzynski equality further restrict the distributions of deliberate work done. Such fluctuation theorems have been experimentally verified in small, non-equilibrium quantum systems undergoing unitary or decohering dynamics. Yet, their validity in systems governed by a non-Hermitian Hamiltonian has long been contentious, due to the false premise of the Hamiltonian's dual and equivalent roles in dynamics and energetics. Here we show that work fluctuations in a non-Hermitian qubit obey the Jarzynski equality even if its Hamiltonian has complex or purely imaginary eigenvalues. With post-selection on a dissipative superconducting circuit undergoing a cyclic parameter sweep, we experimentally quantify the work distribution using projective energy measurements and show that the fate of the Jarzynski equality is determined by the parity-time symmetry of, and the energetics that result from, the corresponding non-Hermitian, Floquet Hamiltonian. By distinguishing the energetics from non-Hermitian dynamics, our results provide the recipe for investigating the non-equilibrium quantum thermodynamics of such open systems., Comment: 7 pages, 5 figures

A coupled two-mode system with balanced gain and loss is a paradigmatic example of an open quantum system that can exhibit real spectra despite being described by a non-Hermitian Hamiltonian. We utilize a degenerate parametric amplifier operating in three-wave mixing mode to realize such a system of balanced gain and loss between the two quadrature modes of the amplifier. By examining the time-domain response of the amplifier, we observe a characteristic transition from real-to-imaginary energy eigenvalues associated with the Parity-Time-symmetry-breaking transition., Comment: 6 pages, 4 figures

Entanglement is a key resource for quantum information technologies ranging from quantum sensing to quantum computing. Conventionally, the entanglement between two coupled qubits is established at the time scale of the inverse of the coupling strength. In this work, we study two weakly coupled non-Hermitian qubits and observe entanglement generation at a significantly shorter time scale by proximity to a higher-order exceptional point. We establish a non-Hermitian perturbation theory based on constructing a biorthogonal complete basis and further identify the optimal condition to obtain the maximally entangled state. Our study of speeding up entanglement generation in non-Hermitian quantum systems opens new avenues for harnessing coherent nonunitary dissipation for quantum technologies., Comment: 6+18 pages, 4+12 figures. Zeng-Zhao Li and Weijian Chen contributed equally to this work

Knowledge Graphs (KGs) are becoming increasingly essential infrastructures in many applications while suffering from incompleteness issues. The KG completion task (KGC) automatically predicts missing facts based on an incomplete KG. However, existing methods perform unsatisfactorily in real-world scenarios. On the one hand, their performance will dramatically degrade along with the increasing sparsity of KGs. On the other hand, the inference procedure for prediction is an untrustworthy black box. This paper proposes a novel explainable model for sparse KGC, compositing high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability while maintaining the model's effectiveness and efficiency. There are two main components that are seamlessly integrated for joint optimization. First, the high-order reasoning component learns high-quality relation representations by capturing endogenous correlation among relations. This can reflect logical rules to justify a broader of missing facts. Second, the entity updating component leverages a weight-free Graph Convolutional Network (GCN) to efficiently model KG structures with interpretability. Unlike conventional methods, we conduct entity aggregation and design composition-based attention in the relational space without additional parameters. The lightweight design makes HoGRN better suitable for sparse settings. For evaluation, we have conducted extensive experiments-the results of HoGRN on several sparse KGs present impressive improvements (9% MRR gain on average). Further ablation and case studies demonstrate the effectiveness of the main components. Our codes will be released upon acceptance., Comment: The manuscript under review

Harnessing parity-time (PT) symmetry with balanced gain and loss profiles has created a variety of opportunities in electronics from wireless energy transfer to telemetry sensing and topological defect engineering. However, existing implementations often employ ad-hoc approaches at low operating frequencies and are unable to accommodate large-scale integration. Here, we report a fully integrated realization of PT-symmetry in a standard complementary metal-oxide-semiconductor technology. Our work demonstrates salient PT-symmetry features such as phase transition as well as the ability to manipulate broadband microwave generation and propagation beyond the limitations encountered by exiting schemes. The system shows 2.1 times bandwidth and 30 percentage noise reduction compared to conventional microwave generation in oscillatory mode and displays large non-reciprocal microwave transport from 2.75 to 3.10 gigahertz in non-oscillatory mode due to enhanced nonlinearities. This approach could enrich integrated circuit (IC) design methodology beyond well-established performance limits and enable the use of scalable IC technology to study topological effects in high-dimensional non-Hermitian systems., Comment: 52 pages (16 pages Main Text, 28 pages Supplementary Materials, 4 pages reference), 27 figures (4 figures Main Text, 23 figures Supplementary Materials), 93 references (50 references Main Text, 43 references Supplementary Materials)

Open quantum systems interacting with an environment exhibit dynamics described by the combination of dissipation and coherent Hamiltonian evolution. Taken together, these effects are captured by a Liouvillian superoperator. The degeneracies of the (generically non-Hermitian) Liouvillian are exceptional points, which are associated with critical dynamics as the system approaches steady state. We use a superconducting transmon circuit coupled to an engineered environment to observe two different types of Liouvillian exceptional points that arise either from the interplay of energy loss and decoherence or purely due to decoherence. By dynamically tuning the Liouvillian superoperators in real time we observe a non-Hermiticity-induced chiral state transfer. Our study motivates a new look at open quantum system dynamics from the vantage of Liouvillian exceptional points, enabling applications of non-Hermitian dynamics in the understanding and control of open quantum systems., Comment: 11 pages, 10 figures

We study the quantum evolution of a non-Hermitian qubit realized as a submanifold of a dissipative superconducting transmon circuit. Real-time tuning of the system parameters to encircle an exceptional point results in non-reciprocal quantum state transfer. We further observe chiral geometric phases accumulated under state transport, verifying the quantum coherent nature of the evolution in the complex energy landscape and distinguishing between coherent and incoherent effects associated with exceptional point encircling. Our work demonstrates an entirely new method for control over quantum state vectors, highlighting new facets of quantum bath engineering enabled through dynamical non-Hermitian control., Comment: 9 pages, 8 figures

We study the dynamics of a driven non-Hermitian superconducting qubit which is perturbed by quantum jumps between energy levels, a purely quantum effect with no classical correspondence. The quantum jumps mix the qubit states leading to decoherence. We observe that this decoherence rate is enhanced near the exceptional point, owing to the cube-root topology of the non-Hermitian eigenenergies. Together with the effect of non-Hermitian gain/loss, quantum jumps can also lead to a breakdown of adiabatic evolution under the slow-driving limit. Our study shows the critical role of quantum jumps in generalizing the applications of classical non-Hermitian systems to open quantum systems for sensing and control., Comment: 12 pages, 10 figures

Graph classification is a highly impactful task that plays a crucial role in a myriad of real-world applications such as molecular property prediction and protein function prediction.Aiming to handle the new classes with limited labeled graphs, few-shot graph classification has become a bridge of existing graph classification solutions and practical usage.This work explores the potential of metric-based meta-learning for solving few-shot graph classification.We highlight the importance of considering structural characteristics in the solution and propose a novel framework which explicitly considers global structure and local structure of the input graph. An implementation upon GIN, named SMF-GIN, is tested on two datasets, Chembl and TRIANGLES, where extensive experiments validate the effectiveness of the proposed method. The Chembl is constructed to fill in the gap of lacking large-scale benchmark for few-shot graph classification evaluation, which is released together with the implementation of SMF-GIN at: https://github.com/jiangshunyu/SMF-GIN., Comment: AI Open Journal Volume 2, 2021, Pages 160-167

Recent studies on Graph Convolutional Networks (GCNs) reveal that the initial node representations (i.e., the node representations before the first-time graph convolution) largely affect the final model performance. However, when learning the initial representation for a node, most existing work linearly combines the embeddings of node features, without considering the interactions among the features (or feature embeddings). We argue that when the node features are categorical, e.g., in many real-world applications like user profiling and recommender system, feature interactions usually carry important signals for predictive analytics. Ignoring them will result in suboptimal initial node representation and thus weaken the effectiveness of the follow-up graph convolution. In this paper, we propose a new GCN model named CatGCN, which is tailored for graph learning when the node features are categorical. Specifically, we integrate two ways of explicit interaction modeling into the learning of initial node representation, i.e., local interaction modeling on each pair of node features and global interaction modeling on an artificial feature graph. We then refine the enhanced initial node representations with the neighborhood aggregation-based graph convolution. We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification. Extensive experiments on three tasks of user profiling (the prediction of user age, city, and purchase level) from Tencent and Alibaba datasets validate the effectiveness of CatGCN, especially the positive effect of performing feature interaction modeling before graph convolution., Comment: Accepted by TKDE as a regular paper

The latest advance in recommendation shows that better user and item representations can be learned via performing graph convolutions on the user-item interaction graph. However, such finding is mostly restricted to the collaborative filtering (CF) scenario, where the interaction contexts are not available. In this work, we extend the advantages of graph convolutions to context-aware recommender system (CARS, which represents a generic type of models that can handle various side information). We propose \textit{Graph Convolution Machine} (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution (GC) layers, and a decoder. The encoder projects users, items, and contexts into embedding vectors, which are passed to the GC layers that refine user and item embeddings with context-aware graph convolutions on user-item graph. The decoder digests the refined embeddings to output the prediction score by considering the interactions among user, item, and context embeddings. We conduct experiments on three real-world datasets from Yelp and Amazon, validating the effectiveness of GCM and the benefits of performing graph convolutions for CARS. Our implementations are available at \url{https://github.com/wujcan/GCM}., Comment: 19 pages, 4 figures, 4 tables. Accepted by Frontiers of Computer Science