检索结果-内蒙古大学图书馆

31st ACM International Conference on Multimedia, MM 2023

作者： Jiang, Runhua Liu, Yongge Zhang, Boyuan Chen, Xu Li, Deng Han, Yahong College of Intelligence and Computing Tianjin University Tianjin China School of Computer and Information Engineering Anyang Normal University Anyang China Key Laboratory of Oracle Bone Inscriptions Information Processing Ministry of Education Anyang China

ISBN: (纸本)9798400701085

Oracle Bone Inscriptions (OBI) are ancient hieroglyphs originated in China and are considered one of the most famous writing systems in the world. Up to now, thousands of OBIs have been discovered, which require deciphering by experts to understand their contents. Experts typically need to restore, classify, and compare each character with previous inscriptions. Although existing research can assist with one of these operations, their performance falls short of practical requirements. In this work, we propose the OraclePoints framework, which represents OBI images as hybrid neural representations comprising features of images and point sets. The image representation provides inscription appearance and character structure, while the point representation makes it easy and effective to distinguish characters and noises. In addition, we demonstrate that OraclePoints can be easily integrated with existing models in a plug-and-play manner. Comprehensive experiments demonstrate that the proposed hybrid neural representation framework supports a range of OBI tasks, including character image retrieval, recognition, and denoising. It is also demonstrated that OraclePoints is helpful for deciphering OBIs by linking ancient characters to modern chinese characters. Our codes are available at https://***/. © 2023 ACM.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Improving Fake News Detection of Influential Domain via Domain- and Instance-Level Transfer 29

Improving Fake News Detection of Influential Domain via Doma...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Nan, Qiong Wang, Danding Zhu, Yongchun Sheng, Qiang Shi, Yuhui Cao, Juan Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Both real and fake news in various domains, such as politics, health, and entertainment are spread via online social media every day, necessitating fake news detection for multiple domains. Among them, fake news in specific domains like politics and health has more serious potential negative impacts on the real world (e.g., the infodemic led by COVID-19 misinformation). Previous studies focus on multi-domain fake news detection, by equally mining and modeling the correlation between domains. However, these multi-domain methods suffer from a seesaw problem: the performance of some domains is often improved at the cost of hurting the performance of other domains, which could lead to an unsatisfying performance in specific domains. To address this issue, we propose a Domain- and Instance-level Transfer Framework for Fake News Detection (DITFEND), which could improve the performance of specific target domains. To transfer coarse-grained domain-level knowledge, we train a general model with data of all domains from the meta-learning perspective. To transfer fine-grained instance-level knowledge and adapt the general model to a target domain, we train a language model on the target domain to evaluate the transferability of each data instance in source domains and re-weigh each instance’s contribution. Offline experiments on two datasets demonstrate the effectiveness of DITFEND. Online experiments show that DITFEND brings additional improvements over the base models in a real-world scenario. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Fake detection

来源：评论

学校读者我要写书评

暂无评论

Iteratively refined behavior regularization for offline reinforcement learning 24

Iteratively refined behavior regularization for offline rein...

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Yi Ma Jianye Hao Xiaohan Hu Yan Zheng Chenjun Xiao School of Computer and Information Technology Shanxi University and Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education College of Intelligence and Computing Tianjin University and Noah's Ark Lab Huawei College of Intelligence and Computing Tianjin University The Chinese University of Hongkong Shenzhen

ISBN: (纸本)9798331314385

One of the fundamental challenges for offline reinforcement learning (RL) is ensuring robustness to data distribution. Whether the data originates from a near-optimal policy or not, we anticipate that an algorithm should demonstrate its ability to learn an effective control policy that seamlessly aligns with the inherent distribution of offline data. Unfortunately, behavior regularization, a simple yet effective offline RL algorithm, tends to struggle in this regard. In this paper, we propose a new algorithm that substantially enhances behavior-regularization based on conservative policy iteration. Our key observation is that by iteratively refining the reference policy used for behavior regularization, conservative policy update guarantees gradually improvement, while also implicitly avoiding querying out-of-sample actions to prevent catastrophic learning failures. We prove that in the tabular setting this algorithm is capable of learning the optimal policy covered by the offline dataset, commonly referred to as the in-sample optimal policy. We then explore several implementation details of the algorithm when function approximations are applied. The resulting algorithm is easy to implement, requiring only a few lines of code modification to existing methods. Experimental results on the D4RL benchmark indicate that our method outperforms previous state-of-the-art baselines in most tasks, clearly demonstrate its superiority over behavior regularization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Representation Learning for Electron Ionization Mass Spectra Retrieval

