arXiv subjects

Jie Liu

Publications and source records attributed to Jie Liu.

At least 289 records · Page 16Linked to original sources

arXiv2025

Multifunctional Nonreciprocal Quantum Device Based on Superconducting Quantum Circuit

Nonreciprocal devices, such as isolator or circulator, are crucial for information routing and processing in quantum networks. Traditional nonreciprocal devices, which rely on the application of bias magnetic fields to break time-reversal symmetry and Lorentz reciprocity, tend to be bulky and require strong static magnetic fields. This makes them challenging to implement in highly integrated large-scale quantum networks. Therefore, we design a multifunctional nonreciprocal quantum device based on the integration and tunable interaction of superconducting quantum circuit. This device can switch between two-port isolator, three-port symmetric circulator, and antisymmetric circulator under the control of external magnetic flux. Furthermore, both isolator and circulator can achieve nearly perfect unidirectional signal transmission. We believe that this scalable and integrable nonreciprocal device could provide new insight for the development of large-scale quantum networks.

quant-ph↗

arXiv2025

AutoLUT: LUT-Based Image Super-Resolution with Automatic Sampling and Adaptive Residual Learning

In recent years, the increasing popularity of Hi-DPI screens has driven a rising demand for high-resolution images. However, the limited computational power of edge devices poses a challenge in deploying complex super-resolution neural networks, highlighting the need for efficient methods. While prior works have made significant progress, they have not fully exploited pixel-level information. Moreover, their reliance on fixed sampling patterns limits both accuracy and the ability to capture fine details in low-resolution images. To address these challenges, we introduce two plug-and-play modules designed to capture and leverage pixel information effectively in Look-Up Table (LUT) based super-resolution networks. Our method introduces Automatic Sampling (AutoSample), a flexible LUT sampling approach where sampling weights are automatically learned during training to adapt to pixel variations and expand the receptive field without added inference cost. We also incorporate Adaptive Residual Learning (AdaRL) to enhance inter-layer connections, enabling detailed information flow and improving the network's ability to reconstruct fine details. Our method achieves significant performance improvements on both MuLUT and SPF-LUT while maintaining similar storage sizes. Specifically, for MuLUT, we achieve a PSNR improvement of approximately +0.20 dB improvement on average across five datasets. For SPF-LUT, with more than a 50% reduction in storage space and about a 2/3 reduction in inference time, our method still maintains performance comparable to the original. The code is available at https://github.com/SuperKenVery/AutoLUT.

cs.CV↗

arXiv2025

Q-PART: Quasi-Periodic Adaptive Regression with Test-time Training for Pediatric Left Ventricular Ejection Fraction Regression

In this work, we address the challenge of adaptive pediatric Left Ventricular Ejection Fraction (LVEF) assessment. While Test-time Training (TTT) approaches show promise for this task, they suffer from two significant limitations. Existing TTT works are primarily designed for classification tasks rather than continuous value regression, and they lack mechanisms to handle the quasi-periodic nature of cardiac signals. To tackle these issues, we propose a novel \textbf{Q}uasi-\textbf{P}eriodic \textbf{A}daptive \textbf{R}egression with \textbf{T}est-time Training (Q-PART) framework. In the training stage, the proposed Quasi-Period Network decomposes the echocardiogram into periodic and aperiodic components within latent space by combining parameterized helix trajectories with Neural Controlled Differential Equations. During inference, our framework further employs a variance minimization strategy across image augmentations that simulate common quality issues in echocardiogram acquisition, along with differential adaptation rates for periodic and aperiodic components. Theoretical analysis is provided to demonstrate that our variance minimization objective effectively bounds the regression error under mild conditions. Furthermore, extensive experiments across three pediatric age groups demonstrate that Q-PART not only significantly outperforms existing approaches in pediatric LVEF prediction, but also exhibits strong clinical screening capability with high mAUROC scores (up to 0.9747) and maintains gender-fair performance across all metrics, validating its robustness and practical utility in pediatric echocardiography analysis.

cs.CV↗

arXiv2025

E4: Energy-Efficient DNN Inference for Edge Video Analytics Via Early-Exit and DVFS

