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

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Haonan Yuan Qingyun Sun Xingcheng Fu Ziwei Zhang Cheng Ji Hao Peng Jianxin Li Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University and School of Computer Science and Engineering Beihang University Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University Department of Computer Science and Technology Tsinghua University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Dynamic graph neural networks (DGNNs) are increasingly pervasive in exploiting spatio-temporal patterns on dynamic graphs. However, existing works fail to generalize under distribution shifts, which are common in real-world scenarios. As the generation of dynamic graphs is heavily influenced by latent environments, investigating their impacts on the out-of-distribution (OOD) generalization is critical. However, it remains unexplored with the following two major challenges: (1) How to properly model and infer the complex environments on dynamic graphs with distribution shifts? (2) How to discover invariant patterns given inferred spatio-temporal environments? To solve these challenges, we propose a novel Environment-Aware dynamic Graph LEarning (EAGLE) framework for OOD generalization by modeling complex coupled environments and exploiting spatiotemporal invariant patterns. Specifically, we first design the environment-aware EADGNN to model environments by multi-channel environments disentangling. Then, we propose an environment instantiation mechanism for environment diversification with inferred distributions. Finally, we discriminate spatio-temporal invariant patterns for out-of-distribution prediction by the invariant pattern recognition mechanism and perform fine-grained causal interventions node-wisely with a mixture of instantiated environment samples. Experiments on real-world and synthetic dynamic graph datasets demonstrate the superiority of our method against state-of-the-art baselines under distribution shifts. To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Validating SMT Solvers via Skeleton Enumeration Empowered by Historical Bug-Triggering Inputs

Validating SMT Solvers via Skeleton Enumeration Empowered by...

引用

International Conference on Software Engineering (ICSE)

作者： Maolin Sun Yibiao Yang Ming Wen Yongcong Wang Yuming Zhou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Technology Huazhong University of Science and Technology China

SMT solvers check the satisfiability of logic formulas over first-order theories, which have been utilized in a rich number of critical applications, such as software verification, test case generation, and program synthesis. Bugs hidden in SMT solvers would severely mislead those applications and further cause severe consequences. Therefore, ensuring the reliability and robustness of SMT solvers is of critical importance. Although many approaches have been proposed to test SMT solvers, it is still a challenge to discover bugs effectively. To tackle such a challenge, we conduct an empirical study on the historical bug-triggering formulas in SMT solvers' bug tracking systems. We observe that the historical bug-triggering formulas contain valuable skeletons (i.e., core structures of formulas) as well as associated atomic formulas which can cast significant impacts on formulas' ability in triggering bugs. Therefore, we propose a novel approach that utilizes the skeletons extracted from the historical bug-triggering formulas and enumerates atomic formulas under the guidance of association rules derived from historical formulas. In this study, we realized our approach as a practical fuzzing tool HistFuzz and conducted extensive testing on the well-known SMT solvers Z3 and cvc5. To date, HistFuzz has found 111 confirmed new bugs for Z3 and cvc5, of which 108 have been fixed by the developers. More notably, out of the confirmed bugs, 23 are soundness bugs and invalid model bugs found in the solvers' default mode, which are essential for SMT solvers. In addition, our experiments also demonstrate that HistFuzz outperforms the state-of-the-art SMT solver fuzzers in terms of achieved code coverage and effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RAGRAPH: a general retrieval-augmented graph learning framework 24

RAGRAPH: a general retrieval-augmented graph learning framew...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Xinke Jiang Rihong Qiu Yongxin Xu Wentao Zhang Yichen Zhu Ruizhe Zhang Yuchen Fang Xu Chu Junfeng Zhao Yasha Wang Key Laboratory of High Confidence Software Technologies (Peking University) School of Computer Science Peking University China University of Electronic Science and Technology of China Key Laboratory of High Confidence Software Technologies (Peking University) School of Computer Science Peking University China and Center on Frontiers of Computing Studies Peking University Beijing China and Peking University Information Technology Institute Tianjin Binhai China Key Laboratory of High Confidence Software Technologies (Peking University) School of Computer Science Peking University China and Big Data Technology Research Center Nanhu Laboratory Jiaxing China Key Laboratory of High Confidence Software Technologies (Peking University) School of Computer Science Peking University China and Peking University Information Technology Institute Tianjin Binhai China

ISBN: (纸本)9798331314385

Graph Neural Networks (GNNs) have become essential in interpreting relational data across various domains, yet, they often struggle to generalize to unseen graph data that differs markedly from training instances. In this paper, we introduce a novel framework called General Retrieval-Augmented Graph Learning (RAGRAPH), which brings external graph data into the general graph foundation model to improve model generalization on unseen scenarios. On the top of our framework is a toy graph vector library that we established, which captures key attributes, such as features and task-specific label information. During inference, the RAGRAPH adeptly retrieves similar toy graphs based on key similarities in downstream tasks, integrating the retrieved data to enrich the learning context via the message-passing prompting mechanism. Our extensive experimental evaluations demonstrate that RAGRAPH significantly outperforms state-of-the-art graph learning methods in multiple tasks such as node classification, link prediction, and graph classification across both dynamic and static datasets. Furthermore, extensive testing confirms that RAGRAPH consistently maintains high performance without the need for task-specific fine-tuning, highlighting its adaptability, robustness, and broad applicability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optical quantum sensing for agnostic environments via deep learning

