Searcharxiv⌕ Search

arXiv subjects

Zhonghua Li

Publications and source records attributed to Zhonghua Li.

At least 37 records · Page 2Linked to original sources

Plug-and-Play Document Modules for Pre-trained Models

Large-scale pre-trained models (PTMs) have been widely used in document-oriented NLP tasks, such as question answering. However, the encoding-task coupling requirement results in the repeated encoding of the same documents for different tasks and queries, which is highly computationally inefficient. To this end, we target to decouple document encoding from downstream tasks, and propose to represent each document as a plug-and-play document module, i.e., a document plugin, for PTMs (PlugD). By inserting document plugins into the backbone PTM for downstream tasks, we can encode a document one time to handle multiple tasks, which is more efficient than conventional encoding-task coupling methods that simultaneously encode documents and input queries using task-specific encoders. Extensive experiments on 8 datasets of 4 typical NLP tasks show that PlugD enables models to encode documents once and for all across different scenarios. Especially, PlugD can save $69\%$ computational costs while achieving comparable performance to state-of-the-art encoding-task coupling methods. Additionally, we show that PlugD can serve as an effective post-processing way to inject knowledge into task-specific models, improving model performance without any additional model training.

cs.CL↗

Refined Vision-Language Modeling for Fine-grained Multi-modal Pre-training

Fine-grained supervision based on object annotations has been widely used for vision and language pre-training (VLP). However, in real-world application scenarios, aligned multi-modal data is usually in the image-caption format, which only provides coarse-grained supervision. It is not only cost-expensive but also compute-expensive to collect object annotations and build object annotation pre-extractor for different scenarios. In this paper, we propose a fine-grained VLP scheme without object annotations from the linguistic perspective. First, we propose a homonym sentence rewriting (HSR) algorithm to provide token-level supervision. The algorithm replaces a verb/noun/adjective/quantifier word of the caption with its homonyms from WordNet. Correspondingly, we propose refined vision-language modeling (RVLM) framework to exploit the token-level supervision. Three refined tasks, i.e., refined image-text contrastive (RITC), refined image-text matching (RITM), and replace language modeling (RLM) are proposed to learn the fine-grained alignment. Extensive experiments on several downstream tasks demonstrate the superior performance of the proposed method.

cs.CV↗

Rota-Baxter systems of Hopf algebras and Hopf trusses

As Hopf truss analogues of Rota-Baxter Hopf algebras, the notion of Rota-Baxter systems of Hopf algebras is proposed. We study the relatiohship between Rota-Baxter systems of Hopf algebras and Rota-Baxter Hopf algebras, show that there is a Rota-Baxter system structure on the group algebra if the group has a Rota-Baxter system structure, investigate the descendent Hopf algebra of a Rota-Baxte system of Hopf algebras. Finally we study the local decomposition of the character group from a Rota-Baxter system of Hopf algebras to a commutative algebra.

math.RA↗

Rethinking Dense Retrieval's Few-Shot Ability

Few-shot dense retrieval (DR) aims to effectively generalize to novel search scenarios by learning a few samples. Despite its importance, there is little study on specialized datasets and standardized evaluation protocols. As a result, current methods often resort to random sampling from supervised datasets to create "few-data" setups and employ inconsistent training strategies during evaluations, which poses a challenge in accurately comparing recent progress. In this paper, we propose a customized FewDR dataset and a unified evaluation benchmark. Specifically, FewDR employs class-wise sampling to establish a standardized "few-shot" setting with finely-defined classes, reducing variability in multiple sampling rounds. Moreover, the dataset is disjointed into base and novel classes, allowing DR models to be continuously trained on ample data from base classes and a few samples in novel classes. This benchmark eliminates the risk of novel class leakage, providing a reliable estimation of the DR model's few-shot ability. Our extensive empirical results reveal that current state-of-the-art DR models still face challenges in the standard few-shot scene. Our code and data will be open-sourced at https://github.com/OpenMatch/ANCE-Tele.

cs.CL↗

FashionSAP: Symbols and Attributes Prompt for Fine-grained Fashion Vision-Language Pre-training

Fashion vision-language pre-training models have shown efficacy for a wide range of downstream tasks. However, general vision-language pre-training models pay less attention to fine-grained domain features, while these features are important in distinguishing the specific domain tasks from general tasks. We propose a method for fine-grained fashion vision-language pre-training based on fashion Symbols and Attributes Prompt (FashionSAP) to model fine-grained multi-modalities fashion attributes and characteristics. Firstly, we propose the fashion symbols, a novel abstract fashion concept layer, to represent different fashion items and to generalize various kinds of fine-grained fashion features, making modelling fine-grained attributes more effective. Secondly, the attributes prompt method is proposed to make the model learn specific attributes of fashion items explicitly. We design proper prompt templates according to the format of fashion data. Comprehensive experiments are conducted on two public fashion benchmarks, i.e., FashionGen and FashionIQ, and FashionSAP gets SOTA performances for four popular fashion tasks. The ablation study also shows the proposed abstract fashion symbols, and the attribute prompt method enables the model to acquire fine-grained semantics in the fashion domain effectively. The obvious performance gains from FashionSAP provide a new baseline for future fashion task research.

