{"paper_id":"2404.08136","title":"Exponentially Weighted Moving Models","authors":["Eric Luxenberg","Stephen Boyd"],"paper_date":"2024-04-11","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2404.08136v2","page_url":"https://thequant.space/flowcharts/exponentially-weighted-moving-models/","scores":{"empirical_rigor":3.5,"math_complexity":7.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes an approximate recursive method for EWMM that stores only a fixed-size window of past samples and solves a constant-size convex optimization problem.","quote":"We propose a general method for computing an approximation of EWMM, which requires storing only a window of a fixed number of past samples, and uses an additional quadratic term to approximate the loss associated with the data before the window. This approximate EWMM relies on convex optimization, and solves problems that do not grow with time.","summary":"An exponentially weighted moving model (EWMM) for a vector time series fits a new data model each time period, based on an exponentially fading loss function on past observed data. The well known and widely used exponentially weighted moving average (EWMA) is a special case that estimates the mean…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The loss function ℓ(x;θ) is convex in θ and the parameter set Θ is convex.","type":"model","stated":"explicit","quote":"We consider a model of the data x ∈Rn that is parametrized by θ ∈Θ ⊆Rm, and specified by the loss function ℓ: Rn × Θ →R, which we assume is convex in θ. (In particular, we assume Θ is a convex set.)","support":"full"},{"assumption":"There exists at least one minimizer for the EWMM optimization problem.","type":"model","stated":"explicit","quote":"We will assume that there is at least one minimizer in the argmin above; if there are multiple minimizers, we can simply choose one.","support":"full"},{"assumption":"The user wishes to use an EWMM and the paper does not address whether EWMM is appropriate for a given application.","type":"other","stated":"explicit","quote":"We simply assume that a user wishes to use an EWMM, and give a practical method to carry out the evaluation with memory and computation that do not grow with time.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"10 Industry Portfolio dataset","provider":"Kenneth French’s data library","kind":"market-prices","access":"public","period":"2020-01-02 to 2024-01-31","universe":"10 value-weighted industry portfolios","quote":"We use the 10 Industry Portfolio dataset from Kenneth French’s data library [Fre24]. The dataset contains daily returns for 10 value-weighted industry portfolios.","support":"partial","known_id":"french-library"}],"known":[{"id":"french-library","name":"Kenneth French Data Library","provider":"Kenneth R. French","kind":"market-prices","access":"public","quote":"We use the 10 Industry Portfolio dataset from Kenneth French’s data library [Fre24].","mentions":1,"used_in":1}],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The approximate finite‑memory EWMM produces estimates that are close to those of the exact EWMM.","kind":"theoretical","quote":"We demonstrate our approximate recursive method with examples, showing that it finds models that are close to the exact EWMM models, fit using all past data. We see that the approximate finite memory EWMM is able to closely match the performance from the exact EWMM.","support":"full"},{"finding":"The recursive formulation yields linear growth in computation time, whereas the naïve method grows quadratically.","kind":"performance","quote":"As expected the na¨ıve method, which saves all past data and directly computes the estimate using all past value, grows quadratically in time, whereas the recursive method grows linearly.","support":"full"},{"finding":"The sparse inverse covariance estimates vary considerably over time, reflecting changing market conditions.","kind":"statistical","quote":"These plots show that the sparse inverse covariance estimate varies considerably with time, i.e., market conditions.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:58:05Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}