Search arXiv⌕ Search

arXiv subjects

Yi Liu

Publications and source records attributed to Yi Liu.

At least 343 records · Page 19Linked to original sources

Unconventional band splitting of CeSb in the devil's staircase transition

The interplay between magnetism and electronic band structure is a central theme in condensed matter physics. CeSb, with its complex devil's staircase antiferromagnetic transition, offers a unique opportunity to explore this interplay. Using angle-resolved photoemission spectroscopy (ARPES), we investigate the electronic structure evolution across the devil's staircase transition. Upon entering the antiferromagnetic phase, we observe an intriguing band splitting of the electron pocket around the X point. The energy separation between the split bands changes abruptly with temperature, consistent with the characteristics of the first-order phase transition. However, their respective spectral weights behave gradually with temperature. Combined with our density functional theory (DFT) calculations, we suggest that this atypical behavior deviates from conventional magnetically induced band splitting and potentially arises from the intricate modulation of paramagnetic and antiferromagnetic layers within the devil's staircase transition. Our results provide insights into the complex relationship between electronic structure and magnetism in correlated electron systems.

cond-mat.str-el↗

Efficient Vector Search on Disaggregated Memory with d-HNSW

Efficient vector query processing is critical to enable AI applications at scale. Recent solutions struggle with growing vector datasets that exceed single-machine memory capacity, forcing unnecessary data movement and resource underutilization in monolithic architectures. We present d-HNSW, the first disaggregated vector similarity search engine for RDMA-based remote memory systems that achieves high performance while supporting fast data indexing with low network communication overhead. The core of d-HNSW is a novel disaggregation of the graph-based vector indexing data structure HNSW. It exploits the characteristics of greedy searching in HNSW to efficiently coordinate data transfers from the memory pool to the compute pool while serving data requests. Specifically, it leverages three ideas: (i) Representative index caching, a lightweight index constructed from a sampled subset of data, is cached in the compute pool to reduce frequent access to critical components of the hierarchical graph-based index, (ii) RDMA-friendly data layout design to reduce the networking round trips incurred by vector query and insertion and (iii) batched query-aware data loading to reduce bandwidth usage on data transfer between pools, addressing the limited cache capacity in compute nodes. We evaluate d-HNSW with extensive benchmarking datasets. The experimental results show that d-HNSW outperforms Naive d-HNSW implementation by up to 117x in latency while maintaining recall as 0.87 in dataset SIFT1M@1.

cs.DB↗

FedRE: Robust and Effective Federated Learning with Privacy Preference

Despite Federated Learning (FL) employing gradient aggregation at the server for distributed training to prevent the privacy leakage of raw data, private information can still be divulged through the analysis of uploaded gradients from clients. Substantial efforts have been made to integrate local differential privacy (LDP) into the system to achieve a strict privacy guarantee. However, existing methods fail to take practical issues into account by merely perturbing each sample with the same mechanism while each client may have their own privacy preferences on privacy-sensitive information (PSI), which is not uniformly distributed across the raw data. In such a case, excessive privacy protection from private-insensitive information can additionally introduce unnecessary noise, which may degrade the model performance. In this work, we study the PSI within data and develop FedRE, that can simultaneously achieve robustness and effectiveness benefits with LDP protection. More specifically, we first define PSI with regard to the privacy preferences of each client. Then, we optimize the LDP by allocating less privacy budget to gradients with higher PSI in a layer-wise manner, thus providing a stricter privacy guarantee for PSI. Furthermore, to mitigate the performance degradation caused by LDP, we design a parameter aggregation mechanism based on the distribution of the perturbed information. We conducted experiments with text tamper detection on T-SROIE and DocTamper datasets, and FedRE achieves competitive performance compared to state-of-the-art methods.

cs.LG↗

Magnetization-resolved density of states and quasi-first order transition in the two-dimensional random bond Ising model: an entropic sampling study

