human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "learners that use little information"
  Abstract: We study learning algorithms that are restricted to using a small amount of information from their input sample. We introduce a category of learning algorithms we term $d$-bit information learners, which are algorithms whose output conveys at most $d$ bits of information of their input. A central theme in this work is that such algorithms generalize. #R##N#We focus on the learning capacity of these algorithms, and prove sample complexity bounds with tight dependencies on the confidence and error parameters. We also observe connections with well studied notions such as sample compression schemes, Occam's razor, PAC-Bayes and differential privacy. #R##N#We discuss an approach that allows us to prove upper bounds on the amount of information that algorithms reveal about their inputs, and also provide a lower bound by showing a simple concept class for which every (possibly randomized) empirical risk minimizer must reveal a lot of information. On the other hand, we show that in the distribution-dependent setting every VC class has empirical risk minimizers that do not reveal a lot of information.

Connected through hyperedge HE-1 (induced by source paper "reasoning about generalization via conditional mutual information"):
  with members:
    - "robust generalization via α mutual information"
    - "in defense of uniform convergence generalization via derandomization with an application to interpolating predictors"
    - "strengthened information theoretic bounds on the generalization error"
    - "tightening mutual information based bounds on generalization error"
    - "high probability generalization bounds for uniformly stable algorithms with nearly optimal rate"
    - "a new analysis of differential privacy s generalization guarantees"
    - "pac learning with stable and private predictions"
    - "a direct sum result for the information complexity of learning"

Connected through hyperedge HE-2 (induced by source paper "guess first to enable better compression and adversarial robustness"):
  with members:
    - "extracting robust and accurate features via a robust information bottleneck"
    - "complement objective training"
    - "sparse dnns with improved adversarial robustness"
    - "towards the first adversarially robust neural network model on mnist"
    - "defense gan protecting classifiers against adversarial attacks using generative models"
    - "excessive invariance causes adversarial vulnerability"
    - "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples"
    - "threat of adversarial attacks on deep learning in computer vision a survey"

Connected through hyperedge HE-3 (induced by source paper "robust generalization via α mutual information"):
  with members:
    - "an operational approach to information leakage"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "generalization in adaptive data analysis and holdout reuse"
    - "renyi divergence and kullback leibler divergence"

Connected through hyperedge HE-4 (induced by source paper "information bottleneck and its applications in deep learning"):
  with members:
    - "a direct sum result for the information complexity of learning"
    - "chaining mutual information and tightening generalization bounds"
    - "mathematics of deep learning"
    - "infovae information maximizing variational autoencoders"
    - "emergence of invariance and disentanglement in deep representations"
    - "stochastic gradient descent performs variational inference converges to limit cycles for deep networks"
    - "fixing a broken elbo"
    - "sharp minima can generalize for deep nets"

Connected through hyperedge HE-5 (induced by source paper "chaining meets chain rule multilevel entropic regularization and training of neural nets"):
  with members:
    - "distribution dependent analysis of gibbs erm principle"
    - "tightening mutual information based bounds on generalization error"
    - "data dependent pac bayes priors via differential privacy"
    - "generalization error bounds for noisy iterative algorithms"
    - "chaining mutual information and tightening generalization bounds"
    - "representing smooth functions as compositions of near identity functions with implications for deep network optimization"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "non convex learning via stochastic gradient langevin dynamics a nonasymptotic analysis"

Connected through hyperedge HE-6 (induced by source paper "gaussian mean field regularizes by limiting learned information"):
  with members:
    - "tightening mutual information based bounds on generalization error"
    - "implicit regularization of stochastic gradient descent in natural language processing observations and implications"
    - "neural ordinary differential equations"
    - "mine mutual information neural estimation"
    - "bounded information rate variational autoencoders"
    - "representation learning with contrastive predictive coding"
    - "parameter space noise for exploration"
    - "information theoretic analysis of generalization capability of learning algorithms"

Connected through hyperedge HE-7 (induced by source paper "a necessary and sufficient stability notion for adaptive generalization"):
  with members:
    - "natural analysts in adaptive data analysis"
    - "an operational approach to information leakage"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "calibrating noise to variance in adaptive data analysis"
    - "learners that leak little information"
    - "typicality based stability and privacy"
    - "inferential privacy guarantees for differentially private mechanisms"
    - "adaptive learning with robust generalization guarantees"

Connected through hyperedge HE-8 (induced by source paper "generalization error bounds via renyi f divergences and maximal leakage"):
  with members:
    - "tightening mutual information based bounds on generalization error"
    - "generalization error bounds for noisy iterative algorithms"
    - "an operational approach to information leakage"
    - "chaining mutual information and tightening generalization bounds"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "dependence measures bounding the exploration bias for general measurements"
    - "max information differential privacy and post selection hypothesis testing"
    - "generalization in adaptive data analysis and holdout reuse"

Question: Please tell me which class the center node 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)