Deep Representation Learning for Electron Ionization Mass Sp...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Shibo Zhang, Xuan Jiao, Anlei Sun, Shiwei Dian, Longyang Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Chinese Academy of Sciences Key Lab of Intelligent Information Processing Institute of Computing Technology Beijing China Shandong University State Key Laboratory of Microbial Technology Qingdao China

ISBN: (纸本)9798350386226

The task of retrieving and analyzing mass spectra is indispensable for the identification of compounds in mass spectrometry (MS). This methodology is of critical importance as it enables researchers to correlate observed spectra with established databases, thereby precisely determining the chemical composition of samples. The primary challenges to its efficacy lie in optimizing the balance between retrieval accuracy and processing speed. Empirical studies have demonstrated that by converting mass spectra into embeddings via deep learning, it is possible to achieve both high accuracy and speed in retrieval. Nevertheless, there are complex challenges associated with employing deep learning for spectral embedding, particularly within the domain of electron ionization mass spectrometry (EI-MS). In this paper, we introduce a novel representation learning technique termed EI-MS2VEC for EI-MS retrieval. Our spectrum retrieval methodology surpasses current state-of-the-art techniques such as FastEI. For the in-silico library, we attain hit rate@1 and hit rate@10 of 43.6% and 84.5%, respectively, compared to FastEI's 36.7% and 80.4%. Moreover, our retrieval approach operates with an order of magnitude greater speed than FastEI. The source code is available on Github (https://***/xfcui/EI-MS2VEC). © 2024 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

How to Train Your Neural Network for Molecular Structure Generation from Mass Spectra?

How to Train Your Neural Network for Molecular Structure Gen...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhao, Kai Liu, Yanmin Dian, Longyang Sun, Shiwei Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Shandong University State Key Laboratory of Microbial Technology Qingdao China Chinese Academy of Sciences Key Lab of Intelligent Information Processing Institute of Computing Technology Beijing China

ISBN: (纸本)9798350386226

Mass spectrometry serves as a pivotal tool for the analysis of small molecules through an examination of their mass-to-charge ratios. Recent advancements in deep learning have markedly enhanced the analysis of mass spectrometric data, facilitating the prediction of novel small molecule structures without the necessity of extensive databases. Nonetheless, the paucity of annotated datasets impedes the efficacious training of molecular generation models predicated on MS2 spectra. To mitigate this limitation, we introduce ctMSNovelist, an avant-garde method that amalgamates pre-training, fine-tuning, and co-training techniques to construct a more precise model for the generation of molecular structures from tandem mass spectrometry data. This novel approach augments both the training regimen and the predictive accuracy of the MSNovelist model, thereby surmounting the obstacle of limited data. The methodology commences with the pretraining of a Variational Autoencoder (VAE) to generate molecular fingerprints derived from SMILES strings. Subsequently, it undergoes fine-tuning to emulate noisy fingerprints originating from mass spectrometry (MS) data. Concurrently, MSNovelist is co-trained utilizing these simulated fingerprints, inclusive of the highly noisy variants produced in the early stages of VAE training. The incorporation of a substantial volume of noisy data serves to enhance model accuracy and avert overfitting. We evaluated ctMSNovelist using the GNPS dataset and attained a SMILES prediction accuracy of 48.8%, representing a 4.1% enhancement over MSNovelist. It is pertinent to note that the sole distinction between ctMSNovelist and MSNovelist in this experiment was the training process. The code and models are publicly available at https://***/xfcui/ctMSNovelist. © 2024 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

IF-Font: Ideographic Description Sequence-Following Font Generation 38

IF-Font: Ideographic Description Sequence-Following Font Gen...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Chen, Xinping Ke, Xiao Guo, Wenzhong Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350116 China

