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 "on the universal approximation property and equivalence of stochastic computing based neural networks and binary neural networks"):
  Abstract: Large-scale deep neural networks are both memory intensive and computation-intensive, thereby posing stringent requirements on the computing platforms. Hardware accelerations of deep neural networks have been extensively investigated in both industry and academia. Specific forms of binary neural networks (BNNs) and stochastic computing based neural networks (SCNNs) are particularly appealing to hardware implementations since they can be implemented almost entirely with binary operations. Despite the obvious advantages in hardware implementation, these approximate computing techniques are questioned by researchers in terms of accuracy and universal applicability. Also it is important to understand the relative pros and cons of SCNNs and BNNs in theory and in actual hardware implementations. In order to address these concerns, in this paper we prove that the "ideal" SCNNs and BNNs satisfy the universal approximation property with probability 1 (due to the stochastic behavior). The proof is conducted by first proving the property for SCNNs from the strong law of large numbers, and then using SCNNs as a "bridge" to prove for BNNs. Based on the universal approximation property, we further prove that SCNNs and BNNs exhibit the same energy complexity. In other words, they have the same asymptotic energy consumption with the growing of network size. We also provide a detailed analysis of the pros and cons of SCNNs and BNNs for hardware implementations and conclude that SCNNs are more suitable for hardware.

Includes members:
  Member "deep reinforcement learning framework applications and embedded implementations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "viewport aware deep reinforcement learning approach for 360 o video caching")
  Member "finn a framework for fast scalable binarized neural network inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sqwa stochastic quantized weight averaging for improving the generalization capability of low precision deep neural networks")
  Member "hardware driven nonlinear activation for stochastic computing based deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient stochastic computing with superparamagnetic tunnel junctions")
  Member "theoretical properties for neural networks with weight matrices of low displacement rank":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "req yolo a resource aware efficient quantization framework for object detection on fpgas")
  Member "benefits of depth in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lossless compression of deep neural networks")
  Member "why deep neural networks for function approximation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "eie efficient inference engine on compressed deep neural network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cluster pruning an efficient filter pruning method for edge ai vision applications")
  Member "quantized neural networks training neural networks with low precision weights and activations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "switchable precision neural networks")

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)