human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "towards fast and energy efficient binarized neural network inference on fpga"):
  Abstract: Binarized Neural Network (BNN) removes bitwidth redundancy in classical CNN by using a single bit (-1/+1) for network parameters and intermediate representations, which has greatly reduced the off-chip data transfer and storage overhead. However, a large amount of computation redundancy still exists in BNN inference. By analyzing local properties of images and the learned BNN kernel weights, we observe an average of $\sim$78% input similarity and $\sim$59% weight similarity among weight kernels, measured by our proposed metric in common network architectures. Thus there does exist redundancy that can be exploited to further reduce the amount of on-chip computations. #R##N#Motivated by the observation, in this paper, we proposed two types of fast and energy-efficient architectures for BNN inference. We also provide analysis and insights to pick the better strategy of these two for different datasets and network models. By reusing the results from previous computation, much cycles for data buffer access and computations can be skipped. By experiments, we demonstrate that 80% of the computation and 40% of the buffer access can be skipped by exploiting BNN similarity. Thus, our design can achieve 17% reduction in total power consumption, 54% reduction in on-chip power consumption and 2.4$\times$ maximum speedup, compared to the baseline without applying our reuse technique. Our design also shows 1.9$\times$ more area-efficiency compared to state-of-the-art BNN inference design. We believe our deployment of BNN on FPGA leads to a promising future of running deep learning models on mobile devices.

Includes members:
  Member "binary ensemble neural network more bits per network or more networks per bit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning architectures for binary networks")
  Member "xnor neural engine a hardware accelerator ip for 21 6 fj op binary neural network inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pulp nn accelerating quantized neural networks on parallel ultra low power risc v processors")
  Member "xnorbin a 95 top s w hardware accelerator for binary convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tentaclenet a pseudo ensemble template for accurate binary convolutional neural networks")
  Member "ucnn exploiting computational reuse in deep neural networks via weight repetition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non structured dnn weight pruning is it beneficial in any platform")
  Member "in datacenter performance analysis of a tensor processing unit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "incremental network quantization towards lossless cnns with low precision weights":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "finn a framework for fast scalable binarized neural network inference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sqwa stochastic quantized weight averaging for improving the generalization capability of low precision deep neural networks")
  Member "ese efficient speech recognition engine with sparse lstm on fpga":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cluster pruning an efficient filter pruning method for edge ai vision applications")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)