Searcharxiv⌕ Search

arXiv subjects

Guodong Zhou

Publications and source records attributed to Guodong Zhou.

At least 55 records · Page 3Linked to original sources

Deformations and homotopy theory of Nijenhuis associative algebras

This paper is the first in a series of works devoted to an operadic study of Nijenhuis structures, focusing on Nijenhuis associative algebras. We introduce the concept of homotopy Nijenhuis associative algebras and demonstrate that the differential graded (=dg) operad $\NjAoperad_{\infty}$ governing these structures serves as the minimal model of the operad $\NjAoperad$ for Nijenhuis associative algebras. Additionally, we determine the Koszul dual homotopy cooperad of $\NjAoperad$. We construct an $L_\infty$-algebra that controls the simultaneous deformations of associative products and Nijenhuis operators. The Maurer-Cartan elements of this $L_\infty$-algebra correspond bijectively to Nijenhuis associative algebra structures. From this, we derive a cochain complex (deformation complex) and an associated cohomology theory of Nijenhuis associative algebras. Finally, we explore the connection between homotopy relative Rota-Baxter associative algebras of weight $0$ and homotopy Nijenhuis associative algebras. A sequel to this work will extend the study to Nijenhuis Lie algebras, with applications to Nijenhuis geometry.

math.KT↗

A recollement approach to Han's conjecture

A conjecture due to Y. Han asks whether that Hochschild homology groups of a finite dimensional algebra vanish for sufficiently large degrees would imply that the algebra is of finite global dimension. We investigate this conjecture from the viewpoint of recollements of derived categories. It is shown that for a recollement of unbounded derived categories of rings which extends downwards (or upwards) one step, Han's conjecture holds for the ring in the middle if and only if it holds for the two rings on the two sides and hence Han's conjecture is reduced to derived $2$-simple rings. Furthermore, this reduction result is applied to Han's conjecture for Morita contexts rings and exact contexts. Finally it is proved that Han's conjecture holds for skew-gentle algebras, category algebras of finite EI categories and Geiss-Leclerc-Schröer algebras associated to Cartan triples.

math.RT↗

Categorical properties and homological conjectures for bounded extensions of algebras

An extension $B\subset A$ of finite dimensional algebras is bounded if the $B$-$B$-bimodule $A/B$ is $B$-tensor nilpotent, its projective dimension is finite and $\mathrm{Tor}_i^B(A/B, (A/B)^{\otimes_B j})=0$ for all $i, j\geq 1$. We show that for a bounded extension $B\subset A$, the algebras $A$ and $B$ are singularly equivalent of Morita type with level. Additionally, under mild conditions, their stable categories of Gorenstein projective modules and Gorenstein defect categories are equivalent, respectively. Some homological conjectures are also investigated for bounded extensions, including Auslander-Reiten conjecture, finististic dimension conjecture, Fg condition, Han's conjecture, and Keller's conjecture. Applications to trivial extensions and triangular matrix algebras are given. In course of proof, we give some handy criteria for a functor between module categories to induce triangle functors between stable categories of Gorenstein projective modules and Gorenstein defect categories, which generalise some known criteria, and hence might be of independent interest.

math.RT↗

Multi-layer Sequence Labeling-based Joint Biomedical Event Extraction

In recent years, biomedical event extraction has been dominated by complicated pipeline and joint methods, which need to be simplified. In addition, existing work has not effectively utilized trigger word information explicitly. Hence, we propose MLSL, a method based on multi-layer sequence labeling for joint biomedical event extraction. MLSL does not introduce prior knowledge and complex structures. Moreover, it explicitly incorporates the information of candidate trigger words into the sequence labeling to learn the interaction relationships between trigger words and argument roles. Based on this, MLSL can learn well with just a simple workflow. Extensive experimentation demonstrates the superiority of MLSL in terms of extraction performance compared to other state-of-the-art methods.

cs.CL↗

The minimal model of Rota-Baxter operad with arbitrary weight

