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 "end to end lane detection through differentiable least squares fitting"):
  Abstract: Lane detection is typically tackled with a two-step pipeline in which a segmentation mask of the lane markings is predicted first, and a lane line model (like a parabola or spline) is fitted to the post-processed mask next. The problem with such a two-step approach is that the parameters of the network are not optimized for the true task of interest (estimating the lane curvature parameters) but for a proxy task (segmenting the lane markings), resulting in sub-optimal performance. In this work, we propose a method to train a lane detector in an end-to-end manner, directly regressing the lane parameters. The architecture consists of two components: a deep network that predicts a segmentation-like weight map for each lane line, and a differentiable least-squares fitting module that returns for each map the parameters of the best-fitting curve in the weighted least-squares sense. These parameters can subsequently be supervised with a loss function of choice. Our method relies on the observation that it is possible to backpropagate through a least-squares fitting procedure. This leads to an end-to-end method where the features are optimized for the true task of interest: the network implicitly learns to generate features that prevent instabilities during the model fitting step, as opposed to two-step pipelines that need to handle outliers with heuristics. Additionally, the system is not just a black box but offers a degree of interpretability because the intermediately generated segmentation-like weight maps can be inspected and visualized. Code and a video is available at github.com/wvangansbeke/LaneDetection_End2End.

Includes members:
  Member "towards end to end lane detection an instance segmentation approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semi local 3d lane detection and uncertainty estimation")
  Member "geometric loss functions for camera pose regression with deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "neural mesh refiner for 6 dof pose estimation")
  Member "optnet differentiable optimization as a layer in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lossless compression of deep neural networks")
  Member "geometric deep learning going beyond euclidean data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on deep geometry learning from a representation perspective")
  Member "unrolled generative adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "learning shape correspondence with anisotropic convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on deep geometry learning from a representation perspective")
  Member "perspective transformer nets learning single view 3d object reconstruction without 3d supervision":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pt2pc learning to generate 3d point cloud shapes from part tree conditions")
  Member "spatial transformer networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "transformation based adversarial video prediction on large scale data")

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.CV(Computer Vision and Pattern Recognition)