Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
17works
0followers
13topics
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

17 published item(s)

preprint2026arXiv

AIConfigurator: Lightning-Fast Configuration Optimization for Multi-Framework LLM Serving

Optimizing Large Language Model (LLM) inference in production systems is increasingly difficult due to dynamic workloads, stringent latency/throughput targets, and a rapidly expanding configuration space. This complexity spans not only distributed parallelism strategies (tensor/pipeline/expert) but also intricate framework-specific runtime parameters such as those concerning the enablement of CUDA graphs, available KV-cache memory fractions, and maximum token capacity, which drastically impact performance. The diversity of modern inference frameworks (e.g., TRT-LLM, vLLM, SGLang), each employing distinct kernels and execution policies, makes manual tuning both framework-specific and computationally prohibitive. We present AIConfigurator, a unified performance-modeling system that enables rapid, framework-agnostic inference configuration search without requiring GPU-based profiling. AIConfigurator combines (1) a methodology that decomposes inference into analytically modelable primitives - GEMM, attention, communication, and memory operations while capturing framework-specific scheduling dynamics; (2) a calibrated kernel-level performance database for these primitives across a wide range of hardware platforms and popular open-weights models (GPT-OSS, Qwen, DeepSeek, LLama, Mistral); and (3) an abstraction layer that automatically resolves optimal launch parameters for the target backend, seamlessly integrating into production-grade orchestration systems. Evaluation on production LLM serving workloads demonstrates that AIConfigurator identifies superior serving configurations that improve performance by up to 40% for dense models (e.g., Qwen3-32B) and 50% for MoE architectures (e.g., DeepSeek-V3), while completing searches within 30 seconds on average. Enabling the rapid exploration of vast design spaces - from cluster topology down to engine specific flags.

preprint2026arXiv

DataClawBench: An Agent Benchmark for Exploratory Real-World Financial Data Analysis

Autonomous data analysis agents are increasingly expected to conduct exploratory analysis over underexplored data environments. This burden is especially salient in complex financial analytics, where relevant evidence is rarely pre-specified. However, existing benchmarks typically evaluate such agents in prior-guided settings, providing selected data sources, explicit data schemas, or cleaned data, thereby understating the exploratory burden. We introduce DataClawBench, a benchmark for exploratory real-world financial data analysis under limited prior guidance. DataClawBench contains approximately 2.06 million real-world records across enterprise, industry, and policy domains, with native data noise preserved. It further includes 492 cross-domain tasks derived from think-tank consulting scenarios, each annotated with intermediate milestones that diagnose exploration and reasoning failures beyond outcome accuracy. A systematic evaluation of eight advanced LLMs under the OpenClaw agent reveals that exploratory data analysis breaks agent reliability: more exploration does not reliably translate into task-relevant progress or correct final answers.

preprint2026arXiv

MemHunter: Automated and Verifiable Memorization Detection at Dataset-scale in LLMs

Large language models (LLMs) have been shown to memorize and reproduce content from their training data, raising significant privacy concerns, especially with web-scale datasets. Existing methods for detecting memorization are primarily sample-specific, relying on manually crafted or discretely optimized memory-inducing prompts generated on a per-sample basis, which become impractical for dataset-level detection due to the prohibitive computational cost of iterating through all samples. In real-world scenarios, data owners may need to verify whether a susceptible LLM has memorized their dataset, particularly if the LLM may have collected the data from the web without authorization. To address this, we introduce MemHunter, which trains a memory-inducing LLM and employs hypothesis testing to efficiently detect memorization at the dataset level, without requiring sample-specific memory inducing. Experiments on models like Pythia and Llama demonstrate that MemHunter can extract up to 40% more training data than existing methods under constrained time resources and reduce search time by up to 80% when integrated as a plug-in. Crucially, MemHunter is the first method capable of dataset-level memorization detection, providing a critical tool for assessing privacy risks in LLMs powered by large-scale datasets.

preprint2023arXiv

Nature of visons in the perturbed ferromagnetic and antiferromagnetic Kitaev honeycomb models

The Kitaev honeycomb model hosts a fascinating fractionalized state of matter featuring emergent Majorana fermions and a vison particle that carries the flux of an emergent gauge field. In the exactly solvable model these visons are static but certain perturbations can induce their motion. We show that the nature of the vison motion induced by a Zeeman field is sharply distinct in the ferromagnetic vs the antiferromagnetic Kitaev models. Namely, in the ferromagnetic model the vison has a trivial non-projective translational symmetry, whereas in the antiferromagnetic Kitaev model it has a projective translational symmetry with $π$-flux per unit cell. The vison band of the ferromagnetic case has zero Berry curvature, and no associated intrinsic contribution to the thermal Hall effect. In contrast, in the antiferromagnetic case there are two gapped vison bands with opposite Chern numbers and an associated intrinsic vison contribution to the thermal Hall effect. We discuss these findings in the light of the physics of the spin liquid candidate $α$-RuCl$_3$.

preprint2022arXiv

A Decentralized Federated Learning Framework via Committee Mechanism with Convergence Guarantee

Federated learning allows multiple participants to collaboratively train an efficient model without exposing data privacy. However, this distributed machine learning training method is prone to attacks from Byzantine clients, which interfere with the training of the global model by modifying the model or uploading the false gradient. In this paper, we propose a novel serverless federated learning framework Committee Mechanism based Federated Learning (CMFL), which can ensure the robustness of the algorithm with convergence guarantee. In CMFL, a committee system is set up to screen the uploaded local gradients. The committee system selects the local gradients rated by the elected members for the aggregation procedure through the selection strategy, and replaces the committee member through the election strategy. Based on the different considerations of model performance and defense, two opposite selection strategies are designed for the sake of both accuracy and robustness. Extensive experiments illustrate that CMFL achieves faster convergence and better accuracy than the typical Federated Learning, in the meanwhile obtaining better robustness than the traditional Byzantine-tolerant algorithms, in the manner of a decentralized approach. In addition, we theoretically analyze and prove the convergence of CMFL under different election and selection strategies, which coincides with the experimental results.

preprint2022arXiv

Decisive role of electron-phonon coupling for phonon and electron instabilities in transition metal dichalcogenides

The origin of the charge density wave (CDW) in transition metal dichalcognides has been in hot debate and no conclusive agreement has been reached. Here, we propose an ab-initio framework for an accurate description of both Fermi surface nesting and electron-phonon coupling (EPC) and systematically investigate their roles in the formation of CDW. Using monolayer 1H-NbSe$_2$ and 1T-VTe$_2$ as representative examples, we show that it is the momentum-dependent EPC softens the phonon frequencies, which become imaginary (phonon instabilities) at CDW vectors (indicating CDW formation). Besides, the distribution of the CDW gap opening (electron instabilities) can be correctly predicted only if EPC is included in the mean-field model. These results emphasize the decisive role of EPC in the CDW formation. Our analytical process is general and can be applied to other CDW systems.

preprint2022arXiv

Distributed Evolution Strategies for Black-box Stochastic Optimization

This work concerns the evolutionary approaches to distributed stochastic black-box optimization, in which each worker can individually solve an approximation of the problem with nature-inspired algorithms. We propose a distributed evolution strategy (DES) algorithm grounded on a proper modification to evolution strategies, a family of classic evolutionary algorithms, as well as a careful combination with existing distributed frameworks. On smooth and nonconvex landscapes, DES has a convergence rate competitive to existing zeroth-order methods, and can exploit the sparsity, if applicable, to match the rate of first-order methods. The DES method uses a Gaussian probability model to guide the search and avoids the numerical issue resulted from finite-difference techniques in existing zeroth-order methods. The DES method is also fully adaptive to the problem landscape, as its convergence is guaranteed with any parameter setting. We further propose two alternative sampling schemes which significantly improve the sampling efficiency while leading to similar performance. Simulation studies on several machine learning problems suggest that the proposed methods show much promise in reducing the convergence time and improving the robustness to parameter settings.

preprint2022arXiv

FedEgo: Privacy-preserving Personalized Federated Graph Learning with Ego-graphs

As special information carriers containing both structure and feature information, graphs are widely used in graph mining, e.g., Graph Neural Networks (GNNs). However, in some practical scenarios, graph data are stored separately in multiple distributed parties, which may not be directly shared due to conflicts of interest. Hence, federated graph neural networks are proposed to address such data silo problems while preserving the privacy of each party (or client). Nevertheless, different graph data distributions among various parties, which is known as the statistical heterogeneity, may degrade the performance of naive federated learning algorithms like FedAvg. In this paper, we propose FedEgo, a federated graph learning framework based on ego-graphs to tackle the challenges above, where each client will train their local models while also contributing to the training of a global model. FedEgo applies GraphSAGE over ego-graphs to make full use of the structure information and utilizes Mixup for privacy concerns. To deal with the statistical heterogeneity, we integrate personalization into learning and propose an adaptive mixing coefficient strategy that enables clients to achieve their optimal personalization. Extensive experimental results and in-depth analysis demonstrate the effectiveness of FedEgo.

preprint2021arXiv

Competition of Spinon Fermi Surface and Heavy Fermi Liquids states from the Periodic Anderson to the Hubbard model