This paper investigates Rota-Baxter associative algebras of of arbitrary weights, that is, associative algebras endowed with Rota-Baxter operators of arbitrary weights from an operadic viewpoint. Denote by $\RB$ the operad of Rota-Baxter associative algebras. A homotopy cooperad is explicitly constructed, which can be seen as the Koszul dual of $\RB$ as it is proven that the cobar construction of this homotopy cooperad is exactly the minimal model of $\RB$. This enables us to give the notion of homotopy Rota-Baxter associative algebras. The deformation complex of a Rota-Baxter associative algebra and the underlying $L_\infty$-algebra structure over it are exhibited as well.

math.KT↗

OpenBA-V2: Reaching 77.3% High Compression Ratio with Fast Multi-Stage Pruning

Large Language Models (LLMs) have played an important role in many fields due to their powerful capabilities.However, their massive number of parameters leads to high deployment requirements and incurs significant inference costs, which impedes their practical applications. Training smaller models is an effective way to address this problem. Therefore, we introduce OpenBA-V2, a 3.4B model derived from multi-stage compression and continual pre-training from the original 15B OpenBA model. OpenBA-V2 utilizes more data, more flexible training objectives, and techniques such as layer pruning, neural pruning, and vocabulary pruning to achieve a compression rate of 77.3\% with minimal performance loss. OpenBA-V2 demonstrates competitive performance compared to other open-source models of similar size, achieving results close to or on par with the 15B OpenBA model in downstream tasks such as common sense reasoning and Named Entity Recognition (NER). OpenBA-V2 illustrates that LLMs can be compressed into smaller ones with minimal performance loss by employing advanced training objectives and data strategies, which may help deploy LLMs in resource-limited scenarios.

cs.CL↗

Comment-aided Video-Language Alignment via Contrastive Pre-training for Short-form Video Humor Detection

The growing importance of multi-modal humor detection within affective computing correlates with the expanding influence of short-form video sharing on social media platforms. In this paper, we propose a novel two-branch hierarchical model for short-form video humor detection (SVHD), named Comment-aided Video-Language Alignment (CVLA) via data-augmented multi-modal contrastive pre-training. Notably, our CVLA not only operates on raw signals across various modal channels but also yields an appropriate multi-modal representation by aligning the video and language components within a consistent semantic space. The experimental results on two humor detection datasets, including DY11k and UR-FUNNY, demonstrate that CVLA dramatically outperforms state-of-the-art and several competitive baseline approaches. Our dataset, code and model release at https://github.com/yliu-cs/CVLA.

cs.CV↗

ChatASU: Evoking LLM's Reflexion to Truly Understand Aspect Sentiment in Dialogues

Aspect Sentiment Understanding (ASU) in interactive scenarios (e.g., Question-Answering and Dialogue) has attracted ever-more interest in recent years and achieved important progresses. However, existing studies on interactive ASU largely ignore the coreference issue for opinion targets (i.e., aspects), while this phenomenon is ubiquitous in interactive scenarios especially dialogues, limiting the ASU performance. Recently, large language models (LLMs) shows the powerful ability to integrate various NLP tasks with the chat paradigm. In this way, this paper proposes a new Chat-based Aspect Sentiment Understanding (ChatASU) task, aiming to explore LLMs' ability in understanding aspect sentiments in dialogue scenarios. Particularly, this ChatASU task introduces a sub-task, i.e., Aspect Chain Reasoning (ACR) task, to address the aspect coreference issue. On this basis, we propose a Trusted Self-reflexion Approach (TSA) with ChatGLM as backbone to ChatASU. Specifically, this TSA treats the ACR task as an auxiliary task to boost the performance of the primary ASU task, and further integrates trusted learning into reflexion mechanisms to alleviate the LLMs-intrinsic factual hallucination problem in TSA. Furthermore, a high-quality ChatASU dataset is annotated to evaluate TSA, and extensive experiments show that our proposed TSA can significantly outperform several state-of-the-art baselines, justifying the effectiveness of TSA to ChatASU and the importance of considering the coreference and hallucination issues in ChatASU.

cs.CL↗

Formal deformations, cohomology theory and $L_\infty[1]$-structures for differential Lie algebras of arbitrary weight

