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

arXiv 2024年

作者： Anschuetz, Eric R. Gamarnik, David Kiani, Bobak T. Institute for Quantum Information and Matter Caltech Walter Burke Institute for Theoretical Physics Caltech MIT Center for Theoretical Physics MIT United States Operations Research Center Statistics and Data Science Center Sloan School of Management MIT United States John A. Paulson School of Engineering and Applied Sciences Department of Electrical Engineering and Computer Science MIT Harvard United States

We consider the problem of estimating the ground state energy of quantum p-local spin glass random Hamiltonians, the quantum analogues of widely studied classical spin glass models. Our main result shows that the maximum energy achievable by product states has a well-defined limit (for even p) as n → ∞ and is Eproduct∗ = √2 log p in the limit of large p. This value is interpreted as the maximal energy of a much simpler so-called Random Energy Model, widely studied in the setting of classical spin glasses. The proof of the limit existing follows from an extension of Fekete’s Lemma after we demonstrate near super-additivity of the (normalized) quenched free energy. The proof of the value follows from a second moment method on the number of states achieving a given energy when restricting to an ǫ-net of product states. Furthermore, we relate the maximal energy achieved over all states to a p-dependent constant γ (p), which is defined by the degree of violation of a certain asymptotic independence ansatz over graph matchings. We show that the maximal energy achieved by all states E∗ (p) in the limit of large n is at most pγ (p)Eproduct∗ . We also prove using Lindeberg’s interpolation method that the limiting E∗ (p) is robust with respect to the choice of the randomness and, for instance, also applies to the case of sparse random Hamiltonians. This robustness in the randomness extends to a wide range of random Hamiltonian models including SYK and random quantum max-cut. Copyright © 2024, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction 21

SumPA: Efficient Pattern-Centric Graph Mining with Pattern A...

引用

Proceedings of the 30th International Conference on Parallel Architectures and Compilation Techniques

作者： Chuangyi Gui Xiaofei Liao Long Zheng Pengcheng Yao Qinggang Wang Hai Jin National Engineering Research Center for Big Data Technology and System/Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665442787

Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance. Existing pattern-centric mining systems reduce the substantial search space towards a single pattern by exploring a highly-optimized matching order, but inherent computational redundancies of such a matching order itself still suffer severely, leading to significant performance degradation. The key innovation of this work lies in a general redundancy criterion that characterizes computational redundancies arising in not only handing a single pattern but also matching multiple patterns simultaneously. In this paper, we present SumPA, a high-performance pattern-centric graph mining system that can sufficiently remove redundant computations for any complex graph mining problems. SumPA features three key designs: (1) a pattern abstraction technique that can simplify numerous complex patterns into a few simple abstract patterns based on pattern similarity, (2) abstraction-guided pattern matching that completely eliminates (totally and partially) redundant computations during subgraph enumeration, and (3) a suite of system optimizations to maximize storage and computation efficiency. Our evaluation on a wide variety of real-world graphs shows that SumPA outperforms the two state-of-the-art systems Peregrine and GraphPi by up to 61.89× and 8.94×, respectively. For many mining problems on large graphs, Peregrine takes hours or even days while SumPA finishes in only a few minutes.

关键词： data reuse

来源：评论

学校读者我要写书评

暂无评论

AdvMap: Crafting Adversarial Maps to Counter ai aimbot in First-Person Shooter Games

引用

IEEE Transactions on Games 2025年

作者： Yan, Kai Chen, Xianyi Cui, Qi Yuan, Haoqin Tan, Zhenshan Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education the School of Computer Science Nanjing210044 China Beijing Jiaotong University Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing100044 China

