710 results on '"Chen, Hongyang"'
Search Results
2. CL4KGE: A Curriculum Learning Method for Knowledge Graph Embedding
- Author
-
Liu, Yang, Zhou, Chuan, Zhang, Peng, Cao, Yanan, Liu, Yongchao, Li, Zhao, and Chen, Hongyang
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
Knowledge graph embedding (KGE) constitutes a foundational task, directed towards learning representations for entities and relations within knowledge graphs (KGs), with the objective of crafting representations comprehensive enough to approximate the logical and symbolic interconnections among entities. In this paper, we define a metric Z-counts to measure the difficulty of training each triple ($<$head entity, relation, tail entity$>$) in KGs with theoretical analysis. Based on this metric, we propose \textbf{CL4KGE}, an efficient \textbf{C}urriculum \textbf{L}earning based training strategy for \textbf{KGE}. This method includes a difficulty measurer and a training scheduler that aids in the training of KGE models. Our approach possesses the flexibility to act as a plugin within a wide range of KGE models, with the added advantage of adaptability to the majority of KGs in existence. The proposed method has been evaluated on popular KGE models, and the results demonstrate that it enhances the state-of-the-art methods. The use of Z-counts as a metric has enabled the identification of challenging triples in KGs, which helps in devising effective training strategies., Comment: 16 pages, 3 figures
- Published
- 2024
3. GNN-SKAN: Harnessing the Power of SwallowKAN to Advance Molecular Representation Learning with GNNs
- Author
-
Li, Ruifeng, Li, Mingqian, Liu, Wei, and Chen, Hongyang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,68T99 ,J.2.4 - Abstract
Effective molecular representation learning is crucial for advancing molecular property prediction and drug design. Mainstream molecular representation learning approaches are based on Graph Neural Networks (GNNs). However, these approaches struggle with three significant challenges: insufficient annotations, molecular diversity, and architectural limitations such as over-squashing, which leads to the loss of critical structural details. To address these challenges, we introduce a new class of GNNs that integrates the Kolmogorov-Arnold Networks (KANs), known for their robust data-fitting capabilities and high accuracy in small-scale AI + Science tasks. By incorporating KANs into GNNs, our model enhances the representation of molecular structures. We further advance this approach with a variant called SwallowKAN (SKAN), which employs adaptive Radial Basis Functions (RBFs) as the core of the non-linear neurons. This innovation improves both computational efficiency and adaptability to diverse molecular structures. Building on the strengths of SKAN, we propose a new class of GNNs, GNN-SKAN, and its augmented variant, GNN-SKAN+, which incorporates a SKAN-based classifier to further boost performance. To our knowledge, this is the first work to integrate KANs into GNN architectures tailored for molecular representation learning. Experiments across 6 classification datasets, 6 regression datasets, and 4 few-shot learning datasets demonstrate that our approach achieves new state-of-the-art performance in terms of accuracy and computational cost., Comment: 10 pages, 6 figures
- Published
- 2024
4. Decision-focused Graph Neural Networks for Combinatorial Optimization
- Author
-
Liu, Yang, Zhou, Chuan, Zhang, Peng, Pan, Shirui, Li, Zhao, and Chen, Hongyang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In recent years, there has been notable interest in investigating combinatorial optimization (CO) problems by neural-based framework. An emerging strategy to tackle these challenging problems involves the adoption of graph neural networks (GNNs) as an alternative to traditional algorithms, a subject that has attracted considerable attention. Despite the growing popularity of GNNs and traditional algorithm solvers in the realm of CO, there is limited research on their integrated use and the correlation between them within an end-to-end framework. The primary focus of our work is to formulate a more efficient and precise framework for CO by employing decision-focused learning on graphs. Additionally, we introduce a decision-focused framework that utilizes GNNs to address CO problems with auxiliary support. To realize an end-to-end approach, we have designed two cascaded modules: (a) an unsupervised trained graph predictive model, and (b) a solver for quadratic binary unconstrained optimization. Empirical evaluations are conducted on various classical tasks, including maximum cut, maximum independent set, and minimum vertex cover. The experimental results on classical CO problems (i.e. MaxCut, MIS, and MVC) demonstrate the superiority of our method over both the standalone GNN approach and classical methods., Comment: 9 pages
- Published
- 2024
5. Combinatorial Optimization with Automated Graph Neural Networks
- Author
-
Liu, Yang, Zhang, Peng, Gao, Yang, Zhou, Chuan, Li, Zhao, and Chen, Hongyang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In recent years, graph neural networks (GNNs) have become increasingly popular for solving NP-hard combinatorial optimization (CO) problems, such as maximum cut and maximum independent set. The core idea behind these methods is to represent a CO problem as a graph and then use GNNs to learn the node/graph embedding with combinatorial information. Although these methods have achieved promising results, given a specific CO problem, the design of GNN architectures still requires heavy manual work with domain knowledge. Existing automated GNNs are mostly focused on traditional graph learning problems, which is inapplicable to solving NP-hard CO problems. To this end, we present a new class of \textbf{AUTO}mated \textbf{G}NNs for solving \textbf{NP}-hard problems, namely \textbf{AutoGNP}. We represent CO problems by GNNs and focus on two specific problems, i.e., mixed integer linear programming and quadratic unconstrained binary optimization. The idea of AutoGNP is to use graph neural architecture search algorithms to automatically find the best GNNs for a given NP-hard combinatorial optimization problem. Compared with existing graph neural architecture search algorithms, AutoGNP utilizes two-hop operators in the architecture search space. Moreover, AutoGNP utilizes simulated annealing and a strict early stopping policy to avoid local optimal solutions. Empirical results on benchmark combinatorial problems demonstrate the superiority of our proposed model., Comment: 9 pages
- Published
- 2024
6. Input Snapshots Fusion for Scalable Discrete Dynamic Graph Nerual Networks
- Author
-
Qi, QingGuo, Chen, Hongyang, Cheng, Minhao, and Liu, Han
- Subjects
Computer Science - Machine Learning - Abstract
Dynamic graphs are ubiquitous in the real world, yet there is a lack of suitable theoretical frameworks to effectively extend existing static graph models into the temporal domain. Additionally, for link prediction tasks on discrete dynamic graphs, the requirement of substantial GPU memory to store embeddings of all nodes hinders the scalability of existing models. In this paper, we introduce an Input {\bf S}napshots {\bf F}usion based {\bf Dy}namic {\bf G}raph Neural Network (SFDyG). By eliminating the partitioning of snapshots within the input window, we obtain a multi-graph (more than one edge between two nodes). Subsequently, by introducing a graph denoising problem with the assumption of temporal decayed smoothing, we integrate Hawkes process theory into Graph Neural Networks to model the generated multi-graph. Furthermore, based on the multi-graph, we propose a scalable three-step mini-batch training method and demonstrate its equivalence to full-batch training counterpart. Our experiments, conducted on eight distinct dynamic graph datasets for future link prediction tasks, revealed that SFDyG generally surpasses related methods.
- Published
- 2024
7. Liberating Seen Classes: Boosting Few-Shot and Zero-Shot Text Classification via Anchor Generation and Classification Reframing
- Author
-
Liu, Han, Zhao, Siyang, Zhang, Xiaotong, Zhang, Feng, Wang, Wei, Ma, Fenglong, Chen, Hongyang, Yu, Hong, and Zhang, Xianchao
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Few-shot and zero-shot text classification aim to recognize samples from novel classes with limited labeled samples or no labeled samples at all. While prevailing methods have shown promising performance via transferring knowledge from seen classes to unseen classes, they are still limited by (1) Inherent dissimilarities among classes make the transformation of features learned from seen classes to unseen classes both difficult and inefficient. (2) Rare labeled novel samples usually cannot provide enough supervision signals to enable the model to adjust from the source distribution to the target distribution, especially for complicated scenarios. To alleviate the above issues, we propose a simple and effective strategy for few-shot and zero-shot text classification. We aim to liberate the model from the confines of seen classes, thereby enabling it to predict unseen categories without the necessity of training on seen classes. Specifically, for mining more related unseen category knowledge, we utilize a large pre-trained language model to generate pseudo novel samples, and select the most representative ones as category anchors. After that, we convert the multi-class classification task into a binary classification task and use the similarities of query-anchor pairs for prediction to fully leverage the limited supervision signals. Extensive experiments on six widely used public datasets show that our proposed method can outperform other strong baselines significantly in few-shot and zero-shot tasks, even without using any seen class samples., Comment: Accepted to AAAI 2024
- Published
- 2024
8. Physical formula enhanced multi-task learning for pharmacokinetics prediction
- Author
-
Li, Ruifeng, Zhou, Dongzhan, Shen, Ancheng, Zhang, Ao, Su, Mao, Li, Mingqian, Chen, Hongyang, Chen, Gang, Zhang, Yin, Zhang, Shufei, Li, Yuqiang, and Ouyang, Wanli
- Subjects
Quantitative Biology - Quantitative Methods ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Machine Learning - Abstract
Artificial intelligence (AI) technology has demonstrated remarkable potential in drug dis-covery, where pharmacokinetics plays a crucial role in determining the dosage, safety, and efficacy of new drugs. A major challenge for AI-driven drug discovery (AIDD) is the scarcity of high-quality data, which often requires extensive wet-lab work. A typical example of this is pharmacokinetic experiments. In this work, we develop a physical formula enhanced mul-ti-task learning (PEMAL) method that predicts four key parameters of pharmacokinetics simultaneously. By incorporating physical formulas into the multi-task framework, PEMAL facilitates effective knowledge sharing and target alignment among the pharmacokinetic parameters, thereby enhancing the accuracy of prediction. Our experiments reveal that PEMAL significantly lowers the data demand, compared to typical Graph Neural Networks. Moreover, we demonstrate that PEMAL enhances the robustness to noise, an advantage that conventional Neural Networks do not possess. Another advantage of PEMAL is its high flexibility, which can be potentially applied to other multi-task machine learning scenarios. Overall, our work illustrates the benefits and potential of using PEMAL in AIDD and other scenarios with data scarcity and noise.
- Published
- 2024
9. A Watermark-Conditioned Diffusion Model for IP Protection
- Author
-
Min, Rui, Li, Sen, Chen, Hongyang, and Cheng, Minhao
- Subjects
Computer Science - Cryptography and Security - Abstract
The ethical need to protect AI-generated content has been a significant concern in recent years. While existing watermarking strategies have demonstrated success in detecting synthetic content (detection), there has been limited exploration in identifying the users responsible for generating these outputs from a single model (owner identification). In this paper, we focus on both practical scenarios and propose a unified watermarking framework for content copyright protection within the context of diffusion models. Specifically, we consider two parties: the model provider, who grants public access to a diffusion model via an API, and the users, who can solely query the model API and generate images in a black-box manner. Our task is to embed hidden information into the generated contents, which facilitates further detection and owner identification. To tackle this challenge, we propose a Watermark-conditioned Diffusion model called WaDiff, which manipulates the watermark as a conditioned input and incorporates fingerprinting into the generation process. All the generative outputs from our WaDiff carry user-specific information, which can be recovered by an image extractor and further facilitate forensic identification. Extensive experiments are conducted on two popular diffusion models, and we demonstrate that our method is effective and robust in both the detection and owner identification tasks. Meanwhile, our watermarking framework only exerts a negligible impact on the original generation and is more stealthy and efficient in comparison to existing watermarking strategies.
- Published
- 2024
10. Collaborate to Adapt: Source-Free Graph Domain Adaptation via Bi-directional Adaptation
- Author
-
Zhang, Zhen, Liu, Meihan, Wang, Anhui, Chen, Hongyang, Li, Zhao, Bu, Jiajun, and He, Bingsheng
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Unsupervised Graph Domain Adaptation (UGDA) has emerged as a practical solution to transfer knowledge from a label-rich source graph to a completely unlabelled target graph. However, most methods require a labelled source graph to provide supervision signals, which might not be accessible in the real-world settings due to regulations and privacy concerns. In this paper, we explore the scenario of source-free unsupervised graph domain adaptation, which tries to address the domain adaptation problem without accessing the labelled source graph. Specifically, we present a novel paradigm called GraphCTA, which performs model adaptation and graph adaptation collaboratively through a series of procedures: (1) conduct model adaptation based on node's neighborhood predictions in target graph considering both local and global information; (2) perform graph adaptation by updating graph structure and node attributes via neighborhood contrastive learning; and (3) the updated graph serves as an input to facilitate the subsequent iteration of model adaptation, thereby establishing a collaborative loop between model adaptation and graph adaptation. Comprehensive experiments are conducted on various public datasets. The experimental results demonstrate that our proposed model outperforms recent source-free baselines by large margins., Comment: Accepted by WWW-2024
- Published
- 2024
- Full Text
- View/download PDF
11. Deep Frequency-Aware Functional Maps for Robust Shape Matching
- Author
-
Luo, Feifan, Li, Qinsong, Hu, Ling, Wang, Haibo, Liu, Xinru, Liu, Shengjun, and Chen, Hongyang
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Deep functional map frameworks are widely employed for 3D shape matching. However, most existing deep functional map methods cannot adaptively capture important frequency information for functional map estimation in specific matching scenarios, i.e., lacking \textit{frequency awareness}, resulting in poor performance when dealing with large deformable shape matching. To this end, we propose a novel unsupervised learning-based framework called Deep Frequency-Aware Functional Maps, which can gracefully cope with various shape matching scenarios. We first introduce a general constraint called Spectral Filter Operator Preservation to compute desirable functional maps, where the spectral filter operator encodes informative frequency information and can promote frequency awareness for deep functional map frameworks by learning a set of filter functions. Then, we directly utilize the proposed constraint as a loss function to supervise functional maps, pointwise maps, and filter functions simultaneously, where the filter functions are derived from the orthonormal Jacobi basis, and the coefficients of the basis are learnable parameters. Finally, we develop an effective refinement strategy to improve the final pointwise map, which incorporates our constraint and learned filter functions, leading to more robust and accurate correspondences during the inference process. Extensive experimental results on various datasets demonstrate that our approach outperforms the existing state-of-the-art methods, especially in challenging settings like datasets with non-isometric deformation and inconsistent topology.
- Published
- 2024
12. HQA-Attack: Toward High Quality Black-Box Hard-Label Adversarial Attack on Text
- Author
-
Liu, Han, Xu, Zhi, Zhang, Xiaotong, Zhang, Feng, Ma, Fenglong, Chen, Hongyang, Yu, Hong, and Zhang, Xianchao
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Black-box hard-label adversarial attack on text is a practical and challenging task, as the text data space is inherently discrete and non-differentiable, and only the predicted label is accessible. Research on this problem is still in the embryonic stage and only a few methods are available. Nevertheless, existing methods rely on the complex heuristic algorithm or unreliable gradient estimation strategy, which probably fall into the local optimum and inevitably consume numerous queries, thus are difficult to craft satisfactory adversarial examples with high semantic similarity and low perturbation rate in a limited query budget. To alleviate above issues, we propose a simple yet effective framework to generate high quality textual adversarial examples under the black-box hard-label attack scenarios, named HQA-Attack. Specifically, after initializing an adversarial example randomly, HQA-attack first constantly substitutes original words back as many as possible, thus shrinking the perturbation rate. Then it leverages the synonym set of the remaining changed words to further optimize the adversarial example with the direction which can improve the semantic similarity and satisfy the adversarial condition simultaneously. In addition, during the optimizing procedure, it searches a transition synonym word for each changed word, thus avoiding traversing the whole synonym set and reducing the query number to some extent. Extensive experimental results on five text classification datasets, three natural language inference datasets and two real-world APIs have shown that the proposed HQA-Attack method outperforms other strong baselines significantly.
- Published
- 2024
13. Two Heads Are Better Than One: Integrating Knowledge from Knowledge Graphs and Large Language Models for Entity Alignment
- Author
-
Yang, Linyao, Chen, Hongyang, Wang, Xiao, Yang, Jing, Wang, Fei-Yue, and Liu, Han
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Entity alignment, which is a prerequisite for creating a more comprehensive Knowledge Graph (KG), involves pinpointing equivalent entities across disparate KGs. Contemporary methods for entity alignment have predominantly utilized knowledge embedding models to procure entity embeddings that encapsulate various similarities-structural, relational, and attributive. These embeddings are then integrated through attention-based information fusion mechanisms. Despite this progress, effectively harnessing multifaceted information remains challenging due to inherent heterogeneity. Moreover, while Large Language Models (LLMs) have exhibited exceptional performance across diverse downstream tasks by implicitly capturing entity semantics, this implicit knowledge has yet to be exploited for entity alignment. In this study, we propose a Large Language Model-enhanced Entity Alignment framework (LLMEA), integrating structural knowledge from KGs with semantic knowledge from LLMs to enhance entity alignment. Specifically, LLMEA identifies candidate alignments for a given entity by considering both embedding similarities between entities across KGs and edit distances to a virtual equivalent entity. It then engages an LLM iteratively, posing multiple multi-choice questions to draw upon the LLM's inference capability. The final prediction of the equivalent entity is derived from the LLM's output. Experiments conducted on three public datasets reveal that LLMEA surpasses leading baseline models. Additional ablation studies underscore the efficacy of our proposed framework.
- Published
- 2024
14. Diffusion-based Graph Generative Methods
- Author
-
Chen, Hongyang, Xu, Can, Zheng, Lingyu, Zhang, Qiang, and Lin, Xuemin
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Being the most cutting-edge generative methods, diffusion methods have shown great advances in wide generation tasks. Among them, graph generation attracts significant research attention for its broad application in real life. In our survey, we systematically and comprehensively review on diffusion-based graph generative methods. We first make a review on three mainstream paradigms of diffusion methods, which are denoising diffusion probabilistic models, score-based genrative models, and stochastic differential equations. Then we further categorize and introduce the latest applications of diffusion models on graphs. In the end, we point out some limitations of current studies and future directions of future explorations. The summary of existing methods metioned in this survey is in https://github.com/zhejiangzhuque/Diffusion-based-Graph-Generative-Methods.
- Published
- 2024
15. Scientific Large Language Models: A Survey on Biological & Chemical Domains
- Author
-
Zhang, Qiang, Ding, Keyang, Lyv, Tianwen, Wang, Xinda, Yin, Qingyu, Zhang, Yiwen, Yu, Jing, Wang, Yuhao, Li, Xiaotong, Xiang, Zhuoyi, Feng, Kehua, Zhuang, Xiang, Wang, Zeyuan, Qin, Ming, Zhang, Mengyao, Zhang, Jinlu, Cui, Jiyu, Huang, Tao, Yan, Pengju, Xu, Renjun, Chen, Hongyang, Li, Xiaolin, Fan, Xiaohui, Xing, Huabin, and Chen, Huajun
- Subjects
Computer Science - Computation and Language - Abstract
Large Language Models (LLMs) have emerged as a transformative power in enhancing natural language comprehension, representing a significant stride toward artificial general intelligence. The application of LLMs extends beyond conventional linguistic boundaries, encompassing specialized linguistic systems developed within various scientific disciplines. This growing interest has led to the advent of scientific LLMs, a novel subclass specifically engineered for facilitating scientific discovery. As a burgeoning area in the community of AI for Science, scientific LLMs warrant comprehensive exploration. However, a systematic and up-to-date survey introducing them is currently lacking. In this paper, we endeavor to methodically delineate the concept of "scientific language", whilst providing a thorough review of the latest advancements in scientific LLMs. Given the expansive realm of scientific disciplines, our analysis adopts a focused lens, concentrating on the biological and chemical domains. This includes an in-depth examination of LLMs for textual knowledge, small molecules, macromolecular proteins, genomic sequences, and their combinations, analyzing them in terms of model architectures, capabilities, datasets, and evaluation. Finally, we critically examine the prevailing challenges and point out promising research directions along with the advances of LLMs. By offering a comprehensive overview of technical developments in this field, this survey aspires to be an invaluable resource for researchers navigating the intricate landscape of scientific LLMs.
- Published
- 2024
16. Search for Long-lived Particles at Future Lepton Colliders Using Deep Learning Techniques
- Author
-
Zhang, Yulei, Mo, Cen, Chen, Xiang, Li, Bingzhi, Chen, Hongyang, Hu, Jifeng, and Li, Liang
- Subjects
High Energy Physics - Experiment ,High Energy Physics - Phenomenology - Abstract
Long-lived particles (LLPs) provide an unambiguous signal for physics beyond the Standard Model (BSM). They have a distinct detector signature, with decay lengths corresponding to lifetimes of around nanoseconds or longer. Lepton colliders allow LLP searches to be conducted in a clean environment, and such searches can reach their full physics potential when combined with machine learning (ML) techniques. In the case of LLPs searches from Higgs decay in $e^+e^-\to ZH$, we show that the LLP signal efficiency can be improved up to 99% with an LLP mass around 50 GeV and a lifetime of approximately $1$ nanosecond, using deep neural network based approaches. The signal sensitivity for the branching ratio of Higgs decaying into LLPs reaches $1.2 \times 10^{-6}$ with a statistics of $4 \times 10^{6}$ Higgs.
- Published
- 2024
17. Geometric-Facilitated Denoising Diffusion Model for 3D Molecule Generation
- Author
-
Xu, Can, Wang, Haosen, Wang, Weigang, Zheng, Pengfei, and Chen, Hongyang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Quantitative Biology - Biomolecules - Abstract
Denoising diffusion models have shown great potential in multiple research areas. Existing diffusion-based generative methods on de novo 3D molecule generation face two major challenges. Since majority heavy atoms in molecules allow connections to multiple atoms through single bonds, solely using pair-wise distance to model molecule geometries is insufficient. Therefore, the first one involves proposing an effective neural network as the denoising kernel that is capable to capture complex multi-body interatomic relationships and learn high-quality features. Due to the discrete nature of graphs, mainstream diffusion-based methods for molecules heavily rely on predefined rules and generate edges in an indirect manner. The second challenge involves accommodating molecule generation to diffusion and accurately predicting the existence of bonds. In our research, we view the iterative way of updating molecule conformations in diffusion process is consistent with molecular dynamics and introduce a novel molecule generation method named Geometric-Facilitated Molecular Diffusion (GFMDiff). For the first challenge, we introduce a Dual-Track Transformer Network (DTN) to fully excevate global spatial relationships and learn high quality representations which contribute to accurate predictions of features and geometries. As for the second challenge, we design Geometric-Facilitated Loss (GFLoss) which intervenes the formation of bonds during the training period, instead of directly embedding edges into the latent space. Comprehensive experiments on current benchmarks demonstrate the superiority of GFMDiff., Comment: 9 pages, 6 figures, AAAI-24 Main Track
- Published
- 2024
- Full Text
- View/download PDF
18. RHGNN: imposing relational inductive bias for heterogeneous graph neural network
- Author
-
Zhu, Shichao, Zhang, Shuai, Liu, Yang, Zhou, Chuan, Pan, Shirui, Li, Zhao, and Chen, Hongyang
- Published
- 2024
- Full Text
- View/download PDF
19. Scalable Algorithms for Laplacian Pseudo-inverse Computation
- Author
-
Liao, Meihao, Li, Rong-Hua, Dai, Qiangqiang, Chen, Hongyang, and Wang, Guoren
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's constant, and evaluation of resistance distance. However, existing algorithms for computing $L^\dagger$ are often computationally expensive when dealing with large graphs. To overcome this challenge, we propose novel solutions for approximating $L^\dagger$ by establishing a connection with the inverse of a Laplacian submatrix $L_v$. This submatrix is obtained by removing the $v$-th row and column from the original Laplacian matrix $L$. The key advantage of this connection is that $L_v^{-1}$ exhibits various interesting combinatorial interpretations. We present two innovative interpretations of $L_v^{-1}$ based on spanning trees and loop-erased random walks, which allow us to develop efficient sampling algorithms. Building upon these new theoretical insights, we propose two novel algorithms for efficiently approximating both electrical closeness centrality and Kemeny's constant. We extensively evaluate the performance of our algorithms on five real-life datasets. The results demonstrate that our novel approaches significantly outperform the state-of-the-art methods by several orders of magnitude in terms of both running time and estimation errors for these two graph analysis tasks. To further illustrate the effectiveness of electrical closeness centrality and Kemeny's constant, we present two case studies that showcase the practical applications of these metrics.
- Published
- 2023
20. Deep Learning Assisted Multiuser MIMO Load Modulated Systems for Enhanced Downlink mmWave Communications
- Author
-
Yu, Ercong, Zhu, Jinle, Li, Qiang, Liu, Zilong, Chen, Hongyang, Shamai, Shlomo, and Poor, H. Vincent
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Information Theory ,Computer Science - Machine Learning - Abstract
This paper is focused on multiuser load modulation arrays (MU-LMAs) which are attractive due to their low system complexity and reduced cost for millimeter wave (mmWave) multi-input multi-output (MIMO) systems. The existing precoding algorithm for downlink MU-LMA relies on a sub-array structured (SAS) transmitter which may suffer from decreased degrees of freedom and complex system configuration. Furthermore, a conventional LMA codebook with codewords uniformly distributed on a hypersphere may not be channel-adaptive and may lead to increased signal detection complexity. In this paper, we conceive an MU-LMA system employing a full-array structured (FAS) transmitter and propose two algorithms accordingly. The proposed FAS-based system addresses the SAS structural problems and can support larger numbers of users. For LMA-imposed constant-power downlink precoding, we propose an FAS-based normalized block diagonalization (FAS-NBD) algorithm. However, the forced normalization may result in performance degradation. This degradation, together with the aforementioned codebook design problems, is difficult to solve analytically. This motivates us to propose a Deep Learning-enhanced (FAS-DL-NBD) algorithm for adaptive codebook design and codebook-independent decoding. It is shown that the proposed algorithms are robust to imperfect knowledge of channel state information and yield excellent error performance. Moreover, the FAS-DL-NBD algorithm enables signal detection with low complexity as the number of bits per codeword increases., Comment: 14 pages, Journal, accepted by IEEE TWC
- Published
- 2023
21. Boosting Decision-Based Black-Box Adversarial Attack with Gradient Priors
- Author
-
Liu, Han, Huang, Xingshuo, Zhang, Xiaotong, Li, Qimai, Ma, Fenglong, Wang, Wei, Chen, Hongyang, Yu, Hong, and Zhang, Xianchao
- Subjects
Computer Science - Machine Learning ,Computer Science - Cryptography and Security ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Decision-based methods have shown to be effective in black-box adversarial attacks, as they can obtain satisfactory performance and only require to access the final model prediction. Gradient estimation is a critical step in black-box adversarial attacks, as it will directly affect the query efficiency. Recent works have attempted to utilize gradient priors to facilitate score-based methods to obtain better results. However, these gradient priors still suffer from the edge gradient discrepancy issue and the successive iteration gradient direction issue, thus are difficult to simply extend to decision-based methods. In this paper, we propose a novel Decision-based Black-box Attack framework with Gradient Priors (DBA-GP), which seamlessly integrates the data-dependent gradient prior and time-dependent prior into the gradient estimation procedure. First, by leveraging the joint bilateral filter to deal with each random perturbation, DBA-GP can guarantee that the generated perturbations in edge locations are hardly smoothed, i.e., alleviating the edge gradient discrepancy, thus remaining the characteristics of the original image as much as possible. Second, by utilizing a new gradient updating strategy to automatically adjust the successive iteration gradient direction, DBA-GP can accelerate the convergence speed, thus improving the query efficiency. Extensive experiments have demonstrated that the proposed method outperforms other strong baselines significantly., Comment: Accepted by IJCAI 2023
- Published
- 2023
22. Debunking Free Fusion Myth: Online Multi-view Anomaly Detection with Disentangled Product-of-Experts Modeling
- Author
-
Wang, Hao, Cheng, Zhi-Qi, Sun, Jingdong, Yang, Xin, Wu, Xiao, Chen, Hongyang, and Yang, Yan
- Subjects
Computer Science - Machine Learning ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Multimedia - Abstract
Multi-view or even multi-modal data is appealing yet challenging for real-world applications. Detecting anomalies in multi-view data is a prominent recent research topic. However, most of the existing methods 1) are only suitable for two views or type-specific anomalies, 2) suffer from the issue of fusion disentanglement, and 3) do not support online detection after model deployment. To address these challenges, our main ideas in this paper are three-fold: multi-view learning, disentangled representation learning, and generative model. To this end, we propose dPoE, a novel multi-view variational autoencoder model that involves (1) a Product-of-Experts (PoE) layer in tackling multi-view data, (2) a Total Correction (TC) discriminator in disentangling view-common and view-specific representations, and (3) a joint loss function in wrapping up all components. In addition, we devise theoretical information bounds to control both view-common and view-specific representations. Extensive experiments on six real-world datasets markedly demonstrate that the proposed dPoE outperforms baselines., Comment: Accepted by ACM Multimedia 2023, 10 pages, 5 tables, and 3 figures
- Published
- 2023
23. Learning Invariant Molecular Representation in Latent Discrete Space
- Author
-
Zhuang, Xiang, Zhang, Qiang, Ding, Keyan, Bian, Yatao, Wang, Xiao, Lv, Jingsong, Chen, Hongyang, and Chen, Huajun
- Subjects
Computer Science - Machine Learning - Abstract
Molecular representation learning lays the foundation for drug discovery. However, existing methods suffer from poor out-of-distribution (OOD) generalization, particularly when data for training and testing originate from different environments. To address this issue, we propose a new framework for learning molecular representations that exhibit invariance and robustness against distribution shifts. Specifically, we propose a strategy called ``first-encoding-then-separation'' to identify invariant molecule features in the latent space, which deviates from conventional practices. Prior to the separation step, we introduce a residual vector quantization module that mitigates the over-fitting to training data distributions while preserving the expressivity of encoders. Furthermore, we design a task-agnostic self-supervised learning objective to encourage precise invariance identification, which enables our method widely applicable to a variety of tasks, such as regression and multi-label classification. Extensive experiments on 18 real-world molecular datasets demonstrate that our model achieves stronger generalization against state-of-the-art baselines in the presence of various distribution shifts. Our code is available at https://github.com/HICAI-ZJU/iMoLD.
- Published
- 2023
24. Graph Neural Architecture Search with GPT-4
- Author
-
Wang, Haishuai, Gao, Yang, Zheng, Xin, Zhang, Peng, Chen, Hongyang, Bu, Jiajun, and Yu, Philip S.
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Graph Neural Architecture Search (GNAS) has shown promising results in automatically designing graph neural networks. However, GNAS still requires intensive human labor with rich domain knowledge to design the search space and search strategy. In this paper, we integrate GPT-4 into GNAS and propose a new GPT-4 based Graph Neural Architecture Search method (GPT4GNAS for short). The basic idea of our method is to design a new class of prompts for GPT-4 to guide GPT-4 toward the generative task of graph neural architectures. The prompts consist of descriptions of the search space, search strategy, and search feedback of GNAS. By iteratively running GPT-4 with the prompts, GPT4GNAS generates more accurate graph neural networks with fast convergence. Experimental results show that embedding GPT-4 into GNAS outperforms the state-of-the-art GNAS methods.
- Published
- 2023
25. Exploring Sentence Type Effects on the Lombard Effect and Intelligibility Enhancement: A Comparative Study of Natural and Grid Sentences
- Author
-
Chen, Hongyang, Yang, Yuhong, Wang, Zhongyuan, Tu, Weiping, Ai, Haojun, and Lin, Song
- Subjects
Computer Science - Sound ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Audio and Speech Processing - Abstract
This study explores how sentence types affect the Lombard effect and intelligibility enhancement, focusing on comparisons between natural and grid sentences. Using the Lombard Chinese-TIMIT (LCT) corpus and the Enhanced MAndarin Lombard Grid (EMALG) corpus, we analyze changes in phonetic and acoustic features across different noise levels. Our results show that grid sentences produce more pronounced Lombard effects than natural sentences. Then, we develop and test a normal-to-Lombard conversion model, trained separately on LCT and EMALG corpora. Through subjective and objective evaluations, natural sentences are superior in maintaining speech quality in intelligibility enhancement. In contrast, grid sentences could provide superior intelligibility due to the more pronounced Lombard effect. This study provides a valuable perspective on enhancing speech communication in noisy environments.
- Published
- 2023
26. Mandarin Lombard Flavor Classification
- Author
-
Liu, Qingmu, Yang, Yuhong, Li, Baifeng, Chen, Hongyang, Tu, Weiping, and Lin, Song
- Subjects
Computer Science - Sound ,Electrical Engineering and Systems Science - Audio and Speech Processing - Abstract
The Lombard effect refers to individuals' unconscious modulation of vocal effort in response to variations in the ambient noise levels, intending to enhance speech intelligibility. The impact of different decibel levels and types of background noise on Lombard effects remains unclear. Building upon the characteristic of Lombard speech that individuals adjust their speech to improve intelligibility dynamically based on the self-feedback speech, we propose a flavor classification approach for the Lombard effect. We first collected Mandarin Lombard speech under different noise conditions, then simulated self-feedback speech, and ultimately conducted the statistical test on the word correct rate. We found that both SSN and babble noise types result in four distinct categories of Mandarin Lombard speech in the range of 30 to 80 dBA with different transition points.
- Published
- 2023
27. EMALG: An Enhanced Mandarin Lombard Grid Corpus with Meaningful Sentences
- Author
-
Li, Baifeng, Liu, Qingmu, Yang, Yuhong, Chen, Hongyang, Tu, Weiping, and Lin, Song
- Subjects
Computer Science - Sound ,Electrical Engineering and Systems Science - Audio and Speech Processing - Abstract
This study investigates the Lombard effect, where individuals adapt their speech in noisy environments. We introduce an enhanced Mandarin Lombard grid (EMALG) corpus with meaningful sentences , enhancing the Mandarin Lombard grid (MALG) corpus. EMALG features 34 speakers and improves recording setups, addressing challenges faced by MALG with nonsense sentences. Our findings reveal that in Mandarin, meaningful sentences are more effective in enhancing the Lombard effect. Additionally, we uncover that female exhibit a more pronounced Lombard effect than male when uttering meaningful sentences. Moreover, our results reaffirm the consistency in the Lombard effect comparison between English and Mandarin found in previous research.
- Published
- 2023
28. Circle Feature Graphormer: Can Circle Features Stimulate Graph Transformer?
- Author
-
Lv, Jingsong, Chen, Hongyang, Qi, Yao, and Yu, Lei
- Subjects
Computer Science - Social and Information Networks ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
In this paper, we introduce two local graph features for missing link prediction tasks on ogbl-citation2. We define the features as Circle Features, which are borrowed from the concept of circle of friends. We propose the detailed computing formulas for the above features. Firstly, we define the first circle feature as modified swing for common graph, which comes from bipartite graph. Secondly, we define the second circle feature as bridge, which indicates the importance of two nodes for different circle of friends. In addition, we firstly propose the above features as bias to enhance graph transformer neural network, such that graph self-attention mechanism can be improved. We implement a Circled Feature aware Graph transformer (CFG) model based on SIEG network, which utilizes a double tower structure to capture both global and local structure features. Experimental results show that CFG achieves the state-of-the-art performance on dataset ogbl-citation2., Comment: 3 pages, 2 figures, 1 table, 31 references, manuscript in preparation
- Published
- 2023
29. HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks
- Author
-
Zhu, Guanghui, Zhu, Zhennan, Chen, Hongyang, Yuan, Chunfeng, and Huang, Yihua
- Subjects
Computer Science - Machine Learning - Abstract
Heterogeneous graph neural networks (GNNs) have been successful in handling heterogeneous graphs. In existing heterogeneous GNNs, meta-path plays an essential role. However, recent work pointed out that simple homogeneous graph model without meta-path can also achieve comparable results, which calls into question the necessity of meta-path. In this paper, we first present the intrinsic difference about meta-path-based and meta-path-free models, i.e., how to select neighbors for node aggregation. Then, we propose a novel framework to utilize the rich type semantic information in heterogeneous graphs comprehensively, namely HAGNN (Hybrid Aggregation for Heterogeneous GNNs). The core of HAGNN is to leverage the meta-path neighbors and the directly connected neighbors simultaneously for node aggregations. HAGNN divides the overall aggregation process into two phases: meta-path-based intra-type aggregation and meta-path-free inter-type aggregation. During the intra-type aggregation phase, we propose a new data structure called fused meta-path graph and perform structural semantic aware aggregation on it. Finally, we combine the embeddings generated by each phase. Compared with existing heterogeneous GNN models, HAGNN can take full advantage of the heterogeneity in heterogeneous graphs. Extensive experimental results on node classification, node clustering, and link prediction tasks show that HAGNN outperforms the existing modes, demonstrating the effectiveness of HAGNN.
- Published
- 2023
30. Give Us the Facts: Enhancing Large Language Models with Knowledge Graphs for Fact-aware Language Modeling
- Author
-
Yang, Linyao, Chen, Hongyang, Li, Zhao, Ding, Xiao, and Wu, Xindong
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Recently, ChatGPT, a representative large language model (LLM), has gained considerable attention due to its powerful emergent abilities. Some researchers suggest that LLMs could potentially replace structured knowledge bases like knowledge graphs (KGs) and function as parameterized knowledge bases. However, while LLMs are proficient at learning probabilistic language patterns based on large corpus and engaging in conversations with humans, they, like previous smaller pre-trained language models (PLMs), still have difficulty in recalling facts while generating knowledge-grounded contents. To overcome these limitations, researchers have proposed enhancing data-driven PLMs with knowledge-based KGs to incorporate explicit factual knowledge into PLMs, thus improving their performance to generate texts requiring factual knowledge and providing more informed responses to user queries. This paper reviews the studies on enhancing PLMs with KGs, detailing existing knowledge graph enhanced pre-trained language models (KGPLMs) as well as their applications. Inspired by existing studies on KGPLM, this paper proposes to enhance LLMs with KGs by developing knowledge graph-enhanced large language models (KGLLMs). KGLLM provides a solution to enhance LLMs' factual reasoning ability, opening up new avenues for LLM research.
- Published
- 2023
31. Graph Neural Processes for Spatio-Temporal Extrapolation
- Author
-
Hu, Junfeng, Liang, Yuxuan, Fan, Zhencheng, Chen, Hongyang, Zheng, Yu, and Zimmermann, Roger
- Subjects
Computer Science - Machine Learning - Abstract
We study the task of spatio-temporal extrapolation that generates data at target locations from surrounding contexts in a graph. This task is crucial as sensors that collect data are sparsely deployed, resulting in a lack of fine-grained information due to high deployment and maintenance costs. Existing methods either use learning-based models like Neural Networks or statistical approaches like Gaussian Processes for this task. However, the former lacks uncertainty estimates and the latter fails to capture complex spatial and temporal correlations effectively. To address these issues, we propose Spatio-Temporal Graph Neural Processes (STGNP), a neural latent variable model which commands these capabilities simultaneously. Specifically, we first learn deterministic spatio-temporal representations by stacking layers of causal convolutions and cross-set graph neural networks. Then, we learn latent variables for target locations through vertical latent state transitions along layers and obtain extrapolations. Importantly during the transitions, we propose Graph Bayesian Aggregation (GBA), a Bayesian graph aggregator that aggregates contexts considering uncertainties in context data and graph structure. Extensive experiments show that STGNP has desirable properties such as uncertainty estimates and strong learning capabilities, and achieves state-of-the-art results by a clear margin., Comment: SIGKDD 2023
- Published
- 2023
- Full Text
- View/download PDF
32. Incidence of metabolic syndrome in patients with unilateral or bilateral staghorn renal stones and its impact on percutaneous nephrolithotomy outcomes
- Author
-
Shen, Zhonghua, Xie, Linguo, Luo, Di, Xie, Haijie, Chen, Hongyang, and Liu, Chunyu
- Published
- 2024
- Full Text
- View/download PDF
33. LVPocket: integrated 3D global-local information to protein binding pockets prediction with transfer learning of protein structure classification
- Author
-
Zhou, Ruifeng, Fan, Jing, Li, Sishu, Zeng, Wenjie, Chen, Yilun, Zheng, Xiaoshan, Chen, Hongyang, and Liao, Jun
- Published
- 2024
- Full Text
- View/download PDF
34. DeepAEG: a model for predicting cancer drug response based on data enhancement and edge-collaborative update strategies
- Author
-
Lao, Chuanqi, Zheng, Pengfei, Chen, Hongyang, Liu, Qiao, An, Feng, and Li, Zhao
- Published
- 2024
- Full Text
- View/download PDF
35. Soil acidification drives the negative effects of nitrogen enrichment on soil microbial biomass at the global scale
- Author
-
Li, Shucheng, Tang, Shiming, Ju, Xiaotang, Zhu, Zhihao, Zhang, Yujuan, Chen, Hongyang, and Jin, Ke
- Published
- 2024
- Full Text
- View/download PDF
36. Boosting Few-Shot Text Classification via Distribution Estimation
- Author
-
Liu, Han, Zhang, Feng, Zhang, Xiaotong, Zhao, Siyang, Ma, Fenglong, Wu, Xiao-Ming, Chen, Hongyang, Yu, Hong, and Zhang, Xianchao
- Subjects
Computer Science - Computation and Language - Abstract
Distribution estimation has been demonstrated as one of the most effective approaches in dealing with few-shot image classification, as the low-level patterns and underlying representations can be easily transferred across different tasks in computer vision domain. However, directly applying this approach to few-shot text classification is challenging, since leveraging the statistics of known classes with sufficient samples to calibrate the distributions of novel classes may cause negative effects due to serious category difference in text domain. To alleviate this issue, we propose two simple yet effective strategies to estimate the distributions of the novel classes by utilizing unlabeled query samples, thus avoiding the potential negative transfer issue. Specifically, we first assume a class or sample follows the Gaussian distribution, and use the original support set and the nearest few query samples to estimate the corresponding mean and covariance. Then, we augment the labeled samples by sampling from the estimated distribution, which can provide sufficient supervision for training the classification model. Extensive experiments on eight few-shot text classification datasets show that the proposed method outperforms state-of-the-art baselines significantly., Comment: Accepted to AAAI 2023
- Published
- 2023
37. Adaptive incentive for cross-silo federated learning: A multi-agent reinforcement learning approach
- Author
-
Yuan, Shijing, Liu, Hongze, Lv, Hongtao, Feng, Zhanbo, Li, Jie, Chen, Hongyang, and Wu, Chentao
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
Cross-silo federated learning (FL) is a typical FL that enables organizations(e.g., financial or medical entities) to train global models on isolated data. Reasonable incentive is key to encouraging organizations to contribute data. However, existing works on incentivizing cross-silo FL lack consideration of the environmental dynamics (e.g., precision of the trained global model and data owned by uncertain clients during the training processes). Moreover, most of them assume that organizations share private information, which is unrealistic. To overcome these limitations, we propose a novel adaptive mechanism for cross-silo FL, towards incentivizing organizations to contribute data to maximize their long-term payoffs in a real dynamic training environment. The mechanism is based on multi-agent reinforcement learning, which learns near-optimal data contribution strategy from the history of potential games without organizations' private information. Experiments demonstrate that our mechanism achieves adaptive incentive and effectively improves the long-term payoffs for organizations.
- Published
- 2023
38. Self-supervised Hypergraph Representation Learning for Sociological Analysis
- Author
-
Sun, Xiangguo, Cheng, Hong, Liu, Bo, Li, Jia, Chen, Hongyang, Xu, Guandong, and Yin, Hongzhi
- Subjects
Computer Science - Social and Information Networks ,Computer Science - Computers and Society - Abstract
Modern sociology has profoundly uncovered many convincing social criteria for behavioural analysis. Unfortunately, many of them are too subjective to be measured and presented in online social networks. On the other hand, data mining techniques can better find data patterns but many of them leave behind unnatural understanding. In this paper, we propose a fundamental methodology to support the further fusion of data mining techniques and sociological behavioral criteria. Our highlights are three-fold: First, we propose an effective hypergraph awareness and a fast line graph construction framework. The hypergraph can more profoundly indicate the interactions between individuals and their environments because each edge in the hypergraph (a.k.a hyperedge) contains more than two nodes, which is perfect to describe social environments. A line graph treats each social environment as a super node with the underlying influence between different environments. In this way, we go beyond traditional pair-wise relations and explore richer patterns under various sociological criteria; Second, we propose a novel hypergraph-based neural network to learn social influence flowing from users to users, users to environments, environment to users, and environments to environments. The neural network can be learned via a task-free method, making our model very flexible to support various data mining tasks and sociological analysis; Third, we propose both qualitative and quantitive solutions to effectively evaluate the most common sociological criteria like social conformity, social equivalence, environmental evolving and social polarization. Our extensive experiments show that our framework can better support both data mining tasks for online user behaviours and sociological analysis., Comment: Accepted by TKDE
- Published
- 2022
39. Intelligent Computing: The Latest Advances, Challenges and Future
- Author
-
Zhu, Shiqiang, Yu, Ting, Xu, Tao, Chen, Hongyang, Dustdar, Schahram, Gigan, Sylvain, Gunduz, Deniz, Hossain, Ekram, Jin, Yaochu, Lin, Feng, Liu, Bo, Wan, Zhiguo, Zhang, Ji, Zhao, Zhifeng, Zhu, Wentao, Chen, Zuoning, Durrani, Tariq, Wang, Huaimin, Wu, Jiangxing, Zhang, Tongyi, and Pan, Yunhe
- Subjects
Computer Science - Artificial Intelligence - Abstract
Computing is a critical driving force in the development of human civilization. In recent years, we have witnessed the emergence of intelligent computing, a new computing paradigm that is reshaping traditional computing and promoting digital revolution in the era of big data, artificial intelligence and internet-of-things with new computing theories, architectures, methods, systems, and applications. Intelligent computing has greatly broadened the scope of computing, extending it from traditional computing on data to increasingly diverse computing paradigms such as perceptual intelligence, cognitive intelligence, autonomous intelligence, and human-computer fusion intelligence. Intelligence and computing have undergone paths of different evolution and development for a long time but have become increasingly intertwined in recent years: intelligent computing is not only intelligence-oriented but also intelligence-driven. Such cross-fertilization has prompted the emergence and rapid advancement of intelligent computing. Intelligent computing is still in its infancy and an abundance of innovations in the theories, systems, and applications of intelligent computing are expected to occur soon. We present the first comprehensive survey of literature on intelligent computing, covering its theory fundamentals, the technological fusion of intelligence and computing, important applications, challenges, and future perspectives. We believe that this survey is highly timely and will provide a comprehensive reference and cast valuable insights into intelligent computing for academic and industrial researchers and practitioners.
- Published
- 2022
- Full Text
- View/download PDF
40. LW-ISP: A Lightweight Model with ISP and Deep Learning
- Author
-
Chen, Hongyang and Ma, Kaisheng
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Electrical Engineering and Systems Science - Image and Video Processing - Abstract
The deep learning (DL)-based methods of low-level tasks have many advantages over the traditional camera in terms of hardware prospects, error accumulation and imaging effects. Recently, the application of deep learning to replace the image signal processing (ISP) pipeline has appeared one after another; however, there is still a long way to go towards real landing. In this paper, we show the possibility of learning-based method to achieve real-time high-performance processing in the ISP pipeline. We propose LW-ISP, a novel architecture designed to implicitly learn the image mapping from RAW data to RGB image. Based on U-Net architecture, we propose the fine-grained attention module and a plug-and-play upsampling block suitable for low-level tasks. In particular, we design a heterogeneous distillation algorithm to distill the implicit features and reconstruction information of the clean image, so as to guide the learning of the student model. Our experiments demonstrate that LW-ISP has achieved a 0.38 dB improvement in PSNR compared to the previous best method, while the model parameters and calculation have been reduced by 23 times and 81 times. The inference efficiency has been accelerated by at least 15 times. Without bells and whistles, LW-ISP has achieved quite competitive results in ISP subtasks including image denoising and enhancement., Comment: 16 PAGES, ACCEPTED AS A CONFERENCE PAPER AT: BMVC 2022
- Published
- 2022
41. Jamming Modulation: An Active Anti-Jamming Scheme
- Author
-
Ma, Jianhui, Li, Qiang, Liu, Zilong, Du, Linsong, Chen, Hongyang, and Ansari, Nirwan
- Subjects
Computer Science - Information Theory ,Electrical Engineering and Systems Science - Signal Processing - Abstract
Providing quality communications under adversarial electronic attacks, e.g., broadband jamming attacks, is a challenging task. Unlike state-of-the-art approaches which treat jamming signals as destructive interference, this paper presents a novel active anti-jamming (AAJ) scheme for a jammed channel to enhance the communication quality between a transmitter node (TN) and receiver node (RN), where the TN actively exploits the jamming signal as a carrier to send messages. Specifically, the TN is equipped with a programmable-gain amplifier, which is capable of re-modulating the jamming signals for jamming modulation. Considering four typical jamming types, we derive both the bit error rates (BER) and the corresponding optimal detection thresholds of the AAJ scheme. The asymptotic performances of the AAJ scheme are discussed under the high jamming-to-noise ratio (JNR) and sampling rate cases. Our analysis shows that there exists a BER floor for sufficiently large JNR. Simulation results indicate that the proposed AAJ scheme allows the TN to communicate with the RN reliably even under extremely strong and/or broadband jamming. Additionally, we investigate the channel capacity of the proposed AAJ scheme and show that the channel capacity of the AAJ scheme outperforms that of the direct transmission when the JNR is relatively high.
- Published
- 2022
42. Path-aware Siamese Graph Neural Network for Link Prediction
- Author
-
Lv, Jingsong, Li, Zhao, Chen, Hongyang, Qi, Yao, and Wu, Chunqi
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In this paper, we propose a Path-aware Siamese Graph neural network(PSG) for link prediction tasks. First, PSG captures both nodes and edge features for given two nodes, namely the structure information of k-neighborhoods and relay paths information of the nodes. Furthermore, a novel multi-task GNN framework with self-supervised contrastive learning is proposed for differentiation of positive links and negative links while content and behavior of nodes can be captured simultaneously. We evaluate the proposed algorithm PSG on two link property prediction datasets, ogbl-ddi and ogbl-collab. PSG achieves top 1 performance on ogbl-ddi until submission and top 3 performance on ogbl-collab. The experimental results verify the superiority of our proposed PSG, Comment: 5 pages, 1 figure, 3 tables, 35 references, manuscript under review
- Published
- 2022
43. Seasonal asynchrony in above- and below-ground phenology in a temperate forest: carbon allocation trade-off and plant-microbe interactions
- Author
-
Wang, Xingchang, Pan, Jun, Liu, Fan, Chen, Hongyang, Jiao, Zhen, Liu, Shuang, and Wang, Chuankuan
- Published
- 2023
- Full Text
- View/download PDF
44. Cold-adapted enzymes: mechanisms, engineering and biotechnological application
- Author
-
Liu, Yan, Jia, Kaizhi, Chen, Hongyang, Wang, Zhulin, Zhao, Wei, and Zhu, Liwen
- Published
- 2023
- Full Text
- View/download PDF
45. Modeling dynamic spatiotemporal user preference for location prediction: a mutually enhanced method
- Author
-
Cai, Jiawei, Wang, Dong, Chen, Hongyang, Liu, Chenxi, and Xiao, Zhu
- Published
- 2024
- Full Text
- View/download PDF
46. CogAware: Cognition-Aware framework for sentiment analysis with textual representations
- Author
-
Zhang, Zhihan, Wu, Chuhan, Chen, Hongyi, and Chen, Hongyang
- Published
- 2024
- Full Text
- View/download PDF
47. BAP: Bilateral asymptotic pruning for optimizing CNNs on image tasks
- Author
-
Chang, Jingfei, Tao, Liping, Lyu, Bo, Zhu, Xiangming, Liu, Shanyun, Zou, Qiaosha, and Chen, Hongyang
- Published
- 2024
- Full Text
- View/download PDF
48. Nobiletin enhances the antifungal activity of eugenol nanoemulsion against Penicillium italicum in both in vitro and in vivo settings
- Author
-
Liu, Yanchi, Zhao, Lintao, Chen, Hongyang, Ye, Zimao, Guo, Long, and Zhou, Zhiqin
- Published
- 2024
- Full Text
- View/download PDF
49. SenseMag: Enabling Low-Cost Traffic Monitoring using Non-invasive Magnetic Sensing
- Author
-
Wang, Kafeng, Xiong, Haoyi, Zhang, Jie, Chen, Hongyang, Dou, Dejing, and Xu, Cheng-Zhong
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing - Abstract
The operation and management of intelligent transportation systems (ITS), such as traffic monitoring, relies on real-time data aggregation of vehicular traffic information, including vehicular types (e.g., cars, trucks, and buses), in the critical roads and highways. While traditional approaches based on vehicular-embedded GPS sensors or camera networks would either invade drivers' privacy or require high deployment cost, this paper introduces a low-cost method, namely SenseMag, to recognize the vehicular type using a pair of non-invasive magnetic sensors deployed on the straight road section. SenseMag filters out noises and segments received magnetic signals by the exact time points that the vehicle arrives or departs from every sensor node. Further, SenseMag adopts a hierarchical recognition model to first estimate the speed/velocity, then identify the length of vehicle using the predicted speed, sampling cycles, and the distance between the sensor nodes. With the vehicle length identified and the temporal/spectral features extracted from the magnetic signals, SenseMag classify the types of vehicles accordingly. Some semi-automated learning techniques have been adopted for the design of filters, features, and the choice of hyper-parameters. Extensive experiment based on real-word field deployment (on the highways in Shenzhen, China) shows that SenseMag significantly outperforms the existing methods in both classification accuracy and the granularity of vehicle types (i.e., 7 types by SenseMag versus 4 types by the existing work in comparisons). To be specific, our field experiment results validate that SenseMag is with at least $90\%$ vehicle type classification accuracy and less than 5\% vehicle length classification error., Comment: Accepted by IEEE Internet of Things Journal
- Published
- 2021
- Full Text
- View/download PDF
50. Preparation of HNS-based sticks through 3D printing and its combustion performance
- Author
-
Chen, Hongyang, Mao, Yaofeng, Chen, Jie, Zhong, Ruolei, Jin, Bo, Nie, Fude, Peng, Rufang, and Wang, Jun
- Published
- 2024
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.