T
- data type for values()
output@Operator(group="nn") public final class TopK<T extends Number> extends PrimitiveOp
If the input is a vector (rank-1), finds the `k` largest entries in the vector and outputs their values and indices as vectors. Thus `values[j]` is the `j`-th largest entry in `input`, and its index is `indices[j]`.
For matrices (resp. higher rank input), computes the top `k` entries in each row (resp. vector along the last dimension). Thus,
values.shape = indices.shape = input.shape[:-1] + [k]
If two elements are equal, the lower-index element appears first.
Modifier and Type | Class and Description |
---|---|
static class |
TopK.Options
Optional attributes for
TopK |
operation
Modifier and Type | Method and Description |
---|---|
static <T extends Number> |
create(Scope scope,
Operand<T> input,
Operand<Integer> k,
TopK.Options... options)
Factory method to create a class wrapping a new TopK operation.
|
Output<Integer> |
indices()
The indices of `values` within the last dimension of `input`.
|
static TopK.Options |
sorted(Boolean sorted) |
Output<T> |
values()
The `k` largest elements along each last dimensional slice.
|
equals, hashCode, op, toString
public static <T extends Number> TopK<T> create(Scope scope, Operand<T> input, Operand<Integer> k, TopK.Options... options)
scope
- current scopeinput
- 1-D or higher with last dimension at least `k`.k
- 0-D. Number of top elements to look for along the last dimension (along each
row for matrices).options
- carries optional attributes valuespublic static TopK.Options sorted(Boolean sorted)
sorted
- If true the resulting `k` elements will be sorted by the values in
descending order.Copyright © 2022. All rights reserved.