arrow
返回

Unsupervised learning with stochastic gradient

delete2005-10-01
delete9
delete
OA
AI
H
Harold Szu
I
Ivica Kopriva *
DOI:10.1016/j.neucom.2004.11.010delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
A stochastic gradient is formulated based on deterministic gradient augmented with Cauchy simulated annealing capable to reach a global minimum with a convergence speed significantly faster when simulated annealing is used alone. In order to solve space-time variant inverse problems known as blind source separation, a novel Helmholtz free energy contrast function, H = E - T(0)S, with imposed thermodynamics constraint at a constant temperature T(0) was introduced generalizing the Shannon maximum entropy S of the closed systems to the open systems having non-zero input-output energy exchange E. Here, only the input data vector was known while source vector and mixing matrix were unknown. A stochastic gradient was successfully applied to solve inverse space-variant imaging problems on a concurrent pixel-by-pixel basis with the unknown mixing matrix (imaging point spread function) varying from pixel to pixel. Published by Elsevier B.V.
Keyword:
stochastic optimization
Cauchy annealing
blind source separation
Helmholtz free energy
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容