Systems with quenched disorder possess complex energy landscapes that are challenging to explore under the conventional Monte Carlo method. In this work, we implement an efficient entropy sampling scheme for accurate computation of the entropy function in low-energy regions. The method is applied to the two-dimensional $\pm J$ random-bond Ising model, where frustration is controlled by the fraction $p$ of ferromagnetic bonds. We investigate the low-temperature paramagnetic--ferromagnetic phase boundary below the multicritical point at $T_N = 0.9530(4)$, $P_N = 0.89078(8)$, as well as the zero-temperature ferromagnetic--spin-glass transition. Finite-size scaling analysis reveals that the phase boundary for $T < T_N$ exhibits reentrant behavior. By analyzing the evolution of the magnetization-resolved density of states $g(E, M)$ and ground-state spin configurations against increasing frustration, we provide strong evidence that the zero-temperature transition is quasi-first order. Finite-size scaling conducted on the spin-glass side supports the validity of $β= 0$, with a correlation length exponent $ν= 1.50(8)$. Our results provide new insights into the nature of the ferromagnetic-to-spin-glass phase transition in an extensively degenerate ground state.

cond-mat.dis-nn↗

First Measurement of the Muon Neutrino Interaction Cross Section and Flux as a Function of Energy at the LHC with FASER

This letter presents the measurement of the energy-dependent neutrino-nucleon cross section in tungsten and the differential flux of muon neutrinos and anti-neutrinos. The analysis is performed using proton-proton collision data at a center-of-mass energy of $13.6 \, {\rm TeV}$ and corresponding to an integrated luminosity of $(65.6 \pm 1.4) \, \mathrm{fb^{-1}}$. Using the active electronic components of the FASER detector, $338.1 \pm 21.0$ charged current muon neutrino interaction events are identified, with backgrounds from other processes subtracted. We unfold the neutrino events into a fiducial volume corresponding to the sensitive regions of the FASER detector and interpret the results in two ways: We use the expected neutrino flux to measure the cross section, and we use the predicted cross section to measure the neutrino flux. Both results are presented in six bins of neutrino energy, achieving the first differential measurement in the TeV range. The observed distributions align with Standard Model predictions. Using this differential data, we extract the contributions of neutrinos from pion and kaon decays.

hep-ex↗

RISE: Radius of Influence based Subgraph Extraction for 3D Molecular Graph Explanation

3D Geometric Graph Neural Networks (GNNs) have emerged as transformative tools for modeling molecular data. Despite their predictive power, these models often suffer from limited interpretability, raising concerns for scientific applications that require reliable and transparent insights. While existing methods have primarily focused on explaining molecular substructures in 2D GNNs, the transition to 3D GNNs introduces unique challenges, such as handling the implicit dense edge structures created by a cut-off radius. To tackle this, we introduce a novel explanation method specifically designed for 3D GNNs, which localizes the explanation to the immediate neighborhood of each node within the 3D space. Each node is assigned an radius of influence, defining the localized region within which message passing captures spatial and structural interactions crucial for the model's predictions. This method leverages the spatial and geometric characteristics inherent in 3D graphs. By constraining the subgraph to a localized radius of influence, the approach not only enhances interpretability but also aligns with the physical and structural dependencies typical of 3D graph applications, such as molecular learning.

cs.LG↗

Reconstruction and Performance Evaluation of FASER's Emulsion Detector at the LHC

This paper presents the reconstruction and performance evaluation of the FASER$ν$ emulsion detector, which aims to measure interactions from neutrinos produced in the forward direction of proton-proton collisions at the CERN Large Hadron Collider. The detector, composed of tungsten plates interleaved with emulsion films, records charged particles with sub-micron precision. A key challenge arises from the extremely high track density environment, reaching $\mathcal{O}(10^5)$ tracks per cm$^2$. To address this, dedicated alignment techniques and track reconstruction algorithms have been developed, building on techniques from previous experiments and introducing further optimizations. The performance of the detector is studied by evaluating the single-film efficiency, position and angular resolution, and the impact parameter distribution of reconstructed vertices. The results demonstrate that an alignment precision of 0.3 micrometers and robust track and vertex reconstruction are achieved, enabling accurate neutrino measurements in the TeV energy range.

