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

A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications

学校读者我要写书评

暂无评论

A Locality-Aware Energy-Efficient Accelerator for Graph Mini...

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Pengcheng Yao Long Zheng Zhen Zeng Yu Huang Chuangyi Gui Xiaofei Liao 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 Computer Science and Engineering UNSW Sydney Australia

ISBN: (数字)9781728173832

ISBN: (纸本)9781728173849

Graph mining is becoming increasingly important due to the ever-increasing demands on analyzing complex structures in graphs. Existing graph accelerators typically hold most of the randomly-accessed data in an on-chip memory to avoid off-chip communications. However, graph mining exhibits substantial random accesses from not only vertex dimension but also edge dimension (with the latter being excessively more complex than the former), leading to significant degradations in terms of both performance and energy *** observe that the most random memory requests arising in graph mining come from accessing a small fraction of valuable (vertex and edge) data when handling real-world graphs. To exploit this extension locality with maximum parallelism, we architect GRAMER, the first graph mining accelerator. GRAMER contains a specialized memory hierarchy, where the valuable data (precisely identified through a cost-efficient heuristic) is permanently resident in a high-priority memory while others are maintained in a cache-like memory under a lightweight replacement policy. The specific pipelined processing units are carefully designed to maximize computational parallelism. GRAMER is also equipped with a work-stealing mechanism to reduce load imbalance. We have implemented GRAMER on a Xilinx Alveo U250 accelerator card. Compared with two state-of-the-art CPU-based graph mining systems, Fractal and RStream, running on a 14-core Intel E5-2680 v4 processor, GRAMER achieves not only considerable speedups (1.11 × ~ 129.95 ) but also significant energy savings (5.79 × ~ 678.34×)

关键词： Memory management Parallel processing Feature extraction Energy efficiency Fractals System-on-chip data mining

Accurate Latent Factor Analysis via Particle Swarm Optimizers

学校读者我要写书评

暂无评论

Accurate Latent Factor Analysis via Particle Swarm Optimizer...

IEEE International Conference on Systems, Man and Cybernetics

作者： Jia Chen Xin Luo MengChu Zhou School of Cyber Science and Technology Beihang University Beijing China Chongqing Key Lab. of Big Data and Intelligent Computing and the Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chongqing School University of Chinese Academy of Sciences Chongqing China New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781665442084

A stochastic-gradient-descent-based Latent Factor Analysis (LFA) model is highly efficient in representative learning of a High-Dimensional and Sparse (HiDS) matrix. Its learning rate adaptation is vital in ensuring its efficiency. Such adaptation can be realized with an evolutionary computing algorithm. However, a resultant model tends to suffer from two issues: a) the pre-mature convergence of the swarm of learning rates as caused by an adopted evolution algorithm, and b) the pre-mature convergence of the LFA model as caused jointly by evolution-based learning rate adaptation and an optimization algorithm. This paper focuses on the methods to address such issues. A Hierarchical Particle-swarm-optimization-incorporated Latent factor analysis (HPL) model with a two-layered structure is proposed, where the first layer pre-trains desired latent factors with a position-transitional particle-swarm-optimization-based LFA model, and the second layer performs latent factor refining with a newly-proposed mini-batch particle swarm optimizer. With such design, an HPL model can well handle the pre-mature convergence, which is supported by the positive experimental results achieved on HiDS matrices from industrial applications.

关键词： Adaptation models Analytical models Computational modeling Refining Predictive models Sparse matrices Particle swarm optimization