Generalising a previous work of Jiang and Sheng, a cohomology theory for differential Lie algebras of arbitrary weight is introduced. The underlying $L_\infty[1]$-structure on the cochain complex is also determined via a generalised version of higher derived brackets. The equivalence between $L_\infty[1]$-structures for absolute and relative differential Lie algebras are established. Formal deformations and abelian extensions are interpreted by using lower degree cohomology groups. Also we introduce the homotopy differential Lie algebras. In a forthcoming paper, we will show that the operad of homotopy (relative) differential Lie algebras is the minimal model of the operad of (relative) differential Lie algebras.

math.RA↗

Pipelined Biomedical Event Extraction Rivaling Joint Learning

Biomedical event extraction is an information extraction task to obtain events from biomedical text, whose targets include the type, the trigger, and the respective arguments involved in an event. Traditional biomedical event extraction usually adopts a pipelined approach, which contains trigger identification, argument role recognition, and finally event construction either using specific rules or by machine learning. In this paper, we propose an n-ary relation extraction method based on the BERT pre-training model to construct Binding events, in order to capture the semantic information about an event's context and its participants. The experimental results show that our method achieves promising results on the GE11 and GE13 corpora of the BioNLP shared task with F1 scores of 63.14% and 59.40%, respectively. It demonstrates that by significantly improving theperformance of Binding events, the overall performance of the pipelined event extraction approach or even exceeds those of current joint learning methods.

cs.CL↗

TopicDiff: A Topic-enriched Diffusion Approach for Multimodal Conversational Emotion Detection

Multimodal Conversational Emotion (MCE) detection, generally spanning across the acoustic, vision and language modalities, has attracted increasing interest in the multimedia community. Previous studies predominantly focus on learning contextual information in conversations with only a few considering the topic information in single language modality, while always neglecting the acoustic and vision topic information. On this basis, we propose a model-agnostic Topic-enriched Diffusion (TopicDiff) approach for capturing multimodal topic information in MCE tasks. Particularly, we integrate the diffusion model into neural topic model to alleviate the diversity deficiency problem of neural topic model in capturing topic information. Detailed evaluations demonstrate the significant improvements of TopicDiff over the state-of-the-art MCE baselines, justifying the importance of multimodal topic information to MCE and the effectiveness of TopicDiff in capturing such information. Furthermore, we observe an interesting finding that the topic information in acoustic and vision is more discriminative and robust compared to the language.

cs.CL↗

How to Understand "Support"? An Implicit-enhanced Causal Inference Approach for Weakly-supervised Phrase Grounding

Weakly-supervised Phrase Grounding (WPG) is an emerging task of inferring the fine-grained phrase-region matching, while merely leveraging the coarse-grained sentence-image pairs for training. However, existing studies on WPG largely ignore the implicit phrase-region matching relations, which are crucial for evaluating the capability of models in understanding the deep multimodal semantics. To this end, this paper proposes an Implicit-Enhanced Causal Inference (IECI) approach to address the challenges of modeling the implicit relations and highlighting them beyond the explicit. Specifically, this approach leverages both the intervention and counterfactual techniques to tackle the above two challenges respectively. Furthermore, a high-quality implicit-enhanced dataset is annotated to evaluate IECI and detailed evaluations show the great advantages of IECI over the state-of-the-art baselines. Particularly, we observe an interesting finding that IECI outperforms the advanced multimodal LLMs by a large margin on this implicit-enhanced dataset, which may facilitate more research to evaluate the multimodal LLMs in this direction.

cs.CL↗

Koszul duality, minimal model and $L_\infty$-structure for differential algebras with weight

A differential algebra with weight is an abstraction of both the derivation (weight zero) and the forward and backward difference operators (weight $\pm 1$). In 2010 Loday established the Koszul duality for the operad of differential algebras of weight zero. He did not treat the case of nonzero weight, noting that new techniques are needed since the operad is no longer quadratic. This paper continues Loday's work and establishes the Koszul duality in the case of nonzero weight. In the process, the minimal model and the Koszul dual homotopy cooperad of the operad governing differential algebras with weight are determined. As a consequence, a notion of homotopy differential algebras with weight is obtained and the deformation complex as well as its $L_\infty$-algebra structure for differential algebras with weight are deduced.

math.RA↗

OpenBA: An Open-sourced 15B Bilingual Asymmetric seq2seq Model Pre-trained from Scratch