Deep neural network (DNN) models are increasingly popular in edge video analytic applications. However, the compute-intensive nature of DNN models pose challenges for energy-efficient inference on resource-constrained edge devices. Most existing solutions focus on optimizing DNN inference latency and accuracy, often overlooking energy efficiency. They also fail to account for the varying complexity of video frames, leading to sub-optimal performance in edge video analytics. In this paper, we propose an Energy-Efficient Early-Exit (E4) framework that enhances DNN inference efficiency for edge video analytics by integrating a novel early-exit mechanism with dynamic voltage and frequency scaling (DVFS) governors. It employs an attention-based cascade module to analyze video frame diversity and automatically determine optimal DNN exit points. Additionally, E4 features a just-in-time (JIT) profiler that uses coordinate descent search to co-optimize CPU and GPU clock frequencies for each layer before the DNN exit points. Extensive evaluations demonstrate that E4 outperforms current state-of-the-art methods, achieving up to 2.8x speedup and 26% average energy saving while maintaining high accuracy.

cs.CV↗

arXiv2025

CaPo: Cooperative Plan Optimization for Efficient Embodied Multi-Agent Cooperation

In this work, we address the cooperation problem among large language model (LLM) based embodied agents, where agents must cooperate to achieve a common goal. Previous methods often execute actions extemporaneously and incoherently, without long-term strategic and cooperative planning, leading to redundant steps, failures, and even serious repercussions in complex tasks like search-and-rescue missions where discussion and cooperative plan are crucial. To solve this issue, we propose Cooperative Plan Optimization (CaPo) to enhance the cooperation efficiency of LLM-based embodied agents. Inspired by human cooperation schemes, CaPo improves cooperation efficiency with two phases: 1) meta-plan generation, and 2) progress-adaptive meta-plan and execution. In the first phase, all agents analyze the task, discuss, and cooperatively create a meta-plan that decomposes the task into subtasks with detailed steps, ensuring a long-term strategic and coherent plan for efficient coordination. In the second phase, agents execute tasks according to the meta-plan and dynamically adjust it based on their latest progress (e.g., discovering a target object) through multi-turn discussions. This progress-based adaptation eliminates redundant actions, improving the overall cooperation efficiency of agents. Experimental results on the ThreeDworld Multi-Agent Transport and Communicative Watch-And-Help tasks demonstrate that CaPo achieves much higher task completion rate and efficiency compared with state-of-the-arts.The code is released at https://github.com/jliu4ai/CaPo.

cs.AI↗

arXiv2025

The Rise of Darkness: Safety-Utility Trade-Offs in Role-Playing Dialogue Agents

Large Language Models (LLMs) have made remarkable advances in role-playing dialogue agents, demonstrating their utility in character simulations. However, it remains challenging for these agents to balance character portrayal utility with content safety because this essential character simulation often comes with the risk of generating unsafe content. To address this issue, we first conduct a systematic exploration of the safety-utility trade-off across multiple LLMs. Our analysis reveals that risk scenarios created by villain characters and user queries (referred to as risk coupling) contribute to this trade-off. Building on this, we propose a novel Adaptive Dynamic Multi-Preference (ADMP) method, which dynamically adjusts safety-utility preferences based on the degree of risk coupling and guides the model to generate responses biased toward utility or safety. We further introduce Coupling Margin Sampling (CMS) into coupling detection to enhance the model's ability to handle high-risk scenarios. Experimental results demonstrate that our approach improves safety metrics while maintaining utility.

cs.CL↗

arXiv2025

Determine-Then-Ensemble: Necessity of Top-k Union for Large Language Model Ensembling

