A Unified Scheme of ResNet and Softmax
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have brought significant changes to human society. Softmax regression and residual neural networks (ResNet) are two important techniques in deep learning: they not only serve as significant theoretical components supporting the functionality of LLMs but also are related to many other machine learning and theoretical computer science fields, including but not limited to image classification, object detection, semantic segmentation, and tensors. Previous research works studied these two concepts separately. In this paper, we provide a theoretical analysis of the regression problem: | langle exp(Ax) + A x , bf 1n rangle-1 ( exp(Ax) + Ax ) - b |22, where A is a matrix in ℝn × d, b is a vector in ℝn, and bf 1n is the n-dimensional vector whose entries are all 1. This regression problem is a unified scheme that combines softmax regression and ResNet, which has never been done before. We derive the gradient, Hessian, and Lipschitz properties of the loss function. The Hessian is shown to be positive semidefinite, and its structure is characterized as the sum of a low-rank matrix and a diagonal matrix. This enables an efficient approximate Newton method. As a result, this unified scheme helps to connect two previously thought unrelated fields and provides novel insight into loss landscape and optimization for emerging over-parameterized neural networks, which is meaningful for future research in deep learning models.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 38 of its 110 references that are in the map. First posted on arXiv 23 Sep 2023.
Builds on
38 of 110 references.
References · 38
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2016Wide Residual Networkscited by 3,057
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020Rethinking Attention with Performerscited by 1,584
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2019CamemBERT: a Tasty French Language Modelcited by 368
- 2015Highway Networkscited by 257
- 2019Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networkscited by 120
- 2023Fast Attention Requires Bounded Entriescited by 102
- 2021Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Timecited by 62
26 more
- 2020Training (Overparametrized) Neural Networks in Near-Linear Timecited by 58
- 2023KDEformer: Accelerating Transformers via Kernel Density Estimationcited by 58
- 2017Residual Conv-Deconv Grid Network for Semantic Segmentationcited by 57
- 2023Attention Scheme Inspired Softmax Regressioncited by 49
- 2023An Over-parameterized Exponential Regressioncited by 45
- 2023Solving Regularized Exp, Cosh and Sinh Regression Problemscited by 44
- 2023The Closeness of In-Context Learning and Weight Shifting for Softmax Regressioncited by 41
- 2019Gram-Gauss-Newton Method: Learning Overparameterized Neural Networks for Regression Problemscited by 40
- 2023An Iterative Algorithm for Rescaled Hyperbolic Functions Regressioncited by 35
- 2023In-Context Learning for Attention Scheme: from Single Softmax Regression to Multiple Softmax Regression via a Tensor Trickcited by 32
- 2023Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Timecited by 31
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
- 2022Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessingcited by 29
- 2023A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Modelscited by 29
- 2023InfoPrompt: Information-Theoretic Soft Prompt Tuning for Natural Language Understandingcited by 29
- 2022Faster Algorithm for Structured John Ellipsoid Computationcited by 28
- 2023Differentially Private Attention Computationcited by 25
- 2023GradientCoin: A Peer-to-Peer Decentralized Large Language Modelscited by 23
- 2022Discrepancy Minimization in Input-Sparsity Timecited by 22
- 2023Solving Attention Kernel Regression Problem via Pre-conditionercited by 20
- 2023A General Algorithm for Solving Rank-one Matrix Sensingcited by 15
- 2023Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Accelerationcited by 11
- 2023Efficient SGD Neural Network Training via Sublinear Activated Neuron Identificationcited by 11
- 2023Efficient Alternating Minimization with Applications to Weighted Low Rank Approximationcited by 9
- 2023Faster Robust Tensor Power Method for Arbitrary Ordercited by 8
- 2023Breast Cancer Classification with Enhanced Interpretability: DALAResNet50 and DT Grad-CAMcited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 5; 2025: 5.
12 papers.
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformerscited by 35
- 2024Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformerscited by 32
- 2024The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexitycited by 21
- 2025High-Order Matching for One-Step Shortcut Diffusion Modelscited by 15
- 2023An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descentcited by 9
- 2023The Expressibility of Polynomial based Attention Schemecited by 7
- 2025Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretrainingcited by 6
- 2024How to Inverting the Leverage Score Distribution?cited by 5
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approachescited by 4
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Methodcited by 3
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systemscited by 3
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decodingcited by 2
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems24 Jun 2025
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding14 Mar 2025
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches3 Mar 2025
- 2025Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretraining9 Feb 2025
- 2025High-Order Matching for One-Step Shortcut Diffusion Models2 Feb 2025
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers17 Dec 2024
- 2024The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity9 Dec 2024
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method21 Aug 2024
- 2024Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers8 May 2024
- 2024How to Inverting the Leverage Score Distribution?21 Apr 2024
- 2023The Expressibility of Polynomial based Attention Scheme30 Oct 2023
- 2023An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent17 Oct 2023