There is a pr for topk, but it is not sorted. You can use it and keep the
sort on CPU for now. It will be faster like that I think.
Le jeu. 29 juin 2017 21:11, Victor Campmany a écrit :
> We are working on both sorts for 1D arrays and sort of an axis of an
> nd-array. We
Has there been any progress? I'm in need of sorted TopK on GPU. I can go
with CPU sort but seems a bit slow.
On Thursday, June 15, 2017 at 4:01:00 AM UTC+8, Victor Campmany wrote:
>
> Hi,
>
> We are planning to implement a new GPU accelerated sorting algorithm. We'd
> like to know which are the
Adam, what input shapes do you do sort on right now? What axis?
This is to help to know which car to optimize.
Fred
Le mer. 14 juin 2017 22:03, Victor Campmany a écrit :
> The implementation would be for *Gpuarray*, not Theano, I mixed things up
> sorry.
>
>
> El
I'd prefer a gpuarray implementation with similar interface as numpy:
gpuarray.sort(arr, [axis=-1], [kind='radixsort'], [order='inc'])
Deep Learning folks would need a fast batched version, especially float32 /
int32 tensors on GPU. But anyway there should be a general algorithm deals
with all