Source author record

Weijie Zhao

Weijie Zhao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

22works
10topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

22 published item(s)

preprint2026arXiv

DebiasRAG: A Tuning-Free Path to Fair Generation in Large Language Models through Retrieval-Augmented Generation

Large language models (LLMs) have achieved unprecedented success due to their exceptional generative capabilities. However, because they depend on knowledge encapsulated from training corpora, they may produce hallucinations, stereotypes, and socially biased content. In particular, LLMs are prone to prejudiced responses involving race, gender, and age, which are collectively referred to as social biases. Prior studies have used fine-tuning and prompt engineering to mitigate such biases in LLMs, but these methods require additional training resources or domain knowledge to design the framework. Moreover, they may degrade the original capabilities of LLMs and often overlook the need for dynamic debiasing contexts for fairer inference. In this paper, we propose DebiasRAG, a novel tuning-free and dynamic query-specific debiasing framework based on retrieval-augmented generation (RAG). DebiasRAG improves fairness while preserving the intrinsic properties of LLMs, such as representation ability. DebiasRAG consists of three stages: (1) query-specific debiasing candidate generation; (2) context candidate pool construction; and (3) gradient-updated debiasing-guided context piece reranking. First, DebiasRAG leverages self-diagnosed bias contexts relevant to the query through regular retrieval, where the bias contexts are prepared offline by the DebiasRAG provider. Given the query-specific bias contexts, DebiasRAG reversely produces debiasing contexts, which are provided as additional fairness constraints for LLM outputs. Second, a regular RAG retrieval process produces query-related contexts from the regular RAG document database, such as a chunked Wikipedia dataset.

preprint2026arXiv

HIVE: Hidden-Evidence Verification for Hallucination Detection in Diffusion Large Language Models

Diffusion large language models generate text through multi-step denoising, where hallucination signals may emerge throughout the trajectory rather than only in the final output. Existing detectors mainly rely on output uncertainty or coarse trace statistics, which often fail to capture the richer hidden dynamics of D-LLMs. We propose HIVE, a hidden-evidence verification framework that extracts compressed hidden evidence from denoising trajectories, selects informative step-layer evidence, and conditions a verifier language model on the selected evidence through prefix embeddings. HIVE produces both a continuous hallucination score from verifier decision logits and structured verification outputs, including hallucination types, evidence pairs, and short rationales. Across two D-LLMs and three QA benchmarks, HIVE consistently outperforms eight strong baselines and achieves up to 0.9236 AUROC and 0.9537 AUPRC. Ablation studies further confirm the importance of hidden-evidence conditioning, learned evidence selection, two-stream evidence representation, and step-layer embeddings. These results suggest that selected hidden evidence from denoising trajectories provides a stronger and more usable hallucination signal than output-only uncertainty or coarse trace statistics.

preprint2022arXiv

Communication-Efficient TeraByte-Scale Model Training Framework for Online Advertising

Click-Through Rate (CTR) prediction is a crucial component in the online advertising industry. In order to produce a personalized CTR prediction, an industry-level CTR prediction model commonly takes a high-dimensional (e.g., 100 or 1000 billions of features) sparse vector (that is encoded from query keywords, user portraits, etc.) as input. As a result, the model requires Terabyte scale parameters to embed the high-dimensional input. Hierarchical distributed GPU parameter server has been proposed to enable GPU with limited memory to train the massive network by leveraging CPU main memory and SSDs as secondary storage. We identify two major challenges in the existing GPU training framework for massive-scale ad models and propose a collection of optimizations to tackle these challenges: (a) the GPU, CPU, SSD rapidly communicate with each other during the training. The connections between GPUs and CPUs are non-uniform due to the hardware topology. The data communication route should be optimized according to the hardware topology; (b) GPUs in different computing nodes frequently communicates to synchronize parameters. We are required to optimize the communications so that the distributed system can become scalable. In this paper, we propose a hardware-aware training workflow that couples the hardware topology into the algorithm design. To reduce the extensive communication between computing nodes, we introduce a $k$-step model merging algorithm for the popular Adam optimizer and provide its convergence rate in non-convex optimization. To the best of our knowledge, this is the first application of $k$-step adaptive optimization method in industrial-level CTR model training. The numerical results on real-world data confirm that the optimized system design considerably reduces the training time of the massive model, with essentially no loss in accuracy.

preprint2022arXiv

Fast ABC-Boost: A Unified Framework for Selecting the Base Class in Multi-Class Classification

The work in ICML'09 showed that the derivatives of the classical multi-class logistic regression loss function could be re-written in terms of a pre-chosen "base class" and applied the new derivatives in the popular boosting framework. In order to make use of the new derivatives, one must have a strategy to identify/choose the base class at each boosting iteration. The idea of "adaptive base class boost" (ABC-Boost) in ICML'09, adopted a computationally expensive "exhaustive search" strategy for the base class at each iteration. It has been well demonstrated that ABC-Boost, when integrated with trees, can achieve substantial improvements in many multi-class classification tasks. Furthermore, the work in UAI'10 derived the explicit second-order tree split gain formula which typically improved the classification accuracy considerably, compared with using only the fist-order information for tree-splitting, for both multi-class and binary-class classification tasks. In this paper, we develop a unified framework for effectively selecting the base class by introducing a series of ideas to improve the computational efficiency of ABC-Boost. Our framework has parameters $(s,g,w)$. At each boosting iteration, we only search for the "$s$-worst classes" (instead of all classes) to determine the base class. We also allow a "gap" $g$ when conducting the search. That is, we only search for the base class at every $g+1$ iterations. We furthermore allow a "warm up" stage by only starting the search after $w$ boosting iterations. The parameters $s$, $g$, $w$, can be viewed as tunable parameters and certain combinations of $(s,g,w)$ may even lead to better test accuracy than the "exhaustive search" strategy. Overall, our proposed framework provides a robust and reliable scheme for implementing ABC-Boost in practice.

preprint2022arXiv

GCWSNet: Generalized Consistent Weighted Sampling for Scalable and Accurate Training of Neural Networks

We develop the "generalized consistent weighted sampling" (GCWS) for hashing the "powered-GMM" (pGMM) kernel (with a tuning parameter $p$). It turns out that GCWS provides a numerically stable scheme for applying power transformation on the original data, regardless of the magnitude of $p$ and the data. The power transformation is often effective for boosting the performance, in many cases considerably so. We feed the hashed data to neural networks on a variety of public classification datasets and name our method ``GCWSNet''. Our extensive experiments show that GCWSNet often improves the classification accuracy. Furthermore, it is evident from the experiments that GCWSNet converges substantially faster. In fact, GCWS often reaches a reasonable accuracy with merely (less than) one epoch of the training process. This property is much desired because many applications, such as advertisement click-through rate (CTR) prediction models, or data streams (i.e., data seen only once), often train just one epoch. Another beneficial side effect is that the computations of the first layer of the neural networks become additions instead of multiplications because the input data become binary (and highly sparse). Empirical comparisons with (normalized) random Fourier features (NRFF) are provided. We also propose to reduce the model size of GCWSNet by count-sketch and develop the theory for analyzing the impact of using count-sketch on the accuracy of GCWS. Our analysis shows that an ``8-bit'' strategy should work well in that we can always apply an 8-bit count-sketch hashing on the output of GCWS hashing without hurting the accuracy much. There are many other ways to take advantage of GCWS when training deep neural networks. For example, one can apply GCWS on the outputs of the last layer to boost the accuracy of trained deep neural networks.

preprint2022arXiv

Integrity Authentication in Tree Models

Tree models are very widely used in practice of machine learning and data mining. In this paper, we study the problem of model integrity authentication in tree models. In general, the task of model integrity authentication is the design \& implementation of mechanisms for checking/detecting whether the model deployed for the end-users has been tampered with or compromised, e.g., malicious modifications on the model. We propose an authentication framework that enables the model builders/distributors to embed a signature to the tree model and authenticate the existence of the signature by only making a small number of black-box queries to the model. To the best of our knowledge, this is the first study of signature embedding on tree models. Our proposed method simply locates a collection of leaves and modifies their prediction values, which does not require any training/testing data nor any re-training. The experiments on a large number of public classification datasets confirm that the proposed signature embedding process has a high success rate while only introducing a minimal prediction accuracy loss.

preprint2022arXiv

Package for Fast ABC-Boost

This report presents the open-source package which implements the series of our boosting works in the past years. In particular, the package includes mainly three lines of techniques, among which the following two are already the standard implementations in popular boosted tree platforms: (i) The histogram-based (feature-binning) approach makes the tree implementation convenient and efficient. In Li et al (2007), a simple fixed-length adaptive binning algorithm was developed. In this report, we demonstrate that such a simple algorithm is still surprisingly effective compared to more sophisticated variants in popular tree platforms. (ii) The explicit gain formula in Li (20010) for tree splitting based on second-order derivatives of the loss function typically improves, often considerably, over the first-order methods. Although the gain formula in Li (2010) was derived for logistic regression loss, it is a generic formula for loss functions with second-derivatives. For example, the open-source package also includes $L_p$ regression for $p\geq 1$. The main contribution of this package is the ABC-Boost (adaptive base class boosting) for multi-class classification. The initial work in Li (2008) derived a new set of derivatives of the classical multi-class logistic regression by specifying a "base class". The accuracy can be substantially improved if the base class is chosen properly. The major technical challenge is to design a search strategy to select the base class. The prior published works implemented an exhaustive search procedure to find the base class which is computationally too expensive. Recently, a new report (Li and Zhao, 20022) presents a unified framework of "Fast ABC-Boost" which allows users to efficiently choose the proper search space for the base class. The package provides interfaces for linux, windows, mac, matlab, R, python.

preprint2022arXiv

pGMM Kernel Regression and Comparisons with Boosted Trees

In this work, we demonstrate the advantage of the pGMM (``powered generalized min-max'') kernel in the context of (ridge) regression. In recent prior studies, the pGMM kernel has been extensively evaluated for classification tasks, for logistic regression, support vector machines, as well as deep neural networks. In this paper, we provide an experimental study on ridge regression, to compare the pGMM kernel regression with the ordinary ridge linear regression as well as the RBF kernel ridge regression. Perhaps surprisingly, even without a tuning parameter (i.e., $p=1$ for the power parameter of the pGMM kernel), the pGMM kernel already performs well. Furthermore, by tuning the parameter $p$, this (deceptively simple) pGMM kernel even performs quite comparably to boosted trees. Boosting and boosted trees are very popular in machine learning practice. For regression tasks, typically, practitioners use $L_2$ boost, i.e., for minimizing the $L_2$ loss. Sometimes for the purpose of robustness, the $L_1$ boost might be a choice. In this study, we implement $L_p$ boost for $p\geq 1$ and include it in the package of ``Fast ABC-Boost''. Perhaps also surprisingly, the best performance (in terms of $L_2$ regression loss) is often attained at $p>2$, in some cases at $p\gg 2$. This phenomenon has already been demonstrated by Li et al (UAI 2010) in the context of k-nearest neighbor classification using $L_p$ distances. In summary, the implementation of $L_p$ boost provides practitioners the additional flexibility of tuning boosting algorithms for potentially achieving better accuracy in regression applications.

preprint2022arXiv

Proximity Graph Maintenance for Fast Online Nearest Neighbor Search

Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems. Recent studies bring proximity graph-based methods into practitioners' attention -- proximity graph-based methods outperform other solutions such as quantization, hashing, and tree-based ANN algorithm families. In current recommendation systems, data point insertions, deletions, and queries are streamed into the system in an online fashion as users and items change dynamically. As proximity graphs are constructed incrementally by inserting data points as new vertices into the graph, online insertions and queries are well-supported in proximity graph. However, a data point deletion incurs removing a vertex from the proximity graph index, while no proper graph index updating mechanisms are discussed in previous studies. To tackle the challenge, we propose an incremental proximity graph maintenance (IPGM) algorithm for online ANN. IPGM supports both vertex deletion and insertion on proximity graphs. Given a vertex deletion request, we thoroughly investigate solutions to update the connections of the vertex. The proposed updating scheme eliminates the performance drop in online ANN methods on proximity graphs, making the algorithm suitable for practical systems.