Large language models (LLMs) exhibit varying strengths and weaknesses across different tasks, prompting recent studies to explore the benefits of ensembling models to leverage their complementary advantages. However, existing LLM ensembling methods often overlook model compatibility and struggle with inefficient alignment of probabilities across the entire vocabulary. In this study, we empirically investigate the factors influencing ensemble performance, identifying model performance, vocabulary size, and response style as key determinants, revealing that compatibility among models is essential for effective ensembling. This analysis leads to the development of a simple yet effective model selection strategy that identifies compatible models. Additionally, we introduce the \textsc{Uni}on \textsc{T}op-$k$ \textsc{E}nsembling (\textsc{UniTE}), a novel approach that efficiently combines models by focusing on the union of the top-k tokens from each model, thereby avoiding the need for full vocabulary alignment and reducing computational overhead. Extensive evaluations across multiple benchmarks demonstrate that \textsc{UniTE} significantly enhances performance compared to existing methods, offering a more efficient framework for LLM ensembling.

cs.CL↗

arXiv2025

Bloch Oscillation and Landau-Zener Tunneling of a Periodically Kicked Dirac Particle

We investigate the dynamics of a relativistic spin-$\frac{1}{2}$ particle governed by a one-dimensional time-periodic kicking Dirac equation. We observe distinct oscillatory behavior in the momentum space and quantum tunneling in the vicinity of zero momentum, which is found to be equivalent to the Bloch oscillations and Landau-Zener tunneling, i.e., Bloch-Landau-Zener (BLZ) dynamics in tilted bipartite lattices. Using the Floquet formalism, we derive an effective Hamiltonian that can accurately predict the oscillation period and amplitude. The tunneling probability has also been determined analytically. Our analysis extends to the influence of various parameters on dynamic behavior. We also discuss how relativistic effects and spin degrees of freedom impact quantum systems' transport properties and localization phenomena.

quant-ph↗

arXiv2025

Exploring and Evaluating Real-world CXL: Use Cases and System Adoption

Compute eXpress Link (CXL) is emerging as a promising memory interface technology. However, its performance characteristics remain largely unclear due to the limited availability of production hardware. Key questions include: What are the use cases for the CXL memory? What are the impacts of the CXL memory on application performance? How to use the CXL memory in combination with existing memory components? In this work, we study the performance of three genuine CXL memory-expansion cards from different vendors. We characterize the basic performance of the CXL memory, study how HPC applications and large language models (LLM) can benefit from the CXL memory, and study the interplay between memory tiering and page interleaving. We also propose a novel data object-level interleaving policy to match the interleaving policy with memory access patterns. Our findings reveal the challenges and opportunities of using the CXL memory.

cs.PF↗

arXiv2025

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads

KV cache is a widely used acceleration technique for large language models (LLMs) inference. However, its memory requirement grows rapidly with input length. Previous studies have reduced the size of KV cache by either removing the same number of unimportant tokens for all attention heads or by allocating differentiated KV cache budgets for pre-identified attention heads. However, due to the importance of attention heads varies across different tasks, the pre-identified attention heads fail to adapt effectively to various downstream tasks. To address this issue, we propose Task-KV, a method that leverages the semantic differentiation of attention heads to allocate differentiated KV cache budgets across various tasks. We demonstrate that attention heads far from the semantic center (called heterogeneous heads) make an significant contribution to task outputs and semantic understanding. In contrast, other attention heads play the role of aggregating important information and focusing reasoning. Task-KV allocates full KV cache budget to heterogeneous heads to preserve comprehensive semantic information, while reserving a small number of recent tokens and attention sinks for non-heterogeneous heads. Furthermore, we innovatively introduce middle activations to preserve key contextual information aggregated from non-heterogeneous heads. To dynamically perceive semantic differences among attention heads, we design a semantic separator to distinguish heterogeneous heads from non-heterogeneous ones based on their distances from the semantic center. Experimental results on multiple benchmarks and different model architectures demonstrate that Task-KV significantly outperforms existing baseline methods.

cs.CL↗

arXiv2025

The Impact of Bar-induced Non-Circular Motions on the Measurement of Galactic Rotation Curves

