paper-with-me

Papers

Curl Descent: Non-Gradient Learning Dynamics with Sign-Diverse Plasticity

2025-10-03 · Hugo Ninou, Jonathan Kadmon, N. Alex Cayco-Gajic arxiv

Gradient-based algorithms are a cornerstone of artificial neural network training, yet it remains unclear whether biological neural networks use similar gradient-based strategies during learning. Experiments often discover a diversity of synaptic plasticity rules, but whether these amount to an approximation to gradient descent is unclear. Here we investigate a previously overlooked possibility: that learning dynamics may include fundamentally non-gradient "curl"-like components while still being able to effectively optimize a loss function. Curl terms naturally emerge in networks with inhibitory-excitatory connectivity or Hebbian/anti-Hebbian plasticity, resulting in learning dynamics that cannot be framed as gradient descent on any objective. To investigate the impact of these curl terms, we analyze feedforward networks within an analytically tractable student-teacher framework, systematically introducing non-gradient dynamics through neurons exhibiting rule-flipped plasticity. Small curl terms preserve the stability of the original solution manifold, resulting in learning dynamics similar to gradient descent. Beyond a critical value, strong curl terms destabilize the solution manifold. Depending on the network architecture, this loss of stability can lead to chaotic learning dynamics that destroy performance. In other cases, the curl terms can counterintuitively speed learning compared to gradient descent by allowing the weight dynamics to escape saddles by temporarily ascending the loss. Our results identify specific architectures capable of supporting robust learning via diverse learning rules, providing an important counterpoint to normative theories of gradient-based learning in neural networks.

📄 PDF Abstract BibTeX arXiv:2510.02765

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Model-Based Concave Utility Reinforcement Learning through Greedy Mirror Descent

2023-11-30 · Bianca Marin Moreno, Margaux Brégère, Pierre Gaillard, Nadia Oudjane

Many machine learning tasks can be solved by minimizing a convex function of an occupancy measure over the policies that generate them. These include reinforcement learning, imitation learning, among others. This more ge…

Imitation Learningreinforcement-learningReinforcement Learning

Curly Flow Matching for Learning Non-gradient Field Dynamics

2025-10-30 · Katarina Petrović, Lazar Atanackovic, Viggo Moro, Kacper Kapuśniak 외 arxiv

Modeling the transport dynamics of natural processes from population-level observations is a ubiquitous problem in the natural sciences. Such models rely on key assumptions about the underlying process in order to enable…

Global Convergence to the Equilibrium of GANs using Variational Inequalities

2018-08-04 · Ian Gemp, Sridhar Mahadevan

In optimization, the negative gradient of a function denotes the direction of steepest descent. Furthermore, traveling in any direction orthogonal to the gradient maintains the value of the function. In this work, we sho…

Generative Adversarial Network

Curls & Whey: Boosting Black-Box Adversarial Attacks

2019-04-02 · CVPR 2019 6 · Yucheng Shi, Siyu Wang, Yahong Han

Image classifiers based on deep neural networks suffer from harassment caused by adversarial examples. Two defects exist in black-box iterative attacks that generate adversarial examples by incrementally adjusting the no…

Adversarial AttackDiversity

AdaCuRL: Adaptive Curriculum Reinforcement Learning with Invalid Sample Mitigation and Historical Revisiting

2025-11-12 · Renda Li, Hailang Huang, Fei Wei, Feng Xiong 외 arxiv

Reinforcement learning (RL) has demonstrated considerable potential for enhancing reasoning in large language models (LLMs). However, existing methods suffer from Gradient Starvation and Policy Degradation when training …

Reinforcement Learning