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 "λopt learn to regularize recommender models in finer levels"):
  Abstract: Recommendation models mainly deal with categorical variables, such as user/item ID and attributes. Besides the high-cardinality issue, the interactions among such categorical variables are usually long-tailed, with the head made up of highly frequent values and a long tail of rare ones. This phenomenon results in the data sparsity issue, making it essential to regularize the models to ensure generalization. The common practice is to employ grid search to manually tune regularization hyperparameters based on the validation data. However, it requires non-trivial efforts and large computation resources to search the whole candidate space; even so, it may not lead to the optimal choice, for which different parameters should have different regularization strengths. In this paper, we propose a hyperparameter optimization method, lambdaOpt, which automatically and adaptively enforces regularization during training. Specifically, it updates the regularization coefficients based on the performance of validation data. With lambdaOpt, the notorious tuning of regularization hyperparameters can be avoided; more importantly, it allows fine-grained regularization (i.e. each parameter can have an individualized regularization coefficient), leading to better generalized models. We show how to employ lambdaOpt on matrix factorization, a classical model that is representative of a large family of recommender models. Extensive experiments on two public benchmarks demonstrate the superiority of our method in boosting the performance of top-K recommendation.

Includes members:
  Member "warm up cold start advertisements improving ctr predictions via learning to learn id embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "field aware calibration a simple and empirically strong method for reliable probabilistic predictions")
  Member "adversarial personalized ranking for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial ranking attack and defense")
  Member "aesthetic based clothing recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modeling embedding dimension correlations via convolutional neural collaborative filtering")
  Member "neural factorization machines for sparse predictive analytics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameter efficient transfer from sequential behaviors for user profiling and recommendation")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "advances in collaborative filtering and ranking")
  Member "efficient hyperparameter optimization and infinitely many armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "entity embeddings of categorical variables":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fastai a layered api for deep learning")
  Member "a generic coordinate descent framework for learning from implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "estimation action reflection towards deep interaction between conversational and recommender systems")

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)