Fast, approximate conditional distribution sampling
AssigneeOracle International Corporation
InventorsYasha Pushak, Tayler Hetherington, Karoon Rashedi Nia, Zahra Zohrevand, Sanjay Jinturkar, Nipun Agarwal
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle International Corporation
InventorsYasha Pushak, Tayler Hetherington, Karoon Rashedi Nia, Zahra Zohrevand, Sanjay Jinturkar, Nipun Agarwal
Estimating the term…
Techniques are described for fast approximate conditional sampling by randomly sampling a dataset and then performing a nearest neighbor search on the pre-sampled dataset to reduce the data over which the nearest neighbor search must be performed and, according to an embodiment, to effectively reduce the number of nearest neighbors that are to be found within the random sample. Furthermore, KD-Tree-based stratified sampling is used to generate a representative sample of a dataset. KD-Tree-based stratified sampling may be used to identify the random sample for fast approximate conditional sampling, which reduces variance in the resulting data sample. As such, using KD-Tree-based stratified sampling to generate the random sample for fast approximate conditional sampling ensures that any nearest neighbor selected, for a target data instance, from the random sample is likely to be among the nearest neighbors of the target data instance within the unsampled dataset.
A computer-executed method for an importance-based machine learning (ML) explainer for an ML model, comprising:
A computer-executed method for an importance-based machine learning (ML) explainer for an ML model, comprising:
One or more non-transitory computer-readable media storing one or more sequences of instructions that, when executed by one or more processors, cause:
One or more non-transitory computer-readable media storing one or more sequences of instructions that, when executed by one or more processors, cause:
Dependencies are inferred from the claim text.