SearcharxivSearch

arXiv subjects

Feiyang Liu

Publications and source records attributed to Feiyang Liu.

At least 19 recordsLinked to original sources

OPERA: Offline Policy-guided Expert Routing and Adaptation for Universal Biomedical Image Analysis

Biomedical image analysis spans diverse modalities and tasks, yet real-world deployment is hindered by severe distribution shifts across scanners, protocols, and patient populations. High-performing models consequently require repeated domain-specific fine-tuning, which is a costly cycle that becomes impractical when labels are scarce or privacy constraints limit data sharing. We propose OPERA (Offline Policy-guided Expert Routing and Adaptation), a multi-agent ensemble framework that addresses this deployment bottleneck by treating expert weight assignment as an offline policy learning problem: a routing policy is learned from a small validation set without gradient updates to any expert agent, then deployed with test-time adaptation to handle distribution shift. OPERA coordinates heterogeneous specialist agents through complementary mechanisms. The expert profiling module learns selection policies offline, enabling informed allocation of expertise. Each agent undergoes confidence calibration through temperature adjustment, ensuring more reliable probabilistic outputs. OPERA also incorporates distribution aware adaptation, where class weights are dynamically adjusted at the batch level using statistics derived from unlabeled test data. Instance level routing assigns each sample to the most suitable expert by leveraging inter model agreement and predictive entropy. We evaluate OPERA on 9 datasets covering fundus photography, chest X-ray, CT, MRI, and multimodal diagnostic benchmarks, comparing against 30+ baselines across classification, segmentation, and multimodal settings. OPERA consistently improves performance and calibration quality, demonstrating that offline policy-guided expert agents coordination is a practical path to deployable biomedical AI without retraining. Code is on \href{https://github.com/HUANGLIZI/OPERA}{GitHub}.

cs.CV

TileFuse: A Fused Mixed-Precision Kernel Library for Efficient Quantized LLM Inference on AMD NPUs

With the growing demand for on-device LLM inference, edge SoCs increasingly integrate NPUs to improve performance and energy efficiency under tight power and thermal budgets. However, practical LLM deployment on current client NPUs remains difficult: widely used quantization formats such as AWQ do not map cleanly onto many existing NPU software stacks, which are often proprietary and expose limited low-level control. In this work, we present TileFuse, a close-to-metal mixed-precision kernel library for AMD XDNA2 NPUs that targets GEMM/GEMV-based operators in quantized LLM inference. TileFuse brings practical low-bit formats such as AWQ-style W4A16 and W8A16 directly onto XDNA2, rather than forcing the model to be reshaped around an NPU-specific quantization scheme. TileFuse co-designs weight layout, metadata placement, mixed-precision microkernels, and array-level dataflow. Specifically, it fuses unpacking, dequantization, and GEMM/GEMV execution into a single kernel flow, introduces an interleaved pre-tiling layout that supports GEMM dimensions up to 32K, and redesigns GEMV dataflow to utilize the full 4x8 AIE array. Across kernel-level evaluations, TileFuse improves performance by up to 121.6% for GEMM and 281% for GEMV over full-precision baselines, while delivering more than 2x performance and energy-efficiency gains over strong iGPU baselines on GEMM. In end-to-end LLM experiments on Ryzen AI laptops, TileFuse achieves up to 2.0x lower prefilling latency with more than 64.6% lower energy consumption. Together, these results show that XDNA2 is a practical target for AWQ-style edge LLM inference and that native NPU support for off-the-shelf quantization can make NPUs substantially more usable in real client deployments.

cs.DC

Interlayer electronic coherence links magnetism and superconductivity in Ruddlesden-Popper nickelates

The extent to which electronic dimensionality influences magnetism and superconductivity in Ruddlesden-Popper (RP) nickelates remains unsettled. Here we report high-precision crystallographic-axis-resolved dc transport measurements on high-quality single crystals of bilayer and trilayer RP nickelates. Using a six-terminal geometry, we self-consistently determine the intrinsic in-plane ($\rho_\parallel$) and out-of-plane ($\rho_\bot$) resistivities on the same crystal, while minimizing uncertainties associated with current redistribution in highly anisotropic conductors. We uncover strong intrinsic electronic anisotropy in both bilayer and trilayer nickelates, in contrast to the weak anisotropy inferred from conventional four-probe measurements. Moreover, $\rho_\bot$ exhibits a nonmonotonic temperature dependence, revealing a universal coherent-to-incoherent crossover in interlayer transport. Across the RP nickelate series, the maximum superconducting transition temperature ($T_c$) observed under pressure is inversely correlated with the ambient-pressure resistivity anisotropy, suggesting that stronger interlayer electronic coherence is favorable for superconductivity. In addition, $\rho_\bot$ serves as an exceptionally sensitive and selective probe of magnetic and density-wave orders, exhibiting pronounced anomalies, whereas only weak signatures are observed in $\rho_\parallel$. Our results highlight interlayer coherence as a key organizing parameter that both tracks the relevant magnetic correlations and is closely tied to superconductivity, providing stringent constraints on microscopic theories of high-$T_c$ superconductivity in nickelates.

cond-mat.str-el

Nature of magnetism in bilayer nickelate La3Ni2O7 single crystals

The recent discovery of high-temperature superconductivity in pressurized and thin film nickelates has generated intense interest, yet the nature of magnetism in their ambient-pressure parent phases remains poorly understood, despite its potentially crucial role in pairing. Here we use neutron scattering to resolve the spin order and dynamics of single-crystalline La3Ni2O7, an ambient-pressure parent of this class. Well defined spin excitations are observed at Q = (0, 0.5, 2.5), featuring a~5 meV spin gap and anisotropic in-plane dispersions, with zone-boundary softening along the transverse direction indicative of competing exchange interactions. The excitations exhibit pronounced out-of-plane modulations with bilayer periodicity, providing direct evidence for antiferromagnetic interlayer coupling. Their dispersion is well described by a bilayer Heisenberg Hamiltonian with strong interlayer exchange and competing in-plane couplings within a stripe-type magnetic order. Normalization of the spectra to absolute units reveals that, although the spin-wave bandwidth is only about 25% of that in cuprates, the local dynamic susceptibility at comparable energies is significantly enhanced, yielding a total fluctuating moment of comparable magnitude. These results highlight intense mid-energy spin excitations rooted in substantial electronic correlations as a defining feature of this family, establishing a magnetic framework distinct from cuprates and directly relevant to understanding superconductivity in this system.

cond-mat.str-el

Photonic implementation of quantum hidden subgroup database compression

We experimentally demonstrate quantum data compression exploiting hidden subgroup symmetries using a photonic quantum processor. Classical databases containing generalized periodicities-symmetries that are in the worst cases inefficient for known classical algorithms to be detect-can efficiently compressed by quantum hidden subgroup algorithms. We implement a variational quantum autoencoder that autonomously learns both the symmetry type (e.g., $\mathbb{Z}_2 \times \mathbb{Z}_2$ vs. $\mathbb{Z}_4$) and the generalized period from structured data. The system uses single photons encoded in path, polarization, and time-bin degrees of freedom, with electronically controlled waveplates enabling tunable quantum gates. Training via gradient descent successfully identifies the hidden symmetry structure, achieving compression by eliminating redundant database entries. We demonstrate two circuit ansatzes: a parametrized generalized Fourier transform and a less-restricted architecture for Simon's symmetry. Both converge successfully, with the cost function approaching zero as training proceeds. These results provide experimental proof-of-principle that photonic quantum computers can compress classical databases by learning symmetries inaccessible to known efficient classical methods, opening pathways for quantum-enhanced information processing.

quant-ph

Signatures of Kitaev interactions in the van der Waals ferromagnet VI3

Materials manifesting the Kitaev model, characterized by bond-dependent interactions on a honeycomb lattice, can host exotic phenomena like quantum spin liquid states and topological magnetic excitations. However, finding such materials remains a formidable challenge. Here, we report high-resolution inelastic neutron scattering measurements performed on VI3, a van der Waals ferromagnetic Mott insulator, covering a wide range of reciprocal space. Our measurements unveil highly anisotropic magnetic excitations in momentum space. Through a comprehensive comparative analysis of various models that incorporate diverse symmetry-allowed magnetic interactions, we find the observed excitations are well captured by a model with a large bond-dependent Kitaev interaction. These results not only help to understand the intriguing properties of VI3, such as the pronounced anomalous thermal Hall effects and strong pressure/structure dependence of magnetism, but also open a new avenue for exploring Kitaev physics.

cond-mat.str-el

Towards Pixel-Level Prediction for Gaze Following: Benchmark and Approach

Following the gaze of other people and analyzing the target they are looking at can help us understand what they are thinking, and doing, and predict the actions that may follow. Existing methods for gaze following struggle to perform well in natural scenes with diverse objects, and focus on gaze points rather than objects, making it difficult to deliver clear semantics and accurate scope of the targets. To address this shortcoming, we propose a novel gaze target prediction solution named GazeSeg, that can fully utilize the spatial visual field of the person as guiding information and lead to a progressively coarse-to-fine gaze target segmentation and recognition process. Specifically, a prompt-based visual foundation model serves as the encoder, working in conjunction with three distinct decoding modules (e.g. FoV perception, heatmap generation, and segmentation) to form the framework for gaze target prediction. Then, with the head bounding box performed as an initial prompt, GazeSeg obtains the FoV map, heatmap, and segmentation map progressively, leading to a unified framework for multiple tasks (e.g. direction estimation, gaze target segmentation, and recognition). In particular, to facilitate this research, we construct and release a new dataset, comprising 72k images with pixel-level annotations and 270 categories of gaze targets, built upon the GazeFollow dataset. The quantitative evaluation shows that our approach achieves the Dice of 0.325 in gaze target segmentation and 71.7% top-5 recognition. Meanwhile, our approach also outperforms previous state-of-the-art methods, achieving 0.953 in AUC on the gaze-following task. The dataset and code will be released.

cs.CV

Lattice and magnetic structure in the van der Waals antiferromagnet VBr3

We report a comprehensive investigation of the lattice and magnetic structure in van der Waals antiferromagnet VBr3, characterized by a BiI3-type structure at room temperature. Neutron diffraction experiments were performed on both polycrystalline and single-crystalline VBr3 samples, revealing clear magnetic Bragg peaks emerging below the N\'eel temperature of TN = 26.5 K. These magnetic Bragg peaks can be indexed by k = (0, 0.5, 1) in hexagonal notation. Our refinement analysis suggests that the antiferromagnetic order in VBr3 manifests as a zigzag structure. Moreover, we observed peak splitting for nuclear Bragg peaks in the HK-plane below the structure transition temperature of Ts = 94 K, indicating the breaking of 3-fold symmetry within the ab-plane.

cond-mat.str-el

Moving Target Detection Method Based on Range? Doppler Domain Compensation and Cancellation for UAV-Mounted Radar

Combining unmanned aerial vehicle (UAV) with through-the-wall radar can realize moving targets detection in complex building scenes. However, clutters generated by obstacles and static objects are always stronger and non-stationary, which results in heavy impacts on moving targets detection. To address this issue, this paper proposes a moving target detection method based on Range-Doppler domain compensation and cancellation for UAV mounted dual channel radar. In the proposed method, phase compensation is performed on the dual channel in range-Doppler domain and then cancellation is utilized to achieve roughly clutters suppression. Next, a filter is constructed based on the cancellation result and the raw echoes, which is used to suppress stationary clutter furthermore. Finally, mismatch imaging is used to focus moving target for detection. Both simulation and UAV-based experiment results are analyzed to verify the efficacy and practicability of the proposed method.

eess.SP

Integrated Sensing and Communication for Network-Assisted Full-Duplex Cell-Free Distributed Massive MIMO Systems

In this paper, we combine the network-assisted full-duplex (NAFD) technology and distributed radar sensing to implement integrated sensing and communication (ISAC). The ISAC system features both uplink and downlink remote radio units (RRUs) equipped with communication and sensing capabilities. We evaluate the communication and sensing performance of the system using the sum communication rates and the Cramer-Rao lower bound (CRLB), respectively. We compare the performance of the proposed scheme with other ISAC schemes, the result shows that the proposed scheme can provide more stable sensing and better communication performance. Furthermore, we propose two power allocation algorithms to optimize the communication and sensing performance jointly. One algorithm is based on the deep Q-network (DQN) and the other one is based on the non-dominated sorting genetic algorithm II (NSGA-II). The proposed algorithms provide more feasible solutions and achieve better system performance than the equal power allocation algorithm.

cs.IT

Superconductivity in pressurized trilayer La$_4$Ni$_3$O$_{10-{\delta}}$ single crystals

The pursuit of discovering new high-temperature superconductors that diverge from the copper-based paradigm1-3 carries profound implications for elucidating mechanisms behind superconductivity and may also enable new applications4-8. Here, our investigation reveals that application of pressure effectively suppresses the spin and charge order in trilayer nickelate La4Ni3O10-{\delta} single crystals, leading to the emergence of superconductivity with a maximum critical temperature (Tc) of around 30 K at 69.0 GPa. The DC susceptibility measurements confirm a substantial diamagnetic response below Tc, indicating the presence of bulk superconductivity with a volume fraction exceeding 80%. In the normal state, we observe a "strange metal" behavior, characterized by a linear temperature-dependent resistance extending up to 300 K. Furthermore, the layer-dependent superconductivity observed hints at a unique interlayer coupling mechanism specific to nickelates, setting them apart from cuprates in this regard. Our findings provide crucial insights into the fundamental mechanisms underpinning superconductivity, while also introducing a new material platform to explore the intricate interplay between the spin/charge order, flat band structures, interlayer coupling, strange metal behavior and high-temperature superconductivity.

cond-mat.supr-con

Passive Integrated Sensing and Communication Scheme based on RF Fingerprint Information Extraction for Cell-Free RAN

This paper investigates how to achieve integrated sensing and communication (ISAC) based on a cell-free radio access network (CF-RAN) architecture with a minimum footprint of communication resources. We propose a new passive sensing scheme. The scheme is based on the radio frequency (RF) fingerprint learning of the RF radio unit (RRU) to build an RF fingerprint library of RRUs. The source RRU is identified by comparing the RF fingerprints carried by the signal at the receiver side. The receiver extracts the channel parameters from the signal and estimates the channel environment, thus locating the reflectors in the environment. The proposed scheme can effectively solve the problem of interference between signals in the same time-frequency domain but in different spatial domains when multiple RRUs jointly serve users in CF-RAN architecture. Simulation results show that the proposed passive ISAC scheme can effectively detect reflector location information in the environment without degrading the communication performance.

eess.SP

Data Augmentation for Human Behavior Analysis in Multi-Person Conversations

In this paper, we present the solution of our team HFUT-VUT for the MultiMediate Grand Challenge 2023 at ACM Multimedia 2023. The solution covers three sub-challenges: bodily behavior recognition, eye contact detection, and next speaker prediction. We select Swin Transformer as the baseline and exploit data augmentation strategies to address the above three tasks. Specifically, we crop the raw video to remove the noise from other parts. At the same time, we utilize data augmentation to improve the generalization of the model. As a result, our solution achieves the best results of 0.6262 for bodily behavior recognition in terms of mean average precision and the accuracy of 0.7771 for eye contact detection on the corresponding test set. In addition, our approach also achieves comparable results of 0.5281 for the next speaker prediction in terms of unweighted average recall.

cs.CV

Information compression via hidden subgroup quantum autoencoders

We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data with a given group structure can be compressed with the same query complexity as the hidden subgroup problem, which is exponentially faster than the best known classical algorithms. We moreover design a quantum algorithm that variationally finds the group structure and uses it to compress the data. There is an encoder and a decoder, along the paradigm of quantum autoencoders. After the training, the encoder outputs a compressed data string and a description of the hidden subgroup symmetry, from which the input data can be recovered by the decoder. In illustrative examples, our algorithm outperforms the classical autoencoder on the mean squared value of test data. This classical-quantum separation in information compression capability has thermodynamical significance: the free energy assigned by a quantum agent to a system can be much higher than that of a classical agent. Taken together, our results show that a possible application of quantum computers is to efficiently compress certain types of data that cannot be efficiently compressed by current methods using classical computers.

quant-ph

Spin Fluctuations in Sr$_{1.8}$La$_{0.2}$RuO$_4$

We use inelastic neutron scattering to study spin fluctuations in Sr$_{1.8}$La$_{0.2}$RuO$_4$, where Lanthanum doping triggers a Lifshitz transition by pushing the van Hove singularity in the $γ$ band to the Fermi energy. Strong spin fluctuations emerge at an incommensurate wave vector $\mathbf{Q}_{ic} = (0.3,0.3)$, corresponding to the nesting vector between $α$ and $β$ Fermi sheets. The incommensurate antiferromagnetic fluctuations shift toward $(0.25,0.25)$ with increasing energy up to ${\sim}110$ meV. By contrast, scatterings near the ferromagnetic wave vectors $\mathbf{Q} = (1,0)$ and $(1,1)$ remain featureless at all energies. This contradicts the weak-coupling perspective that suggests a sharp enhancement of ferromagnetic susceptibility due to the divergence of density of states in the associated $γ$ band. Our findings imply that ferromagnetic fluctuations in Sr$_2$RuO$_4$ and related materials do not fit into the weak-coupling paradigm, but instead are quasi-local fluctuations induced by Hund's coupling. This imposes significant constraints for the pairing mechanism involving spin fluctuations.

cond-mat.str-el

Provable superior accuracy in machine learned quantum models

In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demonstrate this advantage on present-day quantum computing hardware. Our algorithm works directly off classical time-series data and can thus be deployed in real-world settings. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.

quant-ph

Quantum advantage in training binary neural networks

The performance of a neural network for a given task is largely determined by the initial calibration of the network parameters. Yet, it has been shown that the calibration, also referred to as training, is generally NP-complete. This includes networks with binary weights, an important class of networks due to their practical hardware implementations. We therefore suggest an alternative approach to training binary neural networks. It utilizes a quantum superposition of weight configurations. We show that the quantum training guarantees with high probability convergence towards the globally optimal set of network parameters. This resolves two prominent issues of classical training: (1) the vanishing gradient problem and (2) common convergence to suboptimal network parameters. Moreover we achieve a provable polynomial---sometimes exponential---speedup over classical training for certain classes of tasks. We design an explicit training algorithm and implement it in numerical simulations.

quant-ph

Learning Simon's quantum algorithm

We consider whether trainable quantum unitaries can be used to discover quantum speed-ups for classical problems. Using methods recently developed for training quantum neural nets, we consider Simon's problem, for which there is a known quantum algorithm which performs exponentially faster in the number of bits, relative to the best known classical algorithm. We give the problem to a randomly chosen but trainable unitary circuit, and find that the training recovers Simon's algorithm as hoped.

quant-ph