We study the impact of bar-induced non-circular motions on the derivation of galactic rotation curves (RCs) using hydrodynamic simulations and observational data from the PHANGS-ALMA survey. We confirm that non-circular motions induced by a bar can significantly bias RCs derived from the conventional tilted-ring method, consistent with previous findings. The shape of the derived RC depends on the position angle difference ($Δϕ$) between the major axes of the bar and the disk in the face-on plane. For $\left|Δϕ\right|\lesssim40^\circ$, non-circular motions produce a bar-induced "dip" feature (rise-drop-rise pattern) in the derived RC, which shows higher velocities near the nuclear ring and lower velocities in the bar region compared to the true RC (${\mathrm{RC_{true}}}$). We demonstrate convincingly that such dip features are very common in the PHANGS-ALMA barred galaxies sample. Hydrodynamical simulations reveal that the "dip" feature is caused by the perpendicular orientation of the gas flows in the nuclear ring and the bar; at low $\left|Δϕ\right|$ streamlines in the nuclear ring tend to enhance $V_\mathrm{los}$, while those in the bar tend to suppress $V_\mathrm{los}$. We use a simple {\misaell} model to qualitatively explain the general trend of RCs from the tilted-ring method (${\mathrm{RC_{tilted}}}$) and the discrepancy between ${\mathrm{RC_{tilted}}}$ and ${\mathrm{RC_{true}}}$. Furthermore, we propose a straightforward method to implement a first-order correction to the RC derived from the tilted-ring method. Our study is the first to systematically discuss the bar-induced "dip" feature in the RCs of barred galaxies combining both simulations and observations.

astro-ph.GA↗

arXiv2025

MeshONet: A Generalizable and Efficient Operator Learning Method for Structured Mesh Generation

Mesh generation plays a crucial role in scientific computing. Traditional mesh generation methods, such as TFI and PDE-based methods, often struggle to achieve a balance between efficiency and mesh quality. To address this challenge, physics-informed intelligent learning methods have recently emerged, significantly improving generation efficiency while maintaining high mesh quality. However, physics-informed methods fail to generalize when applied to previously unseen geometries, as even small changes in the boundary shape necessitate burdensome retraining to adapt to new geometric variations. In this paper, we introduce MeshONet, the first generalizable intelligent learning method for structured mesh generation. The method transforms the mesh generation task into an operator learning problem with multiple input and solution functions. To effectively overcome the multivariable mapping restriction of operator learning methods, we propose a dual-branch, shared-trunk architecture to approximate the mapping between function spaces based on input-output pairs. Experimental results show that MeshONet achieves a speedup of up to four orders of magnitude in generation efficiency over traditional methods. It also enables generalization to different geometries without retraining, greatly enhancing the practicality of intelligent methods.

cs.LG↗

arXiv2025

Blow-up of the one-dimensional wave equation with quadratic spatial derivative nonlinearity

We investigate the blow-up dynamics of smooth solutions to the one-dimensional wave equation with a quadratic spatial derivative nonlinearity, motivated by its applications in Effective Field Theory (EFT) in cosmology. Despite its relevance, explicit blow-up solutions for this equation have not been documented in the literature. In this work, we establish the non-existence of smooth, exact self-similar blow-up solutions and construct a five-parameter family of generalized self-similar solutions exhibiting logarithmic growth. Moreover, we prove the asymptotic stability of these blow-up solutions. Our proof tackles several significant challenges, including the non-self-adjoint nature of the linearized operator, the presence of unstable eigenvalues, and, most notably, the treatment of non-compact perturbations. By substantially advancing Donninger's spectral-theoretic framework, we develop a robust methodology that effectively handles non-compact perturbations. Key innovations include the incorporation of the Lorentz transformation in self-similar variables, an adaptation of the functional framework in [Merle-Raphael-Rodnianski-Szeftel, Invent.Math., 2022], and a novel resolvent estimate. This approach is general and robust, allowing for straightforward extensions to higher dimensions and applications to a wide range of nonlinear equations.

math.AP↗

arXiv2025

CoReQA: Uncovering Potentials of Language Models in Code Repository Question Answering

