NVIDIA/nvbench
1
0
Fork 0
mirror of https://github.com/NVIDIA/nvbench.git synced 2026-07-01 11:47:33 +00:00
Code Issues Packages Projects Releases Wiki Activity

Compute quantiles the same way C++ does

Browse Source 
Use rounded-rank method, rather than NumPy's quantile
This commit is contained in:
Oleksandr Pavlyk
2026-06-26 18:12:46 -05:00
parent fa1a0253df
commit a2a5c8c91f
2 changed files with 14 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
python/scripts/nvbench_compare.py
View File

@@ -1239,13 +1239,21 @@ def compute_timing_interval_from_samples(samples):
return interval
def percentile_rank(percentile: int, sample_count: int) -> int:
clamped_percentile = min(max(percentile, 0), 100)
return round((clamped_percentile / 100.0) * (sample_count - 1))
def compute_robust_timing_input_from_samples(samples):
values = positive_finite_array(samples)
if values is None:
return None
first_quartile, median, third_quartile = np.quantile(values, [0.25, 0.5, 0.75])
sorted_values = np.sort(values)
first_quartile = sorted_values[percentile_rank(25, len(sorted_values))]
median = sorted_values[percentile_rank(50, len(sorted_values))]
third_quartile = sorted_values[percentile_rank(75, len(sorted_values))]
interval = make_timing_interval(
lower=np.min(values),
lower=sorted_values[0],
upper=third_quartile,
center=median,
)