Regression Week 3: Assessing Fit (polynomial regression)

In this notebook you will compare different regression models in order to assess which model fits best. We will be using polynomial regression as a means to examine this topic. In particular you will:

  • Write a function to take an SArray and a degree and return an SFrame where each column is the SArray to a polynomial value up to the total degree e.g. degree = 3 then column 1 is the SArray column 2 is the SArray squared and column 3 is the SArray cubed
  • Use matplotlib to visualize polynomial regressions
  • Use matplotlib to visualize the same polynomial degree on different subsets of the data
  • Use a validation set to select a polynomial degree
  • Assess the final fit using test data

We will continue to use the House data from previous notebooks.

Fire up graphlab create


In [1]:
import graphlab

Next we're going to write a polynomial function that takes an SArray and a maximal degree and returns an SFrame with columns containing the SArray to all the powers up to the maximal degree.

The easiest way to apply a power to an SArray is to use the .apply() and lambda x: functions. For example to take the example array and compute the third power we can do as follows: (note running this cell the first time may take longer than expected since it loads graphlab)


In [2]:
tmp = graphlab.SArray([1., 2., 3.])
tmp_cubed = tmp.apply(lambda x: x**3)
print tmp
print tmp_cubed


[INFO] 1451825735 : INFO:     (initialize_globals_from_environment:282): Setting configuration variable GRAPHLAB_FILEIO_ALTERNATIVE_SSL_CERT_FILE to /usr/local/lib/python2.7/site-packages/certifi/cacert.pem
1451825735 : INFO:     (initialize_globals_from_environment:282): Setting configuration variable GRAPHLAB_FILEIO_ALTERNATIVE_SSL_CERT_DIR to 
This non-commercial license of GraphLab Create is assigned to jinntrance@gmail.com and will expire on September 27, 2016. For commercial licensing options, visit https://dato.com/buy/.

[INFO] Start server at: ipc:///tmp/graphlab_server-2676 - Server binary: /usr/local/lib/python2.7/site-packages/graphlab/unity_server - Server log: /tmp/graphlab_server_1451825735.log
[INFO] GraphLab Server Version: 1.7.1
[1.0, 2.0, 3.0]
[1.0, 8.0, 27.0]

We can create an empty SFrame using graphlab.SFrame() and then add any columns to it with ex_sframe['column_name'] = value. For example we create an empty SFrame and make the column 'power_1' to be the first power of tmp (i.e. tmp itself).


In [3]:
ex_sframe = graphlab.SFrame()
ex_sframe['power_1'] = tmp
print ex_sframe


+---------+
| power_1 |
+---------+
|   1.0   |
|   2.0   |
|   3.0   |
+---------+
[3 rows x 1 columns]

Polynomial_sframe function

Using the hints above complete the following function to create an SFrame consisting of the powers of an SArray up to a specific degree:


In [4]:
def polynomial_sframe(feature, degree):
    # assume that degree >= 1
    # initialize the SFrame:
    poly_sframe = graphlab.SFrame()
    # and set poly_sframe['power_1'] equal to the passed feature
    poly_sframe['power_1'] = feature
    # first check if degree > 1
    if degree > 1:
        # then loop over the remaining degrees:
        # range usually starts at 0 and stops at the endpoint-1. We want it to start at 2 and stop at degree
        for power in range(2, degree+1): 
            # first we'll give the column a name:
            name = 'power_' + str(power)
            # then assign poly_sframe[name] to the appropriate power of feature
            poly_sframe[name] = feature.apply(lambda x: x**power)
    return poly_sframe

To test your function consider the smaller tmp variable and what you would expect the outcome of the following call:


In [5]:
print polynomial_sframe(tmp, 3)


+---------+---------+---------+
| power_1 | power_2 | power_3 |
+---------+---------+---------+
|   1.0   |   1.0   |   1.0   |
|   2.0   |   4.0   |   8.0   |
|   3.0   |   9.0   |   27.0  |
+---------+---------+---------+
[3 rows x 3 columns]

Visualizing polynomial regression

Let's use matplotlib to visualize what a polynomial regression looks like on some real data.


In [6]:
sales = graphlab.SFrame('kc_house_data.gl/')

