Online Learning for Time Series Prediction

Online Learning for Time Series Prediction

In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Anava, Oren, Hazan, Elad, Mannor, Shie, Shamir, Ohad
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Learning
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Anava, Oren
Hazan, Elad
Mannor, Shie
Shamir, Ohad
description In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that the noise terms are Gaussian, identically distributed or even independent. Furthermore, we show that our algorithm's performances asymptotically approaches the performance of the best ARMA model in hindsight.
doi_str_mv 10.48550/arxiv.1302.6927
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1302_6927</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1302_6927</sourcerecordid><originalsourceid>FETCH-LOGICAL-a657-6d1ae2861d7d2a3e8305eec716cc39d60b9f321295cd09e2c867c9085ea837fe3</originalsourceid><addsrcrecordid>eNotzjsLwjAUQOEsDlLdnSSz0JqHeY1SfEGhgt1LTG4loFGiiP57qTqd7fAhNKGkWGghyNymV3gWlBNWSMPUEM3qeA4RcAU2xRBPuLsm3IQL4AOkAHe8T-CDe4RrHKFBZ893GP-boWa9asptXtWbXbmsciuFyqWnFpiW1CvPLAfNiQBwikrnuPGSHE3HGWVGOE8MMKelcoZoAVZz1QHP0PS3_VrbWwoXm95tb257M_8A0cw65g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Online Learning for Time Series Prediction</title><source>arXiv.org</source><creator>Anava, Oren ; Hazan, Elad ; Mannor, Shie ; Shamir, Ohad</creator><creatorcontrib>Anava, Oren ; Hazan, Elad ; Mannor, Shie ; Shamir, Ohad</creatorcontrib><description>In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that the noise terms are Gaussian, identically distributed or even independent. Furthermore, we show that our algorithm's performances asymptotically approaches the performance of the best ARMA model in hindsight.</description><identifier>DOI: 10.48550/arxiv.1302.6927</identifier><language>eng</language><subject>Computer Science - Learning</subject><creationdate>2013-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1302.6927$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1302.6927$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Anava, Oren</creatorcontrib><creatorcontrib>Hazan, Elad</creatorcontrib><creatorcontrib>Mannor, Shie</creatorcontrib><creatorcontrib>Shamir, Ohad</creatorcontrib><title>Online Learning for Time Series Prediction</title><description>In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that the noise terms are Gaussian, identically distributed or even independent. Furthermore, we show that our algorithm's performances asymptotically approaches the performance of the best ARMA model in hindsight.</description><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsLwjAUQOEsDlLdnSSz0JqHeY1SfEGhgt1LTG4loFGiiP57qTqd7fAhNKGkWGghyNymV3gWlBNWSMPUEM3qeA4RcAU2xRBPuLsm3IQL4AOkAHe8T-CDe4RrHKFBZ893GP-boWa9asptXtWbXbmsciuFyqWnFpiW1CvPLAfNiQBwikrnuPGSHE3HGWVGOE8MMKelcoZoAVZz1QHP0PS3_VrbWwoXm95tb257M_8A0cw65g</recordid><startdate>20130227</startdate><enddate>20130227</enddate><creator>Anava, Oren</creator><creator>Hazan, Elad</creator><creator>Mannor, Shie</creator><creator>Shamir, Ohad</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130227</creationdate><title>Online Learning for Time Series Prediction</title><author>Anava, Oren ; Hazan, Elad ; Mannor, Shie ; Shamir, Ohad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a657-6d1ae2861d7d2a3e8305eec716cc39d60b9f321295cd09e2c867c9085ea837fe3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Anava, Oren</creatorcontrib><creatorcontrib>Hazan, Elad</creatorcontrib><creatorcontrib>Mannor, Shie</creatorcontrib><creatorcontrib>Shamir, Ohad</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Anava, Oren</au><au>Hazan, Elad</au><au>Mannor, Shie</au><au>Shamir, Ohad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Learning for Time Series Prediction</atitle><date>2013-02-27</date><risdate>2013</risdate><abstract>In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that the noise terms are Gaussian, identically distributed or even independent. Furthermore, we show that our algorithm's performances asymptotically approaches the performance of the best ARMA model in hindsight.</abstract><doi>10.48550/arxiv.1302.6927</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1302.6927
ispartof
issn
language eng
recordid cdi_arxiv_primary_1302_6927
source arXiv.org
subjects Computer Science - Learning
title Online Learning for Time Series Prediction
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T04%3A23%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20Learning%20for%20Time%20Series%20Prediction&rft.au=Anava,%20Oren&rft.date=2013-02-27&rft_id=info:doi/10.48550/arxiv.1302.6927&rft_dat=%3Carxiv_GOX%3E1302_6927%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true