An 𝒪(n) algorithm for generating uniform random vectors in n-dimensional cones

01/04/2021
by   Arun I., et al.
0

Unbiased random vectors i.e. distributed uniformly in n-dimensional space, are widely applied and the computational cost of generating a vector increases only linearly with n. On the other hand, generating uniformly distributed random vectors in its subspaces typically involves the inefficiency of rejecting vectors falling outside, or re-weighting a non-uniformly distributed set of samples. Both approaches become severely ineffective as n increases. We present an efficient algorithm to generate uniform random directions in n-dimensional cones, to aid searching and sampling tasks in high dimensions.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro