paper-with-me

Papers

First-Order Preconditioning via Hypergradient Descent

2019-10-18 · Ted Moskovitz, Rui Wang, Janice Lan, Sanyam Kapoor, Thomas Miconi, Jason Yosinski, Aditya Rawal

Standard gradient descent methods are susceptible to a range of issues that can impede training, such as high correlations and different scaling in parameter space.These difficulties can be addressed by second-order approaches that apply a pre-conditioning matrix to the gradient to improve convergence. Unfortunately, such algorithms typically struggle to scale to high-dimensional problems, in part because the calculation of specific preconditioners such as the inverse Hessian or Fisher information matrix is highly expensive. We introduce first-order preconditioning (FOP), a fast, scalable approach that generalizes previous work on hypergradient descent (Almeida et al., 1998; Maclaurin et al., 2015; Baydin et al.,2017) to learn a preconditioning matrix that only makes use of first-order information. Experiments show that FOP is able to improve the performance of standard deep learning optimizers on visual classification and reinforcement learning tasks with minimal computational overhead. We also investigate the properties of the learned preconditioning matrices and perform a preliminary theoretical analysis of the algorithm.

📄 PDF Abstract BibTeX arXiv:1910.08461

Code (1)

Antonildo43/Projeto-Construcao-do-Algoritmo-FOP

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Enhancing Hypergradients Estimation: A Study of Preconditioning and Reparameterization

2024-02-26 · Zhenzhang Ye, Gabriel Peyré, Daniel Cremers, Pierre Ablin

Bilevel optimization aims to optimize an outer objective function that depends on the solution to an inner optimization problem. It is routinely used in Machine Learning, notably for hyperparameter tuning. The convention…

Bilevel Optimization

Accelerating Inexact HyperGradient Descent for Bilevel Optimization

2023-06-30 · Haikuo Yang, Luo Luo, Chris Junchi Li, Michael I. Jordan

We present a method for solving general nonconvex-strongly-convex bilevel optimization problems. Our method -- the \emph{Restarted Accelerated HyperGradient Descent} (\texttt{RAHGD}) method -- finds an $\epsilon$-first-o…

Bilevel Optimization

Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent

2025-02-16 · Ya-Chi Chu, Wenzhi Gao, Yinyu Ye, Madeleine Udell

This paper investigates the convergence properties of the hypergradient descent method (HDM), a 25-year-old heuristic originally proposed for adaptive stepsize selection in stochastic first-order methods. We provide the …

A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods

2024-11-25 · Wei Lin, Qingyu Song, Hong Xu

Tuning step sizes is crucial for the stability and efficiency of optimization algorithms. While adaptive coordinate-wise step sizes have been shown to outperform scalar step size in first-order methods, their use in seco…

Second-order methods

OSDN: Improving Delta Rule with Provable Online Preconditioning in Linear Attention

2026-05-13 · Chenyu Zhou, Hongpei Li, Yuerou Liu, Jianghao Lin 외 arxiv

Linear attention and state-space models offer constant-memory alternatives to softmax attention, but often struggle with in-context associative recall. The Delta Rule mitigates this by writing each token via one step of …