CS231n
Jeremy Liang
这个作者很懒,什么都没留下…
展开
-
CS231n-assignment1 Gradient of some function 常用函数的梯度
Gradient of max() function Gradient of Sigmoid(0 function原创 2018-08-09 15:06:23 · 228 阅读 · 0 评论 -
CS231n-assignment1 K近邻算法实现 two loops/one loop/no loop
1. 两重循环def compute_distances_two_loops(self, X): """ Compute the distance between each test point in X and each training point in self.X_train using a nested loop over both the train...原创 2018-08-02 15:32:43 · 1022 阅读 · 0 评论 -
CS231n-assignment1 K-fold 交叉验证 python 中字典的用法
num_folds = 5k_choices = [1, 3, 5, 8, 10, 12, 15, 20, 50, 100]X_train_folds = []y_train_folds = []################################################################################# TODO: ...原创 2018-08-03 10:33:16 · 823 阅读 · 0 评论 -
CS231n-assignment1 SVM 的梯度计算(dW) 用FOR循环实现和用矩阵实现
1. FOR循环实现import numpy as npfrom random import shuffledef svm_loss_naive(W, X, y, reg): """ Structured SVM loss function, naive implementation (with loops). Inputs have dimension D...原创 2018-08-03 15:27:07 · 851 阅读 · 0 评论 -
CS231n-assignment2 FullyConnectedNet 多层神经网络的实现 任意数量隐藏层的实现
from builtins import rangefrom builtins import objectimport numpy as npfrom cs231n.layers import *from cs231n.layer_utils import *class TwoLayerNet(object): """ A two-layer fully...原创 2018-08-17 13:34:39 · 869 阅读 · 0 评论 -
CS231n-assignment1 soft max
原创 2018-09-14 14:37:49 · 124 阅读 · 0 评论