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 "sequential matrix completion"):
  Abstract: We propose a novel algorithm for sequential matrix completion in a recommender system setting, where the $(i,j)$th entry of the matrix corresponds to a user $i$'s rating of product $j$. The objective of the algorithm is to provide a sequential policy for user-product pair recommendation which will yield the highest possible ratings after a finite time horizon. The algorithm uses a Gamma process factor model with two posterior-focused bandit policies, Thompson Sampling and Information-Directed Sampling. While Thompson Sampling shows competitive performance in simulations, state-of-the-art performance is obtained from Information-Directed Sampling, which makes its recommendations based off a ratio between the expected reward and a measure of information gain. To our knowledge, this is the first implementation of Information Directed Sampling on large real datasets. #R##N#This approach contributes to a recent line of research on bandit approaches to collaborative filtering including Kawale et al. (2015), Li et al. (2010), Bresler et al. (2014), Li et al. (2016), Deshpande & Montanari (2012), and Zhao et al. (2013). The setting of this paper, as has been noted in Kawale et al. (2015) and Zhao et al. (2013), presents significant challenges to bounding regret after finite horizons. We discuss these challenges in relation to simpler models for bandits with side information, such as linear or gaussian process bandits, and hope the experiments presented here motivate further research toward theoretical guarantees.

Includes members:
  Member "learning to optimize via information directed sampling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "making sense of reinforcement learning and probabilistic inference")
  Member "learning to optimize via posterior sampling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "linear bandits in high dimension and recommendation systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "contextual bandits with random projection")
  Member "the algebraic combinatorial approach for low rank matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted matrix completion from non random non uniform sampling patterns")
  Member "further optimal regret bounds for thompson sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "delay adaptive learning in generalized linear contextual bandits")
  Member "adadelta an adaptive learning rate method":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "a contextual bandit approach to personalized news article recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "low rank matrix completion with noisy observations a quantitative comparison":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bilinear factor matrix norm minimization for robust pca algorithms and 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.IR(Information Retrieval)