Large language models (LLMs) with billions of parameters have demonstrated outstanding performance on various natural language processing tasks. This report presents OpenBA, an open-sourced 15B bilingual asymmetric seq2seq model, to contribute an LLM variant to the Chinese-oriented open-source model community. We enhance OpenBA with effective and efficient techniques as well as adopt a three-stage training strategy to train the model from scratch. Our solution can also achieve very competitive performance with only 380B tokens, which is better than LLaMA-70B on the BELEBELE benchmark, BLOOM-176B on the MMLU benchmark, GLM-130B on the C-Eval (hard) benchmark. This report provides the main details to pre-train an analogous model, including pre-training data processing, Bilingual Flan data collection, the empirical observations that inspire our model architecture design, training objectives of different stages, and other enhancement techniques. Additionally, we also provide the fine-tuning details of OpenBA on four downstream tasks. We have refactored our code to follow the design principles of the Huggingface Transformers Library, making it more convenient for developers to use, and released checkpoints of different training stages at https://huggingface.co/openBA. More details of our project are available at https://github.com/OpenNLG/openBA.git.

cs.CL↗

A localisation theorem for singularity categories of proper dg algebras

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of their singularity categories. This allows us to recover and generalise some known results on singularity categories of finite-dimensional algebras.

math.RT↗

Opinion Tree Parsing for Aspect-based Sentiment Analysis

Extracting sentiment elements using pre-trained generative models has recently led to large improvements in aspect-based sentiment analysis benchmarks. However, these models always need large-scale computing resources, and they also ignore explicit modeling of structure between sentiment elements. To address these challenges, we propose an opinion tree parsing model, aiming to parse all the sentiment elements from an opinion tree, which is much faster, and can explicitly reveal a more comprehensive and complete aspect-level sentiment structure. In particular, we first introduce a novel context-free opinion grammar to normalize the opinion tree structure. We then employ a neural chart-based opinion tree parser to fully explore the correlations among sentiment elements and parse them into an opinion tree structure. Extensive experiments show the superiority of our proposed model and the capacity of the opinion tree parser with the proposed context-free opinion grammar. More importantly, the results also prove that our model is much faster than previous models.

cs.CL↗

Gröbner-Shirshov bases and linear bases for free multi-operated algebras over algebras with applications to differential Rota-Baxter algebras and integro-differential algebras

Quite much recent studies has been attracted to the operated algebra since it unifies various notions such as the differential algebra and the Rota-Baxter algebra. An $Ω$-operated algebra is a an (associative) algebra equipped with a set $Ω$ of linear operators which might satisfy certain operator identities such as the Leibniz rule. A free $Ω$-operated algebra $B$ can be generated on an algebra $A$ similar to a free algebra generated on a set. If $A$ has a Gröbner-Shirshov basis $G$ and if the linear operators $Ω$ satisfy a set $Φ$ of operator identities, it is natural to ask when the union $G\cup Φ$ is a Gröbner-Shirshov basis of $B$. A previous work answers this question affirmatively under a mild condition, and thereby obtains a canonical linear basis of $B$. In this paper, we answer this question in the general case of multiple linear operators. As applications we get operated Gröbner-Shirshov bases for free differential Rota-Baxter algebras and free integro-differential algebras over algebras as well as their linear bases. One of the key technical difficulties is to introduce new monomial orders for the case of two operators, which might be of independent interest.

math.RA↗

Pre-trained Token-replaced Detection Model as Few-shot Learner

Pre-trained masked language models have demonstrated remarkable ability as few-shot learners. In this paper, as an alternative, we propose a novel approach to few-shot learning with pre-trained token-replaced detection models like ELECTRA. In this approach, we reformulate a classification or a regression task as a token-replaced detection problem. Specifically, we first define a template and label description words for each task and put them into the input to form a natural language prompt. Then, we employ the pre-trained token-replaced detection model to predict which label description word is the most original (i.e., least replaced) among all label description words in the prompt. A systematic evaluation on 16 datasets demonstrates that our approach outperforms few-shot learners with pre-trained masked language models in both one-sentence and two-sentence learning tasks.

cs.CL↗