• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种无参数学习自动机方案。

A parameter-free learning automaton scheme.

作者信息

Ren Xudie, Li Shenghong, Ge Hao

机构信息

School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China.

Shanghai Data Miracle Intelligent Technology Co., Ltd., Shanghai, China.

出版信息

Front Neurorobot. 2022 Sep 23;16:999658. doi: 10.3389/fnbot.2022.999658. eCollection 2022.

DOI:10.3389/fnbot.2022.999658
PMID:36213147
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9539663/
Abstract

For a learning automaton, a proper configuration of the learning parameters is crucial. To ensure stable and reliable performance in stochastic environments, manual parameter tuning is necessary for existing LA schemes, but the tuning procedure is time-consuming and interaction-costing. It is a fatal limitation for LA-based applications, especially for those environments where the interactions are expensive. In this paper, we propose a parameter-free learning automaton (PFLA) scheme to avoid parameter tuning by a Bayesian inference method. In contrast to existing schemes where the parameters must be carefully tuned according to the environment, PFLA works well with a set of consistent parameters in various environments. This intriguing property dramatically reduces the difficulty of applying a learning automaton to an unknown stochastic environment. A rigorous proof of ϵ-optimality for the proposed scheme is provided and numeric experiments are carried out on benchmark environments to verify its effectiveness. The results show that, without any parameter tuning cost, the proposed PFLA can achieve a competitive performance compared with other well-tuned schemes and outperform untuned schemes on the consistency of performance.

摘要

对于学习自动机而言,学习参数的恰当配置至关重要。为确保在随机环境中实现稳定可靠的性能,现有学习自动机方案需要进行手动参数调整,但该调整过程既耗时又耗费交互成本。这对于基于学习自动机的应用来说是一个致命限制,尤其是对于那些交互成本高昂的环境。在本文中,我们提出一种无参数学习自动机(PFLA)方案,通过贝叶斯推理方法避免参数调整。与现有方案不同,现有方案中参数必须根据环境仔细调整,而PFLA在各种环境中使用一组一致的参数就能良好运行。这一有趣的特性极大地降低了将学习自动机应用于未知随机环境的难度。我们为所提方案提供了严格的ε最优性证明,并在基准环境上进行了数值实验以验证其有效性。结果表明,所提PFLA无需任何参数调整成本,与其他经过良好调整的方案相比能够实现具有竞争力的性能,并且在性能一致性方面优于未调整的方案。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/877705da7f50/fnbot-16-999658-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/260e06236e54/fnbot-16-999658-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/754742938c09/fnbot-16-999658-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/f4f898f29553/fnbot-16-999658-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/877705da7f50/fnbot-16-999658-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/260e06236e54/fnbot-16-999658-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/754742938c09/fnbot-16-999658-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/f4f898f29553/fnbot-16-999658-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/95be/9539663/877705da7f50/fnbot-16-999658-g0004.jpg

相似文献

