r Sys.Date(){r setup, include=FALSE} knitr::opts_chunk$set(echo = TRUE)
library(tidyverse)
library(ggrepel)
new <- mpg %>%
group_by(class) %>%
filter(row_number(desc(hwy)) == 1)
ggplot(mpg, aes(x = displ, y = hwy)) +
geom_point(aes(colour = class)) +
geom_point(data = new, size = 3, shape = 1) +
geom_label_repel(data =new, aes(label = model))
第一小题
new_carat <- diamonds %>% filter(carat < 3)
ggplot(data = new_carat, aes(x = carat, y = price)) +
geom_boxplot(aes(group = cut_number(carat, 20)))
第二小题
ggplot(data = new_carat, aes(x = carat, y = price)) +
geom_boxplot(aes(group = cut_width(carat, 0.1)))
```{r eval=TRUE, warning=FALSE} # install.packages(“lattice”) library(lattice) # install.packages(“zoo”) library(zoo)
evaluate <- function(PARAM, minVal = NA, maxVal = NA, y = 2014, transform = FALSE, verbose = FALSE, negative = FALSE, transformOnly = FALSE, returnData = FALSE, accountParams = NULL){
# Step 1 # Convert and declare parameters if they exist on unbounded (-inf,inf) domain if( transform | transformOnly ){ PARAM <- minVal + (maxVal - minVal) * unlist(lapply( PARAM, function(v) (1 + exp(-v))^(-1) )) if( transformOnly ){
}
} return(PARAM)
} ## 修改
lowerBound <- c(n1 = 5, nFact = 3, nSharpe = 22, shThresh = 0.05) upperBound <- c(n1 = 80, nFact = 3, nSharpe = 22, shThresh = 0.95) stepSize <- c(n1 = 5, nFact = 1, nSharpe = 1, shThresh = 0.05)
pnames <- names(stepSize) np <- length(pnames)
POINTS <- list() for( p in pnames ){ POINTS[[p]] <- seq(lowerBound[[p]], upperBound[[p]], stepSize[[p]]) }
OPTIM <- data.frame(matrix(NA, nrow = prod(unlist(lapply(POINTS, length))), ncol = np + 1)) names(OPTIM)[1:np] <- names(POINTS) names(OPTIM)[np+1] <- “obj”
for( i in 1:np ){ each <- prod(unlist(lapply(POINTS, length))[-(1:i)]) times <- prod(unlist(lapply(POINTS, length))[-(i:length(pnames))]) OPTIM[,i] <- rep(POINTS[[pnames[i]]], each = each, times = times) }
timeLapse <- proc.time()[3] for( i in 1:nrow(OPTIM) ){ OPTIM[i,np+1] <- evaluate(OPTIM[i,1:np], transform = FALSE, y = 2014) cat(paste0(“##”, floor( 100 * i / nrow(OPTIM)), “% complete”)) cat(paste0(“##”, round( ((proc.time()[3] - timeLapse) * ((nrow(OPTIM) - i)/ i))/60, 2), ” minutes remaining“)) }
library(lattice) wireframe(obj ~ n1*shThresh, data = OPTIM, xlab = “n1”, ylab = “shThresh”, main = “Long-Only MACD Exhaustive Optimization”, drape = TRUE, colorkey = TRUE, screen = list(z = 15, x = -60) )
levelplot(obj ~ n1*shThresh, data = OPTIM, xlab = “n1”, ylab = “shThresh”, main = “Long-Only MACD Exhaustive Optimization” )
# four
```{r eval=TRUE, warning=FALSE}
#install.packages("lattice")
library(lattice)
K <- maxIter <- 200
# Vector theta_0
initDelta <- 6
deltaThresh <- 0.05
PARAM <- PARAMNaught <-
c(n1 = 0, nFact = 0, nSharpe = 0, shThresh = 0) - initDelta/2
# bounds
minVal <- c(n1 = 1, nFact = 1, nSharpe = 1, shThresh = 0.01)
maxVal <- c(n1 = 250, nFact = 10, nSharpe = 250, shThresh = .99)
# Optimization parameters
alpha <- 1
gamma <- 2
rho <- .5
sigma <- .5
randomInit <- FALSE
np <- 4 ## 修改
OPTIM <- data.frame(matrix(NA, ncol = np + 1, nrow = maxIter * (2 * np + 2)))
SIMPLEX <- data.frame(matrix(NA, ncol = np + 1, nrow = np + 1))
names(SIMPLEX) <- names(OPTIM) <- c(names(POINTS), "obj") #修改
# Print function for reporting progress in loop
printUpdate <- function(){
cat("Iteration: ", k, "of", K, "\n")
cat("\t\t", paste0(strtrim(names(OPTIM), 6), "\t"), "\n")
cat("Global Best:\t",
paste0(round(unlist(OPTIM[which.min(OPTIM$obj),]),3), "\t"), "\n")
cat("Simplex Best:\t",
paste0(round(unlist(SIMPLEX[which.min(SIMPLEX$obj),]),3), "\t"), "\n")
cat("Simplex Size:\t",
paste0(max(round(simplexSize,3)), "\t"), "\n\n\n")
}
o <- 1
# Initialize SIMPLEX
for( i in 1:(np+1) ) {
SIMPLEX[i,1:np] <- PARAMNaught + initDelta * as.numeric(1:np == (i-1))
SIMPLEX[i,np+1] <- evaluate(SIMPLEX[i,1:np], minVal, maxVal, negative = TRUE,
y = y)
OPTIM[o,] <- SIMPLEX[i,]
o <- o + 1
}
# Optimization loop
for( k in 1:K ){
SIMPLEX <- SIMPLEX[order(SIMPLEX[,np+1]),]
centroid <- colMeans(SIMPLEX[-(np+1),-(np+1)])
cat("Computing Reflection...\n")
reflection <- centroid + alpha * (centroid - SIMPLEX[np+1,-(np+1)])
reflectResult <- evaluate(reflection, minVal, maxVal, negative = TRUE, y = y)
OPTIM[o,] <- c(reflection, obj = reflectResult)
o <- o + 1
if( reflectResult > SIMPLEX[1,np+1] &
reflectResult < SIMPLEX[np, np+1] ){
SIMPLEX[np+1,] <- c(reflection, obj = reflectResult)
} else if( reflectResult < SIMPLEX[1,np+1] ) {
cat("Computing Expansion...\n")
expansion <- centroid + gamma * (reflection - centroid)
expansionResult <- evaluate(expansion,
minVal, maxVal, negative = TRUE, y = y)
OPTIM[o,] <- c(expansion, obj = expansionResult)
o <- o + 1
if( expansionResult < reflectResult ){
SIMPLEX[np+1,] <- c(expansion, obj = expansionResult)
} else {
SIMPLEX[np+1,] <- c(reflection, obj = reflectResult)
}
} else if( reflectResult > SIMPLEX[np, np+1] ) {
cat("Computing Contraction...\n")
contract <- centroid + rho * (SIMPLEX[np+1,-(np+1)] - centroid)
contractResult <- evaluate(contract, minVal, maxVal, negative = TRUE, y = y)
OPTIM[o,] <- c(contract, obj = contractResult)
o <- o + 1
if( contractResult < SIMPLEX[np+1, np+1] ){
SIMPLEX[np+1,] <- c(contract, obj = contractResult)
} else {
cat("Computing Shrink...\n")
for( i in 2:(np+1) ){
SIMPLEX[i,1:np] <- SIMPLEX[1,-(np+1)] +
sigma * (SIMPLEX[i,1:np] - SIMPLEX[1,-(np+1)])
SIMPLEX[i,np+1] <- c(obj = evaluate(SIMPLEX[i,1:np],
minVal, maxVal,
negative = TRUE, y = y))
}
OPTIM[o:(o+np-1),] <- SIMPLEX[2:(np+1),]
o <- o + np
}
}
centroid <- colMeans(SIMPLEX[-(np+1),-(np+1)])
simplexSize <- rowMeans(t(apply(SIMPLEX[,1:np], 1,
function(v) abs(v - centroid))))
if( max(simplexSize) < deltaThresh ){
cat("Size Threshold Breached: Restarting with Random Initiate\n\n")
for( i in 1:(np+1) ) {
SIMPLEX[i,1:np] <- (PARAMNaught * 0) +
runif(n = np, min = -initDelta, max = initDelta)
SIMPLEX[i,np+1] <- evaluate(SIMPLEX[i,1:np],
minVal, maxVal, negative = TRUE, y = y)
OPTIM[o,] <- SIMPLEX[i,]
o <- o + 1
SIMPLEX <- SIMPLEX[order(SIMPLEX[,np+1]),]
centroid <- colMeans(SIMPLEX[-(np+1),-(np+1)])
simplexSize <- rowMeans(t(apply(SIMPLEX[,1:np], 1, function(v) abs(v - centroid))))
}
}
printUpdate()
}
# Return the best optimization in untransformed parameters
evaluate(OPTIM[which.min(OPTIM$obj),1:np], minVal, maxVal, transformOnly = TRUE)