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 "logistic regression the importance of being improper"):
  Abstract: Learning linear predictors with the logistic loss---both in stochastic and online settings---is a fundamental task in machine learning and statistics, with direct connections to classification and boosting. Existing "fast rates" for this setting exhibit exponential dependence on the predictor norm, and Hazan et al. (2014) showed that this is unfortunately unimprovable. Starting with the simple observation that the logistic loss is $1$-mixable, we design a new efficient improper learning algorithm for online logistic regression that circumvents the aforementioned lower bound with a regret bound exhibiting a doubly-exponential improvement in dependence on the predictor norm. This provides a positive resolution to a variant of the COLT 2012 open problem of McMahan and Streeter (2012) when improper learning is allowed. This improvement is obtained both in the online setting and, with some extra work, in the batch statistical setting with high probability. We also show that the improved dependence on predictor norm is near-optimal. #R##N#Leveraging this improved dependency on the predictor norm yields the following applications: (a) we give algorithms for online bandit multiclass learning with the logistic loss with an $\tilde{O}(\sqrt{n})$ relative mistake bound across essentially all parameter ranges, thus providing a solution to the COLT 2009 open problem of Abernethy and Rakhlin (2009), and (b) we give an adaptive algorithm for online multiclass boosting with optimal sample complexity, thus partially resolving an open problem of Beygelzimer et al. (2015) and Jung et al. (2017). Finally, we give information-theoretic bounds on the optimal rates for improper logistic regression with general function classes, thereby characterizing the extent to which our improvement for linear classes extends to other parametric and even nonparametric settings.

Includes members:
  Member "fast rates with high probability in exp concave statistical learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "strength from weakness fast learning using weak supervision")
  Member "from exp concavity to variance control high probability o 1 n rates and high probability online to batch conversion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient improper learning for online logistic regression")
  Member "fast rates in statistical and online learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strength from weakness fast learning using weak supervision")
  Member "sequential probability assignment with binary alphabets and large classes of experts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a tight excess risk bound via a unified pac bayesian rademacher shtarkov mdl complexity")
  Member "logistic regression tight bounds for stochastic and online optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient improper learning for online logistic regression")
  Member "contextual bandit algorithms with supervised learning guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "self concordant analysis for logistic regression":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the implicit and explicit regularization effects of dropout")

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)