preprint2020arXiv

Distributed Hierarchical GPU Parameter Server for Massive Scale Deep Learning Ads Systems

Neural networks of ads systems usually take input from multiple resources, e.g., query-ad relevance, ad features and user portraits. These inputs are encoded into one-hot or multi-hot binary features, with typically only a tiny fraction of nonzero feature values per example. Deep learning models in online advertising industries can have terabyte-scale parameters that do not fit in the GPU memory nor the CPU main memory on a computing node. For example, a sponsored online advertising system can contain more than $10^{11}$ sparse features, making the neural network a massive model with around 10 TB parameters. In this paper, we introduce a distributed GPU hierarchical parameter server for massive scale deep learning ads systems. We propose a hierarchical workflow that utilizes GPU High-Bandwidth Memory, CPU main memory and SSD as 3-layer hierarchical storage. All the neural network training computations are contained in GPUs. Extensive experiments on real-world data confirm the effectiveness and the scalability of the proposed system. A 4-node hierarchical GPU parameter server can train a model more than 2X faster than a 150-node in-memory distributed parameter server in an MPI cluster. In addition, the price-performance ratio of our proposed system is 4-9 times better than an MPI-cluster solution.

preprint2020arXiv

F2GAN: Fusing-and-Filling GAN for Few-shot Image Generation

In order to generate images for a given category, existing deep generative models generally rely on abundant training images. However, extensive data acquisition is expensive and fast learning ability from limited data is necessarily required in real-world applications. Also, these existing methods are not well-suited for fast adaptation to a new category. Few-shot image generation, aiming to generate images from only a few images for a new category, has attracted some research interest. In this paper, we propose a Fusing-and-Filling Generative Adversarial Network (F2GAN) to generate realistic and diverse images for a new category with only a few images. In our F2GAN, a fusion generator is designed to fuse the high-level features of conditional images with random interpolation coefficients, and then fills in attended low-level details with non-local attention module to produce a new image. Moreover, our discriminator can ensure the diversity of generated images by a mode seeking loss and an interpolation regression loss. Extensive experiments on five datasets demonstrate the effectiveness of our proposed method for few-shot image generation.

preprint2016arXiv

Engineering bandgaps of monolayer MoS2 and WS2 on fluoropolymer substrates by electrostatically tuned many-body effects

Intrinsic electrical and excitonic properties of monolayer transition metal dichalcogenides are studied on CYTOP fluoropolymer substrates with greatly suppressed unintentional doping and dielectric screening. Ambipolar transport behavior is observed in monolayer WS2 by applying solid states backdates. The excitonic properties of monolayer MoS2 and WS2 are determined by intricate interplays between the bandage renormalization, Pauli blocking and carrier screening against carrier doping.

preprint2016arXiv

Enhancing charge-density-wave order in 1T-TiSe2 nanosheet by encapsulation with hexagonal Boron Nitride

Layered transition metal dichalcogenides (TMDs) provide an ideal platform for exploring the effects of dimensionality on correlated electronic phases such as charge density wave (CDW) order. When TMDs are reduced in thickness to the 2-D limit, it is expected that the substrates will exert considerable influence on the electron states. Here we report a study of the charge density wave (CDW) state in 1T-TiSe2 nanosheets of different thicknesses when the sheets are encapsulated by hexagonal Boron Nitride (h-BN) or supported on SiO2 substrate. Our results show that dimensionality reduction results in an enhancement of CDW order and that disorder and substrate phonons tends to destroy CDW order, preventing observation of intrinsic CDW transition in ultrathin samples. Encapsulated 10 nm thick 1T-TiSe2 samples exhibit intrinsic CDW with transition temperature as high as 235 K. Our study points out that choosing the right substrate is important in the search for room temperature CDW materials.

preprint2015arXiv

Halide-Assisted Atmospheric Pressure Growth of Large WSe2 and WS2 Monolayer Crystals