cs.CV↗

Generating functions of multiple $t$-star values

In this paper, we study the generating functions of multiple $t$-star values with an arbitrary number of blocks of twos, which are based on the results of the corresponding generating functions of multiple $t$-harmonic star sums. These generating functions can deduce an explicit expression of multiple $t$-star values. As applications, we obtain some evaluations of multiple $t$-star values with one-two-three or more general indices.

math.NT↗

Relations of multiple $t$-values of general level

We study the relations of multiple $t$-values of general level. The generating function of sums of multiple $t$-(star) values of level $N$ with fixed weight, depth and height is represented by the generalized hypergeometric function $_3F_2$, which generalizes the results for multiple zeta(-star) values and multiple $t$-(star) values. As applications, we obtain formulas for the generating functions of sums of multiple $t$-(star) values of level $N$ with height one and maximal height and a weighted sum formula for sums of multiple $t$-(star) values of level $N$ with fixed weight and depth. Using the stuffle algebra, we also get the symmetric sum formulas and Hoffman's restricted sum formulas for multiple $t$-(star) values of level $N$. Some evaluations of multiple $t$-star values of level $2$ with one-two-three indices are given.

math.NT↗

Ohno-Zagier type relation for multiple $t$-values

We study the Ohno-Zagier type relation for multiple $t$-values and multiple $t$-star values. We represent the generating function of sums of multiple $t$-(star) values with fixed weight, depth and height in terms of the generalized hypergeometric function $\,_3F_2$. As applications, we get a formula for the generating function of sums of multiple $t$-(star) values of maximal height and a weighted sum formula for sums of multiple $t$-(star) values with fixed weight and depth.

math.NT↗

Integrality and some evaluations of odd multiple harmonic sums

In 2015, S. Hong and C. Wang proved that none of the elementary symmetric functions of $1,1/3,\ldots,1/(2n-1)$ is an integer when $n\geq 2$. In 2017, Kh. Pilehrood, T. Pilehrood and R. Tauraso proved that the multiple harmonic sums $H_n(s_1,\ldots,s_r)$ are never integers with exceptions of $H_1(s_1)=1$ and $H_3(1,1)=1$. They also proved that the multiple harmonic star sums are never integers when $n\geq 2$. In this paper, we consider the odd multiple harmonic sums and the odd multiple harmonic star sums and show that none of these sums is an integer with exception of the trivial case. Besides, we give evaluations of the odd (alternating) multiple harmonic sums with depth one.

math.NT↗

FCOSR: A Simple Anchor-free Rotated Detector for Aerial Object Detection

Existing anchor-base oriented object detection methods have achieved amazing results, but these methods require some manual preset boxes, which introduces additional hyperparameters and calculations. The existing anchor-free methods usually have complex architectures and are not easy to deploy. Our goal is to propose an algorithm which is simple and easy-to-deploy for aerial image detection. In this paper, we present a one-stage anchor-free rotated object detector (FCOSR) based on FCOS, which can be deployed on most platforms. The FCOSR has a simple architecture consisting of only convolution layers. Our work focuses on the label assignment strategy for the training phase. We use ellipse center sampling method to define a suitable sampling region for oriented bounding box (OBB). The fuzzy sample assignment strategy provides reasonable labels for overlapping objects. To solve the insufficient sampling problem, a multi-level sampling module is designed. These strategies allocate more appropriate labels to training samples. Our algorithm achieves 79.25, 75.41, and 90.15 mAP on DOTA1.0, DOTA1.5, and HRSC2016 datasets, respectively. FCOSR demonstrates superior performance to other methods in single-scale evaluation. We convert a lightweight FCOSR model to TensorRT format, which achieves 73.93 mAP on DOTA1.0 at a speed of 10.68 FPS on Jetson Xavier NX with single scale. The code is available at: https://github.com/lzh420202/FCOSR

cs.CV↗

VLDeformer: Vision-Language Decomposed Transformer for Fast Cross-Modal Retrieval