We study a model of correlated electrons coupled by tunnelling to a layer of itinerant metallic electrons, which allows to interpolate from a frustrated limit favorable to spin liquid states to a Kondo-lattice limit favorable to interlayer coherent heavy metallic states. We study the competition of the spinon fermi surface state and the interlayer coherent heavy Kondo metal that appears with increasing tunnelling. Employing a slave rotor mean-field approach, we obtain a phase diagram and describe two regimes where the spin liquid state is destroyed by weak interlayer tunnelling, (i) the Kondo limit in which the correlated electrons can be viewed as localized spin moments and (ii) near the Mott metal-insulator-transition where the spinon Fermi surface transitions continuously into a Fermi liquid. We study the shape of LDOS spectra of the putative spin liquid layer in the heavy Fermi liquid phase and describe the temperature dependence of its width arising from quasiparticle interactions and disorder effects throughout this phase diagram, in an effort to understand recent STM experiments of the candidate spin liquid 1T-TaSe$_2$ residing on metallic 1H-TaSe$_2$. Comparison of the shape and temperature dependence of the theoretical and experimental LDOS suggest that this system is either close to the localized Kondo limit, or in an intermediate coupling regime where the Kondo coupling and the Heisenberg exchange interaction are comparable.

preprint2021arXiv

Outlier-Resilient Web Service QoS Prediction

The proliferation of Web services makes it difficult for users to select the most appropriate one among numerous functionally identical or similar service candidates. Quality-of-Service (QoS) describes the non-functional characteristics of Web services, and it has become the key differentiator for service selection. However, users cannot invoke all Web services to obtain the corresponding QoS values due to high time cost and huge resource overhead. Thus, it is essential to predict unknown QoS values. Although various QoS prediction methods have been proposed, few of them have taken outliers into consideration, which may dramatically degrade the prediction performance. To overcome this limitation, we propose an outlier-resilient QoS prediction method in this paper. Our method utilizes Cauchy loss to measure the discrepancy between the observed QoS values and the predicted ones. Owing to the robustness of Cauchy loss, our method is resilient to outliers. We further extend our method to provide time-aware QoS prediction results by taking the temporal information into consideration. Finally, we conduct extensive experiments on both static and dynamic datasets. The results demonstrate that our method is able to achieve better performance than state-of-the-art baseline methods.

preprint2020arXiv

An Uncoupled Training Architecture for Large Graph Learning

Graph Convolutional Network (GCN) has been widely used in graph learning tasks. However, GCN-based models (GCNs) is an inherently coupled training framework repetitively conducting the complex neighboring aggregation, which leads to the limitation of flexibility in processing large-scale graph. With the depth of layers increases, the computational and memory cost of GCNs grow explosively due to the recursive neighborhood expansion. To tackle these issues, we present Node2Grids, a flexible uncoupled training framework that leverages the independent mapped data for obtaining the embedding. Instead of directly processing the coupled nodes as GCNs, Node2Grids supports a more efficacious method in practice, mapping the coupled graph data into the independent grid-like data which can be fed into the efficient Convolutional Neural Network (CNN). This simple but valid strategy significantly saves memory and computational resource while achieving comparable results with the leading GCN-based models. Specifically, by ranking each node's influence through degree, Node2Grids selects the most influential first-order as well as second-order neighbors with central node fusion information to construct the grid-like data. For further improving the efficiency of downstream tasks, a simple CNN-based neural network is employed to capture the significant information from the mapped grid-like data. Moreover, the grid-level attention mechanism is implemented, which enables implicitly specifying the different weights for neighboring nodes with different influences. In addition to the typical transductive and inductive learning tasks, we also verify our framework on million-scale graphs to demonstrate the superiority of the proposed Node2Grids model against the state-of-the-art GCN-based approaches.

preprint2020arXiv

Anatomy of Z2 fluxes in anyon Fermi liquids and Bose condensates

We study in detail the properties of pi-fluxes embedded in a state with a finite density of anyons that form either a Fermi liquid or a Bose-Einstein condensate. By employing a recently developed exact lattice bosonization in 2D, we demonstrate that such pi-flux remains a fully deconfined quasiparticle with a finite energy cost in a Fermi liquid of emergent fermions coupled to a Z2 gauge field. This pi-flux is accompanied by a screening cloud of fermions, which in the case of a Fermi gas with a parabolic dispersion binds exactly 1/8 of a fermionic hole. In addition there is a long-ranged power-law oscillatory disturbance of the liquid surrounding the pi-flux akin to Friedel oscillations. These results carry over directly to the pi-flux excitations in orthogonal metals. In sharp contrast, when the pi-flux is surrounded by a Bose-Einstein condensate of particles coupled to a Z2 gauge field, it binds a superfluid half-vortex, becoming a marginally confined excitation with a logarithmic energy cost divergence.

preprint2020arXiv

Correlated states of a triangular net of coupled quantum wires: Implications for the phase diagram of marginally twisted bilayer graphene

