tff.analytics.heavy_hitters.iblt.CoupledHyperEdgeHasher
Stay organized with collections
Save and categorize content based on your preferences.
Hashes a string to an hyper-edge with coupled indices.
tff.analytics.heavy_hitters.iblt.CoupledHyperEdgeHasher(
seed: int, table_size: int, repetitions: int, rescale_factor: float
)
For a string, generates a set of indices such that the indices are close to
each as described in https://arxiv.org/pdf/2001.10500.pdf
Args |
seed
|
An integer seed for hash functions.
|
table_size
|
The hash table size of the IBLT. Must be a positive integer.
|
repetitions
|
The number of repetitions in IBLT data structure. Must be at
least 3.
|
rescale_factor
|
A float to rescale table_size to table_size /
rescale_factor + 1 . This number is denoted as z in
https://arxiv.org/pdf/2001.10500.pdf. Must be non-negative and no
greater than table_size - 1 .
|
Raises |
ValueError
|
If arguments do not meet expectations.
|
Methods
get_hash_indices_tf
View source
get_hash_indices_tf(
data_strings
)
Returns Tensor containing hash-position of (input string, repetition)
.
Returns |
A tf.Tensor of shape (input_length, repetitions, 3) containing value
i at index (i, r, 0) , value r at index (i, r, 1) and the
hash-index of the i-th input string in repetition r at index
(i, r, 2) .
|
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-09-20 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
{"lastModified": "Last updated 2024-09-20 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-09-20 UTC."],[],[]]