SIDE-real: Supernova Ia Dust Extinction with truncated marginal neural ratio estimation applied to real data

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Karchev, Konstantin Grayling, Matthew Boyd, Benjamin M. Trotta, Roberto Mandel, Kaisey S. Weniger, Christoph Via Bonomea 265 TriesteI-34136 Italy Institute of Astronomy Kavli Institute for Cosmology Madingley Road CambridgeCB3 0HA United Kingdom Astrophysics Group Physics Department Blackett Lab Imperial College London Prince Consort Road LondonSW7 2AZ United Kingdom INFN - National Institute for Nuclear Physics Via Valerio 2 TriesteI-34127 Italy Italian Research Center on High-Performance Computing Big Data and Quantum Computing Via Magnanelli 2 BO Casalecchio di RenoI-40033 Italy Statistical Laboratory DPMMS University of Cambridge Wilberforce Road CambridgeCB3 0WB United Kingdom University of Amsterdam Science Park 904 AmsterdamNL-1098 XH Netherlands

We present the first fully simulation-based hierarchical analysis of the light curves of a population of low-redshift type Ia supernovæ (SNæ Ia). Our hardware-accelerated forward model, released in the Python package slicsim, includes stochastic variations of each SN's spectral flux distribution (based on the pre-trained BayeSN model), extinction from dust in the host and in the Milky Way, redshift, and realistic instrumental noise. By utilizing truncated marginal neural ratio estimation (TMNRE), a neural network-enabled simulation-based inference technique, we implicitly marginalize over 4000 latent variables (for a set of ≈100 SNæ Ia) to efficiently infer SN Ia absolute magnitudes and host-galaxy dust properties at the population level while also constraining the parameters of individual objects. Amortization of the inference procedure allows us to obtain coverage guarantees for our results through Bayesian validation and frequentist calibration. Furthermore, we show a detailed comparison to full likelihood-based inference, implemented through Hamiltonian Monte Carlo, on simulated data and then apply TMNRE to the light curves of 86 SNæ Ia from the Carnegie Supernova Project, deriving marginal posteriors in excellent agreement with previous work. Given its ability to accommodate arbitrarily complex extensions to the forward model, e.g. different populations based on host properties, redshift evolution, complicated photometric redshift estimates, selection effects, and non-Ia contamination, without significant modifications to the inference procedure, TMNRE has the potential to become the tool of choice for cosmological parameter inference from future, large SN Ia samples. © 2024, CC BY.

关键词： Supernovae

Risk-based decision making: estimands for sequential prediction under interventions

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Luijken, Kim Morzywolek, Pawel van Amsterdam, Wouter Cinà, Giovanni Hoogland, Jeroen Keogh, Ruth Krijthe, Jesse Magliacane, Sara van Ommen, Thijs Peek, Niels Putter, Hein van Smeden, Maarten Sperrin, Matthew Wang, Junfeng Weir, Daniala Didelez, Vanessa van Geloven, Nan Department of Epidemiology Julius Center for Health Sciences and Primary Care University Medical Center Utrecht Utrecht Netherlands Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium Department of Statistics University of Washington Seattle United States Department of Medical Informatics Amsterdam University Medical Centers Amsterdam Netherlands Institute for Logic Language and Computation University of Amsterdam Amsterdam Netherlands Pacmed Amsterdam Netherlands Department of Epidemiology and Data Science Amsterdam University Medical Centers Amsterdam Netherlands Department of Medical Statistics London School of Hygiene & Tropical Medicine Keppel Street London United Kingdom Pattern Recognition and Bio-Informatics Group EEMCS Delft University of Technology Delft Netherlands Amsterdam Machine Learning Lab University of Amsterdam Amsterdam Netherlands Department of Information and Computing Sciences Utrecht University Utrecht Netherlands Division of Informatics Imaging and Data Science Faculty of Biology Medicine and Health University of Manchester Manchester Academic Health Science Centre Manchester United Kingdom Department of Biomedical Data Sciences Leiden University Medical Center Leiden Netherlands Division of Pharmacoepidemiology and Clinical Pharmacology Department of Pharmaceutical Sciences Utrecht University Utrecht Netherlands Department of Biometry and Data Management Leibniz Institute for Prevention Research Epidemiology - BIPS Bremen Germany Faculty of Mathematics/Computer Science University of Bremen Bremen Germany

