| /external/v8/src/wasm/ |
| D | wasm-opcodes.h | 66 V(I64LoadMem, 0x29, l_i) \
73 V(I64LoadMem8S, 0x30, l_i) \
74 V(I64LoadMem8U, 0x31, l_i) \
75 V(I64LoadMem16S, 0x32, l_i) \
76 V(I64LoadMem16U, 0x33, l_i) \
77 V(I64LoadMem32S, 0x34, l_i) \
78 V(I64LoadMem32U, 0x35, l_i)
202 V(I64SConvertI32, 0xac, l_i) \
203 V(I64UConvertI32, 0xad, l_i) \
421 V(I64AtomicLoad, 0xfe11, l_i) \
[all …]
|
| /external/tensorflow/tensorflow/contrib/linear_optimizer/kernels/g3doc/ |
| D | readme.md | 7 $$ P(w) = \frac{1}{n}\sum_{i=1}^n \l_i(x_i^T w)+\lambda g(w) $$
11 $$ D(\a) = \frac{1}{n} \left(\sum_{i=1}^n -\l_i^\star(-\a_i)\right) -\lambda g^\star\left(\tfrac{1}…
15 Here, $$f^\star$$ denotes the convex dual of a convex function $$f$$, $$\l_i$$
35 -\frac{1}{n} \sum_{i\in\P_k}\l_i^\star(-\a_i-(\d_{[k]})_i) -\frac{1}{n} w^T X
49 $$ \max_{\d} \left\{ D_i(\d) = -\l_i^\star(-(\a_i+\d)) - \bar{y}_i \d - \frac{A}{2} \d^2 \right\} $$
61 Hinge loss is given by $$ \l_i(u) = \max(0,1-y u) $$. Its convex dual is $$
62 \l_i^\star(-a) = -a y $$ with the constraint $$ a y\in [0,1] $$.
75 $$ \l_i(u) =
92 Squared loss is $$ \l_i(u) = \frac{1}{2}(u-y)^2 $$ with dual $$ \l_i^\star(v) =
102 Logistic loss is $$ \l_i(u) = \log (1+e^{-uy_i}) $$ and its dual is
[all …]
|
| /external/libaom/libaom/third_party/googletest/src/googletest/src/ |
| D | gtest.cc | 1037 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1038 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1039 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1047 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1049 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1051 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1052 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1056 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1057 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1058 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/mesa3d/src/gtest/src/ |
| D | gtest.cc | 1036 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1037 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1038 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1046 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1048 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1050 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1051 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1055 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1056 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1057 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googletest/src/ |
| D | gtest.cc | 1036 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1037 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1038 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1046 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1048 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1050 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1051 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1055 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1056 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1057 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/libvpx/libvpx/third_party/googletest/src/src/ |
| D | gtest.cc | 1080 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1081 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1082 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1090 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1092 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1094 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1095 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1099 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1100 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1101 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/ |
| D | README.md | 60 assignment `l_i`.
62 2. `y_i` is used to update the leaf statistics of leaf `l_i`.
64 3. If the growing statistics for the leaf `l_i` do not yet contain
70 split in the growing statistics of leaf `l_i`. If leaf `l_i` has now seen
|
| /external/googletest/googletest/src/ |
| D | gtest.cc | 1057 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1058 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1059 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1067 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1069 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1071 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1072 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1076 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1077 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1078 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/tensorflow/tensorflow/core/util/ctc/ |
| D | ctc_loss_calculator.h | 325 for (int l_i : l) { in PopulateLPrimes() local
326 if (l_i < 0) { in PopulateLPrimes()
330 } else if (l_i >= num_classes) { in PopulateLPrimes()
|
| /external/epid-sdk/ext/gtest/ |
| D | gtest-all.cc | 2484 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
2485 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
2486 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
2494 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
2496 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
2498 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
2499 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
2503 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
2504 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
2505 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | cholesky_expander.cc | 97 auto l_i = DynamicSliceInMinorDims(body_l, {i, zero}, {1, n}); in CholeskyUnblocked() local
98 auto row = Select(Ge(mask_range_row, i), mask_zeros_row, l_i); in CholeskyUnblocked()
|