We explore in detail the electronic phases of a system consisting of three non-colinear arrays of coupled quantum wires, each rotated 120 degrees with respect to the next. A perturbative renormalization-group analysis reveals that multiple correlated states can be stabilized: a $s$-wave or $d \pm id$ superconductor, a charge density wave insulator, a two-dimensional Fermi liquid, and a 2D Luttinger liquid (also known as smectic metal or sliding Luttinger liquid). The model provides an effective description of electronic interactions in small-angle twisted bilayer graphene and we discuss its implications in relation to the recent observation of correlated and superconducting groundstates near commensurate densities in magic-angle twisted samples, as well as the ``strange metal'' behavior at finite temperatures as a natural outcome of the 2D Luttinger liquid phase.

preprint2020arXiv

LoCEC: Local Community-based Edge Classification in Large Online Social Networks

Relationships in online social networks often imply social connections in the real world. An accurate understanding of relationship types benefits many applications, e.g. social advertising and recommendation. Some recent attempts have been proposed to classify user relationships into predefined types with the help of pre-labeled relationships or abundant interaction features on relationships. Unfortunately, both relationship feature data and label data are very sparse in real social platforms like WeChat, rendering existing methods inapplicable. In this paper, we present an in-depth analysis of WeChat relationships to identify the major challenges for the relationship classification task. To tackle the challenges, we propose a Local Community-based Edge Classification (LoCEC) framework that classifies user relationships in a social network into real-world social connection types. LoCEC enforces a three-phase processing, namely local community detection, community classification and relationship classification, to address the sparsity issue of relationship features and relationship labels. Moreover, LoCEC is designed to handle large-scale networks by allowing parallel and distributed processing. We conduct extensive experiments on the real-world WeChat network with hundreds of billions of edges to validate the effectiveness and efficiency of LoCEC.

preprint2020arXiv

SocialTrans: A Deep Sequential Model with Social Information for Web-Scale Recommendation Systems

On social network platforms, a user's behavior is based on his/her personal interests, or influenced by his/her friends. In the literature, it is common to model either users' personal preference or their socially influenced preference. In this paper, we present a novel deep learning model SocialTrans for social recommendations to integrate these two types of preferences. SocialTrans is composed of three modules. The first module is based on a multi-layer Transformer to model users' personal preference. The second module is a multi-layer graph attention neural network (GAT), which is used to model the social influence strengths between friends in social networks. The last module merges users' personal preference and socially influenced preference to produce recommendations. Our model can efficiently fit large-scale data and we deployed SocialTrans to a major article recommendation system in China. Experiments on three data sets verify the effectiveness of our model and show that it outperforms state-of-the-art social recommendation methods.

preprint2020arXiv

Who Are the Phishers? Phishing Scam Detection on Ethereum via Network Embedding

Recently, blockchain technology has become a topic in the spotlight but also a hotbed of various cybercrimes. Among them, phishing scams on blockchain have been found making a notable amount of money, thus emerging as a serious threat to the trading security of the blockchain ecosystem. In order to create a favorable environment for investment, an effective method for detecting phishing scams is urgently needed in the blockchain ecosystem. To this end, this paper proposes an approach to detect phishing scams on Ethereum by mining its transaction records. Specifically, we first crawl the labeled phishing addresses from two authorized websites and reconstruct the transaction network according to the collected transaction records. Then, by taking the transaction amount and timestamp into consideration, we propose a novel network embedding algorithm called trans2vec to extract the features of the addresses for subsequent phishing identification. Finally, we adopt the oneclass support vector machine (SVM) to classify the nodes into normal and phishing ones. Experimental results demonstrate that the phishing detection method works effectively on Ethereum, and indicate the efficacy of trans2vec over existing state-of-the-art algorithms on feature extraction for transaction networks. This work is the first investigation on phishing detection on Ethereum via network embedding and provides insights into how features of large-scale transaction networks can be embedded.

preprint2019arXiv

Antiferromagnetism and chiral d-wave superconductivity from an effective $t-J-D$ model for twisted bilayer graphene

Starting from the strong-coupling limit of an extended Hubbard model, we develop a spin-fermion theory to study the insulating phase and pairing symmetry of the superconducting phase in twisted bilayer graphene. Assuming that the insulating phase is an anti-ferromagnetic insulator, we show that fluctuations of the anti-ferromagnetic order in the conducting phase can mediate superconducting pairing. Using a self-consistent mean-field analysis, we find that the pairing wave function has a chiral d-wave symmetry. Consistent with this observation, we show explicitly the existence of chiral Majorana edge modes by diagonalizing our proposed Hamiltonian on a finite-sized system. These results establish twisted bilayer graphene as a promising platform to realize topological superconductivity.