As in Week 3, we will use the sqft_living variable. For plotting purposes (connecting the dots), you'll need to sort by the values of sqft_living. For houses with identical square footage, we break the tie by their prices.


In [7]:
sales = sales.sort(['sqft_living', 'price'])

Let's start with a degree 1 polynomial using 'sqft_living' (i.e. a line) to predict 'price' and plot what it looks like.


In [8]:
poly1_data = polynomial_sframe(sales['sqft_living'], 1)
poly1_data['price'] = sales['price'] # add price to the data since it's the target

NOTE: for all the models in this notebook use validation_set = None to ensure that all results are consistent across users.


In [9]:
model1 = graphlab.linear_regression.create(poly1_data, target = 'price', features = ['power_1'], validation_set = None)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 21613
PROGRESS: Number of features          : 1
PROGRESS: Number of unpacked features : 1
PROGRESS: Number of coefficients    : 2
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 1.031492     | 4362074.696077     | 261440.790724 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:

In [10]:
#let's take a look at the weights before we plot
model1.get("coefficients")


Out[10]:
name index value
(intercept) None -43579.0852515
power_1 None 280.622770886
[2 rows x 3 columns]

In [11]:
import matplotlib.pyplot as plt
%matplotlib inline

In [12]:
plt.plot(poly1_data['power_1'],poly1_data['price'],'.',
        poly1_data['power_1'], model1.predict(poly1_data),'-')


Out[12]:
[<matplotlib.lines.Line2D at 0x110d34b50>,
 <matplotlib.lines.Line2D at 0x110d34d90>]

Let's unpack that plt.plot() command. The first pair of SArrays we passed are the 1st power of sqft and the actual price we then ask it to print these as dots '.'. The next pair we pass is the 1st power of sqft and the predicted values from the linear model. We ask these to be plotted as a line '-'.

We can see, not surprisingly, that the predicted values all fall on a line, specifically the one with slope 280 and intercept -43579. What if we wanted to plot a second degree polynomial?


In [13]:
poly2_data = polynomial_sframe(sales['sqft_living'], 2)
my_features = poly2_data.column_names() # get the name of the features
poly2_data['price'] = sales['price'] # add price to the data since it's the target
model2 = graphlab.linear_regression.create(poly2_data, target = 'price', features = my_features, validation_set = None)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 21613
PROGRESS: Number of features          : 2
PROGRESS: Number of unpacked features : 2
PROGRESS: Number of coefficients    : 3
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.036609     | 5913020.984255     | 250948.368758 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:

In [14]:
model2.get("coefficients")


Out[14]:
name index value
(intercept) None 199222.496445
power_1 None 67.9940640677
power_2 None 0.0385812312789
[3 rows x 3 columns]

In [15]:
plt.plot(poly2_data['power_1'],poly2_data['price'],'.',
        poly2_data['power_1'], model2.predict(poly2_data),'-')


Out[15]:
[<matplotlib.lines.Line2D at 0x111032490>,
 <matplotlib.lines.Line2D at 0x1110326d0>]

The resulting model looks like half a parabola. Try on your own to see what the cubic looks like:


In [43]:
def plot_deg(features, labels, degree, val_set = None):
    polyn_data = polynomial_sframe(features, degree)
    my_features = polyn_data.column_names() # get the name of the features
    polyn_data['price'] = labels # add price to the data since it's the target
    modeln = graphlab.linear_regression.create(polyn_data, target = 'price', features = my_features, validation_set = val_set)
    #print_rows(num_rows=16)
    modeln["coefficients"].print_rows(num_rows=16)
    plt.plot(polyn_data['power_1'],polyn_data['price'],'.',
        polyn_data['power_1'], modeln.predict(polyn_data),'-')

In [44]:
plot_deg(sales['sqft_living'], sales['price'], 3)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 21613
PROGRESS: Number of features          : 3
PROGRESS: Number of unpacked features : 3
PROGRESS: Number of coefficients    : 4
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.040061     | 3261066.736007     | 249261.286346 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+-------------------+
|     name    | index |       value       |
+-------------+-------+-------------------+
| (intercept) |  None |   336788.117952   |
|   power_1   |  None |   -90.1476236119  |
|   power_2   |  None |   0.087036715081  |
|   power_3   |  None | -3.8398521196e-06 |
+-------------+-------+-------------------+
[4 rows x 3 columns]

Now try a 15th degree polynomial:


In [37]:
plot_deg(sales['sqft_living'], sales['price'], 15)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 21613
PROGRESS: Number of features          : 15
PROGRESS: Number of unpacked features : 15
PROGRESS: Number of coefficients    : 16
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.024269     | 2662308.584344     | 245690.511190 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+--------------------+
|     name    | index |       value        |
+-------------+-------+--------------------+
| (intercept) |  None |   73619.7521179    |
|   power_1   |  None |   410.287462517    |
|   power_2   |  None |  -0.230450714409   |
|   power_3   |  None | 7.58840542349e-05  |
|   power_4   |  None | -5.65701802386e-09 |
|   power_5   |  None | -4.57028130967e-13 |
|   power_6   |  None | 2.66360206727e-17  |
|   power_7   |  None | 3.38584769163e-21  |
|   power_8   |  None |  1.147231041e-25   |
|   power_9   |  None | -4.65293586061e-30 |
|   power_10  |  None | -8.6879620195e-34  |
|   power_11  |  None | -6.30994295678e-38 |
|   power_12  |  None | -2.7039038383e-42  |
|   power_13  |  None | -1.21241981157e-47 |
|   power_14  |  None | 1.11397452845e-50  |
|   power_15  |  None | 1.39881690796e-54  |
+-------------+-------+--------------------+
[16 rows x 3 columns]


In [ ]:

What do you think of the 15th degree polynomial? Do you think this is appropriate? If we were to change the data do you think you'd get pretty much the same curve? Let's take a look.

Changing the data and re-learning

We're going to split the sales data into four subsets of roughly equal size. Then you will estimate a 15th degree polynomial model on all four subsets of the data. Print the coefficients (you should use .print_rows(num_rows = 16) to view all of them) and plot the resulting fit (as we did above). The quiz will ask you some questions about these results.

To split the sales data into four subsets, we perform the following steps:

  • First split sales into 2 subsets with .random_split(0.5, seed=0).
  • Next split the resulting subsets into 2 more subsets each. Use .random_split(0.5, seed=0).

We set seed=0 in these steps so that different users get consistent results. You should end up with 4 subsets (set_1, set_2, set_3, set_4) of approximately equal size.


In [22]:
(s_h, s_t)=sales.random_split(0.5, seed=0)

(set_1, set_2)=s_h.random_split(0.5, seed=0)
(set_3, set_4)=s_t.random_split(0.5, seed=0)

Fit a 15th degree polynomial on set_1, set_2, set_3, and set_4 using sqft_living to predict prices. Print the coefficients and make a plot of the resulting model.


In [38]:
plot_deg(set_1['sqft_living'], set_1['price'], 15)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 5404
PROGRESS: Number of features          : 15
PROGRESS: Number of unpacked features : 15
PROGRESS: Number of coefficients    : 16
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.041189     | 2195218.932304     | 248858.822200 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+--------------------+
|     name    | index |       value        |
+-------------+-------+--------------------+
| (intercept) |  None |    223312.75025    |
|   power_1   |  None |   118.086127586    |
|   power_2   |  None |  -0.0473482011336  |
|   power_3   |  None | 3.25310342468e-05  |
|   power_4   |  None | -3.3237215256e-09  |
|   power_5   |  None | -9.75830457822e-14 |
|   power_6   |  None | 1.15440303425e-17  |
|   power_7   |  None | 1.05145869431e-21  |
|   power_8   |  None | 3.46049616301e-26  |
|   power_9   |  None | -1.09654454076e-30 |
|   power_10  |  None | -2.42031812181e-34 |
|   power_11  |  None | -1.99601206791e-38 |
|   power_12  |  None | -1.0770990379e-42  |
|   power_13  |  None | -2.7286281761e-47  |
|   power_14  |  None | 2.44782693234e-51  |
|   power_15  |  None |  5.019752326e-55   |
+-------------+-------+--------------------+
[16 rows x 3 columns]


