## R and R^2, the relationship between correlation and the coefficient of determination.

Posted on June 25, 2017

There are 2 closely related quantities in statistics - correlation (often referred to as ) and the coefficient of determination (often referred to as ). Today we’ll explore the nature of the relationship between and , go over some common use cases for each statistic and address some misconceptions. Correlation...

[Read More]
Tags:
Correlation, R, R2, R^2, Coefficient of Determination, Regression, Performance

## Understanding Neural Networks with Layerwise Relevance Propagation and Deep Taylor Series

Posted on April 16, 2017

Deep neural networks are some of the most powerful learning algorithms that have ever been developed. Unfortunately, they are also some of the most complex. The hierarchical non-linear transformations that neural networks apply to data can be nearly impossible to understand. This problem is exacerbated by the non-determinism of neural...

[Read More]
Tags:
Tensorflow, Layerwise, Relevance, Propagation, Deep, Taylor, Series, Visualization

## Exploring Assumptions with Monty Hall and Blue Eyed Islanders

Posted on February 12, 2017

Let’s talk about making assumptions. Each time you form an opinion on something, you don’t re-examine each of the beliefs that contributed to that opinion. For example, when you order food at a restaurant, you pick the foods that you think will taste good. You don’t spend hours questioning the...

[Read More]
Tags:
Math, Probability, Paradox, Monty Hall, Blue Eyed Islanders

## An Introduction to Algebraic Groups for CS People

Posted on January 2, 2017

One of my favorite classes in college was Abstract Algebra. It was my first non-CS non-elementary math class, and I took it because I knew I didn’t want to graduate without having broadened my mathematical horizons beyond CS. As it turned out, Abstract Algebra felt pretty familiar. Many of the...

[Read More]
Tags:
Abstract, Algebra, CS, Theory, Group, Programming

## Computation Theory Part 2 - Complexity Classes and NP Completeness

Posted on November 19, 2016

Welcome to part 2 of the Computation Theory series! In the last post, we discussed decidability and the halting problem. In this post we will talk about complexity classes. Time Complexity If you’re not used to reasoning about algorithms and their complexity, there is an enormous amount of great material...

[Read More]
Tags:
CS, Theory, Computation, Polynomial, Time, P, NP