Prediction models are used amongst others to inform medical decisions on interventions. Typically, individuals with high risks of adverse outcomes are advised to undergo an intervention while those at low risk are advised to refrain from it. Standard prediction models do not always provide risks that are relevant to inform such decisions: e.g., an individual may be estimated to be at low risk because similar individuals in the past received an intervention which lowered their risk. Therefore, prediction models supporting decisions should target risks belonging to defined intervention strategies. Previous works on prediction under interventions assumed that the prediction model was used only at one time point to make an intervention decision. In clinical practice, intervention decisions are rarely made only once: they might be repeated, deferred and re-evaluated. This requires estimated risks under interventions that can be reconsidered at several potential decision moments. In the current work, we highlight key considerations for formulating estimands in sequential prediction under interventions that can inform such intervention decisions. We illustrate these considerations by giving examples of estimands for a case study about choosing between vaginal delivery and cesarean section for women giving birth. Our formalization of prediction tasks in a sequential, causal, and estimand context provides guidance for future studies to ensure that the right question is answered and appropriate causal estimation approaches are chosen to develop sequential prediction models that can inform intervention decisions. © 2023, CC BY.

关键词： Forecasting

Structure Embedded Nucleus Classification for Histopathology Images

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Lou, Wei Wan, Xiang Li, Guanbin Lou, Xiaoying Li, Chenghang Gao, Feng Li, Haofeng Shenzhen Research Institute of Big Data Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong at Shenzhen Shenzhen518172 China Pazhou Lab Guangzhou510330 China The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Department of Pathology Guangdong Provincial Key Laboratory of Colorectal and Pelvic Floor Diseases The Sixth Affiliated Hospital of Sun Yat-sen University Guangzhou China Artificial Intelligence Thrust The Hong Kong University of Science and Technology at Guangzhou Guangzhou510030 China Department of Colorectal Surgery Department of General Surgery Guangdong Provincial Key Laboratory of Colorectal and Pelvic Floor Diseases The Sixth Affiliated Hospital Sun Yat-sen University Guangzhou510655 China Shanghai Artificial Intelligence Laboratory Shanghai China

Nuclei classification provides valuable information for histopathology image analysis. However, the large variations in the appearance of different nuclei types cause difficulties in identifying nuclei. Most neural network based methods are affected by the local receptive field of convolutions, and pay less attention to the spatial distribution of nuclei or the irregular contour shape of a nucleus. In this paper, we first propose a novel polygon-structure feature learning mechanism that transforms a nucleus contour into a sequence of points sampled in order, and employ a recurrent neural network that aggregates the sequential change in distance between key points to obtain learnable shape features. Next, we convert a histopathology image into a graph structure with nuclei as nodes, and build a graph neural network to embed the spatial distribution of nuclei into their representations. To capture the correlations between the categories of nuclei and their surrounding tissue patterns, we further introduce edge features that are defined as the background textures between adjacent nuclei. Lastly, we integrate both polygon and graph structure learning mechanisms into a whole framework that can extract intra and inter-nucleus structural characteristics for nuclei classification. Experimental results show that the proposed framework achieves significant improvements compared to the state-of-the-art methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Classification (of information)

LOREN: Logic-regularized reasoning for interpretable fact verification

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chen, Jiangjie Bao, Qiaoben Sun, Changzhi Zhang, Xinbo Chen, Jiaze Zhou, Hao Xiao, Yanghua Li, Lei Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China ByteDance AI Lab University of California Santa Barbara United States Fudan-Aishu Cognitive Intelligence Joint Research Center

Given a natural language statement, how to verify its veracity against a large-scale textual knowledge source like Wikipedia? Most existing neural models make predictions without giving clues about which part of a false claim goes wrong. In this paper, we propose LOREN, an approach for interpretable fact verification. We decompose the verification of the whole claim at phrase-level, where the veracity of the phrases serves as explanations and can be aggregated into the final verdict according to logical rules. The key insight of LOREN is to represent claim phrase veracity as three-valued latent variables, which are regularized by aggregation logical rules. The final claim verification is based on all latent variables. Thus, LOREN enjoys the additional benefit of interpretability-it is easy to explain how it reaches certain results with claim phrase veracity. Experiments on a public fact verification benchmark show that LOREN is competitive against previous approaches while enjoying the merit of faithful and accurate interpretability. The resources of LOREN are available at: https://***/jiangjiechen/LOREN. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