Chemical vapor deposition (CVD) of two-dimensional (2D) tungsten dichalcogenide crystals requires steady flow of tungsten source in the vapor phase. This often requires high temperature and low pressure due to the high sublimation point of tungsten oxide precursors. We demonstrate atmospheric pressure CVD of WSe2 and WS2 monolayers at moderate temperatures (700 ~ 850 oC) using alkali metal halides (MX where M= Na or K and X=Cl, Br or I) as the growth promoters. We attribute the facilitated growth to the formation of volatile tungsten oxyhalide species during growth, which leads to efficient delivery of the precursor to the growth substrates. The monolayer crystals were found to be free of unintentional doping with alkali metal and halogen atoms. Good field-effect transistor (FET) performances with high current on/off ratio ~10 7, hole and electron mobilities up to 102 and 26 cm2 V 1 s-1 for WSe2 and electron mobility of ~14 cm2 V-1 s-1 for WS2 devices were achieved.

preprint2015arXiv

Workload-Driven Vertical Partitioning for Effective Query Processing over Raw Data

Traditional databases are not equipped with the adequate functionality to handle the volume and variety of "Big Data". Strict schema definition and data loading are prerequisites even for the most primitive query session. Raw data processing has been proposed as a schema-on-demand alternative that provides instant access to the data. When loading is an option, it is driven exclusively by the current-running query, resulting in sub-optimal performance across a query workload. In this paper, we investigate the problem of workload-driven raw data processing with partial loading. We model loading as fully-replicated binary vertical partitioning. We provide a linear mixed integer programming optimization formulation that we prove to be NP-hard. We design a two-stage heuristic that comes within close range of the optimal solution in a fraction of the time. We extend the optimization formulation and the heuristic to pipelined raw data processing, scenario in which data access and extraction are executed concurrently. We provide three case-studies over real data formats that confirm the accuracy of the model when implemented in a state-of-the-art pipelined operator for raw data processing.

preprint2014arXiv

Nonlinear Photoluminescence in Atomically Thin Layered WSe2 Arising from Diffusion-Assisted Exciton-Exciton Annihilation

We studied multi-exciton dynamics in monolayer WSe2 using nonlinear photoluminescence (PL) spectroscopy and Monte Carlo simulations. We observed strong nonlinear saturation behavior of exciton PL with increasing excitation power density, and long-distance exciton diffusion reaching several micrometers. We demonstrated that the diffusion-assisted exciton-exciton annihilation model accounts for the observed nonlinear PL behavior. The long-distance exciton diffusion and subsequent efficient exciton-exciton annihilation process determined the unusual multi-exciton dynamics in atomically thin layered transition metal dichalcogenides.

preprint2014arXiv

Photocarrier relaxation in two-dimensional semiconductors

Two-dimensional (2D) crystals of semiconducting transition metal dichalcogenides (TMD) absorb a large fraction of incident photons in the visible frequencies despite being atomically thin. It has been suggested that the strong absorption is due to the parallel band or "band nesting" effect and corresponding divergence in the joint density of states. Here, we show using photoluminescence excitation spectroscopy that the band nesting in mono- and bilayer MX$_2$ (M = Mo, W and X = S, Se) results in excitation-dependent characteristic relaxation pathways of the photoexcited carriers. Our experimental and simulation results reveal that photoexcited electron-hole pairs in the nesting region spontaneously separate in the $k$-space, relaxing towards immediate band extrema with opposite momentum. These effects imply that the loss of photocarriers due to direct exciton recombination is temporarily suppressed for excitation in resonance with band nesting. Our findings highlight the potential for efficient hot carrier collection using these materials as the absorbers in optoelectronic devices.

preprint2014arXiv

Transport properties of monolayer MoS$_2$ grown by chemical vapour deposition

Recent success in the growth of monolayer MoS$_2$ via chemical vapor deposition (CVD) has opened up prospects for the implementation of these materials into thin film electronic and optoelectronic devices. Here, we investigate the electronic transport properties of individual crystallites of high quality CVD-grown monolayer MoS$_2$. The devices show low temperature mobilities up to 500 cm$^2$V$^{-1}$s$^{-1}$ and a clear signature of metallic conduction at high doping densities. These characteristics are comparable to the electronic properties of the best mechanically exfoliated monolayers in literature, verifying the high electronic quality of the CVD-grown materials. We analyze the different scattering mechanisms and show, that the short-range scattering plays a dominant role in the highly conducting regime at low temperatures. Additionally, the influence of phonons as a limiting factor of these devices is discussed.

