-
Notifications
You must be signed in to change notification settings - Fork 0
/
final_master.Rmd
293 lines (247 loc) · 9.32 KB
/
final_master.Rmd
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
---
title: "Final Project"
author: "Evan Ott"
date: "December 5, 2016"
output:
pdf_document: default
html_notebook: default
---
```{r setup, include=FALSE}
knitr::opts_chunk$set(echo = TRUE)
```
#Stochastic Gradient Descent (Logistic Regression)
Let's load in the data and Dr. Scott's algorithm:
```{r readdata}
library(ggplot2)
library(latex2exp)
library(Matrix)
library(Rcpp)
library(RcppEigen)
library(reshape2)
Rcpp::sourceCpp("scott_sgdlogit.cpp")
raw_data = read.csv("master.csv", header = TRUE)
# Read specific columns from the data
kegg = as.character(raw_data[ , 1])
gene = as.character(raw_data[ , 2])
data = raw_data[ , 3:ncol(raw_data)]
N = ncol(data)
P = nrow(data)
M = rep(1, N) # Used in logistic regression
# For C++ code, it's easiest to use a sparse matrix
# TODO: might want to consider scaling the counts, either in the way DESeq2 does
# it or something similar.
X = Matrix(as.matrix(unname(data)), sparse = TRUE)
# X[i, j] == data[i, j] is non-negative, so this trims out the genes with no counts
X_nozero = X[which(rowSums(data) > 0), ]
P = nrow(X_nozero)
# Convert the column names to 0 = control, 1 = treatment
Ynames = names(data)
Y = stringi::stri_endswith(Ynames, fixed = "T") * 1
```
Now, let's create a transformed version of X where the values are on the log scale.
```{r x-log-scale}
# Copy it as to not damage the original
X_nozero_log = X_nozero
# Oooh I figured out a sweet hack. So the dgCMatrix class could be used in the
# following way:
# X@i are the row indices - 1 (that have ncol sections in non-decreasing order)
# X@p are the indices - 1 in X@i where we switch to a new column
#
# OR
# X@x is the (non-zero) data itself, so why not just edit that? =D
# Here, add a small value because log(1) == 0, and we want to maintain a value there.
# #oneliner
X_nozero_log@x = log2(X_nozero_log@x + 0.1)
```
Now, let's try to use cross-validation (on the limited number of samples we have)
to determine a good range for $\lambda$, the LASSO penalty factor in the stochastic gradient decent logistic regression code.
```{r sgd-cv}
# Initial guess for the betas.
beta_init = rep(0, P)
# For the weighting in the skip scenario for a feature
# TODO: algorithm is very sensitive to this value
eta = 0.0002
# passes through the data
nIter = 100
# exponentially-weighted moving average factor
# TODO: could explore other values.
discount = 0.01
# X_cv = X_nozero
X_cv = X_nozero_log
folds = 3
col_breaks = cut(1:length(Y), folds, labels = FALSE)
abs_errors = c()
zero_one_errors = c()
lambdas = 10 ^ seq(-1, 4, 0.1)
for (lambda in lambdas) {
absFoldErrors = c()
zeroOneFoldErrors = c()
for (fold in 1:folds) {
test_ind = which(col_breaks == fold)
train_ind = which(col_breaks != fold)
X_nozero_train = X_cv[ , train_ind]
Y_train = Y[train_ind]
X_nozero_test = X_cv[ , test_ind]
Y_test = Y[test_ind]
train_result = sparsesgd_logit(X_nozero_train, Y_train, M[train_ind], eta, nIter, beta_init, lambda, discount)
intercept = train_result$alpha
beta = train_result$beta
prediction_test = 1/(1 + exp(-(intercept + t(X_nozero_test) %*% beta)))
# metrics to choose from
zero_one_error_test = sum(Y_test != round(prediction_test))
abs_error_test = sum(abs(Y_test - prediction_test))
absFoldErrors = c(absFoldErrors, abs_error_test)
zeroOneFoldErrors = c(zeroOneFoldErrors, zero_one_error_test)
}
abs_errors = c(abs_errors, mean(absFoldErrors))
zero_one_errors = c(zero_one_errors, mean(zeroOneFoldErrors))
}
```
```{r sgd-cv-plot, echo=FALSE}
gg_color_hue <- function(n) {
hues = seq(15, 375, length = n + 1)
hcl(h = hues, l = 65, c = 100)[1:n]
}
plotdata = data.frame(lambdas, abs_errors, zero_one_errors)
plotdata = melt(plotdata, id.vars = "lambdas")
ggplot(plotdata) + geom_point(aes(lambdas, value, group = variable, col = variable)) +
geom_line(aes(lambdas, value, group = variable, col = variable)) +
scale_x_log10() + ylab("error") + ggtitle(paste0(folds, "-fold cross-validation out-of-sample errors")) +
xlab(TeX("$\\lambda$")) + guides(color = guide_legend(title = "")) +
scale_color_manual(labels = c("absolute errors", "0-1 errors"), values = gg_color_hue(2))
```
So based on 3-fold cross-validation, the absolute error $\sum_i \left|y_i - \hat{y}_i\right|$ seems to reach its best
(minimal) value when $\lambda=10^{-0.2}$ while the 0-1 error $\sum_i \delta\left(y_i,~ \textrm{round}(\hat{y}_i)\right)$
(number of incorrect predictions) exhibits the same behavior around $\lambda=10^{0.5}$.
Let's take the latter, since the absolute error shouldn't be different.
```{r sgd}
# Initial guess for the betas.
beta_init = rep(0, P)
# For the weighting in the skip scenario for a feature
# TODO: algorithm is very sensitive to this value
eta = 0.0002
# passes through the data
nIter = 100
# L1 regularization
lambda = 10^0.5
# exponentially-weighted moving average factor
# TODO: could explore other values.
discount = 0.01
# Run the algorithm
result = sparsesgd_logit(X_nozero_log, Y, M, eta, nIter, beta_init, lambda, discount)
intercept = result$alpha
beta = result$beta
prediction = 1/(1 + exp(-(intercept + t(X_nozero_log) %*% beta)))
plot(prediction[ , 1] ~ Y)
```
So, these predictions are, to use a technical term, "totally garbage."
Every single prediction is just slightly below $\frac{1}{2}$ so the algorithm
is effectively saying, "I dunno, but maybe this data is control not treatment"
so while the results below are potentially a starting point, it'd be rather foolish
to grant them much authority.
```{r sgd-outputs, echo=FALSE, collapse=TRUE}
cat(paste("How many genes are in the final model? ", sum(result$beta != 0), "\n"))
cat(paste("Which genes?", paste(gene[which(result$beta != 0)], collapse = "\n"), sep = "\n"))
plot(result$nll_tracker)
```
#DESeq2
Now, let's use a pre-fabricated solution instead.
```{r deseq2-run, message=FALSE, warning=FALSE}
library(DESeq2)
#library(BiocParallel)
# Allow for parallelization of DESeq2 code.
#register(MulticoreParam(4))
get_results = function(d) {
nms = rownames(d)
log2change = d[ , 2]
padj = d[ , 6]
idx = order(nms)
return(data.frame(names = nms[idx], log2change = log2change[idx], padj = padj[idx]))
}
# Get the counts
count_data_raw = raw_data[ , 3:ncol(raw_data)]
########################################
# Format the data in the way DESeq2 expects
########################################
new_colnames = rep(NULL, N)
condition = rep(NULL, N)
control = 0
treatment = 0
for (i in 1:N) {
base = c("control", "treatment")[Y[i] + 1]
val = 0
if (base == "control") {
control = control + 1
val = control
} else {
treatment = treatment + 1
val = treatment
}
new_colnames[i] = paste0(base, val)
condition[i] = base
}
count_data = count_data_raw
colnames(count_data) = new_colnames
rownames(count_data) = gene
col_data = data.frame(condition)
rownames(col_data) = new_colnames
# remove the unobserved genes from the get-go
count_data = count_data[which(rowSums(data) > 0), ]
# Run DESeq2
dds = DESeqDataSetFromMatrix(countData = count_data,
colData = col_data,
design = ~ condition)
dds = DESeq(dds)#, parallel = TRUE)
res = results(dds)#, parallel = TRUE)
# plot(sort(res$pvalue))
# points(sort(res$padj), col = "red")
# P - sum(is.na(res$pvalue))
# P - sum(is.na(res$padj))
```
```{r default-deseq2, echo=FALSE}
cat(paste("How many genes are in the final model? ", length(which(res$padj < 0.1)), "\n"))
print("Which genes in default DESeq2?")
get_results(res[which(res$padj < 0.1), ])
```
```{r deseq2-process, message = FALSE}
# Not exactly sure what this plot does either.
# plotMA(res, main="DESeq2", ylim=c(-3,3))
# Benjamini-Hochberg by hand (DESeq2 does something similar...)
alpha = 0.1
sorted_pval = sort(res$pvalue, na.last = TRUE)
numNA = sum(is.na(res$pvalue))
bh = sapply(1:P, function(i){ sorted_pval[i] <= alpha * i / (P - numNA)})
threshold = sorted_pval[max(which(bh))]
```
```{r deseq2-bh, echo=TRUE}
cat(paste("How many genes in customized Benjamini-Hochberg procedure",
length(which(res$pvalue < threshold)), "\n", sep = "\n")) # 1 gene here
print("Which genes in customized Benjamini-Hochberg procedure")
get_results(res[which(res$pvalue < threshold), ])
```
```{r deseq2-checking}
# These two are equal -- throws out genes that were never observed section 1.5.3 of DESeq2 paper
print(paste(sum(rowSums(count_data) == 0),
sum(is.na(res$pvalue))))
# 118687 genes are thrown out by the "independent filtering" for having a low
# mean normalized count
sum(is.na(res$padj)) - sum(is.na(res$pvalue))
# Not entirely sure what this plot means.
# plot(metadata(res)$filterNumRej,
# type = "b", ylab = "number of rejections",
# xlab = "quantiles of filter")
# lines(metadata(res)$lo.fit, col = "red")
# abline(v = metadata(res)$filterTheta)
#nofilter
# If you turn off the filtering, only two of the adjusted p-values are less than 0.1
# where the adjustment basically just accounts for Benjamini-Hochberg, I think
resNoFilt <- results(dds, independentFiltering = FALSE)
addmargins(table(filtering = (res$padj < .1),
noFiltering = (resNoFilt$padj < .1)))
```
```{r deseq2-custom-bh, echo=FALSE}
cat(paste("How many genes without independent filtering",
length(which(resNoFilt$padj < 0.1)), "\n", sep="\n")) # 2 genes here
print("How many genes without independent filtering")
get_results(resNoFilt[which(resNoFilt$padj < 0.1),])
```