Cross-model retrieval has emerged as one of the most important upgrades for text-only search engines (SE). Recently, with powerful representation for pairwise text-image inputs via early interaction, the accuracy of vision-language (VL) transformers has outperformed existing methods for text-image retrieval. However, when the same paradigm is used for inference, the efficiency of the VL transformers is still too low to be applied in a real cross-modal SE. Inspired by the mechanism of human learning and using cross-modal knowledge, this paper presents a novel Vision-Language Decomposed Transformer (VLDeformer), which greatly increases the efficiency of VL transformers while maintaining their outstanding accuracy. By the proposed method, the cross-model retrieval is separated into two stages: the VL transformer learning stage, and the VL decomposition stage. The latter stage plays the role of single modal indexing, which is to some extent like the term indexing of a text SE. The model learns cross-modal knowledge from early-interaction pre-training and is then decomposed into an individual encoder. The decomposition requires only small target datasets for supervision and achieves both $1000+$ times acceleration and less than $0.6$\% average recall drop. VLDeformer also outperforms state-of-the-art visual-semantic embedding methods on COCO and Flickr30k.

cs.CV↗

Rota-Baxter $C^{\ast}$-algebras

This paper introduces the notion of Rota-Baxter $C^{\ast}$-algebras. Here a Rota-Baxter $C^{\ast}$-algebra is a $C^{\ast}$-algebra with a Rota-Baxter operator. Symmetric Rota-Baxter operators, as special cases of Rota-Baxter operators on $C^{\ast}$-algebra, are defined and studied. A theorem of Rota-Baxter operators on concrete $C^{\ast}$-algebras is given, deriving the relationship between two kinds of Rota-Baxter algebras. As a corollary, some connection between $\ast$-representations and Rota-Baxter operators is given. The notion of representations of Rota-Baxter $C^{\ast}$-algebras are constructed, and a theorem of representations of direct sums of Rota-Baxter representations is derived. Finally using Rota-Baxter operators, the notion of quasidiagonal operators on $C^{\ast}$-algebra is reconstructed.

math.OA↗

A note on the sum of finite multiple harmonic $q$-series on $r\text{-}(r+1)$ indices

We study the sum of the finite multiple harmonic $q$-series on $r\text{-}(r+1)$ indices at roots of unity with $r=1,2,3$. And we give the equivalent conditions of two conjectures regarding cyclic sums of finite multiple harmonic $q$-series on $1\text{-}2\text{-}3$ indices at roots of unity, posed recently by Kh. Pilehrood, T. Pilehrood and R. Tauraso.

math.NT↗

Weighted sum formula of multiple $L$-values and its applications

In this paper, we study the multiple $L$-values and the multiple zeta values of level $N$. We set up the algebraic framework for the double shuffle relations of the multiple zeta values of level $N$. Using the regularized double shuffle relations of multiple $L$-values, we give a sum formula and a weighted sum formula of multiple $L$-values. As applications, we give sum formulas and weighted sum formulas of double zeta values of level $2$ and $3$.

math.NT↗

Scalar particles tunneling radiation in the Demianski-Newman spacetime with influences of quantum gravity

In this paper,using Hamilton-Jacobi ansatz, we investigate scalar particles tunneling radiation in the Demianski-Newman spacetime. We get the effective temperature with influences of quantum gravity, and compare this temperature with the original temperature of the Demianski-Newman black hole. We find that it's similar to the case of fermions, for scalar particles the influence of quantum gravity will also slow down the increase of Hawking temperatures,which naturally leads to remnants left in the evaporation.

hep-th↗

Topological properties of $q$-analogues of multiple zeta values

In the space of bounded real-valued functions on the interval $(0,1)$, we study the convergent sequences of $q$-analogues of multiple zeta values which do not converge to $0$. And we obtain the derived sets of the set of some $q$-analogue of multiple zeta values.

math.NT↗

MarlRank: Multi-agent Reinforced Learning to Rank

When estimating the relevancy between a query and a document, ranking models largely neglect the mutual information among documents. A common wisdom is that if two documents are similar in terms of the same query, they are more likely to have similar relevance score. To mitigate this problem, in this paper, we propose a multi-agent reinforced ranking model, named MarlRank. In particular, by considering each document as an agent, we formulate the ranking process as a multi-agent Markov Decision Process (MDP), where the mutual interactions among documents are incorporated in the ranking process. To compute the ranking list, each document predicts its relevance to a query considering not only its own query-document features but also its similar documents features and actions. By defining reward as a function of NDCG, we can optimize our model directly on the ranking performance measure. Our experimental results on two LETOR benchmark datasets show that our model has significant performance gains over the state-of-art baselines. We also find that the NDCG shows an overall increasing trend along with the step of interactions, which demonstrates that the mutual information among documents helps improve the ranking performance.

cs.LG↗