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 "a general framework for counterfactual learning to rank"):
  Abstract: Implicit feedback (e.g., click, dwell time) is an attractive source of training data for Learning-to-Rank, but its naive use leads to learning results that are distorted by presentation bias. For the special case of optimizing average rank for linear ranking functions, however, the recently developed SVM-PropRank method has shown that counterfactual inference techniques can be used to provably overcome the distorting effect of presentation bias. Going beyond this special case, this paper provides a general and theoretically rigorous framework for counterfactual learning-to-rank that enables unbiased training for a broad class of additive ranking metrics (e.g., Discounted Cumulative Gain (DCG)) as well as a broad class of models (e.g., deep networks). Specifically, we derive a relaxation for propensity-weighted rank-based metrics which is subdifferentiable and thus suitable for gradient-based optimization. We demonstrate the effectiveness of this general approach by instantiating two new learning methods. One is a new type of unbiased SVM that optimizes DCG -- called SVM PropDCG --, and we show how the resulting optimization problem can be solved via the Convex Concave Procedure (CCP). The other is Deep PropDCG, where the ranking function can be an arbitrary deep network. In addition to the theoretical support, we empirically find that SVM PropDCG significantly outperforms existing linear rankers in terms of DCG. Moreover, the ability to train non-linear ranking functions via Deep PropDCG further improves performance.

Includes members:
  Member "intervention harvesting for context dependent examination bias estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fair learning to rank from implicit feedback")
  Member "estimating position bias without intrusive interventions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "unbiased learning to rank with unbiased propensity estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "handling position bias for unbiased learning to rank in hotels search")
  Member "a novel algorithm for unbiased learning to rank":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fair learning to rank from implicit feedback")
  Member "deeprank a new deep architecture for relevance ranking in information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "unbiased learning to rank with biased feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "safe exploration for optimizing contextual bandits")
  Member "recommendations as treatments debiasing learning and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the fairness of randomized trials for recommendation with heterogeneous demographics and beyond")
  Member "unbiased comparative evaluation of ranking functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fairness in recommendation ranking through pairwise comparisons")

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)