Hugging Face Trending Papers

Hybrid Least Squares/Gradient Descent Methods for MIONets

Read the original on Hugging Face Trending Papers →

In this paper, we propose an efficient hybrid least squares/gradient descent (LSGD) method for MIONets to accelerate training. This method generalizes the LSGD method for DeepONets.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv Computation and Language
2d ago

Detailed Derivation of The Backpropagation Algorithm

The article presents a detailed, step‑by‑step derivation of the backpropagation algorithm for a fully connected feedforward neural network with sigmoid activations and squared‑error loss. It starts with a single‑weight example, extends to general error terms and matrix equations, and then scales the derivation to multiple training examples and mini‑batch gradient descent. Each equation is annotated with dimensions and linked to a NumPy implementation trained on handwritten Arabic digits, with full code provided.

By Faris Alasmary
arXiv Machine Learning
Sep 18

Low-rank Orthogonalization for Large-scale Matrix Optimization with Applications to Foundation Model Training

The paper introduces low‑rank orthogonalization, a technique that exploits the low‑rank nature of gradients in neural network training to perform matrix orthogonalization more efficiently. Building on this, the authors present low‑rank matrix‑signed gradient descent (MSGD) and a low‑rank variant of the Muon optimizer, showing through experiments that low‑rank Muon matches or surpasses vanilla Muon on GPT‑2 and LLaMA pretraining, especially for larger models. Theoretical analysis provides iteration‑complexity bounds for both low‑rank MSGD and low‑rank Muon under heavy‑tailed noise.

By Chuan He, Zhanwang Deng, Zhaosong Lu