ai-based automatic aiming cheats (a.k.a., ai aimbots) have proliferated in first-person shooter (FPS) games, which grant malicious users an unfair gameplay advantage. Since ai aimbots operate independently of game data and are developed using object detection algorithms, they are difficult to detect with traditional anti-cheating methods. To actively counter ai aimbots, we propose AdvMap, which introduces invisible adversarial perturbations into game scene elements. In optimizing these adversarial perturbations, we design a mixture-of-misleading loss function that increases the total target confidence score within each misleading bounding box. It mitigates the risk of segment missing even when AdvMap is obscured, thereby enhancing the robustness. Besides, an L1-norm constraint with a small scale is employed during each update of the adversarial perturbations, which preserves the fidelity of the game scene. Additionally, to enable effective adaptation to interact with various elements within game environments, we introduce an Image-Subspace-Based Multi-Directional (ISMD) optimization strategy. It enables the adversarial perturbations to adaptively fit into each element by leveraging the mapping relationship between the game's 3D scenes and its corresponding 2D images. Furthermore, we construct a comprehensive benchmark, which includes various FPS games with different graphics styles and perspectives. Extensive experimental results demonstrate the efficacy of our method in countering various ai aimbot tools on different state-of-the-art object detection methods. © 2021 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Reproducibility of predictive networks for mouse visual cortex

arXiv

引用

arXiv 2024年

作者： Turishcheva, Polina Burg, Max Sinz, Fabian H. Ecker, Alexander Institute of Computer Science Campus Institute Data Science University Gottingen Germany International Max Planck Research School for Intelligent Systems Tubingen Germany Tubingen AI Center University of Tubingen Germany Max Planck Institute for Dynamics and Self-Organization Gottingen Germany

Deep predictive models of neuronal activity have recently enabled several new discoveries about the selectivity and invariance of neurons in the visual cortex. These models learn a shared set of nonlinear basis functions, which are linearly combined via a learned weight vector to represent a neuron's function. Such weight vectors, which can be thought as embeddings of neuronal function, have been proposed to define functional cell types via unsupervised clustering. However, as deep models are usually highly overparameterized, the learning problem is unlikely to have a unique solution, which raises the question if such embeddings can be used in a meaningful way for downstream analysis. In this paper, we investigate how stable neuronal embeddings are with respect to changes in model architecture and initialization. We find that L1regularization to be an important ingredient for structured embeddings and develop an adaptive regularization that adjusts the strength of regularization per neuron. This regularization improves both predictive performance and how consistently neuronal embeddings cluster across model fits compared to uniform regularization. To overcome overparametrization, we propose an iterative feature pruning strategy which reduces the dimensionality of performance-optimized models by half without loss of performance and improves the consistency of neuronal embeddings with respect to clustering neurons. This result suggests that to achieve an objective taxonomy of cell types or a compact representation of the functional landscape, we need novel architectures or learning techniques that improve identifiability. We will make our code available at publication time. © 2024, CC BY-NC-ND.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Capsule: An Out-of-Core Training Mechanism for Colossal GNNs

引用

Proceedings of the ACM on Management of data 2025年第1期3卷 1-30页

作者： Yongan Xiang Zezhong Ding Rui Guo Shangyou Wang Xike Xie S. Kevin Zhou School of Computer Science and Technology University of Science and Technology of China (USTC) Hefei Anhui China & Data Darkness Lab Suzhou Institute for Advanced Research USTC Suzhou Jiangsu China School of Artificial Intelligence and Data Science USTC Hefei Anhui China & Data Darkness Lab Suzhou Institute for Advanced Research USTC Suzhou Jiangsu China School of Biomedical Engineering USTC Suzhou Jiangsu China & Data Darkness Lab Suzhou Institute for Advanced Research USTC Suzhou Jiangsu China School of Biomedical Engineering USTC Suzhou Jiangsu China & MIRACLE Center Suzhou Institute for Advanced Research USTC Suzhou Jiangsu China

Cutting-edge platforms of graph neural networks (GNNs), such as DGL and PyG, harness the parallel processing power of GPUs to extract structural information from graph data, achieving state-of-the-art (SOTA) performance in fields such as recommendation systems, knowledge graphs, and bioinformatics. Despite the computational advantages provided by GPUs, these GNN platforms struggle with scalability challenges due to the colossal graphical structures processed and the limited memory capacities of GPUs. In response, this work introduces Capsule, a new out-of-core mechanism for large-scale GNN training. Unlike existing out-of-core GNN systems, which use main or secondary memory as operative memory and use CPU kernels during non-backpropagation computation, Capsule uses GPU memory and GPU kernels. By substantially leveraging the parallelization capabilities of GPUs, Capsule significantly enhances GNN training efficiency. In addition, Capsule can be smoothly integrated to mainstream open-source GNN frameworks, DGL and PyG, in a play-and-plug manner. Through a prototype implementation and comprehensive experiments on real datasets, we demonstrate that Capsule can achieve up to a 12.02× improvement in runtime efficiency, while using only 22.24% of the main memory, compared to SOTA out-of-core GNN systems.

