-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtestonerun.R
More file actions
317 lines (254 loc) · 9.38 KB
/
Copy pathtestonerun.R
File metadata and controls
317 lines (254 loc) · 9.38 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
source("config.R")
source("R/simulation.R")
source("R/estimation.R")
source("R/recovery.R")
source("R/utils.R")
library(np)
library(ggplot2)
library(reshape2)
#先生成指数,再产生sigma
prepare_simulation_data <- function(K, n_ave = NULL, n_vec = NULL, m, k = 2, l = 2,
seed_sigma = 311, seed_mu = 311, seed_X = 69, scale_sigma = 5) {
if (is.null(n_vec)) {
if (is.null(n_ave)) stop("You must provide either n_vec or n_ave.")
n_vec <- rep(n_ave, K)
} else {
if (length(n_vec) != K) stop("Length of n_vec must be equal to K.")
}
delta <- T / m
ts <- seq(delta, T, length.out = m)
set.seed(seed_sigma)
V_true <- generate_K_trajectory(K, a, delta, alpha, k, m)
V_scaled <- V_true # 保留未缩放版本以供恢复 σ²
sigma2 <- exp(V_scaled)
sigma <- sqrt(sigma2) / scale_sigma # 控制扩散强度
sigma2 <- sigma^2
set.seed(seed_mu)
mu <- generate_K_trajectory(K, b, delta, beta, l, m)
set.seed(seed_X)
X <- generate_n_X(n_vec, sigma, mu, X0)
X_Delta <- variation(log(X), m)
list(
ts = ts,
delta = delta,
n_vec = n_vec,
V_true = V_scaled,
sigma2_true = sigma2[-1, ],
mu_true = mu[-1, ],
X_Delta = X_Delta
)
}
#直接生成sigma,此部分仅用于测试对μ的估计
prepare_simulation_data2 <- function(K, n_ave, m, k = 2, l = 2,
seed_sigma = 311, seed_mu = 311, seed_X = 69) {
delta <- T / m
ts <- seq(delta, T, length.out = m)
n_vec <- rep(n_ave, K)
set.seed(seed_sigma)
V_true <- generate_K_trajectory(K, a, delta, alpha, k, m)#此处仅仅保持接口统一,未使用
sigma2 <- exp(V_true)
sigma <- generate_K_trajectory(K, a, delta, alpha, k, m)
sigma <- sigma / max(sigma) # 归一化防止数值不稳定
set.seed(seed_mu)
mu <- generate_K_trajectory(K, b, delta, beta, l, m)
set.seed(seed_X)
X <- generate_n_X(n_vec, sigma, mu, X0)
X_Delta <- variation(log(X), m)
list(
ts = ts,
delta = delta,
n_vec = n_vec,
V_true = V_true,
sigma2_true = sigma2[-1, ],
mu_true = mu[-1, ],
X_Delta = X_Delta
)
}
#先生成指数,再对μ估计,结果不好
test_mu_estimation <- function(K = 300, n_ave = 500, n_vec = NULL, m = 50, L = 2) {
sim_data <- prepare_simulation_data(K = K, n_ave = n_ave, n_vec = n_vec, m = m, l = 2)
ts <- sim_data$ts
X_Delta <- sim_data$X_Delta
if (max(sim_data$n_vec) == 1) {
Z_Delta <- X_Delta
} else {
Z_Delta <- cluster_mean(X_Delta, K, sim_data$n_vec) / sqrt(sim_data$delta)
}
# Step 1: estimate m_mu
m_mu_hat <- estimate_m_mu(Z_Delta, ts)
# Step 2: estimate G_mu
G_mu_hat <- estimate_G_mu(Z_Delta, m_mu_hat, m, K, h_min = h_min)
PCs_hat <- Re(eigen(G_mu_hat)$vectors) * sqrt(m)
lams_hat <- Re(eigen(G_mu_hat)$values) / m
# Step 3: select L
if (is.null(L)) {
L <- select_L_by_AIC(Z_Delta, m_mu_hat, PCs_hat, max_L = 10)
cat(sprintf("Selected L = %d\n", L))
}
# Step 4: recover mu_k(t)
mu_hat <- recover_mu(Z_Delta, m_mu_hat, PCs_hat, L, K)
# Step 5: compute errors
mu_true <- sim_data$mu_true
m_mu_true <- rowMeans(mu_true)
G_mu_true <- (mu_true - m_mu_true) %*% t(mu_true - m_mu_true) / K
PCs_true <- Re(eigen(G_mu_true)$vectors) * sqrt(m)
lams_true <- Re(eigen(G_mu_true)$values) / m
err_m <- max(abs(m_mu_hat - m_mu_true))
err_G <- max(abs(G_mu_hat - G_mu_true))
err_lams <- max(abs(lams_hat[1:length(lams_true)] - lams_true))
err_PCs <- max(sapply(1:L, function(i) {
true <- PCs_true[, i] * sign(PCs_true[1, i])
est <- PCs_hat[, i] * sign(PCs_hat[1, i])
max(abs(true - est))
}))
err_mu <- max(abs(mu_hat[, 1] - mu_true[, 1])) / (max(mu_true[, 1]) - min(mu_true[, 1]))
cat(sprintf("err_m_mu = %0.6f\n", err_m))
cat(sprintf("err_G_mu = %0.6f\n", err_G))
cat(sprintf("err_lams = %0.6f\n", err_lams))
cat(sprintf("err_PCs = %0.6f\n", err_PCs))
cat(sprintf("err_mu_k = %0.6f\n", err_mu))
# Step 6: plot comparison for 1st process
plot_compare_single(ts, mu_true, mu_hat, k = 1, label = "mu_k(t)")
# Return for comparison if needed
invisible(list(
mu_true = mu_true,
mu_hat = mu_hat,
err_m = err_m,
err_G = err_G,
err_lams= err_lams,
err_PCs = err_PCs,
err_mu = err_mu
))
}
#直接生成sigma,估计μ,结果较好
test_mu_estimation2 <- function(K = 300, n_ave = 500, m = 50, L = 2) {
sim_data <- prepare_simulation_data2(K, n_ave, m, l = 2)
ts <- sim_data$ts
X_Delta <- sim_data$X_Delta
if (max(sim_data$n_vec) == 1) {
Z_Delta <- X_Delta
} else {
Z_Delta <- cluster_mean(X_Delta, K, sim_data$n_vec) / sqrt(sim_data$delta)
}
# Step 1: estimate m_mu
m_mu_hat <- estimate_m_mu(Z_Delta, ts)
# Step 2: estimate G_mu
G_mu_hat <- estimate_G_mu(Z_Delta, m_mu_hat, m, K, h_min = h_min)
PCs_hat <- Re(eigen(G_mu_hat)$vectors) * sqrt(m)
lams_hat <- Re(eigen(G_mu_hat)$values) / m
# Step 3: select L
if (is.null(L)) {
L <- select_L_by_AIC(Z_Delta, m_mu_hat, PCs_hat, max_L = 10)
cat(sprintf("Selected L = %d\n", L))
}
# Step 4: recover mu_k(t)
mu_hat <- recover_mu(Z_Delta, m_mu_hat, PCs_hat, L, K)
# Step 5: compute errors
mu_true <- sim_data$mu_true
m_mu_true <- rowMeans(mu_true)
G_mu_true <- (mu_true - m_mu_true) %*% t(mu_true - m_mu_true) / K
PCs_true <- Re(eigen(G_mu_true)$vectors) * sqrt(m)
lams_true <- Re(eigen(G_mu_true)$values) / m
err_m <- max(abs(m_mu_hat - m_mu_true))
err_G <- max(abs(G_mu_hat - G_mu_true))
err_lams <- max(abs(lams_hat[1:length(lams_true)] - lams_true))
err_PCs <- max(sapply(1:L, function(i) {
true <- PCs_true[, i] * sign(PCs_true[1, i])
est <- PCs_hat[, i] * sign(PCs_hat[1, i])
max(abs(true - est))
}))
err_mu <- max(abs(mu_hat[, 1] - mu_true[, 1])) / (max(mu_true[, 1]) - min(mu_true[, 1]))
cat(sprintf("err_m_mu = %0.6f\n", err_m))
cat(sprintf("err_G_mu = %0.6f\n", err_G))
cat(sprintf("err_lams = %0.6f\n", err_lams))
cat(sprintf("err_PCs = %0.6f\n", err_PCs))
cat(sprintf("err_mu_k = %0.6f\n", err_mu))
# Step 6: plot comparison for 1st process
plot_compare_single(ts, mu_true, mu_hat, k = 1, label = "mu_k(t)")
# Return for comparison if needed
invisible(list(
mu_true = mu_true,
mu_hat = mu_hat,
err_m = err_m,
err_G = err_G,
err_lams= err_lams,
err_PCs = err_PCs,
err_mu = err_mu
))
}
#生成指数再估计sigma,结果较好
test_sigma_inference <- function(K = 100, n_ave = 300, m = 50, L = NULL) {
sim_data <- prepare_simulation_data(K, n_ave = n_ave, m = m, l = 2)
q_vec <- compute_qk_mc(sim_data$n_vec)
Y_Delta <- construct_Y(sim_data$X_Delta, sim_data$n_vec, q_vec)
m_V_hat <- estimate_m_mu(Y_Delta, sim_data$ts)
G_V_hat <- estimate_G_mu(Y_Delta, m_V_hat, m, K, h_min = h_min)
PCs_hat <- Re(eigen(G_V_hat)$vectors) * sqrt(m)
lams_hat <- Re(eigen(G_V_hat)$values) / m
if (is.null(L)) {
L <- select_L_by_AIC(Y_Delta, m_V_hat, PCs_hat, max_L = 10)
cat(sprintf("Selected L = %d\n", L))
}
V_hat <- recover_mu(Y_Delta, m_V_hat, PCs_hat, L, K)
sigma2_hat <- exp(V_hat)
plot_compare_single(sim_data$ts, sim_data$V_true[-1, ], V_hat, k = 1, label = "V_k(t)")
plot_compare_single(sim_data$ts, sim_data$sigma2_true, sigma2_hat, k = 1, label = "sigma²_k(t)")
}
#对比直接smoothing
test_mu_traditional_vs_truth <- function(K = 100, n_ave = 500, m = 50,
k_basis = 2, l_basis = 2, scale_sigma = 5,
seed_sigma = 311, seed_mu = 311, seed_X = 69,
show_plot_k = c(1), bw_method = "cv.aic") {
# Step 1: 生成仿真数据
sim_data <- prepare_simulation_data(
K = K, n_ave = n_ave, m = m,
k = k_basis, l = l_basis,
scale_sigma = scale_sigma,
seed_sigma = seed_sigma,
seed_mu = seed_mu,
seed_X = seed_X
)
X_Delta <- sim_data$X_Delta
ts <- sim_data$ts
delta <- sim_data$delta
n_vec <- sim_data$n_vec
mu_true <- sim_data$mu_true # m × K
# Step 2: 估计每个 μ_k(t) 传统方法
mu_hat_mat <- matrix(NA, m, K)
col_start <- 1
if (max(sim_data$n_vec) == 1) {
Z_Delta <- X_Delta
} else {
Z_Delta <- cluster_mean(X_Delta, K, sim_data$n_vec) / sqrt(sim_data$delta)
}
for (k in 1:K) {
y_k <- Z_Delta[, k] # 抽取第k个过程的聚合增量
df <- data.frame(t = ts, y = y_k)
fit <- npreg(y ~ t, data = df, regtype = "ll", bwmethod = bw_method)
mu_hat_mat[, k] <- predict(fit, newdata = data.frame(t = ts))
}
# Step 3: 误差评估
mse_vec <- colMeans((mu_hat_mat - mu_true)^2)
rmse_vec <- sqrt(mse_vec)
avg_rmse <- mean(rmse_vec)
max_rmse <- max(rmse_vec)
cat(sprintf("=== Traditional Method RMSE Results ===\n"))
cat(sprintf("Average RMSE across K: %.6f\n", avg_rmse))
cat(sprintf("Maximum RMSE among K: %.6f\n", max_rmse))
# Step 4: 可视化若干条曲线对比
par(mfrow = c(length(show_plot_k), 1), mar = c(4, 4, 2, 1))
for (k in show_plot_k) {
plot(ts, mu_true[, k], type = "l", lwd = 2, col = "black",
ylab = expression(mu[k](t)), xlab = "t",
main = paste0("Process k = ", k, ": True vs Traditional"))
lines(ts, mu_hat_mat[, k], col = "red", lwd = 2, lty = 2)
legend("topright", legend = c("True", "Traditional"), col = c("black", "red"), lty = c(1, 2), lwd = 2)
}
invisible(list(
ts = ts,
mu_true = mu_true,
mu_hat = mu_hat_mat,
rmse = rmse_vec,
avg_rmse = avg_rmse
))
}