Source author record

Weiping Li

Weiping Li 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

16works
13topics
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

16 published item(s)

preprint2026arXiv

Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization

Large Language Models (LLMs) suffer from order bias, where their performance is affected by the arrangement order of input elements. This unfairness limits the model's applications in scenarios such as in-context learning and Retrieval-Augmented Generation (RAG). Recent studies attempt to obtain optimal or suboptimal arrangements based on statistical results or using dataset-based search, but these methods increase inference overhead while leaving the model's inherent order bias unresolved. Other studies mitigate order sensitivity through supervised fine-tuning using augmented training sets with multiple order variants, but often at the cost of accuracy, trapping the model in consistent yet incorrect hallucinations. In this paper, we propose \textbf{D}ual \textbf{G}roup \textbf{A}dvantage \textbf{O}ptimization (\textbf{DGAO}), which aims to improve model accuracy and order stability simultaneously. DGAO calculates and balances intra-group relative accuracy advantage and inter-group relative stability advantage, rewarding the policy model for generating order-stable and correct outputs while penalizing order-sensitive or incorrect responses. This marks the first time reinforcement learning has been used to mitigate LLMs' order sensitivity. We also propose two new metrics, Consistency Rate and Overconfidence Rate, to reveal the pseudo-stability of previous methods and guide more comprehensive evaluation. Extensive experiments demonstrate that DGAO achieves superior order fairness while improving performance on RAG, mathematical reasoning, and classification tasks. Our code is available at: https://github.com/Hyalinesky/DGAO.

preprint2022arXiv

Eliciting Knowledge from Pretrained Language Models for Prototypical Prompt Verbalizer

Recent advances on prompt-tuning cast few-shot classification tasks as a masked language modeling problem. By wrapping input into a template and using a verbalizer which constructs a mapping between label space and label word space, prompt-tuning can achieve excellent results in zero-shot and few-shot scenarios. However, typical prompt-tuning needs a manually designed verbalizer which requires domain expertise and human efforts. And the insufficient label space may introduce considerable bias into the results. In this paper, we focus on eliciting knowledge from pretrained language models and propose a prototypical prompt verbalizer for prompt-tuning. Labels are represented by prototypical embeddings in the feature space rather than by discrete words. The distances between the embedding at the masked position of input and prototypical embeddings are used as classification criterion. For zero-shot settings, knowledge is elicited from pretrained language models by a manually designed template to form initial prototypical embeddings. For few-shot settings, models are tuned to learn meaningful and interpretable prototypical embeddings. Our method optimizes models by contrastive learning. Extensive experimental results on several many-class text classification datasets with low-resource settings demonstrate the effectiveness of our approach compared with other verbalizer construction methods. Our implementation is available at https://github.com/Ydongd/prototypical-prompt-verbalizer.

preprint2022arXiv

Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering Over Knowledge Graphs

Answering natural language questions on knowledge graphs (KGQA) remains a great challenge in terms of understanding complex questions via multi-hop reasoning. Previous efforts usually exploit large-scale entity-related text corpora or knowledge graph (KG) embeddings as auxiliary information to facilitate answer selection. However, the rich semantics implied in off-the-shelf relation paths between entities is far from well explored. This paper proposes improving multi-hop KGQA by exploiting relation paths' hybrid semantics. Specifically, we integrate explicit textual information and implicit KG structural features of relation paths based on a novel rotate-and-scale entity link prediction framework. Extensive experiments on three existing KGQA datasets demonstrate the superiority of our method, especially in multi-hop scenarios. Further investigation confirms our method's systematical coordination between questions and relation paths to identify answer entities.

preprint2020arXiv

Blind Quality Assessment for Image Superresolution Using Deep Two-Stream Convolutional Networks

Numerous image superresolution (SR) algorithms have been proposed for reconstructing high-resolution (HR) images from input images with lower spatial resolutions. However, effectively evaluating the perceptual quality of SR images remains a challenging research problem. In this paper, we propose a no-reference/blind deep neural network-based SR image quality assessor (DeepSRQ). To learn more discriminative feature representations of various distorted SR images, the proposed DeepSRQ is a two-stream convolutional network including two subcomponents for distorted structure and texture SR images. Different from traditional image distortions, the artifacts of SR images cause both image structure and texture quality degradation. Therefore, we choose the two-stream scheme that captures different properties of SR inputs instead of directly learning features from one image stream. Considering the human visual system (HVS) characteristics, the structure stream focuses on extracting features in structural degradations, while the texture stream focuses on the change in textural distributions. In addition, to augment the training data and ensure the category balance, we propose a stride-based adaptive cropping approach for further improvement. Experimental results on three publicly available SR image quality databases demonstrate the effectiveness and generalization ability of our proposed DeepSRQ method compared with state-of-the-art image quality assessment algorithms.

preprint2020arXiv

Learned Fast HEVC Intra Coding