physics.ins-det↗

A Rusty Link in the AI Supply Chain: Detecting Evil Configurations in Model Repositories

Recent advancements in large language models (LLMs) have spurred the development of diverse AI applications from code generation and video editing to text generation; however, AI supply chains such as Hugging Face, which host pretrained models and their associated configuration files contributed by the public, face significant security challenges; in particular, configuration files originally intended to set up models by specifying parameters and initial settings can be exploited to execute unauthorized code, yet research has largely overlooked their security compared to that of the models themselves; in this work, we present the first comprehensive study of malicious configurations on Hugging Face, identifying three attack scenarios (file, website, and repository operations) that expose inherent risks; to address these threats, we introduce CONFIGSCAN, an LLM-based tool that analyzes configuration files in the context of their associated runtime code and critical libraries, effectively detecting suspicious elements with low false positive rates and high accuracy; our extensive evaluation uncovers thousands of suspicious repositories and configuration files, underscoring the urgent need for enhanced security validation in AI model hosting platforms.

cs.CR↗

ai.txt: A Domain-Specific Language for Guiding AI Interactions with the Internet

We introduce ai.txt, a novel domain-specific language (DSL) designed to explicitly regulate interactions between AI models, agents, and web content, addressing critical limitations of the widely adopted robots.txt standard. As AI increasingly engages with online materials for tasks such as training, summarization, and content modification, existing regulatory methods lack the necessary granularity and semantic expressiveness to ensure ethical and legal compliance. ai.txt extends traditional URL-based access controls by enabling precise element-level regulations and incorporating natural language instructions interpretable by AI systems. To facilitate practical deployment, we provide an integrated development environment with code autocompletion and automatic XML generation. Furthermore, we propose two compliance mechanisms: XML-based programmatic enforcement and natural language prompt integration, and demonstrate their effectiveness through preliminary experiments and case studies. Our approach aims to aid the governance of AI-Internet interactions, promoting responsible AI use in digital ecosystems.

cs.NI↗

CloudQC: A Network-aware Framework for Multi-tenant Distributed Quantum Computing

Distributed quantum computing (DQC) that allows a large quantum circuit to be executed simultaneously on multiple quantum processing units (QPUs) becomes a promising approach to increase the scalability of quantum computing. It is natural to envision the near-future DQC platform as a multi-tenant cluster of QPUs, called a Quantum Cloud. However, no existing DQC work has addressed the two key problems of running DQC in a multi-tenant quantum cloud: placing multiple quantum circuits to QPUs and scheduling network resources to complete these jobs. This work is the first attempt to design a circuit placement and resource scheduling framework for a multi-tenant environment. The proposed framework is called CloudQC, which includes two main functional components, circuit placement and network scheduler, with the objectives of optimizing both quantum network cost and quantum computing time. Experimental results with real quantum circuit workloads show that CloudQC significantly reduces the average job completion time compared to existing DQC placement algorithms for both single-circuit and multi-circuit DQC. We envision this work will motivate more future work on network-aware quantum cloud.

cs.DC↗

On the Euler class one conjecture for fillable contact structures

In this paper, it is proved that every oriented closed hyperbolic $3$--manifold $N$ admits some finite cover $M$ with the following property. There exists some even lattice point $w$ on the boundary of the dual Thurston norm unit ball of $M$, such that $w$ is not the real Euler class of any weakly symplectically fillable contact structure on $M$. In particular, $w$ is not the real Euler class of any transversely oriented, taut foliation on $M$. This supplies new counter-examples to Thurston's Euler class one conjecture.

math.GT↗

Optical Wireless Communications: Enabling the Next Generation Network of Networks

Optical wireless communication (OWC) is a promising technology anticipated to play a key role in the next-generation network of networks, especially as a complementary technology to traditional radio frequency communications, for enhancing networking capabilities beyond conventional terrestrial networks. OWC is already a mature technology with diverse usage scenarios, and can enable integrated applications via wireless access and backhaul networks, dynamic drone and satellite networks, underwater networks, inter- and intra-system interconnecting networks, and vehicular communication networks. Furthermore, novel and emerging technological opportunities such as photovoltaic cells, orbital angular momentum-based modulation, optical reconfigurable intelligent surfaces, organic light-emitting and photo diodes, and recent advances in ultraviolet communications can help enhance future OWC capabilities even further. Moreover, OWC networks can also support value-added services such as enhanced positioning and gesture recognition. Hence, OWC provides unique functionalities that can play a crucial role in building convergent and resilient future network of networks alongside radio frequency and optical fiber technologies.

eess.SP↗

The Tenth NTIRE 2025 Efficient Super-Resolution Challenge Report

This paper presents a comprehensive review of the NTIRE 2025 Challenge on Single-Image Efficient Super-Resolution (ESR). The challenge aimed to advance the development of deep models that optimize key computational metrics, i.e., runtime, parameters, and FLOPs, while achieving a PSNR of at least 26.90 dB on the $\operatorname{DIV2K\_LSDIR\_valid}$ dataset and 26.99 dB on the $\operatorname{DIV2K\_LSDIR\_test}$ dataset. A robust participation saw \textbf{244} registered entrants, with \textbf{43} teams submitting valid entries. This report meticulously analyzes these methods and results, emphasizing groundbreaking advancements in state-of-the-art single-image ESR techniques. The analysis highlights innovative approaches and establishes benchmarks for future research in the field.

cs.CV↗

asKAN: Active Subspace embedded Kolmogorov-Arnold Network

The Kolmogorov-Arnold Network (KAN) has emerged as a promising neural network architecture for small-scale AI+Science applications. However, it suffers from inflexibility in modeling ridge functions, which is widely used in representing the relationships in physical systems. This study investigates this inflexibility through the lens of the Kolmogorov-Arnold theorem, which starts the representation of multivariate functions from constructing the univariate components rather than combining the independent variables. Our analysis reveals that incorporating linear combinations of independent variables can substantially simplify the network architecture in representing the ridge functions. Inspired by this finding, we propose active subspace embedded KAN (asKAN), a hierarchical framework that synergizes KAN's function representation with active subspace methodology. The architecture strategically embeds active subspace detection between KANs, where the active subspace method is used to identify the primary ridge directions and the independent variables are adaptively projected onto these critical dimensions. The proposed asKAN is implemented in an iterative way without increasing the number of neurons in the original KAN. The proposed method is validated through function fitting, solving the Poisson equation, and reconstructing sound field. Compared with KAN, asKAN significantly reduces the error using the same network architecture. The results suggest that asKAN enhances the capability of KAN in fitting and solving equations in the form of ridge functions.

physics.comp-ph↗

MedReason: Eliciting Factual Medical Reasoning Steps in LLMs via Knowledge Graphs

Medical tasks such as diagnosis and treatment planning require precise and complex reasoning, particularly in life-critical domains. Unlike mathematical reasoning, medical reasoning demands meticulous, verifiable thought processes to ensure reliability and accuracy. However, there is a notable lack of datasets that provide transparent, step-by-step reasoning to validate and enhance the medical reasoning ability of AI models. To bridge this gap, we introduce MedReason, a large-scale high-quality medical reasoning dataset designed to enable faithful and explainable medical problem-solving in large language models (LLMs). We utilize a structured medical knowledge graph (KG) to convert clinical QA pairs into logical chains of reasoning, or ``thinking paths'', which trace connections from question elements to answers via relevant KG entities. Each path is validated for consistency with clinical logic and evidence-based medicine. Our pipeline generates detailed reasoning for various medical questions from 7 medical datasets, resulting in a dataset of 32,682 question-answer pairs, each with detailed, step-by-step explanations. Experiments demonstrate that fine-tuning with our dataset consistently boosts medical problem-solving capabilities, achieving significant gains of up to 7.7% for DeepSeek-Ditill-8B. Our top-performing model, MedReason-8B, outperforms the Huatuo-o1-8B, a state-of-the-art medical reasoning model, by up to 4.2% on the clinical benchmark MedBullets. We also engage medical professionals from diverse specialties to assess our dataset's quality, ensuring MedReason offers accurate and coherent medical reasoning. Our data, models, and code is available at https://github.com/UCSC-VLAA/MedReason.

cs.CL↗

JAX-BTE: A GPU-Accelerated Differentiable Solver for Phonon Boltzmann Transport Equations

This paper introduces JAX-BTE, a GPU-accelerated, differentiable solver for the phonon Boltzmann Transport Equation (BTE) based on differentiable programming. JAX-BTE enables accurate, efficient and differentiable multiscale thermal modeling by leveraging high-performance GPU computing and automatic differentiation. The solver efficiently addresses the high-dimensional and complex integro-differential nature of the phonon BTE, facilitating both forward simulations and data-augmented inverse simulations through end-to-end optimization. Validation is performed across a range of 1D to 3D simulations, including complex FinFET structures, in both forward and inverse settings, demonstrating excellent performance and reliability. JAX-BTE significantly outperforms state-of-the-art BTE solvers in forward simulations and uniquely enables inverse simulations, making it a powerful tool for multiscale thermal analysis and design for semiconductor devices.

physics.comp-ph↗

Effective Cloud Removal for Remote Sensing Images by an Improved Mean-Reverting Denoising Model with Elucidated Design Space

Cloud removal (CR) remains a challenging task in remote sensing image processing. Although diffusion models (DM) exhibit strong generative capabilities, their direct applications to CR are suboptimal, as they generate cloudless images from random noise, ignoring inherent information in cloudy inputs. To overcome this drawback, we develop a new CR model EMRDM based on mean-reverting diffusion models (MRDMs) to establish a direct diffusion process between cloudy and cloudless images. Compared to current MRDMs, EMRDM offers a modular framework with updatable modules and an elucidated design space, based on a reformulated forward process and a new ordinary differential equation (ODE)-based backward process. Leveraging our framework, we redesign key MRDM modules to boost CR performance, including restructuring the denoiser via a preconditioning technique, reorganizing the training process, and improving the sampling process by introducing deterministic and stochastic samplers. To achieve multi-temporal CR, we further develop a denoising network for simultaneously denoising sequential images. Experiments on mono-temporal and multi-temporal datasets demonstrate the superior performance of EMRDM. Our code is available at https://github.com/Ly403/EMRDM.

cs.CV↗

Prospects and Opportunities with an upgraded FASER Neutrino Detector during the HL-LHC era: Input to the EPPSU

The FASER experiment at CERN has opened a new window in collider neutrino physics by detecting TeV-energy neutrinos produced in the forward direction at the LHC. Building on this success, this document outlines the scientific case and design considerations for an upgraded FASER neutrino detector to operate during LHC Run 4 and beyond. The proposed detector will significantly enhance the neutrino physics program by increasing event statistics, improving flavor identification, and enabling precision measurements of neutrino interactions at the highest man-made energies. Key objectives include measuring neutrino cross sections, probing proton structure and forward QCD dynamics, testing lepton flavor universality, and searching for beyond-the-Standard Model physics. Several detector configurations are under study, including high-granularity scintillator-based tracking calorimeters, high-precision silicon tracking layers, and advanced emulsion-based detectors for exclusive event reconstruction. These upgrades will maximize the physics potential of the HL-LHC, contribute to astroparticle physics and QCD studies, and serve as a stepping stone toward future neutrino programs at the Forward Physics Facility.

hep-ex↗