arXiv subjects
Publications and source records attributed to Yuming Liu.
Let $G$ be a Brauer graph and $A$ the associated Brauer graph algebra. Denote by $gr(A)$ the graded algebra associated with the radical filtration of $A$. The question when $gr(A)$ is of finite representation type was answered in [9]. In the present paper, we characterize when $gr(A)$ is domestic in terms of the associated Brauer graph $G$.
In a previous paper arXiv:2211.05435 we have compared the Hochschild cohomology groups of finite dimensional monomial algebras under gluing two idempotents. In the present paper, we compare the Hochschild cohomology groups of finite dimensional monomial algebras under gluing two arrows.
In this paper, we summarize a general method of transforming DG structures into higher structures on the various complexes related to the reduced bar resolution of a given quiver algebra using algebraic Morse theory. As an application, we describe the $A_\infty$-structures of toupie algebras. Additionally, for certain special toupie algebras, we also prove that their double homological duals are isomorphic to their associated graded algebras.
We give a unified generalization of Dugas' construction on stable auto-equivalences of Morita type from local symmetric algebras to arbitrary symmetric algebras. For group algebras $kP$ of $p$-groups in characteristic $p$, we recover all the stable auto-equivalences corresponding to endo-trivial modules over $kP$ except that $P$ is generalized quaternion of order $2^m$. Moreover, we give many examples of stable auto-equivalences of Morita type for non-local symmetric algebras.
Inspired by the work of Wang and Zhou [4] for Rota-Baxter algebras, we develop a cohomology theory of Rota-Baxter systems and justify it by interpreting the lower degree cohomology groups as formal deformations and as abelian extensions of Rota-Baxter systems. A further study on an $L_\infty$-algebra structure associated to this cohomology theory will be given in a subsequent paper.
The effectiveness of knowledge graph embedding (KGE) largely depends on the ability to model intrinsic relation patterns and mapping properties. However, existing approaches can only capture some of them with insufficient modeling capacity. In this work, we propose a more powerful KGE framework named HousE, which involves a novel parameterization based on two kinds of Householder transformations: (1) Householder rotations to achieve superior capacity of modeling relation patterns; (2) Householder projections to handle sophisticated relation mapping properties. Theoretically, HousE is capable of modeling crucial relation patterns and mapping properties simultaneously. Besides, HousE is a generalization of existing rotation-based models while extending the rotations to high-dimensional spaces. Empirically, HousE achieves new state-of-the-art performance on five benchmark datasets. Our code is available at https://github.com/anrep/HousE.
Breast lesions segmentation is an important step of computer-aided diagnosis system, and it has attracted much attention. However, accurate segmentation of malignant breast lesions is a challenging task due to the effects of heterogeneous structure and similar intensity distributions. In this paper, a novel bidirectional aware guidance network (BAGNet) is proposed to segment the malignant lesion from breast ultrasound images. Specifically, the bidirectional aware guidance network is used to capture the context between global (low-level) and local (high-level) features from the input coarse saliency map. The introduction of the global feature map can reduce the interference of surrounding tissue (background) on the lesion regions. To evaluate the segmentation performance of the network, we compared with several state-of-the-art medical image segmentation methods on the public breast ultrasound dataset using six commonly used evaluation metrics. Extensive experimental results indicate that our method achieves the most competitive segmentation results on malignant breast ultrasound images.
Convolutional neural networks have made significant progresses in edge detection by progressively exploring the context and semantic features. However, local details are gradually suppressed with the enlarging of receptive fields. Recently, vision transformer has shown excellent capability in capturing long-range dependencies. Inspired by this, we propose a novel transformer-based edge detector, \emph{Edge Detection TransformER (EDTER)}, to extract clear and crisp object boundaries and meaningful edges by exploiting the full image context information and detailed local cues simultaneously. EDTER works in two stages. In Stage I, a global transformer encoder is used to capture long-range global context on coarse-grained image patches. Then in Stage II, a local transformer encoder works on fine-grained patches to excavate the short-range local cues. Each transformer encoder is followed by an elaborately designed Bi-directional Multi-Level Aggregation decoder to achieve high-resolution features. Finally, the global context and local cues are combined by a Feature Fusion Module and fed into a decision head for edge prediction. Extensive experiments on BSDS500, NYUDv2, and Multicue demonstrate the superiority of EDTER in comparison with state-of-the-arts.
Let $k$ be an algebraically closed field. It is known that any stable equivalence between standard representation-finite self-injective $k$-algebras (without block of Loewy length 2) lifts to a standard derived equivalence, in particular, it is of Morita type. We show that the same holds for any stable equivalence between nonstandard representation-finite self-injective $k$-algebras. We also fill a gap in the original proof in standard case. This gives a complete solution of the liftability question raised by H. Asashiba about twenty years ago.
User-item interactions in recommendations can be naturally de-noted as a user-item bipartite graph. Given the success of graph neural networks (GNNs) in graph representation learning, GNN-based C methods have been proposed to advance recommender systems. These methods often make recommendations based on the learned user and item embeddings. However, we found that they do not perform well wit sparse user-item graphs which are quite common in real-world recommendations. Therefore, in this work, we introduce a novel perspective to build GNN-based CF methods for recommendations which leads to the proposed framework Localized Graph Collaborative Filtering (LGCF). One key advantage of LGCF is that it does not need to learn embeddings for each user and item, which is challenging in sparse scenarios. Alternatively, LGCF aims at encoding useful CF information into a localized graph and making recommendations based on such graph. Extensive experiments on various datasets validate the effectiveness of LGCF especially in sparse scenarios. Furthermore, empirical results demonstrate that LGCF provides complementary information to the embedding-based CF model which can be utilized to boost recommendation performance.
Transformers have achieved remarkable performance in a myriad of fields including natural language processing and computer vision. However, when it comes to the graph mining area, where graph neural network (GNN) has been the dominant paradigm, transformers haven't achieved competitive performance, especially on the node classification task. Existing graph transformer models typically adopt fully-connected attention mechanism on the whole input graph and thus suffer from severe scalability issues and are intractable to train in data insufficient cases. To alleviate these issues, we propose a novel Gophormer model which applies transformers on ego-graphs instead of full-graphs. Specifically, Node2Seq module is proposed to sample ego-graphs as the input of transformers, which alleviates the challenge of scalability and serves as an effective data augmentation technique to boost model performance. Moreover, different from the feature-based attention strategy in vanilla transformers, we propose a proximity-enhanced attention mechanism to capture the fine-grained structural bias. In order to handle the uncertainty introduced by the ego-graph sampling, we further propose a consistency regularization and a multi-sample inference strategy for stabilized training and testing, respectively. Extensive experiments on six benchmark datasets are conducted to demonstrate the superiority of Gophormer over existing graph transformers and popular GNNs, revealing the promising future of graph transformers.
Text encoders based on C-DSSM or transformers have demonstrated strong performance in many Natural Language Processing (NLP) tasks. Low latency variants of these models have also been developed in recent years in order to apply them in the field of sponsored search which has strict computational constraints. However these models are not the panacea to solve all the Natural Language Understanding (NLU) challenges as the pure semantic information in the data is not sufficient to fully identify the user intents. We propose the TextGNN model that naturally extends the strong twin tower structured encoders with the complementary graph information from user historical behaviors, which serves as a natural guide to help us better understand the intents and hence generate better language representations. The model inherits all the benefits of twin tower models such as C-DSSM and TwinBERT so that it can still be used in the low latency environment while achieving a significant performance gain than the strong encoder-only counterpart baseline models in both offline evaluations and online production system. In offline experiments, the model achieves a 0.14% overall increase in ROC-AUC with a 1% increased accuracy for long-tail low-frequency Ads, and in the online A/B testing, the model shows a 2.03% increase in Revenue Per Mille with a 2.32% decrease in Ad defect rate.
Sponsored search ads appear next to search results when people look for products and services on search engines. In recent years, they have become one of the most lucrative channels for marketing. As the fundamental basis of search ads, relevance modeling has attracted increasing attention due to the significant research challenges and tremendous practical value. Most existing approaches solely rely on the semantic information in the input query-ad pair, while the pure semantic information in the short ads data is not sufficient to fully identify user's search intents. Our motivation lies in incorporating the tremendous amount of unsupervised user behavior data from the historical search logs as the complementary graph to facilitate relevance modeling. In this paper, we extensively investigate how to naturally fuse the semantic textual information with the user behavior graph, and further propose three novel AdsGNN models to aggregate topological neighborhood from the perspectives of nodes, edges and tokens. Furthermore, two critical but rarely investigated problems, domain-specific pre-training and long-tail ads matching, are studied thoroughly. Empirically, we evaluate the AdsGNN models over the large industry dataset, and the experimental results of online/offline tests consistently demonstrate the superiority of our proposal.
Recently, we obtained in [7] a new characterization for an orthogonal system to be a simple-minded system in the stable module category of any representation-finite self-injective algebra. In this paper, we apply this result to give an explicit construction of simple-minded systems over self-injective Nakayama algebras.
Let $A$ be a representation-finite self-injective algebra over an algebraically closed field $k$. We give a new characterization for an orthogonal system in the stable module category $A$-$\stmod$ to be a simple-minded system. As a by-product, we show that every Nakayama-stable orthogonal system in $A$-$\stmod$ extends to a simple-minded system.
Let $A$ be a finite-dimensional self-injective algebra over an algebraically closed field, $\mathcal{C}$ a stably quasi-serial component (i.e. its stable part is a tube) of rank $n$ of the Auslander-Reiten quiver of $A$, and $\mathcal{S}$ be a simple-minded system of the stable module category $\stmod{A}$. We show that the intersection $\mathcal{S}\cap\mathcal{C}$ is of size strictly less than $n$, and consists only of modules with quasi-length strictly less than $n$. In particular, all modules in the homogeneous tubes of the Auslander-Reiten quiver of $A$ cannot be in any simple-minded system.
We determine the Batalin-Vilkovisky structure on the Tate-Hochschild cohomology of the group algebra $kG$ of a finite group $G$ in terms of the additive decomposition. In particular, we show that the Tate cohomology of $G$ is a Batalin-Vilkovisky subalgebra of the Tate-Hochschild cohomology of the group algebra $kG$, and that the Tate cochain complex of $G$ is a cyclic $A_{\infty}$-subalgebra of the Tate-Hochschild cochain complex of $kG$.
Tissue biopsy evaluation in the clinic is in need of quantitative disease markers for diagnosis and, most importantly, prognosis. Among the new technologies, quantitative phase imaging (QPI) has demonstrated promise for histopathology because it reveals intrinsic tissue nanoarchitecture through the refractive index. However, a vast majority of past QPI investigations have relied on imaging unstained tissues, which disrupts the established specimen processing. Here we present color spatial light interference microscopy (cSLIM) as a new whole slide imaging modality that performs interferometric imaging with a color detector array. As a result, cSLIM yields in a single scan both the intrinsic tissue phase map and the standard color bright-field image, familiar to the pathologist. Our results on 196 breast cancer patients indicate that cSLIM can provide not only diagnostic but also prognostic information from the alignment of collagen fibers in the tumor microenvironment. The effects of staining on the tissue phase maps were corrected by a simple mathematical normalization. These characteristics are likely to reduce barriers to clinical translation for the new cSLIM technology.