Large language models that enhance software development tasks, such as code generation, code completion, and code question answering (QA), have been extensively studied in both academia and the industry. The models are integrated into popular intelligent IDEs like JetBrains and Cursor. Current benchmarks for evaluating models' code comprehension capabilities primarily focus on code generation or completion, often neglecting QA, which is a crucial aspect of understanding code. Existing code QA benchmarks are derived from code comments with predefined patterns (e.g., CodeQA) or focus on specific domains, such as education (e.g., CS1QA). These benchmarks fail to capture the real-world complexity of software engineering and user requirements for understanding code repositories. To address this gap, we introduce CoReQA, a benchmark for Code Repository-level question answering, constructed from GitHub issues and comments from 176 popular repositories across four programming languages. Since questions and answers may include both natural language and code snippets, traditional evaluation metrics such as BLEU are inadequate for assessing repository-level QA performance. Thus, we provide an LLM-as-a-judge framework to evaluate QA performance from five aspects. Based on CoReQA, we evaluate the performance of three baselines, including two short-context models using generic retrieval strategies and one long-context model that utilizes the entire repository context. Evaluation results show that state-of-the-art proprietary and long-context models struggle to address repository-level questions effectively. Our analysis highlights the limitations of language models in assisting developers in understanding repositories and suggests future directions for improving repository comprehension systems through effective context retrieval methodologies.

cs.SE↗

arXiv2025

Entanglement transfer between giant atoms in waveguide-QED systems

We investigate the entanglement transfer between giant atoms in waveguide-QED systems. The system consists of two pairs of two-level giant atoms, $ab$ and $cd$, each independently coupled to its respective one-dimensional waveguide. Initially, entangled states are stored in atom pair $ac$. There we consider three giant atom coupling configurations: separated, braided, and nested. For comparison, the entanglement transfer for small atoms configuration is also studied here. We focus on the entanglement transfer from atom pair $ac$ to atoms pair $bd$ and atom pair $ab$ in these four coupling configurations. It is shown that the transfer of entanglement in each coupling configuration strongly depends on phase shift. In particular, the braided configuration demonstrates superior performance in entanglement transfer. For the entanglement transfer from atom pair $ac$ to atom pair $bd$, complete entanglement transfer is presented in braided configuration, a behavior not found in small atom or other giant atom configurations. For the entanglement transfer from atom pair $ac$ to atom pair $ab$, although the maximum entanglement transferred to atom pair $ab$ in the braided configuration is half of that one to atom pair $bd$, it is still higher than that in the small atom, separated, and nested configurations. This study lays the foundation for entanglement transfer between giant atoms in waveguide-QED platforms.

quant-ph↗

arXiv2024

DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching

Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics.

cs.CV↗

arXiv2024

Iterated relation systems on Riemannian manifolds

For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we introduce the notion of iterated relation systems. We study the attractor of an iterated relation system and formulate a condition under which such an attractor can be identified with that of an associated graph-directed iterated function system. Using this method, we obtain dimension formulas for the attractor of an iterated relation system under the graph open set condition or the graph finite type condition. This method improves the one in [Ngai-Xu, J. Geom. Anal. {\bf 33} (2023), 262], which relies on knowing the specific structure of the attractor.

math.DS↗

arXiv2024

Advocating for the Silent: Enhancing Federated Generalization for Non-Participating Clients

Federated Learning (FL) has surged in prominence due to its capability of collaborative model training without direct data sharing. However, the vast disparity in local data distributions among clients, often termed the Non-Independent Identically Distributed (Non-IID) challenge, poses a significant hurdle to FL's generalization efficacy. The scenario becomes even more complex when not all clients participate in the training process, a common occurrence due to unstable network connections or limited computational capacities. This can greatly complicate the assessment of the trained models' generalization abilities. While a plethora of recent studies has centered on the generalization gap pertaining to unseen data from participating clients with diverse distributions, the distinction between the training distributions of participating clients and the testing distributions of non-participating ones has been largely overlooked. In response, our paper unveils an information-theoretic generalization framework for FL. Specifically, it quantifies generalization errors by evaluating the information entropy of local distributions and discerning discrepancies across these distributions. Inspired by our deduced generalization bounds, we introduce a weighted aggregation approach and a duo of client selection strategies. These innovations are designed to strengthen FL's ability to generalize and thus ensure that trained models perform better on non-participating clients by incorporating a more diverse range of client data distributions. Our extensive empirical evaluations reaffirm the potency of our proposed methods, aligning seamlessly with our theoretical construct.

cs.LG↗