human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "difference target propagation"
  Abstract: Back-propagation has been the workhorse of recent successes of deep learning but it relies on infinitesimal effects (partial derivatives) in order to perform credit assignment. This could become a serious issue as one considers deeper and more non-linear functions, e.g., consider the extreme case of nonlinearity where the relation between parameters and cost is actually discrete. Inspired by the biological implausibility of back-propagation, a few approaches have been proposed in the past that could play a similar credit assignment role. In this spirit, we explore a novel approach to credit assignment in deep networks that we call target propagation. The main idea is to compute targets rather than gradients, at each layer. Like gradients, they are propagated backwards. In a way that is related but different from previously proposed proxies for back-propagation which rely on a backwards network with symmetric weights, target propagation relies on auto-encoders at each layer. Unlike back-propagation, it can be applied even when units exchange stochastic bits rather than real numbers. We show that a linear correction for the imperfectness of the auto-encoders, called difference target propagation, is very effective to make target propagation actually work, leading to results comparable to back-propagation for deep networks with discrete and continuous units and denoising auto-encoders and achieving state of the art for stochastic networks.

Connected through hyperedge HE-1 (induced by source paper "biologically motivated deep learning method using hierarchical competitive learning"):
  with members:
    - "unsupervised learning by competing hidden units"
    - "assessing the scalability of biologically motivated deep learning algorithms and architectures"
    - "competitive learning enriches learning representation and accelerates the fine tuning of cnns"
    - "unsupervised representation learning with deep convolutional generative adversarial networks"
    - "how auto encoders could provide credit assignment in deep networks via target propagation"
    - "going deeper with convolutions"
    - "winner take all autoencoders"
    - "imagenet large scale visual recognition challenge"

Connected through hyperedge HE-2 (induced by source paper "non linear neurons with human like apical dendrite activations"):
  with members:
    - "moroco the moldavian and romanian dialectal corpus"
    - "age progression regression by conditional adversarial autoencoder"
    - "fashion mnist a novel image dataset for benchmarking machine learning algorithms"
    - "noisy activation functions"
    - "character level convolutional networks for text classification"
    - "deep residual learning for image recognition"
    - "fast and accurate deep network learning by exponential linear units elus"
    - "delving deep into rectifiers surpassing human level performance on imagenet classification"

Connected through hyperedge HE-3 (induced by source paper "supervised deep similarity matching"):
  with members:
    - "decoupled greedy learning of cnns"
    - "structured and deep similarity matching via structured and deep hebbian networks"
    - "learning from brains how to regularize machines"
    - "a neural network for semi supervised learning on manifolds"
    - "greedy layerwise learning can scale to imagenet"
    - "biologically motivated algorithms for propagating local target representations"
    - "conducting credit assignment by aligning local representations"
    - "equilibrium propagation bridging the gap between energy based models and backpropagation"

Connected through hyperedge HE-4 (induced by source paper "are skip connections necessary for biologically plausible learning rules"):
  with members:
    - "assessing the scalability of biologically motivated deep learning algorithms and architectures"
    - "densely connected convolutional networks"
    - "deep residual learning for image recognition"

Connected through hyperedge HE-5 (induced by source paper "better classifier calibration for small data sets"):
  with members:
    - "obtaining calibrated probabilities from boosting"

Connected through hyperedge HE-6 (induced by source paper "understanding straight through estimator in training activation quantized neural nets"):
  with members:
    - "blended coarse gradient descent for full quantization of deep neural networks"
    - "deep neural nets with interpolating function as output activation"
    - "learning one convolutional layer with overlapping patches"
    - "loss aware weight quantization of deep networks"
    - "binaryrelax a relaxation approach for training deep neural networks with quantized weights"
    - "pact parameterized clipping activation for quantized neural networks"
    - "an optimal control approach to deep learning and applications to discrete weight neural networks"
    - "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples"

Connected through hyperedge HE-7 (induced by source paper "biologically plausible deep learning but how far can we go with shallow networks"):
  with members:
    - "unsupervised learning by competing hidden units"
    - "deep learning in spiking neural networks"
    - "putting a bug in ml the moth olfactory network learns to read mnist"
    - "error forward propagation reusing feedforward connections to propagate errors in deep learning"
    - "feedback alignment in deep convolutional networks"
    - "regularized evolution for image classifier architecture search"
    - "a biologically plausible learning rule for deep learning in the brain"
    - "assessing the scalability of biologically motivated deep learning algorithms and architectures"

Connected through hyperedge HE-8 (induced by source paper "inherent weight normalization in stochastic neural networks"):
  with members:
    - "self normalizing neural networks"
    - "learning discrete weights using the local reparameterization trick"
    - "emnist an extension of mnist to handwritten letters"
    - "learning to learn by gradient descent by gradient descent"
    - "binarized neural networks training deep neural networks with weights and activations constrained to 1 or 1"
    - "training a probabilistic graphical model with resistive switching electronic synapses"
    - "the concrete distribution a continuous relaxation of discrete random variables"
    - "stochastic synapses enable efficient brain inspired learning machines"

Question: Please tell me which class the center node 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)