引用

Physical Review Research 2024年第4期6卷 043267-043267页

作者： Zeqiao Zhou Yuxuan Du Xu-Fei Yin Shanshan Zhao Xinmei Tian Dacheng Tao MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition University of Science and Technology of China Hefei 230026 China JD Explore Academy Beijing 101111 China College of Computing and Data Science Nanyang Technological University Singapore 639798 Singapore Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences University of Science and Technology of China Hefei 230026 China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Shanghai 201315 China School of Computer Science The University of Sydney NSW 2008 Australia

Optical quantum sensing promises measurement precision beyond classical sensors termed the Heisenberg limit (HL). However, conventional methodologies often rely on prior knowledge of the target system to achieve HL, presenting challenges in practical applications. Addressing this limitation, we introduce an innovative deep-learning-based quantum sensing scheme (DQS), enabling optical quantum sensors to attain HL in agnostic environments. DQS incorporates two essential components: a graph neural network (GNN) predictor and a trigonometric interpolation algorithm. Operating within a data-driven paradigm, DQS utilizes the GNN predictor, trained on offline data, to unveil the intrinsic relationships between the optical setups employed in preparing the probe state and the resulting quantum Fisher information (QFI) after interaction with the agnostic environment. This distilled knowledge facilitates the identification of optimal optical setups associated with maximal QFI. Subsequently, DQS employs a trigonometric interpolation algorithm to recover the unknown parameter estimates for the identified optical setups. Extensive experiments are conducted to investigate the performance of DQS under different settings up to eight photons. Our findings not only offer a different lens through which to accelerate optical quantum sensing tasks but also catalyze future research integrating deep learning and quantum mechanics.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

GALAS: Greedy Local-Adjusting Room Allocation Framework

GALAS: Greedy Local-Adjusting Room Allocation Framework

引用

Smart World Congress (SWC), IEEE

作者： Lian Chi Jiajia Xie Jinxin Wu Hongyang Chen Tianming Zhao School of Artificial Intelligence Nanjing University of Information Science and Technology Nanjing China School of Computer Science and Electronic Engineering Hunan University Changsha China Zhejiang Lab Research Center for Graph Computing Hangzhou China

In this paper, we study the room allocation problem to optimize room utilization in allocating rooms for courses under all the conflicting constraints, which has been proven NP-complete. We first formulate the problem as an Integer Linear Program (ILP) so it can be solved optimally using an ILP solver. However, solving ILP incurs an exponential run-time complexity, which is impractical for real-world applications. To address this issue, we propose Greedy Algorithm plus Local Adjustment via Swaps (GALAS), a greedy heuristic framework with a reduced run-time that finds near-optimal room allocation solutions. GALAS uses multiple greedy strategies to quickly generate feasible schedules and then optimize them via a sequence of local swap operations. We evaluate the performance of the GALAS on synthetic and real-world datasets. The experimental results show that the GALAS outperforms the state-of-the-art in room utilization and run-time simultaneously. On average, GALAS achieves a near-optimal performance of 98.5% to the optimal solution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Construction of Influenza Early Warning Model Based on Combinatorial Judgment Classifier:A Case Study of Seasonal Influenza in Hong Kong

引用

Current Medical science 2022年第1期42卷 226-236页

作者： Zi-xiao WANG James NTAMBARA Yan LU Wei DAI Rui-jun MENG Dan-min QIAN Department of Medical Informatics School of MedicineNantong UniversityNantong 226001China Department of Computer Science College of Engineering and Computing SciencesNew York Institute of TechnologyNew York 10023USA Department of Computer Science College of Overseas EducationNanjing University of Posts and TelecommunicationsNanjing 210023China Department of Epidemiology School of Public HealthNantong UniversityNantong 226019China Artificial Intelligence Laboratory Center De Montfort University of LeicesterLeicester LE1 9BHUnited Kingdom

Objective:The annual influenza epidemic is a heavy burden on the health care system,and has increasingly become a major public health problem in some areas,such as Hong Kong(China).Therefore,based on a variety of machine learning methods,and considering the seasonal influenza in Hong Kong,the study aims to establish a Combinatorial Judgment Classifier(CJC)model to classify the epidemic trend and improve the accuracy of influenza epidemic early warning.

关键词： influenza prediction data-driven Support Vector Machine Discriminant Analysis Ensemble Classifier

来源：评论

学校读者我要写书评

暂无评论

CHECKWHY: Causal Fact Verification via Argument Structure

arXiv

引用

arXiv 2024年

作者： Si, Jiasheng Zhao, Yibo Zhu, Yingjie Zhu, Haiyang Lu, Wenpeng Zhou, Deyu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China School of Computer Science and Engineering Southeast University China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China

