Tensor Data Scattering and the Impossibility of Slicing Theorem
This paper proposes a standard way to represent sparse tensors. A broad theoretical framework for tensor data scattering methods used in various deep learning frameworks is established. This paper presents a theorem that is very important for performance analysis and accelerator optimization for implementing data scattering. The theorem shows how the impossibility of slicing happens in tenser data scattering. A sparsity measuring formula is provided, which can effectively indicate the storage efficiency of sparse tensor and the possibility of parallelly using it. The source code, including CUDA code, is provided in a related open-source project.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, …
Decision MakingDecision Making Under UncertaintyAggregating Credences into Beliefs: Agenda Conditions for Impossibility Results
Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beliefs into collective binary beliefs. Similar to the development of judgment aggregation theory, formulating axiomatic requir…
BinarizationNegationTensor Slicing and Optimization for Multicore NPUs
Although code generation for Convolution Neural Network (CNN) models has been extensively studied, performing efficient data slicing and parallelization for highly-constrai\-ned Multicore Neural Processor Units (NPUs) is…
Code GenerationCompiler OptimizationA Reexamination of Proof Approaches for the Impossibility Theorem
The decisive-set and pivotal-voter approaches have been used to prove Arrow's impossibility theorem. This study presents a proof using a proof calculus in logic. A valid deductive inference between the premises, the axio…
validRD-Optimized Trit-Plane Coding of Deep Compressed Image Latent Tensors
DPICT is the first learning-based image codec supporting fine granular scalability. In this paper, we describe how to implement two key components of DPICT efficiently: trit-plane slicing and rate-distortion-optimized (R…
Decoder