In [39]:
plot_deg(set_2['sqft_living'], set_2['price'], 15)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 5398
PROGRESS: Number of features          : 15
PROGRESS: Number of unpacked features : 15
PROGRESS: Number of coefficients    : 16
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.046408     | 2069212.978547     | 234840.067186 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+--------------------+
|     name    | index |       value        |
+-------------+-------+--------------------+
| (intercept) |  None |   89836.5077348    |
|   power_1   |  None |    319.80694676    |
|   power_2   |  None |  -0.103315397038   |
|   power_3   |  None | 1.06682476058e-05  |
|   power_4   |  None | 5.75577097729e-09  |
|   power_5   |  None | -2.5466346474e-13  |
|   power_6   |  None | -1.09641345066e-16 |
|   power_7   |  None | -6.36458441707e-21 |
|   power_8   |  None | 5.52560416968e-25  |
|   power_9   |  None |  1.3508203898e-28  |
|   power_10  |  None | 1.18408188241e-32  |
|   power_11  |  None | 1.98348000462e-37  |
|   power_12  |  None | -9.9253359052e-41  |
|   power_13  |  None | -1.60834847033e-44 |
|   power_14  |  None | -9.12006024135e-49 |
|   power_15  |  None | 1.68636658315e-52  |
+-------------+-------+--------------------+
[16 rows x 3 columns]


In [40]:
plot_deg(set_3['sqft_living'], set_3['price'], 15)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 5409
PROGRESS: Number of features          : 15
PROGRESS: Number of unpacked features : 15
PROGRESS: Number of coefficients    : 16
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.037291     | 2269769.506523     | 251460.072754 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+--------------------+
|     name    | index |       value        |
+-------------+-------+--------------------+
| (intercept) |  None |    87317.97956     |
|   power_1   |  None |   356.304911031    |
|   power_2   |  None |  -0.164817442795   |
|   power_3   |  None | 4.40424992635e-05  |
|   power_4   |  None | 6.48234877396e-10  |
|   power_5   |  None | -6.75253226641e-13 |
|   power_6   |  None | -3.36842592784e-17 |
|   power_7   |  None | 3.60999704377e-21  |
|   power_8   |  None | 6.46999725636e-25  |
|   power_9   |  None | 4.23639388651e-29  |
|   power_10  |  None | -3.62149423631e-34 |
|   power_11  |  None | -4.27119527371e-37 |
|   power_12  |  None | -5.61445971691e-41 |
|   power_13  |  None | -3.87452772941e-45 |
|   power_14  |  None | 4.69430357729e-50  |
|   power_15  |  None | 6.39045886165e-53  |
+-------------+-------+--------------------+
[16 rows x 3 columns]


In [61]:
plot_deg(set_4['sqft_living'], set_4['price'], 15)


PROGRESS: Linear regression:
PROGRESS: --------------------------------------------------------
PROGRESS: Number of examples          : 5402
PROGRESS: Number of features          : 15
PROGRESS: Number of unpacked features : 15
PROGRESS: Number of coefficients    : 16
PROGRESS: Starting Newton Method
PROGRESS: --------------------------------------------------------
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | Iteration | Passes   | Elapsed Time | Training-max_error | Training-rmse |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: | 1         | 2        | 0.049356     | 2314893.173824     | 244563.136754 |
PROGRESS: +-----------+----------+--------------+--------------------+---------------+
PROGRESS: SUCCESS: Optimal solution found.
PROGRESS:
+-------------+-------+--------------------+
|     name    | index |       value        |
+-------------+-------+--------------------+
| (intercept) |  None |   259020.879447    |
|   power_1   |  None |   -31.7277161932   |
|   power_2   |  None |   0.109702769609   |
|   power_3   |  None | -1.58383847314e-05 |
|   power_4   |  None | -4.47660623787e-09 |
|   power_5   |  None | 1.13976573478e-12  |
|   power_6   |  None | 1.97669120543e-16  |
|   power_7   |  None | -6.15783678607e-21 |
|   power_8   |  None | -4.88012304096e-24 |
|   power_9   |  None | -6.6218678116e-28  |
|   power_10  |  None | -2.70631583575e-32 |
|   power_11  |  None | 6.72370411717e-36  |
|   power_12  |  None | 1.74115646286e-39  |
|   power_13  |  None |  2.0918837573e-43  |
|   power_14  |  None | 4.78015565447e-48  |
|   power_15  |  None | -4.74535333059e-51 |
+-------------+-------+--------------------+
[16 rows x 3 columns]

