Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
21works
0followers
17topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

21 published item(s)

preprint2026arXiv

Fact-Checking with Large Language Models via Probabilistic Certainty and Consistency

Large language models (LLMs) are increasingly used in applications requiring factual accuracy, yet their outputs often contain hallucinated responses. While fact-checking can mitigate these errors, existing methods typically retrieve external evidence indiscriminately, overlooking the model's internal knowledge and potentially introducing irrelevant noise. Moreover, current systems lack targeted mechanisms to resolve specific uncertainties in the model's reasoning. Inspired by how humans fact-check, we argue that LLMs should adaptively decide whether to rely on internal knowledge or initiate retrieval based on their confidence in a given claim. We introduce Probabilistic Certainty and Consistency (PCC), a framework that estimates factual confidence by jointly modeling an LLM's probabilistic certainty and reasoning consistency. These confidence signals enable an adaptive verification strategy: the model answers directly when confident, triggers targeted retrieval when uncertain or inconsistent, and escalates to deep search when ambiguity is high. Our confidence-guided routing mechanism ensures that retrieval is invoked only when necessary, improving both efficiency and reliability. Extensive experiments across three challenging benchmarks show that PCC achieves better uncertainty quantification than verbalized confidence and consistently outperforms strong LLM-based fact-checking baselines. Furthermore, we demonstrate that PCC generalizes well across various LLMs.

preprint2026arXiv

Joint Optimization of Trajectory Control, Resource Allocation, and Task Offloading for Multi-UAV-Assisted IoV

This paper investigates a multi-Unmanned Aerial Vehicle (UAV) joint base station-assisted Internet of Vehicles (IoV) task offloading system in dense urban environments. To minimize system delay and energy consumption under strict coupling constraints, the complex non-convex optimization problem is decoupled into a hierarchical execution framework. First, a sequential distributed optimization algorithm based on Second-Order Cone Programming (SOCP) is proposed to optimize the 3D flight trajectory of each UAV, ensuring adaptive network coverage. Second, a novel hybrid resource scheduling paradigm synergizing Deep Reinforcement Learning (DRL) and Large Language Models (LLMs) is developed. Within this framework, the DRL agent dictates the initial resource allocation, while the LLM acts as a semantic macro-scheduler to rectify long-tail allocation imbalances for failed and surplus tasks. Crucially, a reward decoupling mechanism is introduced to isolate DRL training from external LLM interventions, thereby ensuring policy convergence. Finally, the task offloading ratios are precisely determined via Linear Programming (LP) within an alternating optimization loop. Simulation results demonstrate that the proposed method significantly outperforms traditional multi-agent reinforcement learning baselines in terms of task success rate and system efficiency.

preprint2026arXiv

SOMA: Efficient Multi-turn LLM Serving via Small Language Model

Large Language Models (LLMs) are increasingly deployed in multi-turn dialogue settings where preserving conversational context across turns is essential. A standard serving practice concatenates the full dialogue history at every turn, which reliably maintains coherence but incurs substantial cost in latency, memory, and API expenditure, especially when queries are routed to large proprietary models. Existing approaches often struggle to balance the trade-off between response quality and efficiency. We propose a framework that exploits the early turns of a session to estimate a local response manifold and then adapt a smaller surrogate model to this local region for the remainder of the conversation. Concretely, we learn soft prompts that maximize semantic divergence between the large and surrogate small language models' responses to surface least-aligned local directions, stabilize training with anti-degeneration control, and distill the mined cases into localized LoRA fine-tuning so the surrogate runs without prompts at inference. A simple gate enables a one-time switch with rollback on drift. We further provide a theoretical analysis for key components in SOMA. Extensive experiments show the effectiveness of SOMA. The source code is provided at: https://github.com/LabRAI/SOMA.

preprint2023arXiv

A Deep Reinforcement Learning Approach for Online Parcel Assignment

In this paper, we investigate the online parcel assignment (OPA) problem, in which each stochastically generated parcel needs to be assigned to a candidate route for delivery to minimize the total cost subject to certain business constraints. The OPA problem is challenging due to its stochastic nature: each parcel's candidate routes, which depends on the parcel's origin, destination, weight, etc., are unknown until its order is placed, and the total parcel volume is uncertain in advance. To tackle this challenge, we propose the PPO-OPA algorithm based on deep reinforcement learning that shows competitive performance. More specifically, we introduce a novel Markov Decision Process (MDP) framework to model the OPA problem, and develop a policy gradient algorithm that adopts attention networks for policy evaluation. By designing a dedicated reward function, our proposed algorithm can achieve a lower total cost with smaller violation of constraints, comparing to the traditional method which assigns parcels to candidate routes proportionally. In addition, the performances of our proposed algorithm and the Primal-Dual algorithm are comparable, while the later assumes a known total parcel volume in advance, which is unrealistic in practice.

preprint2023arXiv

HiFlash: Communication-Efficient Hierarchical Federated Learning with Adaptive Staleness Control and Heterogeneity-aware Client-Edge Association

Federated learning (FL) is a promising paradigm that enables collaboratively learning a shared model across massive clients while keeping the training data locally. However, for many existing FL systems, clients need to frequently exchange model parameters of large data size with the remote cloud server directly via wide-area networks (WAN), leading to significant communication overhead and long transmission time. To mitigate the communication bottleneck, we resort to the hierarchical federated learning paradigm of HiFL, which reaps the benefits of mobile edge computing and combines synchronous client-edge model aggregation and asynchronous edge-cloud model aggregation together to greatly reduce the traffic volumes of WAN transmissions. Specifically, we first analyze the convergence bound of HiFL theoretically and identify the key controllable factors for model performance improvement. We then advocate an enhanced design of HiFlash by innovatively integrating deep reinforcement learning based adaptive staleness control and heterogeneity-aware client-edge association strategy to boost the system efficiency and mitigate the staleness effect without compromising model accuracy. Extensive experiments corroborate the superior performance of HiFlash in model accuracy, communication reduction, and system efficiency.

preprint2022arXiv

Asynchronous Federated Learning Based Mobility-aware Caching in Vehicular Edge Computing

Vehicular edge computing (VEC) is a promising technology to support real-time applications through caching the contents in the roadside units (RSUs), thus vehicles can fetch the contents requested by vehicular users (VUs) from the RSU within short time. The capacity of the RSU is limited and the contents requested by VUs change frequently due to the high-mobility characteristics of vehicles, thus it is essential to predict the most popular contents and cache them in the RSU in advance. The RSU can train model based on the VUs' data to effectively predict the popular contents. However, VUs are often reluctant to share their data with others due to the personal privacy. Federated learning (FL) allows each vehicle to train the local model based on VUs' data, and upload the local model to the RSU instead of data to update the global model, and thus VUs' privacy information can be protected. The traditional synchronous FL must wait all vehicles to complete training and upload their local models for global model updating, which would cause a long time to train global model. The asynchronous FL updates the global model in time once a vehicle's local model is received. However, the vehicles with different staying time have different impacts to achieve the accurate global model. In this paper, we consider the vehicle mobility and propose an Asynchronous FL based Mobility-aware Edge Caching (AFMC) scheme to obtain an accurate global model, and then propose an algorithm to predict the popular contents based on the global model. Experimental results show that AFMC outperforms other baseline caching schemes.

preprint2022arXiv

CycleTrans: Learning Neutral yet Discriminative Features for Visible-Infrared Person Re-Identification

Visible-infrared person re-identification (VI-ReID) is a task of matching the same individuals across the visible and infrared modalities. Its main challenge lies in the modality gap caused by cameras operating on different spectra. Existing VI-ReID methods mainly focus on learning general features across modalities, often at the expense of feature discriminability. To address this issue, we present a novel cycle-construction-based network for neutral yet discriminative feature learning, termed CycleTrans. Specifically, CycleTrans uses a lightweight Knowledge Capturing Module (KCM) to capture rich semantics from the modality-relevant feature maps according to pseudo queries. Afterwards, a Discrepancy Modeling Module (DMM) is deployed to transform these features into neutral ones according to the modality-irrelevant prototypes. To ensure feature discriminability, another two KCMs are further deployed for feature cycle constructions. With cycle construction, our method can learn effective neutral features for visible and infrared images while preserving their salient semantics. Extensive experiments on SYSU-MM01 and RegDB datasets validate the merits of CycleTrans against a flurry of state-of-the-art methods, +4.57% on rank-1 in SYSU-MM01 and +2.2% on rank-1 in RegDB.

preprint2022arXiv

HELoC: Hierarchical Contrastive Learning of Source Code Representation

Abstract syntax trees (ASTs) play a crucial role in source code representation. However, due to the large number of nodes in an AST and the typically deep AST hierarchy, it is challenging to learn the hierarchical structure of an AST effectively. In this paper, we propose HELoC, a hierarchical contrastive learning model for source code representation. To effectively learn the AST hierarchy, we use contrastive learning to allow the network to predict the AST node level and learn the hierarchical relationships between nodes in a self-supervised manner, which makes the representation vectors of nodes with greater differences in AST levels farther apart in the embedding space. By using such vectors, the structural similarities between code snippets can be measured more precisely. In the learning process, a novel GNN (called Residual Self-attention Graph Neural Network, RSGNN) is designed, which enables HELoC to focus on embedding the local structure of an AST while capturing its overall structure. HELoC is self-supervised and can be applied to many source code related downstream tasks such as code classification, code clone detection, and code clustering after pre-training. Our extensive experiments demonstrate that HELoC outperforms the state-of-the-art source code representation models.

preprint2022arXiv

Intrinsic new properties of a quantum spin liquid

Quantum fluctuations are expected to lead to highly entangled spin-liquid states in certain two-dimensional spin-1/2 compounds. We have synthesized and measured thermodynamic properties and muon spin relaxation rates in the copper-based two-dimensional triangular-lattice spin liquids Lu$_3$Cu$_2$Sb$_3$O$_{14}$ and Lu$_3$CuZnSb$_3$O$_{14}$. The former is the least disordered of this kind discovered to date. Magnetic entropy generation at high temperatures has been ruled out after carefully correcting for the lattice specific heat. Surprisingly, roughly half of the magnetic entropy is missing down to temperatures of O(10$^{-3}$) the exchange energy, independent of magnetic field up to $gμ_B H \gtrsim k_BΘ_W$, where $Θ_W$ is the Weiss temperature. The magnetic specific heat divided by temperature $C_M(T)/T$ and muon spin relaxation rate $λ(T)$ are both temperature-independent at low temperatures, followed by logarithmic decreases with increasing temperature. This behavior can be simply characterized by scale-invariant time-dependent fluctuations with a single parameter. Since no cooperative effects due to impurities are observed, the measured properties are intrinsic. They are evidence that in Lu$_3$Cu$_2$Sb$_3$O$_{14}$ massive quantum fluctuations lead to either a gigantic specific heat peak from singlet excitations at very low temperatures or, perhaps less likely, an extensively degenerate possibly topological singlet ground state.

preprint2022arXiv

Layer-dependent interlayer antiferromagnetic spin reorientation in air-stable semiconductor CrSBr

Magnetic van der Waals (vdW) materials offer a fantastic platform to investigate and exploit rich spin configurations stabilized in reduced dimensions. One tantalizing magnetic order is the interlayer antiferromagnetism in A-type vdW antiferromagnet, which may be effectively modified by the magnetic field, stacking order and thickness scaling. However, atomically revealing the interlayer spin orientation in the vdW antiferromagnet is highly challenging, because most of the material candidates exhibit an insulating ground state or instability in ambient conditions. Here, we report the layer-dependent interlayer antiferromagnetic reorientation in air-stable semiconductor CrSBr using magnetotransport characterization and first-principles calculations. We reveal a pronounced odd-even layer effect of interlayer reorientation, which originates from the competitions among interlayer exchange, magnetic anisotropy energy and extra Zeeman energy of uncompensated magnetization. Furthermore, we quantitatively constructed the layer-dependent magnetic phase diagram with the help of a linear-chain model. Our work uncovers the layer-dependent interlayer antiferromagnetic reorientation engineered by magnetic field in the air-stable semiconductor, which could contribute to future vdW spintronic devices.

preprint2022arXiv

Preference Robust Modified Optimized Certainty Equivalent

Ben-Tal and Teboulle \cite{BTT86} introduce the concept of optimized certainty equivalent (OCE) of an uncertain outcome as the maximum present value of a combination of the cash to be taken out from the uncertain income at present and the expected utility value of the remaining uncertain income. In this paper, we consider two variations of the OCE. First, we introduce a modified OCE by maximizing the combination of the utility of the cash and the expected utility of the remaining uncertain income so that the combined quantity is in a unified utility value. Second, we consider a situation where the true utility function is unknown but it is possible to use partially available information to construct a set of plausible utility functions. To mitigate the risk arising from the ambiguity, we introduce a robust model where the modified OCE is based on the worst-case utility function from the ambiguity set. In the case when the ambiguity set of utility functions is constructed by a Kantorovich ball centered at a nominal utility function, we show how the modified OCE and the corresponding worst case utility function can be identified by solving two linear programs alternatively. We also show the robust modified OCE is statistically robust in a data-driven environment where the underlying data are potentially contaminated. Some preliminary numerical results are reported to demonstrate the performance of the modified OCE and the robust modified OCE model.

preprint2022arXiv

Time-Dependent Performance Modeling for Platooning Communications at Intersection

With the development of internet of vehicles, platooning strategy has been widely studied as the potential approach to ensure the safety of autonomous driving. Vehicles in the form of platoon adopt 802.11p to exchange messages through vehicle to vehicle (V2V) communications. When multiple platoons arrive at an intersection, the leader vehicle of each platoon adjusts its movement characteristics to ensure that it can cross the intersection and thus the following vehicles have to adjust their movement characteristics accordingly. In this case, the time-varying connectivity among vehicles leads to the significant non-stationary performance change in platooning communications, which may incur safety issues. In this paper, we construct the time-dependent model to evaluate the platooning communication performance at the intersection based on the initial movement characteristics. We first consider the movement behaviors of vehicles at the intersection including turning, accelerating, decelerating and stopping as well as the periodic change of traffic lights to construct movement model, and then establish a hearing network to reflect the time-varying connectivity among vehicles. Afterwards, we adopt the pointwise stationary fluid flow approximation (PSFFA) to model the non-stationary behavior of transmission queue. Then, we consider four access categories (ACs) and continuous backoff freezing of 802.11p to construct the models to describe the time-dependent access process of 802.11p. Finally, based on the time-dependent model, the packet transmission delay and packet delivery ratio are derived. The accuracy of our proposed model is verified by comparing the simulation results with analytical results.

preprint2021arXiv

A significant detection of X-ray Polarization in Sco X-1 with PolarLight and constraints on the corona geometry

We report the detection of X-ray polarization in the neutron star low mass X-ray binary Scorpius (Sco) X-1 with PolarLight. The result is energy dependent, with a non-detection in 3-4 keV but a 4$σ$ detection in 4-8 keV; it is also flux dependent in the 4-8 keV band, with a non-detection when the source displays low fluxes but a 5$σ$ detection during high fluxes, in which case we obtain a polarization fraction of $0.043 \pm 0.008$ and a polarization angle of $52.6^\circ \pm 5.4^\circ$. This confirms a previous marginal detection with OSO-8 in the 1970s, and marks Sco X-1 the second astrophysical source with a significant polarization measurement in the keV band. The measured polarization angle is in line with the jet orientation of the source on the sky plane ($54^\circ$), which is supposedly the symmetric axis of the system. Combining previous spectral analysis, our measurements suggest that an optically thin corona is located in the transition layer under the highest accretion rates, and disfavor the extended accretion disk corona model.

preprint2021arXiv

Deep Reinforcement Learning with Spatio-temporal Traffic Forecasting for Data-Driven Base Station Sleep Control

To meet the ever increasing mobile traffic demand in 5G era, base stations (BSs) have been densely deployed in radio access networks (RANs) to increase the network coverage and capacity. However, as the high density of BSs is designed to accommodate peak traffic, it would consume an unnecessarily large amount of energy if BSs are on during off-peak time. To save the energy consumption of cellular networks, an effective way is to deactivate some idle base stations that do not serve any traffic demand. In this paper, we develop a traffic-aware dynamic BS sleep control framework, named DeepBSC, which presents a novel data-driven learning approach to determine the BS active/sleep modes while meeting lower energy consumption and satisfactory Quality of Service (QoS) requirements. Specifically, the traffic demands are predicted by the proposed GS-STN model, which leverages the geographical and semantic spatial-temporal correlations of mobile traffic. With accurate mobile traffic forecasting, the BS sleep control problem is cast as a Markov Decision Process that is solved by Actor-Critic reinforcement learning methods. To reduce the variance of cost estimation in the dynamic environment, we propose a benchmark transformation method that provides robust performance indicator for policy update. To expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach, together with an explorer network, which can strengthen the exploration further. Extensive experiments with a real-world dataset corroborate that our proposed framework significantly outperforms the existing methods.

preprint2021arXiv

Double Quarter Wave Crab Cavity Wire Stretching Measurement at BNL

The wire stretching measurement was completed on the prototype Double Quarter Wave (DQW) crab cavity for operation practice and calibration of the measurement system. Four locations were defined to be on the electrical center plane of the crab cavity, and survey of the wire indicated all are on the same plane. The successful measurement validated the wire stretching system built at Brookhaven National Lab. The offset of the four wire locations to the fitted plane provided the error of the measurement.

preprint2020arXiv

DeepCP: Deep Learning Driven Cascade Prediction Based Autonomous Content Placement in Closed Social Network

Online social networks (OSNs) are emerging as the most popular mainstream platform for content cascade diffusion. In order to provide satisfactory quality of experience (QoE) for users in OSNs, much research dedicates to proactive content placement by using the propagation pattern, user's personal profiles and social relationships in open social network scenarios (e.g., Twitter and Weibo). In this paper, we take a new direction of popularity-aware content placement in a closed social network (e.g., WeChat Moment) where user's privacy is highly enhanced. We propose a novel data-driven holistic deep learning framework, namely DeepCP, for joint diffusion-aware cascade prediction and autonomous content placement without utilizing users' personal and social information. We first devise a time-window LSTM model for content popularity prediction and cascade geo-distribution estimation. Accordingly, we further propose a novel autonomous content placement mechanism CP-GAN which adopts the generative adversarial network (GAN) for agile placement decision making to reduce the content access latency and enhance users' QoE. We conduct extensive experiments using cascade diffusion traces in WeChat Moment (WM). Evaluation results corroborate that the proposed DeepCP framework can predict the content popularity with a high accuracy, generate efficient placement decision in a real-time manner, and achieve significant content access latency reduction over existing schemes.

preprint2020arXiv

Demonstration of Planar Ultrananocrystalline Diamond Field Emission Source Operating in SRF Injector at 2 Kelvin

Reported here is the first demonstration of electron beam generation in an SRF TESLA 1.3 GHz gun equipped with field emission cathode when operated at 2 Kelvin. The cathode is submicron film of nitrogen-incorporated ultrananocrystalline diamond [(N)UNCD] deposited atop a Nb RRR300 cathode plug. The output current was measured to increase exponentially as a function of the cavity gradient. Our results demonstrate a feasible path toward simplified fully cryogenic SRF injector technology. One important finding is that the electron emitter made of (N)UNCD, a material long been known as a highly efficient field emission material, demonstrated a record low turn-on gradient of 0.6 MV/m. A hypothesis explaining this behavior is proposed.

preprint2020arXiv

HFEL: Joint Edge Association and Resource Allocation for Cost-Efficient Hierarchical Federated Edge Learning

Federated Learning (FL) has been proposed as an appealing approach to handle data privacy issue of mobile devices compared to conventional machine learning at the remote cloud with raw user data uploading. By leveraging edge servers as intermediaries to perform partial model aggregation in proximity and relieve core network transmission overhead, it enables great potentials in low-latency and energy-efficient FL. Hence we introduce a novel Hierarchical Federated Edge Learning (HFEL) framework in which model aggregation is partially migrated to edge servers from the cloud. We further formulate a joint computation and communication resource allocation and edge association problem for device users under HFEL framework to achieve global cost minimization. To solve the problem, we propose an efficient resource scheduling algorithm in the HFEL framework. It can be decomposed into two subproblems: \emph{resource allocation} given a scheduled set of devices for each edge server and \emph{edge association} of device users across all the edge servers. With the optimal policy of the convex resource allocation subproblem for a set of devices under a single edge server, an efficient edge association strategy can be achieved through iterative global cost reduction adjustment process, which is shown to converge to a stable system point. Extensive performance evaluations demonstrate that our HFEL framework outperforms the proposed benchmarks in global cost saving and achieves better training performance compared to conventional federated learning.

preprint2020arXiv

In-orbit Operation and Performance of the CubeSat Soft X-ray Polarimeter PolarLight

PolarLight is a compact soft X-ray polarimeter onboard a CubeSat, which was launched into a low-Earth orbit on October 29, 2018. In March 2019, PolarLight started full operation, and since then, regular observations with the Crab nebula, Sco X-1, and background regions have been conducted. Here we report the operation, calibration, and performance of PolarLight in the orbit. Based on these, we discuss how one can run a low-cost, shared CubeSat for space astronomy, and how CubeSats can play a role in modern space astronomy for technical demonstration, science observations, and student training.

preprint2020arXiv

Learning Task-oriented Disentangled Representations for Unsupervised Domain Adaptation

Unsupervised domain adaptation (UDA) aims to address the domain-shift problem between a labeled source domain and an unlabeled target domain. Many efforts have been made to address the mismatch between the distributions of training and testing data, but unfortunately, they ignore the task-oriented information across domains and are inflexible to perform well in complicated open-set scenarios. Many efforts have been made to eliminate the mismatch between the distributions of training and testing data by learning domain-invariant representations. However, the learned representations are usually not task-oriented, i.e., being class-discriminative and domain-transferable simultaneously. This drawback limits the flexibility of UDA in complicated open-set tasks where no labels are shared between domains. In this paper, we break the concept of task-orientation into task-relevance and task-irrelevance, and propose a dynamic task-oriented disentangling network (DTDN) to learn disentangled representations in an end-to-end fashion for UDA. The dynamic disentangling network effectively disentangles data representations into two components: the task-relevant ones embedding critical information associated with the task across domains, and the task-irrelevant ones with the remaining non-transferable or disturbing information. These two components are regularized by a group of task-specific objective functions across domains. Such regularization explicitly encourages disentangling and avoids the use of generative models or decoders. Experiments in complicated, open-set scenarios (retrieval tasks) and empirical benchmarks (classification tasks) demonstrate that the proposed method captures rich disentangled information and achieves superior performance.

preprint2020arXiv

Personalized Federated Learning for Intelligent IoT Applications: A Cloud-Edge based Framework

Internet of Things (IoT) have widely penetrated in different aspects of modern life and many intelligent IoT services and applications are emerging. Recently, federated learning is proposed to train a globally shared model by exploiting a massive amount of user-generated data samples on IoT devices while preventing data leakage. However, the device, statistical and model heterogeneities inherent in the complex IoT environments pose great challenges to traditional federated learning, making it unsuitable to be directly deployed. In this article we advocate a personalized federated learning framework in a cloud-edge architecture for intelligent IoT applications. To cope with the heterogeneity issues in IoT environments, we investigate emerging personalized federated learning methods which are able to mitigate the negative effects caused by heterogeneity in different aspects. With the power of edge computing, the requirements for fast-processing capacity and low latency in intelligent IoT applications can also be achieved. We finally provide a case study of IoT based human activity recognition to demonstrate the effectiveness of personalized federated learning for intelligent IoT applications.