官术网_书友最值得收藏!

Algorithm

The algorithm of the prototypical networks is shown here:

  1. Let's say we have the dataset, D, comprising {(x1, y1), (x2, y2), ... (xn, yn)} where x is the feature and y is the class label.
  2. Since we perform episodic training, we randomly sample n number of data points per each class from our dataset, D, and prepare our support set, S.
  3. Similarly, we select n number of data points and prepare our query set, Q.
  4. We learn the embeddings of the data points in our support set using our embedding function, f? (). The embedding function can be any feature extractor—say, a convolutional network for images and an LSTM network for text.
  5. Once we have the embeddings for each data point, we compute the prototype of each class by taking the mean embeddings of the data points under each class:
  1. Similarly, we learn the query set embeddings.
  2. We calculate the Euclidean distance, d, between query set embeddings and the class prototype.
  3. We predict the probability, p?(y = k|x), of the class of a query set by applying softmax over the distance d:
  1. We compute the loss function, J(?), as a negative log probability, J(?) = -logp?(y=k|x), and we try to minimize the loss using stochastic gradient descent.
主站蜘蛛池模板: 镇江市| 枣强县| 盘锦市| 靖江市| 通渭县| 抚州市| 信宜市| 五指山市| 陆河县| 桑植县| 大同县| 洪雅县| 黎平县| 宜都市| 汶川县| 浠水县| 隆德县| 嘉善县| 罗平县| 黑龙江省| 资源县| 儋州市| 中牟县| 资兴市| 渝北区| 定兴县| 瓦房店市| 峨眉山市| 屏东市| 保靖县| 宁阳县| 靖安县| 崇礼县| 托克托县| 龙江县| 达州市| 错那县| 鄱阳县| 南皮县| 柏乡县| 盐亭县|