Some questions you will be asked on your quiz:

Quiz Question: Is the sign (positive or negative) for power_15 the same in all four models?

Quiz Question: (True/False) the plotted fitted lines look the same in all four plots

Selecting a Polynomial Degree

Whenever we have a "magic" parameter like the degree of the polynomial there is one well-known way to select these parameters: validation set. (We will explore another approach in week 4).

We split the sales dataset 3-way into training set, test set, and validation set as follows:

  • Split our sales data into 2 sets: training_and_validation and testing. Use random_split(0.9, seed=1).
  • Further split our training data into two sets: training and validation. Use random_split(0.5, seed=1).

Again, we set seed=1 to obtain consistent results for different users.


In [46]:
training_and_validation, testing = sales.random_split(0.9, seed=1)
training, validation = training_and_validation.random_split(0.5, seed=1)

Next you should write a loop that does the following:

  • For degree in [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15] (to get this in python type range(1, 15+1))
    • Build an SFrame of polynomial data of train_data['sqft_living'] at the current degree
    • hint: my_features = poly_data.column_names() gives you a list e.g. ['power_1', 'power_2', 'power_3'] which you might find useful for graphlab.linear_regression.create( features = my_features)
    • Add train_data['price'] to the polynomial SFrame
    • Learn a polynomial regression model to sqft vs price with that degree on TRAIN data
    • Compute the RSS on VALIDATION data (here you will want to use .predict()) for that degree and you will need to make a polynmial SFrame using validation data.
  • Report which degree had the lowest RSS on validation data (remember python indexes from 0)

(Note you can turn off the print out of linear_regression.create() with verbose = False)


In [75]:
max_val_rss = 9223372036854775807
test_rss = 0
best_d = 0

for d in range(1,15+1):
    this_pow = 'power_' + str(d)
    polyn_data = polynomial_sframe(training['sqft_living'], d)
    val_data = polynomial_sframe(validation['sqft_living'], d)
    test_data = polynomial_sframe(testing['sqft_living'], d)
    my_features = polyn_data.column_names() # get the name of the features
    print my_features
    polyn_data['price'] = training['price']# add price to the data since it's the target
    val_data['price'] = validation['price']
    test_data['price'] = testing['price']
    modeln = graphlab.linear_regression.create(polyn_data, target = 'price', features = my_features, validation_set = val_data, verbose = False)
    val_data['predicted'] = modeln.predict(val_data)
    #print polyn_data
    val_RSS = val_data.apply(lambda d: (d['price'] - d['predicted']) ** 2).sum()
    if val_RSS < max_val_rss:
        best_d = d
        max_val_rss = val_RSS
        test_data['predicted'] = modeln.predict(test_data)
        test_rss = test_data.apply(lambda d: (d['price'] - d['predicted']) ** 2).sum()
print "RSS ", best_d,  max_train_rss, test_rss


['power_1']
['power_1', 'power_2']
['power_1', 'power_2', 'power_3']
['power_1', 'power_2', 'power_3', 'power_4']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10', 'power_11']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10', 'power_11', 'power_12']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10', 'power_11', 'power_12', 'power_13']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10', 'power_11', 'power_12', 'power_13', 'power_14']
['power_1', 'power_2', 'power_3', 'power_4', 'power_5', 'power_6', 'power_7', 'power_8', 'power_9', 'power_10', 'power_11', 'power_12', 'power_13', 'power_14', 'power_15']
RSS  6 9223372036854775807 1.25529337848e+14

Quiz Question: Which degree (1, 2, …, 15) had the lowest RSS on Validation data?

Now that you have chosen the degree of your polynomial using validation data, compute the RSS of this model on TEST data. Report the RSS on your quiz.


In [ ]:

Quiz Question: what is the RSS on TEST data for the model with the degree selected from Validation data?


In [ ]: