656 results for Gradient · 0.083s

github.com/KentonMurray/ProxGradPytorch

KentonMurray/ProxGradPytorch

PyTorch implementation of Proximal Gradient Algorithms a la Parikh and Boyd (2014). Useful for Auto-Sizing (Murray and Chiang 2015, Murray et al. 2019). (⭐ 42)

arxiv.org/abs/2401.03892v3

Sampling in Unit Time with Kernel Fisher-Rao Flow

We introduce a new mean-field ODE and corresponding interacting particle systems (IPS) for sampling from an unnormalized target density. The IPS are gradient-free, available in closed form, and only require the ability to sample from a reference dens...

Sponsored Partners
arxiv.org/abs/1808.05274v1

Frank-Wolfe Style Algorithms for Large Scale Optimization

We introduce a few variants on Frank-Wolfe style algorithms suitable for large scale optimization. We show how to modify the standard Frank-Wolfe algorithm using stochastic gradients, approximate subproblem solutions, and sketched decision variables...

github.com/johnkorzhuk/grabient

johnkorzhuk/grabient

Cosine gradient generator & Palette finder (⭐ 2007)

arxiv.org/abs/1807.05827v4

Remember and Forget for Experience Replay

Experience replay (ER) is a fundamental component of off-policy deep reinforcement learning (RL). ER recalls experiences from past iterations to compute gradient estimates for the current policy, increasing data-efficiency. However, the accuracy of s...

github.com/Abhinandan-Kushwaha/react-native-gifted-charts

Abhinandan-Kushwaha/react-native-gifted-charts

The most loved library for Bar, Line, Area, Pie, Donut, Stacked Bar, Population Pyramid, Radar, Bubble and Scatter charts in React Native. Allows 2D, 3D, gradient, animations and live data updates. (⭐ 1280)

en.wikipedia.org/wiki/Backpropagation

Backpropagation - Wikipedia

In machine learning, backpropagation is a gradient computation method commonly used for training a neural network in computing parameter updates. It is

arxiv.org/abs/1204.1227v4

An Approximate Newton Method for Markov Decision Processes

Gradient-based algorithms are one of the methods of choice for the optimisation of Markov Decision Processes. In this article we will present a novel approximate Newton algorithm for the optimisation of such models. The algorithm has various desirabl...

arxiv.org/abs/2411.16462v2

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet interconnects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have b...

arxiv.org/abs/2506.17796v2

SING: SDE Inference via Natural Gradients

Latent stochastic differential equation (SDE) models are important tools for the unsupervised discovery of dynamical systems from data, with applications ranging from engineering to neuroscience. In these complex domains, exact posterior inference of...

arxiv.org/abs/2305.15997v1

SING: A Plug-and-Play DNN Learning Technique

We propose SING (StabIlized and Normalized Gradient), a plug-and-play technique that improves the stability and generalization of the Adam(W) optimizer. SING is straightforward to implement and has minimal computational overhead, requiring only a lay...