Few-shot font generation (FFG) aims to learn the target style from a limited number of reference glyphs and generate the remaining glyphs in the target font. Previous works focus on disentangling the content and style features of glyphs, combining the content features of the source glyph with the style features of the reference glyph to generate new glyphs. However, the disentanglement is challenging due to the complexity of glyphs, often resulting in glyphs that are influenced by the style of the source glyph and prone to artifacts. We propose IF-Font, a novel paradigm which incorporates Ideographic Description Sequence (IDS) instead of the source glyph to control the semantics of generated glyphs. To achieve this, we quantize the reference glyphs into tokens, and model the token distribution of target glyphs using corresponding IDS and reference tokens. The proposed method excels in synthesizing glyphs with neat and correct strokes, and enables the creation of new glyphs based on provided IDS. Extensive experiments demonstrate that our method greatly outperforms state-of-the-art methods in both one-shot and few-shot settings, particularly when the target styles differ significantly from the training font styles. The code is available at https://***/Stareven233/IF-Font. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Camera-Invariant Meta-Learning Network for Single-Camera-Training Person Re-Identification

引用

IEEE Internet of Things Journal 2025年第12期12卷 22381-22392页

作者： Pei, Jiangbo Jiang, Zhuqing Men, Aidong Wang, Haiying Luo, Haiyong Wen, Shiping Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Beijing Key Laboratory of Network System and Network Culture China Chinese Academy of Sciences Institute of Computing Technology Beijing100190 China University of Technology Australian AI Institute Faculty of Engineering and Information Technology SydneyNSW2007 Australia

Single-camera-training person re-identification (SCT re-ID) aims to train a re-ID model using SCT datasets where each person appears in only one camera. The main challenge of SCT re-ID is to learn camera-invariant feature representations without cross-camera same-person (CCSP) data as supervision. Previous methods address it by assuming that the most similar person should be found in another camera. However, this assumption is not guaranteed to be correct. In this paper, we propose a novel solution: the Camera-Invariant Meta-Learning Network (CIMN) for SCT re-ID. CIMN operates under the premise that camera-invariant feature representations should remain robust despite changes in camera settings. To achieve this, we partition the training data into a meta-train set and a meta-test set based on camera IDs. We then conduct a cross-camera simulation using a meta-learning strategy, aiming to enforce the feature representations learned from the meta-train set to be robust when applied to the meta-test set. We further introduce three specific loss functions to leverage potential identity relations between the meta-train set and the meta-test set. Through the cross-camera simulation and the introduced loss functions, CIMN can extract feature representations that are both camera-invariant and identity-discriminative even in the absence of CCSP data. Our experimental results demonstrate that CIMN can extract feature representations that are both camera-invariant and identity-discriminative, even in the absence of CCSP data. our method achieves comparable performance with and without the use of CCSP data, and outperforms state-of-the-art methods on three SCT re-ID benchmarks. © 2014 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AlphaFold2 and its applications in the fields of biology and medicine

引用

Signal Transduction and Targeted Therapy 2023年第4期8卷 1630-1643页

作者： Zhenyu Yang Xiaoxi Zeng Yi Zhao Runsheng Chen West China Biomedical Big Data Center West China HospitalSichuan UniversityChengdu 610041China Key Laboratory of Intelligent Information Processing Advanced Computer Research CenterInstitute of Computing TechnologyChinese Academy of SciencesBeijing 100190China Key Laboratory of RNA Biology Center for Big Data Research in HealthInstitute of BiophysicsChinese Academy of SciencesBeijing 100101China Pingshan Translational Medicine Center Shenzhen Bay LaboratoryShenzhen 518118China

AlphaFold2(AF2)is an artificial intelligence(AI)system developed by DeepMind that can predict three-dimensional(3D)structures of proteins from amino acid sequences with atomic-level *** structure prediction is one of the most challenging problems in computational biology and chemistry,and has puzzled scientists for 50 *** advent of AF2 presents an unprecedented progress in protein structure prediction and has attracted much *** release of structures of more than 200 million proteins predicted by AF2 further aroused great enthusiasm in the science community,especially in the fields of biology and ***2 is thought to have a significant impact on structural biology and research areas that need protein structure information,such as drug discovery,protein design,prediction of protein function,et *** the time is not long since AF2 was developed,there are already quite a few application studies of AF2 in the fields of biology and medicine,with many of them having preliminarily proved the potential of *** better understand AF2 and promote its applications,we will in this article summarize the principle and system architecture of AF2 as well as the recipe of its success,and particularly focus on reviewing its applications in the fields of biology and *** of current AF2 prediction will also be discussed.

关键词： system fields Fold

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：