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 "minimax regret of switching constrained online convex optimization no phase transition"):
  Abstract: We study the problem of switching-constrained online convex optimization (OCO), where the player has a limited number of opportunities to change her action. While the discrete analog of this online learning task has been studied extensively, previous work in the continuous setting has neither established the minimax rate nor algorithmically achieved it. We here show that $ T $-round switching-constrained OCO with fewer than $ K $ switches has a minimax regret of $ \Theta(\frac{T}{\sqrt{K}}) $. In particular, it is at least $ \frac{T}{\sqrt{2K}} $ for one dimension and at least $ \frac{T}{\sqrt{K}} $ for higher dimensions. The lower bound in higher dimensions is attained by an orthogonal subspace argument. The minimax analysis in one dimension is more involved. To establish the one-dimensional result, we introduce the fugal game relaxation, whose minimax regret lower bounds that of switching-constrained OCO. We show that the minimax regret of the fugal game is at least $ \frac{T}{\sqrt{2K}} $ and thereby establish the minimax lower bound in one dimension. We next show that a mini-batching algorithm provides an $ O(\frac{T}{\sqrt{K}}) $ upper bound, and therefore we conclude that the minimax regret of switching-constrained OCO is $ \Theta(\frac{T}{\sqrt{K}}) $ for any $K$. This is in sharp contrast to its discrete counterpart, the switching-constrained prediction-from-experts problem, which exhibits a phase transition in minimax regret between the low-switching and high-switching regimes. In the case of bandit feedback, we first determine a novel linear (in $T$) minimax regret for bandit linear optimization against the strongly adaptive adversary of OCO, implying that a slightly weaker adversary is appropriate. We also establish the minimax regret of switching-constrained bandit convex optimization in dimension $n>2$ to be $\tilde{\Theta}(\frac{T}{\sqrt{K}})$.

Includes members:
  Member "online learning over a finite action set with limited switching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "competitive ratio versus regret minimization achieving the best of both worlds")
  Member "efficient hyperparameter optimization and infinitely many armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "an optimal algorithm for bandit convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "competing against equilibria in zero sum games with evolving payoffs")
  Member "a tale of two metrics simultaneous bounds on competitiveness and regret":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "competitive ratio versus regret minimization achieving the best of both worlds")
  Member "bandit convex optimization sqrt t regret in one dimension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bandit convex optimization in non stationary environments")
  Member "prediction by random walk perturbation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptive hedging under delayed feedback")
  Member "bandits with switching costs t 2 3 regret":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "competitive ratio versus regret minimization achieving the best of both worlds")
  Member "online learning with switching costs and other adaptive adversaries":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "regret bounds for batched bandits")

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)