关键词： gpus graph data management graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computing

Container lifecycle-aware scheduling for serverless computin...

引用

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Time Series Anomaly Detection under data Contamination 12

Unsupervised Time Series Anomaly Detection under Data Contam...

引用

12th International Conference on Information Technology in Medicine and Education, ITME 2022

作者： Lin, Xiaohui Li, Zuoyong Huang, Xunhua Chen, Xinwei Fan, Haoyi Fuzhou University College of Computer and Data Science Fuzhou350108 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Fuzhou350121 China Harbin University of Science and Technology School of Computer Science and Technology Harbin150080 China Minjiang University Fujian Engineering and Research Center of New Chinese Lacquer Materials Fuzhou350121 China Zhengzhou University School of Computer and Artificial Intelligence Zhengzhou450001 China

ISBN: (纸本)9798350310153

Unsupervised learning utilizes unlabeled data to alleviate the reliance on large amounts of labeled data, and it has made great progress in time series anomaly detection. However, there are still some thorny issues unsolved, especially the incapability to maintain the robustness of the model when the time series dataset is contaminated. In this work, we propose an unsupervised time series anomaly detection method on data contamination, named distribution alignment autoencoder (DAAE), in which a temporal sliding reward function combines the adversarial distribution alignment to mine the contaminated data. Specifically, the dimensionality reduction and reconstruction of the time series are implemented by an autoencoder. Next, using two discriminators, the latent features obtained by dimensionality reduction are mapped to the Gaussian distribution, and the high-confidence normal time series are generated by sampling noise from the Gaussian distribution. Then, we compute the mean square error between high-confidence normal samples and the training data. Finally, we feed the error values to the temporal sliding reward function to mine the contaminated training samples. Experimental results compared with baselines on public datasets demonstrate the effectiveness of DAAE. © 2022 IEEE.

关键词： Contamination

来源：评论

学校读者我要写书评

暂无评论

DRCTL: A Disorder-Resistant Computation Translation Layer Enhancing the Lifetime and Performance of Memristive CIM Architecture

DRCTL: A Disorder-Resistant Computation Translation Layer En...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Heng Zhou Bing Wu Huan Cheng Jinpeng Liu Taoming Lei Dan Feng Wei Tong Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology School of Computer Science and Technology Huazhong University of Science and Technology Ministry of Education of China

ISBN: (数字)9798350350579

ISBN: (纸本)9798350350586

The memristive Computing-in-Memory (CIM) sys-tem can efficiently accelerate matrix-vector multiplication (MVM) operations through in-situ computing. The data layout has a significant impact on the communication performance of CIM systems. Existing software-level communication opti-mizations aim to reduce communication distance by carefully designing static data layouts, while wear-leveling (WL) and error mitigation methods use dynamic scheduling to enhance system reliability, resulting in randomized data layouts and increased communication overhead. Besides, existing CIM compilers di-rectly map data to physical crossbars and generate instructions, which causes inconvenience for dynamic scheduling. To address these challenges of balancing communication performance and reliability while coordinating existing CIM compilers and dy-namic scheduling, we propose a disorder-resistant computation translation layer (DRCTL), which improves system lifetime and communication performance through co-optimization of data layout and dynamic scheduling. It consists of three parts: (1) We propose an address conversion method for dynamic scheduling, which updates the addresses in the instruction stream after dynamic scheduling, thereby avoiding recompilation. (2) Dynamic scheduling strategy for reliability improvement. We propose a hierarchical wear-leveling (HWL) strategy, which reduces communication by increasing scheduling granularity. (3) Communication optimization for dynamic scheduling. We propose data layout-aware selective remapping (LASR), which helps dynamic scheduling methods improve communication lo-cality and reduce latency by exploiting data dependencies. The experiments demonstrate that HWL extends lifetime by 100.3-205.9 x compared to not using WL. Even with a slight lifetime decrease compared to the state-of-the-art WL (TIWL), it still supports continuous neural network training for 7 years. After applying LASR to HWL, the number of execution cycles, energy consumption

