tf_agents.bandits.agents.utils.build_laplacian_nearest_neighbor_graph
Stay organized with collections
Save and categorize content based on your preferences.
Build the Laplacian matrix of a nearest neighbor graph.
tf_agents.bandits.agents.utils.build_laplacian_nearest_neighbor_graph(
input_vecs: tf_agents.typing.types.Tensor
,
k: int = 1
) -> tf_agents.typing.types.Tensor
Given input embedding vectors, this utility returns the Laplacian matrix of
the induced k-nearest-neighbor graph.
Args |
input_vecs
|
a Tensor . Input embedding vectors (one per row). Shaped
[num_vectors, ...] .
|
k
|
an integer. Number of nearest neighbors to use.
|
Returns |
The graph Laplacian matrix. A dense float Tensor of shape
[num_vectors, num_vectors] , where num_vectors is the number of input
embedding vectors (Tensor ).
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-04-26 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-04-26 UTC."],[],[]]