paper-with-me

홈 › Papers

Lipschitz Multiscale Deep Equilibrium Models: A Theoretically Guaranteed and Accelerated Approach

2026-02-03 · Naoki Sato, Hideaki Iiduka arxiv

Deep equilibrium models (DEQs) achieve infinitely deep network representations without stacking layers by exploring fixed points of layer transformations in neural networks. Such models constitute an innovative approach that achieves performance comparable to state-of-the-art methods in many large-scale numerical experiments, despite requiring significantly less memory. However, DEQs face the challenge of requiring vastly more computational time for training and inference than conventional methods, as they repeatedly perform fixed-point iterations with no convergence guarantee upon each input. Therefore, this study explored an approach to improve fixed-point convergence and consequently reduce computational time by restructuring the model architecture to guarantee fixed-point convergence. Our proposed approach for image classification, Lipschitz multiscale DEQ, has theoretically guaranteed fixed-point convergence for both forward and backward passes by hyperparameter adjustment, achieving up to a 4.75$\times$ speed-up in numerical experiments on CIFAR-10 at the cost of a minor drop in accuracy.

📄 PDF Abstract BibTeX arXiv:2602.03297

Code (0)

등록된 구현이 없습니다.

Tasks

Image Classification

Similar Papers 제목 키워드 기반

Accelerated Mirror Descent in Continuous and Discrete Time

2015-12-01 · NeurIPS 2015 12 · Walid Krichene, Alexandre Bayen, Peter L. Bartlett

We study accelerated mirror descent dynamics in continuous and discrete time. Combining the original continuous-time motivation of mirror descent with a recent ODE interpretation of Nesterov's accelerated method, we prop…

Extragradient-Type Methods with $\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions

2023-02-08 · Quoc Tran-Dinh

We develop two "Nesterov's accelerated" variants of the well-known extragradient method to approximate a solution of a co-hypomonotone inclusion constituted by the sum of two operators, where one is Lipschitz continuous …

Explore Reinforced: Equilibrium Approximation with Reinforcement Learning

2024-12-02 · Ryan Yu, Mateusz Nowak, Qintong Xie, Michelle Yilin Feng 외

Current approximate Coarse Correlated Equilibria (CCE) algorithms struggle with equilibrium approximation for games in large stochastic environments but are theoretically guaranteed to converge to a strong solution conce…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Lipschitz Generative Adversarial Nets

2019-02-15 · Zhiming Zhou, Jiadong Liang, Yuxuan Song, Lantao Yu 외

In this paper, we study the convergence of generative adversarial networks (GANs) from the perspective of the informativeness of the gradient of the optimal discriminative function. We show that GANs without restriction …

Informativeness

STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games

2022-10-18 · Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Manolis Zampetakis

Min-max optimization problems involving nonconvex-nonconcave objectives have found important applications in adversarial training and other multi-agent learning settings. Yet, no known gradient descent-based method is gu…