关键词： Training Energy consumption Processor scheduling Layout Dynamic scheduling In-memory computing Common Information Model (computing) System-on-chip Reliability Optimization

来源：评论

学校读者我要写书评

暂无评论

MeHyper: Accelerating Hypergraph Neural Networks by Exploring Implicit dataflows

MeHyper: Accelerating Hypergraph Neural Networks by Explorin...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Wenju Zhao Pengcheng Yao Dan Chen Long Zheng Xiaofei Liao Qinggang Wang Shaobo Ma Yu Li Haifeng Liu Wenjing Xiao Yufei Sun Bing Zhu Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computing National University of Singapore Singapore School of Computer Electronics and Information Guangxi University NanNing China School of Computer Science and Engineering University of New South Wales Sydney NSW Australia

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

Hypergraph Neural Networks (HGNNs) are increasingly utilized to analyze complex inter-entity relationships. Traditional HGNN systems, based on a hyperedge-centric dataflow model, independently process aggregation tasks for hyperedges and vertices, leading to significant computational redundancy. This redundancy arises from recalculating shared information across different tasks. For the first time, we identify and harness implicit dataflows (i.e., dependencies) within HGNNs, introducing the microedge concept to effectively capture and reuse intricate shared information among aggregation tasks, thereby minimizing redundant computations. We have developed a new microedge-centric dataflow model that processes shared information as fine-grained microedge aggregation tasks. This dataflow model is supported by the Read-Process-Activate-Generate execution model, which aims to optimize parallelism among these tasks. Furthermore, our newly developed MeHyper, a microedge-centric HGNN accelerator, incorporates a decoupled pipeline for improved computational parallelism and a hierarchical feature management strategy to reduce off-chip memory accesses for large volumes of intermediate feature vectors generated. Our evaluation demonstrates that MeHyper substantially outperforms the leading CPUbased system PyG-CPU and the GPU-based system HyperGef, delivering performance improvements of $1,032.23 \times$ and $10.51 \times$, and energy efficiencies of $1,169.03 \times$ and $9.96 \times$, respectively.

关键词： Computational modeling Neural networks Redundancy Pipelines Memory management Parallel processing Vectors Energy efficiency Hardware acceleration

来源：评论

学校读者我要写书评

暂无评论

Evaluation of China's Digital Economy: A Case Study using Entropy and TOPSIS 11

Evaluation of China's Digital Economy: A Case Study using En...

引用

11th International Conference on Information Technology and Quantitative Management, ITQM 2024

作者： Liu, Junjie Wang, Boya Xue, Jiayu Qu, Yi Shi, Yong Sino-Danish College University of Chinese Academy of Sciences Beijing100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Faculty of Science and Engineering University of Nottingham Ningbo China Zhejiang Ningbo315100 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States

Recently, digital economy in social science has become increasingly significant. A well-constructed evaluation structure could generally and promptly describe and reveal its overall social digitalization development. Building on existent researches, this paper improves the evaluation system, which comprises four first-level indicators and thirty-one second-level indicators. Notably, this paper innovatively incorporates higher education into digital innovation of the evaluation. The Entropy method is utilized to assign weights to various indicators in an objective way, with employing the TOPSIS approach to prioritize the development of digital economy in places based on the closeness to the ideal solution. By analysing related data related from 31 provinces in China between 2017 to 2021, this paper greatly finds: Firstly, the development of digital economy vary significantly across provinces, with most provinces at a relatively poor level, indicating considerable potential for overall growth;Secondly, Guangdong, Jiangsu, Zhejiang, and Shandong consistently ranked in the top four from 2017 to 2021, reflecting their specific development attributes and their emphasis on digital economy;Thirdly, significant disparities exist both between regions and among provinces. Consequently, this paper suggests establishing a comprehensive national digital economy development plan, formulating region-specific digital economy policies tailored to local conditions, and encouraging leading provinces to actively share experiences with other provinces. © 2024 The Authors.

关键词： Digital economy Evaluation Multi-source information TOPSIS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：