arrow
返回

Annealing Optimization for Progressive Learning With Stochastic Approximation

delete2023-05-01
delete2
delete
OA
AI
C
Christos N. Mavridis *
J
John S. Baras
DOI:10.1109/TAC.2022.3232706delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this work, we introduce a learning model designed to meet the needs of applications in which computational resources are limited, and robustness and interpretability are prioritized. Learning problems can be formulated as constrained stochastic optimization problems, with the constraints originating mainly from model assumptions that define a tradeoff between complexity and performance. This tradeoff is closely related to overfitting, generalization capacity, and robustness to noise and adversarial attacks, and depends on both the structure and complexity of the model, as well as the properties of the optimization methods used. We develop an online prototype-based learning algorithm based on annealing optimization that is formulated as an online gradient-free stochastic approximation algorithm. The learning model can be viewed as an interpretable and progressively growing competitive-learning neural network model to be used for supervised, unsupervised, and reinforcement learning. The annealing nature of the algorithm contributes to minimal hyperparameter tuning requirements, poor local minima prevention, and robustness with respect to the initial conditions. At the same time, it provides online control over the performance-complexity tradeoff by progressively increasing the complexity of the learning model as needed, through an intuitive bifurcation phenomenon. Finally, the use of stochastic approximation enables the study of the convergence of the learning algorithm through mathematical tools from dynamical systems and control, and allows for its integration with reinforcement learning algorithms, constructing an adaptive state-action aggregation scheme.
Keyword:
Approximation algorithms
Optimization
Heuristic algorithms
Annealing
Machine learning algorithms
Dynamical systems
Complexity theory
Optimization for machine learning
annealing optimization
online deterministic annealing (ODA)
progressive learning
reinforcement learning (RL)
stochastic approximation

期刊

IEEE Transactions on Automatic Control 封面图
IEEE Transactions on Automatic Control
IF:
7
论文数:
1.3W
被引数:
6.7W

机构

University System of Maryland 封面图
University System of Maryland
学者数:
6.5W
论文数: 5.6W
被引数: 113
引用论文

引用论文

err分享
err收藏
Time-recursive deinterlacing for IDTV and pyramid coding
err1990-10-01
err0
errOAAI
errFeng-Ming Wang; Dimitris Anastassiou; Arun N. Netravali
err分享
err收藏
MULTIMODAL INTERVENTION FOR SELECTIVE MUTISM IN MENTALLY RETARDED CHILDREN
err1998-09-01
err0
PREAI
errPaul Swamidhas Sudhakar Russell; Sushila Edward Raj; Jacob Kochukaleekal John
err分享
err收藏
Use of Amazonian Forest Fragments by Understory Insectivorous Birds
err1995-12-01
err0
PREAI
errPhilip C. Stouffer; Richard O. Bierregaard
err分享
err收藏
Explicit and implicit reinforcement learning across the psychosis spectrum.
err2017-07-01
err0
errOAAI
errDeanna M. Barch; Cameron S. Carter; James M. Gold; Sheri L. Johnson; Ann M. Kring; Angus W. MacDonald; Diego A. Pizzagalli; J. Daniel Ragland; Steven M. Silverstein; Milton E. Strauss
err分享
err收藏
Robustness and generalization
err2011-11-15
err246
errOAAI
errXu, Huan; Mannor, Shie
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容