Wang, Youssef, & Elhakeem (2006) On some feature selection strategies for spam filter design
A short paper on comparing different algorithms to do feature selection in spam
filtering problems.
[more]
Lin, Tegmark, & Rolnick (2017) Why does deep and cheap learning work so well?
The paper points out in sec 1 that, in contrast to the good old-fashioned AI
(GOFAI) algorithms, artificial neural networks are understood only at a
heuristic level. The authors try to provide analytic insights on why deep
learning and general ANN works.
[more]
Das & Stein (2011) Differences in Tranching Methods
There are two methods the rating agencies used to evaluate credit worthiness.
S&P and Moody’s in particular, uses the probability of default (PD) and the
expected loss (EL) respectively. This paper compares these two methods in the
context of CDO.
[more]
Koutras (1996) On a waiting time distribution in a sequence of Bernoulli trials
Consider a Bernoulli trial with success probability \(p = 1-q\), this paper is interested
in the problem of the number of trials needed to see the \(r\)-th occurrence of
seeing 2 successes within a window of no more than \(k\) trials. Windows are
non-overlapping.
[more]
Using pgfplotstable in LaTeX
pgfplotstable allows you to typeset a table in LaTeX without really typing out
the table. The following is a simple example, that converts a CSV into a table:
[more]