{"paper_id":"2407.06745","title":"Stochastic Approaches to Asset Price Analysis","authors":["Michael Sekatchev","Zhengxiang Zhou"],"paper_date":"2024-07-09","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2407.06745v1","page_url":"https://thequant.space/flowcharts/stochastic-approaches-to-asset-price-analysis/","scores":{"empirical_rigor":6,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes using a Kalman filter with an Ornstein‑Uhlenbeck process for asset price estimation, a recursive OU parameter estimation method, and a method‑of‑moments estimator for the Heston model.","quote":"In this project, we propose to explore the Kalman filter’s performance for estimating asset prices. ... we","summary":"In this project, we propose to explore the Kalman filter’s performance for estimating asset prices. We begin by introducing a stochastic mean-reverting processes, the Ornstein-Uhlenbeck (OU) model. After this we discuss the Kalman filter in detail, and its application with this model. After a…","strategy":"Kalman filter day‑trading algorithm with OU model"},"assumptions":{"status":"available","items":[{"assumption":"Asset returns follow an Ornstein‑Uhlenbeck process.","type":"model","stated":"explicit","quote":"filter will assume that the asset returns follow a Ornstein‑Uhlenbeck process, as is popular in the field."},{"assumption":"Process and observation noises are independent and identically distributed (i.i.d.).","type":"statistical","stated":"explicit","quote":"In our applications, we will be assuming that the noise at each step is independent and identically distributed (i.i.d.), so we will be setting Qk = σ2 p1 for all k."},{"assumption":"Observation noise is Gaussian.","type":"statistical","stated":"explicit","quote":"Suppose this true state Zk+1 is inaccessible, but it can be measured with some Gaussian noise, obtaining an observation ˜Zk+1..."},{"assumption":"All transaction costs are ignored in the trading simulation.","type":"execution","stated":"explicit","quote":"All transaction costs are neglected."},{"assumption":"Trading positions are opened at the market open price and closed at the market close price of the same day.","type":"execution","stated":"implied","quote":"Based on the difference between the Kalman filter prediction and the true open price, a long or a short position is created with 100 shares of the stock"},{"assumption":"The optimal OU parameters evolve over time and can be estimated recursively using a fixed look‑back window tb.","type":"model","stated":"explicit","quote":"For this reason, we propose a recursive parameter estimation method."}]},"datasets":{"status":"available","items":[{"name":"Apple daily stock price (11‑month sample)","provider":null,"kind":"market-prices","access":"public","period":"past eleven months","universe":"Apple Inc.","quote":"Figure 7: Apple’s daily stock price in the past eleven months with the Kalman filter overlaid."},{"name":"Apple stock price (3‑year sample)","provider":null,"kind":"market-prices","access":"public","period":"past 3 years","universe":"Apple Inc.","quote":"In this section, we aim to find the MOM estimators using (19) for Apple’s stock using a dataset that contains observations of price of the past 3 years."}],"known":[],"sample":{"start":null,"end":null,"market":"Apple stock","asset_class":"equities","frequency":"daily"},"data_resolution":"daily"},"transaction_costs":{"status":"available","modeled":"no","headline_net_of_costs":false,"detail":null,"quote":"All transaction costs are neglected.","source":"front_matter","rule":"R3","candidates":{"front_matter":"no","evidence_card":"no","evidence_card_quoted":true},"card_detail":null,"card_quote":"All transaction costs are neglected.","meaning":"a trading or execution result is reported without costs"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[{"finding":"The optimal Kalman‑OU parameters for the three‑year backtest are σo = 3.36 and tb = 140 days.","kind":"performance","quote":"The optimal pair of parameters from this plot is σo = 3.36, tb = 140 days."},{"finding":"Open‑price estimation using the recursive OU Kalman filter yields a very large sum of absolute errors (~38 453), about 50 per day.","kind":"negative","quote":"the sum of absolute error is huge, which reaches around 38453. This means that the average daily absolute error is about 50."},{"finding":"Close‑price estimation yields an even larger sum of absolute errors (~90 959), about 120 per day.","kind":"negative","quote":"the sum of absolute error is huge, which reaches around 90959. This means that the average daily absolute error is about 120."},{"finding":"The Kalman‑OU trading algorithm is compared against a buy‑and‑hold benchmark, with profits reported relative to the initial open price.","kind":"performance","quote":"The performance of the algorithm is compared to a buy and hold strategy, which involves simply buying 100 shares of the stock at Zo0 and selling them at time T."}],"reported_performance":{"strategy":"Kalman filter day‑trading algorithm with OU model","sharpe":null,"sharpe_benchmark":null,"annual_return_pct":12.18,"total_return_pct":null,"max_drawdown_pct":null},"out_of_sample":{"method":"holdout","headline_out_of_sample":true}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":16,"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":1,"extracted_at":"2026-11-14T18:06:35Z"},"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/"}