paper-with-me

홈 › Papers

Improving Infinitely Deep Bayesian Neural Networks with Nesterov's Accelerated Gradient Method

2026-03-26 · Chenxu Yu, Wenqi Fang arxiv

As a representative continuous-depth neural network approach, stochastic differential equation (SDE)-based Bayesian neural networks (BNNs) have attracted considerable attention due to their solid theoretical foundations and strong potential for real-world applications. However, their reliance on numerical SDE solvers inevitably incurs a large number of function evaluations (NFEs), resulting in high computational cost and occasional convergence instability. To address these challenges, we propose a Nesterov-accelerated gradient (NAG) enhanced SDE-BNN model. By integrating NAG into the SDE-BNN framework along with an NFE-dependent residual skip connection, our method accelerates convergence and substantially reduces NFEs during both training and testing. Extensive empirical results show that our model consistently outperforms conventional SDE-BNNs across various tasks, including image classification and sequence modeling, achieving lower NFEs and improved predictive accuracy.

📄 PDF Abstract BibTeX arXiv:2603.25024

Code (0)

등록된 구현이 없습니다.

Tasks

Image Classification

Similar Papers 제목 키워드 기반

A modified limited memory Nesterov's accelerated quasi-Newton

2021-12-01 · S. Indrapriyadarsini, Shahrzad Mahboubi, Hiroshi Ninomiya, Takeshi Kamio 외

The Nesterov's accelerated quasi-Newton (L)NAQ method has shown to accelerate the conventional (L)BFGS quasi-Newton method using the Nesterov's accelerated gradient in several neural network (NN) applications. However, t…

Accelerated Information Gradient flow

2019-09-04 · Yifei Wang, Wuchen Li

We present a framework for Nesterov's accelerated gradient flows in probability space to design efficient mean-field Markov chain Monte Carlo (MCMC) algorithms for Bayesian inverse problems. Here four examples of informa…

Bayesian Inference

A geometric alternative to Nesterov's accelerated gradient descent

2015-06-26 · Sébastien Bubeck, Yin Tat Lee, Mohit Singh

We propose a new method for unconstrained optimization of a smooth and strongly convex function, which attains the optimal rate of convergence of Nesterov's accelerated gradient descent. The new algorithm has a simple ge…

A Concise Lyapunov Analysis of Nesterov's Accelerated Gradient Method

2025-02-24 · Jun Liu

Convergence analysis of Nesterov's accelerated gradient method has attracted significant attention over the past decades. While extensive work has explored its theoretical properties and elucidated the intuition behind i…

Randomized Subspace Nesterov Accelerated Gradient

2026-05-01 · Gaku Omiya, Pierre-Louis Poirion, Akiko Takeda arxiv

Randomized-subspace methods reduce the cost of first-order optimization by using only low-dimensional projected-gradient information, a feature that is attractive in forward-mode automatic differentiation and communicati…