1
A parameter-free learning automaton scheme.一种无参数学习自动机方案。
Front Neurorobot. 2022 Sep 23;16:999658. doi: 10.3389/fnbot.2022.999658. eCollection 2022.
2
An Efficient Parameter-Free Learning Automaton Scheme.
IEEE Trans Neural Netw Learn Syst. 2021 Nov;32(11):4849-4863. doi: 10.1109/TNNLS.2020.3025937. Epub 2021 Oct 27.
3
A Non-Monte-Carlo Parameter-Free Learning Automata Scheme Based on Two Categories of Statistics.基于两类统计量的无蒙特卡罗参数自由学习自动机方案。
IEEE Trans Cybern. 2019 Dec;49(12):4153-4166. doi: 10.1109/TCYB.2018.2859353. Epub 2018 Aug 13.
4
Last-position elimination-based learning automata.基于最后位置消除的学习自动机。
IEEE Trans Cybern. 2014 Dec;44(12):2484-92. doi: 10.1109/TCYB.2014.2309478. Epub 2014 Apr 2.
5
A new class of epsilon-optimal learning automata.一类新型的ε-最优学习自动机。
IEEE Trans Syst Man Cybern B Cybern. 2004 Feb;34(1):246-54. doi: 10.1109/tsmcb.2003.811117.
6
Parameter learning from stochastic teachers and stochastic compulsive liars.从随机教师和随机强迫说谎者中进行参数学习。
IEEE Trans Syst Man Cybern B Cybern. 2006 Aug;36(4):820-34. doi: 10.1109/tsmcb.2005.863379.
7
A comparison of Monte Carlo-based Bayesian parameter estimation methods for stochastic models of genetic networks.基于蒙特卡洛的遗传网络随机模型贝叶斯参数估计方法比较
PLoS One. 2017 Aug 10;12(8):e0182015. doi: 10.1371/journal.pone.0182015. eCollection 2017.
8
Linac photon beam fine-tuning in PRIMO using the gamma-index analysis toolkit.在 PRIMO 中使用伽马指数分析工具包对直线加速器光子束进行微调。
Radiat Oncol. 2020 Jan 6;15(1):8. doi: 10.1186/s13014-019-1455-1.
9
BAYESIAN INFERENCE OF STOCHASTIC REACTION NETWORKS USING MULTIFIDELITY SEQUENTIAL TEMPERED MARKOV CHAIN MONTE CARLO.使用多保真度序贯回火马尔可夫链蒙特卡罗方法对随机反应网络进行贝叶斯推断。
Int J Uncertain Quantif. 2020;10(6):515-542. doi: 10.1615/int.j.uncertaintyquantification.2020033241.
10
Spectral density-based and measure-preserving ABC for partially observed diffusion processes. An illustration on Hamiltonian SDEs.基于谱密度和保测度的部分观测扩散过程的近似贝叶斯计算。哈密顿随机微分方程的一个示例。
Stat Comput. 2020;30(3):627-648. doi: 10.1007/s11222-019-09909-6. Epub 2019 Nov 5.

本文引用的文献

1
Last-position elimination-based learning automata.基于最后位置消除的学习自动机。
IEEE Trans Cybern. 2014 Dec;44(12):2484-92. doi: 10.1109/TCYB.2014.2309478. Epub 2014 Apr 2.
2
Learning-automaton-based online discovery and tracking of spatiotemporal event patterns.基于学习自动机的时空事件模式在线发现和跟踪。
IEEE Trans Cybern. 2013 Jun;43(3):1118-30. doi: 10.1109/TSMCB.2012.2224339.
3
Modeling a student-classroom interaction in a tutorial-like system using learning automata.在类似辅导的系统中使用学习自动机对学生-课堂互动进行建模。
IEEE Trans Syst Man Cybern B Cybern. 2010 Feb;40(1):29-42. doi: 10.1109/TSMCB.2009.2032414.
4
Solving multiconstraint assignment problems using learning automata.使用学习自动机解决多约束分配问题。
IEEE Trans Syst Man Cybern B Cybern. 2010 Feb;40(1):6-18. doi: 10.1109/TSMCB.2009.2032528.
5
Generalized pursuit learning schemes: new families of continuous and discretized learning automata.广义追踪学习方案:连续和离散学习自动机的新类别
IEEE Trans Syst Man Cybern B Cybern. 2002;32(6):738-49. doi: 10.1109/TSMCB.2002.1049608.
6
Continuous and discretized pursuit learning schemes: various algorithms and their comparison.连续和离散化追踪学习方案:各种算法及其比较
IEEE Trans Syst Man Cybern B Cybern. 2001;31(3):277-87. doi: 10.1109/3477.931507.
7
A new class of epsilon-optimal learning automata.一类新型的ε-最优学习自动机。
IEEE Trans Syst Man Cybern B Cybern. 2004 Feb;34(1):246-54. doi: 10.1109/tsmcb.2003.811117.