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 "algorithm for training neural networks on resistive device arrays"):
  Abstract: Hardware architectures composed of resistive cross-point device arrays can provide significant power and speed benefits for deep neural network training workloads using stochastic gradient descent (SGD) and backpropagation (BP) algorithm. The training accuracy on this imminent analog hardware however strongly depends on the switching characteristics of the cross-point elements. One of the key requirements is that these resistive devices must change conductance in a symmetrical fashion when subjected to positive or negative pulse stimuli. Here, we present a new training algorithm, so-called the "Tiki-Taka" algorithm, that eliminates this stringent symmetry requirement. We show that device asymmetry introduces an unintentional implicit cost term into the SGD algorithm, whereas in the "Tiki-Taka" algorithm a coupled dynamical system simultaneously minimizes the original objective function of the neural network and the unintentional cost term due to device asymmetry in a self-consistent fashion. We tested the validity of this new algorithm on a range of network architectures such as fully connected, convolutional and LSTM networks. Simulation results on these various networks show that whatever accuracy is achieved using the conventional SGD algorithm with symmetric (ideal) device switching characteristics the same accuracy is also achieved using the "Tiki-Taka" algorithm with non-symmetric (non-ideal) device switching characteristics. Moreover, all the operations performed on the arrays are still parallel and therefore the implementation cost of this new algorithm on array architectures is minimal; and it maintains the aforementioned power and speed benefits. These algorithmic improvements are crucial to relax the material specification and to realize technologically viable resistive crossbar arrays that outperform digital accelerators for similar training tasks.

Includes members:
  Member "training lstm networks with resistive cross point devices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mixed precision deep learning based on computational memory")
  Member "a network of deep neural networks for distant speech recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unpaired speech enhancement by acoustic and adversarial supervision for speech recognition")
  Member "dual path networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "convolutional networks with dense connectivity")
  Member "training deep convolutional neural networks with resistive cross point devices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mixed precision deep learning based on computational memory")
  Member "exploring the limits of language modeling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on contextual embeddings")
  Member "acceleration of deep neural network training with resistive cross point devices design considerations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mixed precision deep learning based on computational memory")
  Member "google s neural machine translation system bridging the gap between human and machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "deep residual learning for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)