preprint2013arXiv

An innovative way of etching MoS2: Characterization and mechanistic investigation

We report a systematic study of the etching of MoS2 crystals by using XeF2 as a gaseous reactant. By controlling the etching process, monolayer MoS2 with uniform morphology can be obtained. The Raman and photoluminescence spectra of the resulting material were similar to those of exfoliated MoS2. Utilizing this strategy, different patterns such as a Hall bar structure and a hexagonal array can be realized. Furthermore, the etching mechanism was studied by introducing graphene as an etching mask. We believe our technique opens an easy and controllable way of etching MoS2, which can be used to fabricate complex nanostructures, such as nanoribbons, quantum dots and transistor structures. This etching process using XeF2 can also be extended to other interesting two-dimensional crystals.

preprint2013arXiv

Lattice dynamics in mono- and few-layer sheets of WS2 and WSe2

Thickness is one of the fundamental parameters that define the electronic, optical, and thermal properties of two-dimensional (2D) crystals. Phonons in molybdenum disulfide (MoS2) were recently found to exhibit unique thickness dependence due to interplay between short and long range interactions. Here we report Raman spectra of atomically thin sheets of WS2 and WSe2 in the mono- to few-layer thickness regime. We show that, similar to the case of MoS2, the characteristic and modes exhibit stiffening and softening with increasing number of layers, respectively, with a small shift of less than 3 cm-1 due to large mass of the atoms. Thickness dependence is also observed in a series of multiphonon bands arising from overtone, combination, and zone edge phonons, whose intensity exhibit significant enhancement in excitonic resonance conditions. Some of these multiphonon peaks are found to be absent only in monolayers. These features provide a unique fingerprint and rapid identification for monolayer flakes.

preprint2013arXiv

Origin of indirect optical transitions in few-layer MoS2, WS2 and WSe2

It has been well established that single layer MX2 (M=Mo,W and X=S,Se) are direct gap semiconductors with band edges coinciding at the K point in contrast to their indirect gap multilayer counterparts. In few-layer MX2, there are two valleys along the Γ-K line with similar energy. There is little understanding on which of the two valleys forms the conduction band minimum (CBM) in this thickness regime. We investigate the conduction band valley structure in few-layer MX2 by examining the temperature-dependent shift of indirect exciton PL. Hihgly anisotropic thermal expansion of the lattice and corresponding evolution of the band structure result in distinct peak shift for indirect transitions involving the K and Λ (midpoint along Γ-K) valleys. We identify the origin of the indirect emission and concurrently determine the relative energy of these valleys. Our results show that the two valleys compete in energy in few-layer WSe2.

preprint2012arXiv

Evolution of Electronic Structure in Atomically Thin Sheets of WS2 and WSe2

Geometrical confinement effect in exfoliated sheets of layered materials leads to significant evolution of energy dispersion with decreasing layer thickness. Molybdenum disulphide (MoS2) was recently found to exhibit indirect to direct gap transition when the thickness is reduced to a single monolayer. This leads to remarkable enhancement in the photoluminescence efficiency, which opens up new opportunities for the optoelectronic applications of the material. Here we report differential reflectance and photoluminescence (PL) spectra of mono- to few-layer WS2 and WSe2 that indicate that the band structure of these materials undergoes similar indirect to direct transition when thinned to a single monolayer. Strong enhancement in PL quantum yield is observed for monoayer WS2 and WSe2 due to exciton recombination at the direct band edge. In contrast to natural MoS2 crystals extensively used in recent studies, few-layer WS2 and WSe2 show comparatively strong indirect gap emission along with distinct direct gap hot electron emission, suggesting high quality of synthetic crystals prepared by chemical vapor transport method. Fine absorption and emission features and their thickness dependence suggest strong effect of Se p-orbitals on the d electron band structure as well as interlayer coupling in WSe2.