In High Efficiency Video Coding (HEVC), excellent rate-distortion (RD) performance is achieved in part by having a flexible quadtree coding unit (CU) partition and a large number of intra-prediction modes. Such an excellent RD performance is achieved at the expense of much higher computational complexity. In this paper, we propose a learned fast HEVC intra coding (LFHI) framework taking into account the comprehensive factors of fast intra coding to reach an improved configurable tradeoff between coding performance and computational complexity. First, we design a low-complex shallow asymmetric-kernel CNN (AK-CNN) to efficiently extract the local directional texture features of each block for both fast CU partition and fast intra-mode decision. Second, we introduce the concept of the minimum number of RDO candidates (MNRC) into fast mode decision, which utilizes AK-CNN to predict the minimum number of best candidates for RDO calculation to further reduce the computation of intra-mode selection. Third, an evolution optimized threshold decision (EOTD) scheme is designed to achieve configurable complexity-efficiency tradeoffs. Finally, we propose an interpolation-based prediction scheme that allows for our framework to be generalized to all quantization parameters (QPs) without the need for training the network on each QP. The experimental results demonstrate that the LFHI framework has a high degree of parallelism and achieves a much better complexity-efficiency tradeoff, achieving up to 75.2% intra-mode encoding complexity reduction with negligible rate-distortion performance degradation, superior to the existing fast intra-coding schemes.

preprint2020arXiv

Prior-enlightened and Motion-robust Video Deblurring

Various blur distortions in video will cause negative impact on both human viewing and video-based applications, which makes motion-robust deblurring methods urgently needed. Most existing works have strong dataset dependency and limited generalization ability in handling challenging scenarios, like blur in low contrast or severe motion areas, and non-uniform blur. Therefore, we propose a PRiOr-enlightened and MOTION-robust video deblurring model (PROMOTION) suitable for challenging blurs. On the one hand, we use 3D group convolution to efficiently encode heterogeneous prior information, explicitly enhancing the scenes' perception while mitigating the output's artifacts. On the other hand, we design the priors representing blur distribution, to better handle non-uniform blur in spatio-temporal domain. Besides the classical camera shake caused global blurry, we also prove the generalization for the downstream task suffering from local blur. Extensive experiments demonstrate we can achieve the state-of-the-art performance on well-known REDS and GoPro datasets, and bring machine task gain.

preprint2018arXiv

Locating earthquakes with a network of seismic stations via a deep learning method

The accurate and automated determination of earthquake locations is still a challenging endeavor. However, such information is critical for monitoring seismic activity and assessing potential hazards in real time. Recently, a convolutional neural network was applied to detect earthquakes from single-station waveforms and approximately map events across several large surface areas. In this study, we locate 194 earthquakes induced during oil and gas operations in Oklahoma, USA, within an error range of approximately 4.9 km on average to the epicenter and 1.0 km to the depth in catalogs with data from 30 network stations by applying the fully convolutional network. The network is trained by 1,013 historic events, and the output is a 3D volume of the event location probability in the Earth. The trained system requires approximately one hundredth of a second to locate an event without the need for any velocity model or human interference.

preprint2016arXiv

Comments on "Approximate Characterizations for the Gaussian Source Broadcast Distortion Region"

Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its nonlinear form, it appears difficult to determine whether it is always looser than the trivial outer bound in all distortion regimes with bandwidth compression". However, in this correspondence we solve this problem and prove that for the bandwidth expansion case ($K\geq2$), this outer bound is strictly tighter than the trivial outer bound with each user being optimal in the point-to-point setting; while for the bandwidth compression or bandwidth match case, this outer bound actually degenerates to the trivial outer bound. Therefore, our results imply that on one hand, the outer bound given in [1] is nontrivial only for Gaussian broadcast communication ($K\geq2$) with bandwidth expansion; on the other hand, unfortunately, no nontrivial outer bound exists so far for Gaussian broadcast communication ($K\geq2$) with bandwidth compression.

preprint2015arXiv

Secrecy Communication with Security Rate Measure

We introduce a new measure on secrecy, which is established based on rate-distortion theory. It is named \emph{security rate}, which is the minimum (infimum) of the additional rate needed to reconstruct the source within target distortion level with any positive probability for wiretapper. It denotes the minimum distance in information metric (bits) from what wiretapper has received to any decrypted reconstruction (where decryption is defined as reconstruction within target distortion level with some positive possibility). By source coding theorem, it is equivalent to a distortion-based equivocation $\mathop{\min}\limits _{p\left(v^{n}|s^{n},m\right):Ed\left(S^{n},V^{n}\right)\le D_{E}}\frac{1}{n}I\left(S^{n};V^{n}|M\right)$ which can be seen as a direct extension of equivocation $\frac{1}{n}H\left(S^{n}|M\right)$ to lossy decryption case, given distortion level $D_{E}$ and the received (encrypted) message $M$ of wiretapper. In this paper, we study it in Shannon cipher system with lossless communication, where a source is transmitted from sender to legitimate receiver secretly and losslessly, and also eavesdropped by a wiretapper. We characterize the admissible region of secret key rate, coding rate of the source, wiretapper distortion, and security rate (distortion-based equivocation). Since the security rate equals the distortion-based equivocation, and the equivocation is a special case of the distortion-based equivocation (with Hamming distortion measure and $D_{E}=0$), this gives an answer for the meaning of the maximum equivocation.