With the growing complexity of fact verification tasks, the concern with "thoughtful" reasoning capabilities is increasing. However, recent fact verification benchmarks mainly focus on checking a narrow scope of semantic factoids within claims and lack an explicit logical reasoning process. In this paper, we introduce CHECKWHY, a challenging dataset tailored to a novel causal fact verification task: checking the truthfulness of the causal relation within claims through rigorous reasoning steps. CHECKWHY consists of over 19K "why" claim-evidence-argument structure triplets with supports, refutes, and not enough info labels. Each argument structure is composed of connected evidence, representing the reasoning process that begins with foundational evidence and progresses toward claim establishment. Through extensive experiments on state-of-the-art models, we validate the importance of incorporating the argument structure for causal fact verification. Moreover, the automated and human evaluation of argument structure generation reveals the difficulty in producing satisfying argument structure by fine-tuned models or Chain-of-Thought prompted LLMs, leaving considerable room for future improvements1 Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

FEST: Feature Enhancement Swin Transformer for Remote Sensing Image Semantic Segmentation

FEST: Feature Enhancement Swin Transformer for Remote Sensin...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Ronghuan Zhang Jing Zhao Ming Li Qingzhi Zou Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The global context is crucial for the precise segmentation of remote sensing images. However, the large volumes and high spatial resolutions of remote sensing images make efficient analysis of the entire scene challenging for most convolutional neural network (CNN)-based methods. To address this issue, we propose to design an innovative framework for semantic segmentation of remote sensing images called Feature Enhancement Swin Transformer (FEST). Firstly, we utilize the Swin Transformer as the encoder and incorporates a Global Information Enhancement Model (GIEM) within each Swin Transformer block to reduce information loss and enable encoding of more accurate spatial information. Secondly, we introduce an enhanced decoding structure called Enhanced Feature Fusion Module (EFFM) with added enhanced channel and spatial attention modules to retain localized information while obtaining extensive contextual information. Finally, for loss calculation, we utilize the dice and cross-entropy loss to jointly supervise the model, aiming to achieve a competitive performance. We comprehensively evaluated FEST on the ISPRS-Vaihingen and Potsdam datasets. The results indicate that our approach has achieved significant improvements in semantic segmentation tasks compared to existing methods.

关键词： Deep learning Federated learning Semantic segmentation Semantics Transformers Information retrieval Encoding

来源：评论

学校读者我要写书评

暂无评论

Quantum speedups of optimizing approximately convex functions with applications to logarithmic regret stochastic convex bandits 22

Quantum speedups of optimizing approximately convex function...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Tongyang Li Ruizhe Zhang Advanced Institute of Information Technology Center on Frontiers of Computing Studies and School of Computer Science Peking University Department of Computer Science The University of Texas at Austin

ISBN: (纸本)9781713871088

We initiate the study of quantum algorithms for optimizing approximately convex functions. Given a convex set K ⊆ ℝn and a function F : ℝn → ℝ such that there exists a convex function f : K → ℤ satisfying supx∈K |F(x) - f(x)| ≤ ε/n, our quantum algorithm finds an x* ∈ K such that F(x*) - minx∈K F(x) ≤ ε using Õ(n3) quantum evaluation queries to F. This achieves a polynomial quantum speedup compared to the best-known classical algorithms. As an application, we give a quantum algorithm for zeroth-order stochastic convex bandits with Õ(n5 log2 T) regret, an exponential speedup in T compared to the classical (√T) lower bound. Technically, we achieve quantum speedup in n by exploiting a quantum framework of simulated annealing and adopting a quantum version of the hit-and-run walk. Our speedup in T for zeroth-order stochastic convex bandits is due to a quadratic quantum speedup in multiplicative error of mean estimation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HCF-Net: Hierarchical Context Fusion Network for Infrared Small Object Detection

arXiv

引用

arXiv 2024年

作者： Xu, Shibiao Zheng, ShuChen Xu, Wenhao Xu, Rongtao Wang, Changwei Zhang, Jiguang Teng, Xiaoqiang Li, Ao Guo, Li Artificial Intelligence Beijing University of Posts and Telecommunications China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China School of Computer Science and Technology Harbin University of Science and Technology China

Infrared small object detection is an important computer vision task involving the recognition and localization of tiny objects in infrared images, which usually contain only a few pixels. However, it encounters difficulties due to the diminutive size of the objects and the generally complex backgrounds in infrared images. In this paper, we propose a deep learning method, HCF-Net, that significantly improves infrared small object detection performance through multiple practical modules. Specifically, it includes the parallelized patch-aware attention (PPA) module, dimension-aware selective integration (DASI) module, and multi-dilated channel refiner (MDCR) module. The PPA module uses a multi-branch feature extraction strategy to capture feature information at different scales and levels. The DASI module enables adaptive channel selection and fusion. The MDCR module captures spatial features of different receptive field ranges through multiple depth-separable convolutional layers. Extensive experimental results on the SIRST infrared single-frame image dataset show that the proposed HCF-Net performs well, surpassing other traditional and deep learning models. Code is available at https://***/zhengshuchen/HCFNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：