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 "learning fast algorithms for linear transforms using butterfly factorizations"):
  Abstract: Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense matrix-vector multiplication, yet each has a specialized and highly efficient (subquadratic) algorithm. We ask to what extent hand-crafting these algorithms and implementations is necessary, what structural priors they encode, and how much knowledge is required to automatically learn a fast algorithm for a provided structured transform. Motivated by a characterization of fast matrix-vector multiplication as products of sparse matrices, we introduce a parameterization of divide-and-conquer methods that is capable of representing a large class of transforms. This generic formulation can automatically learn an efficient algorithm for many important transforms; for example, it recovers the $O(N \log N)$ Cooley-Tukey FFT algorithm to machine precision, for dimensions $N$ up to $1024$. Furthermore, our method can be incorporated as a lightweight replacement of generic matrices in machine learning pipelines to learn efficient and compressible transformations. On a standard task of compressing a single hidden-layer network, our method exceeds the classification accuracy of unconstrained matrices on CIFAR-10 by 3.9 points---the first time a structured approach has done so---with 4X faster inference speed and 40X fewer parameters.

Includes members:
  Member "neural arithmetic logic units":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stealing black box functionality using the deep neural tree architecture")
  Member "quadrature based features for kernel approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalization guarantees for sparse kernel approximation with entropic optimal features")
  Member "learning compressed transforms with low displacement rank":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low memory neural network training a technical report")
  Member "c ir cnn accelerating and compressing deep neural networks using block circulant weight matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "π nets deep polynomial neural networks")
  Member "a semantic loss function for deep learning with symbolic knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "strassennets deep learning with a multiplication budget":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "searching for winograd aware quantized networks")
  Member "hyperband a novel bandit based approach to hyperparameter optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "neural combinatorial optimization with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")

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)