arrow
返回

Dynamic sparse coding for sparse time-series modeling via first-order smooth optimization

delete2018-04-30
delete3
PRE
AI
M
Minyoung Kim *
DOI:10.1007/s10489-018-1189-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Sparse coding, often called dictionary learning, has received significant attention in the fields of statistical machine learning and signal processing. However, most approaches assume iid data setup, which can be easily violated when the data retains certain statistical structures such as sequences where data samples are temporally correlated. In this paper we formulate a novel dynamic sparse coding problem, and propose an efficient algorithm that enforces smooth dynamics for the latent state vectors (codes) within a linear dynamic model while imposing sparseness of the state vectors. We overcome the added computational overhead originating from smooth dynamic constraints by adopting the recent first-order smooth optimization technique, adjusted for our problem instance. We demonstrate the improved prediction performance of our approach over the conventional sparse coding on several interesting real-world problems including financial asset return data forecasting and human motion estimation from silhouette videos.
Keyword:
Sparse coding and dictionary learning
Dynamical systems and motion estimation
Smooth optimization
Time-series forecasting
AI总结

AI总结

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

期刊

Applied Intelligence 封面图
Applied Intelligence
IF:
3.5
论文数:
7.6K
被引数:
1.7W

机构

暂无机构信息
引用论文

引用论文

Sparse coding based orientation estimation for latent fingerprints
err2017-07-01
err19
PREAI
errLiu, Shuxin; Liu, Manhua; Yang, Zongyuan
err分享
err收藏
Least angle regression
err2004-04-01
err7.5K
errOAAI
errEfron, B; Hastie, T; Johnstone, I; Tibshirani, R
err分享
err收藏
err分享
err收藏
学者 查看更多内容