Rethinking the trigger of backdoor attack

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Yiming Zhai, Tongqing Wu, Baoyuan Jiang, Yong Li, Zhifeng Xia, Shu-Tao Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Secure Computing Lab of Big Data Shenzhen Research Institute of Big Data Shenzhen China Tencent AI Lab Shenzhen China

Backdoor attack intends to inject hidden backdoor into the deep neural networks (DNNs), such that the prediction of the infected model will be maliciously changed if the hidden backdoor is activated by the attacker-defined trigger, while it performs well on benign samples. Currently, most of existing backdoor attacks adopted the setting of static trigger, i.e., triggers across the training and testing images follow the same appearance and are located in the same area. In this paper, we revisit this attack paradigm by analyzing the characteristics of the static trigger. We demonstrate that such an attack paradigm is vulnerable when the trigger in testing images is not consistent with the one used for training. We further explore how to utilize this property for backdoor defense, and discuss how to alleviate such vulnerability of existing attacks. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

Comparison of Point Cloud and Image-based Models for Calorimeter Fast Simulation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Acosta, Fernando Torales Mikuni, Vinicius Nachman, Benjamin Arratia, Miguel Karki, Bishnu Milton, Ryan Karande, Piyush Angerami, Aaron Physics Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States National Energy Research Scientific Computing Center Berkeley Lab BerkeleyCA94720 United States Berkeley Institute for Data Science University of California BerkeleyCA94720 United States Department of Physics and Astronomy University of California RiversideCA92521 United States Thomas Jefferson National Accelerator Facility Newport NewsVA23606 United States Computational Engineering Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Nuclear and Chemical Science Division Lawrence Livermore National Laboratory LivermoreCA94550 United States

Score based generative models are a new class of generative models that have been shown to accurately generate high dimensional calorimeter datasets. Recent advances in generative models have used images with 3D voxels to represent and model complex calorimeter showers. Point clouds, however, are likely a more natural representation of calorimeter showers, particularly in calorimeters with high granularity. Point clouds preserve all of the information of the original simulation, more naturally deal with sparse datasets, and can be implemented with more compact models and data files. In this work, two state-of-the-art score based models are trained on the same set of calorimeter simulation and directly compared. © 2023, CC BY.

关键词： Calorimeters

On-edge multi-task transfer learning: Model and practice with data-driven task allocation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zheng, Zimu Chen, Qiong Hu, Chuang Wang, Dan Liu, Fangming The National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The Edge Cloud Innovation Lab. Technical Innovation Department Cloud BU Huawei Technologies Co. Ltd. Shenzhen China The Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Hong Kong

On edge devices, data scarcity occurs as a common problem where transfer learning serves as a widely-suggested remedy. Nevertheless, transfer learning imposes heavy computation burden to the resource-constrained edge devices. Existing task allocation works usually assume all submitted tasks are equally important, leading to inefficient resource allocation at a task level when directly applied in Multi-task Transfer Learning (MTL). To address these issues, we first reveal that it is crucial to measure the impact of tasks on overall decision performance improvement and quantify task importance. We then show that task allocation with task importance for MTL (TATIM) is a variant of NP-complete Knapsack problem, where the complicated computation to solve this problem needs to be conducted repeatedly under varying contexts. To solve TATIM with high computational efficiency, we propose a data-driven Cooperative Task Allocation (DCTA) approach. Finally, we evaluate the performance of DCTA by not only a trace-driven simulation, but also a new comprehensive real-world AIOps case study which bridges model and practice via a new architecture and main components design within AIOps system. Extensive experiments show that our DCTA reduces 3.24 times of processing time, and saves 48.4% energy consumption compared with the state-of-the-art when solving TATIM. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy utilization