mlsanityData to 14 Oct 2026

An alternative approach to train neural networks using monotone variational inequality

arXiv 2202.08876 ↗First posted 17 Feb 2022stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose an alternative approach to neural network training using the monotone vector field, an idea inspired by the seminal work of Juditsky and Nemirovski [Juditsky & Nemirovsky, 2019] developed originally to solve parameter estimation problems for generalized linear models (GLM) by reducing the original non-convex problem to a convex problem of solving a monotone variational inequality (VI). Our approach leads to computationally efficient procedures that converge fast and offer guarantee in some special cases, such as training a single-layer neural network or fine-tuning the last layer of the pre-trained model. Our approach can be used for more efficient fine-tuning of a pre-trained model while freezing the bottom layers, an essential step for deploying many machine learning models such as large language models (LLM). We demonstrate its applicability in training fully-connected (FC) neural networks, graph neural networks (GNN), and convolutional neural networks (CNN) and show the competitive or better performance of our approach compared to stochastic gradient descent methods on both synthetic and real network data prediction tasks regarding various performance metrics.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 17 Feb 2022.

Builds on

25 of 41 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  5. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  6. 2017Inductive Representation Learning on Large Graphscited by 6,320
  7. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  8. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  9. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  10. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  11. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
  12. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
13 more
  1. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
  2. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
  3. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
  4. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
  5. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
  6. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 329
  7. 2017On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learningcited by 142
  8. 2020Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networkscited by 98
  9. 2020Simple and optimal methods for stochastic variational inequalities, I: operator extrapolationcited by 35
  10. 2018First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problemscited by 34
  11. 2021LocoProp: Enhancing BackProp via Local Loss Optimizationcited by 15
  12. 2020An analytic theory of shallow networks dynamics for hinge loss classificationcited by 14
  13. 2021On Well-Structured Convex-Concave Saddle Point Problems and Variational Inequalities with Monotone Operatorscited by 4

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.