Long Memory in Foreign-Exchange Rates
汇率的长记忆AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究汇率序列的长记忆、分数整合模型及预测评估,支持时间序列与预测分类,未涉及收益预测。
汇率的长记忆AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Using the Geweke-Porter-Hudak test, the author finds evidence of long memory in exchange-rate data. This implies t hat the empirical evidence of unit roots in exchange rates may not be robust to long-memory alternatives. Fractionally integrated autoregressive moving average models are estimated by both the time-domain exact maximum likelihood method and the frequency-domain approximate maximum likelihood method. Impulse-response functions and forecasts based.on these estimated fractionally integrated autoregressive moving average models are evaluated to gain insight into the long-memory characteristics of exchange rates. Some tentative explanations of the long memory found in the exchange rate s are discussed.
预测回归中基于限制似然的偏差缩减与近乎精确尺寸检验
Difficulties with inference in predictive regressions are generally attributed to strong persistence in the predictor series. We show that the major source of the problem is actually the nuisance intercept parameter, and we propose basing inference on the restricted likelihood, which is free of such nuisance location parameters and also possesses small curvature, making it suitable for inference. The bias of the restricted maximum likelihood (REML) estimates is shown to be…
多元时间序列分析基础
This study is devoted to the analysis of multivariate time series data. Such data might arise in business and economics, engineering, geophysical sciences, agriculture, and many other fields. The emphasis is on providing an account of the basic concepts and methods which are useful in analyzing such data. The book presupposes a familiarity with univariate time series as might be gained from one term of a graduate course, but it is otherwise self-contained. It covers the…
利用指数平滑预测具有复杂季节模式的时间序列
An innovations state space modeling framework is introduced for forecasting complex seasonal time series such as those with multiple seasonal periods, high-frequency seasonality, non-integer seasonality, and dual-calendar effects. The new framework incorporates Box–Cox transformations, Fourier representations with time varying coefficients, and ARMA error correction. Likelihood evaluation and analytical expressions for point forecasts and interval predictions under the…
电价的状态转换长记忆模型
In this paper we develop a regime switching model which can generate long memory (fractional integration) in each of the regime states. This property is relevant in a number of cases. For instance, the deregulated market for electricity power in the Nordic countries is characterized by electricity spot prices with a high degree of long memory. It occurs that in some time periods bilateral prices are identical whereas in other periods the prices differ. The latter occurs when…
基于分位数的 Kumaraswamy–Teissier 自回归移动平均模型
This paper introduces a quantile-based Kumaraswamy-Teissier autoregressive moving average (KTARMA) model for positive-valued time series. Leveraging the flexibility of the extended Kumaraswamy-Teissier distribution within an observation-driven framework, the random component of the distribution is conditioned on the historical process and time-varying covariates, and is parameterized explicitly via its $ρ$-th conditional quantile, where $ρ\in (0,1)$. To capture temporal…
可扩展的 VARMA 模型估计
Vector autoregressive moving-average (VARMA) models have long been considered impractical beyond moderate dimensions: the likelihood is non-convex, the parametrization is identified only up to equivalence, and every evaluation costs a pass over the entire series. Yet their moving-average term captures with a few parameters what a pure autoregression matches only with many lags. We introduce an estimation framework that removes this computational barrier: each optimization…