preprint2011arXiv

$SL_2(\mathbb{C})$-Character Variety of a Hyperbolic Link and Regulator

In this paper, we study the $SL_2(\mathbb{C})$ character variety of a hyperbolic link in $S^3$. We analyze a special smooth projective variety $Y^h$ arising from some 1-dimensional irreducible slices on the character variety. We prove that a natural symbol obtained from these 1-dimensional slices is a torsion in $K_2({\mathbb C}(Y^h))$. By using the regulator map from $K_2$ to the corresponding Deligne cohomology, we get some variation formulae on some Zariski open subset of $Y^h$. From this we give some discussions on a possible parametrized volume conjecture for both hyperbolic links and knots.

preprint2010arXiv

On a spectral sequence for twisted cohomologies

Let ($Ω^{\ast}(M), d$) be the de Rham cochain complex for a smooth compact closed manifolds $M$ of dimension $n$. For an odd-degree closed form $H$, there are a twisted de Rham cochain complex $(Ω^{\ast}(M), d+H_\wedge)$ and its associated twisted de Rham cohomology $H^*(M,H)$. We show that there exists a spectral sequence $\{E^{p, q}_r, d_r\}$ derived from the filtration $F_p(Ω^{\ast}(M))=\bigoplus_{i\geq p}Ω^i(M)$ of $Ω^{\ast}(M)$, which converges to the twisted de Rham cohomology $H^*(M,H)$. We also show that the differentials in the spectral sequence can be given in terms of cup products and specific elements of Massey products as well, which generalizes a result of Atiyah and Segal. Some results about the indeterminacy of differentials are also given in this paper.

preprint2006arXiv

An SL(2,C) Algebro-Geometric Invariant of Knots

In this paper, we define a new algebro-geometric invariant of 3-manifolds resulting from the Dehn surgery along a hyperbolic knot complement in S^3. We establish a Casson type invariant for these 3-manifolds. In the last section, we explicitly calculate the character variety of the figure-eight knot and discuss some applications, as well as the computation of our new invariants for some 3-manifolds resulting from the Dehn surgery along the figure-eight knot.

preprint2006arXiv

On the Generalized Volume Conjecture and Regulator

In this paper, by using the regulator map of Beilinson-Deligne on a curve, we show that the quantization condition posed by Gukov is true for the SL_2(C) character variety of the hyperbolic knot in S^3. Furthermore, we prove that the corresponding $\mathbb{C}^{*}$-valued closed 1-form is a secondary characteristic class (Chern-Simons) arising from the vanishing first Chern class of the flat line bundle over the smooth part of the character variety, where the flat line bundle is the pullback of the universal Heisenberg line bundle over $\mathbb{C}^{*}\times \mathbb{C}^{*}$. Based on this result, we give a reformulation of Gukov's generalized volume conjecture from a motivic perspective.

preprint2004arXiv

The Z-graded symplectic Floer cohomology of monotone Lagrangian sub-manifolds

We define an integer graded symplectic Floer cohomology and a Fintushel-Stern type spectral sequence which are new invariants for monotone Lagrangian sub-manifolds and exact isotopes. The Z-graded symplectic Floer cohomology is an integral lifting of the usual Z_Sigma(L)-graded Floer-Oh cohomology. We prove the Kunneth formula for the spectral sequence and an ring structure on it. The ring structure on the Z_Sigma(L)-graded Floer cohomology is induced from the ring structure of the cohomology of the Lagrangian sub-manifold via the spectral sequence. Using the Z-graded symplectic Floer cohomology, we show some intertwining relations among the Hofer energy e_H(L) of the embedded Lagrangian, the minimal symplectic action sigma(L), the minimal Maslov index Sigma(L)$ and the smallest integer k(L, phi$ of the converging spectral sequence of the Lagrangian L.

preprint1995arXiv

Floer homologies for Lagrangian intersections and instantons

In 1985 lectures at MSRI, A. Casson introduced an interesting integer valued invariant for any oriented integral homology 3-sphere Y via beautiful constructions on representation spaces (see [1] for an exposition). The Casson invariant λ(Y) is roughly defined by measuring the oriented number of irreducible representations of the fundamental group π_1(Y) in SU(2). Such an invariant generalized the Rohlin invariant and gives surprising corollaries in low dimensional topology.