Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics

2021 ◽  
Author(s):  
Ninh Pham
Keyword(s):  
Order Statistics ◽  
Efficient Algorithms ◽  
Inner Product ◽  
Extreme Order Statistics ◽  
Product Search

Learning Sparse Binary Code for Maximum Inner Product Search

2021 ◽  
Author(s):  
Changyi Ma ◽  
Fangchen Yu ◽  
Yueyao Yu ◽  
Wenye Li
Keyword(s):  
Binary Code ◽  
Inner Product ◽  
Product Search

Limit distributions for compounded sums of extreme order statistics

1992 ◽  
Vol 29 (03) ◽  
pp. 557-574 ◽  
Author(s):  
Jan Beirlant ◽  
Jozef L. Teugels
Keyword(s):  
Order Statistics ◽  
Asymptotic Distribution ◽  
Counting Process ◽  
Extreme Values ◽  
Random Variables ◽  
Limit Distributions ◽  
Extreme Order Statistics ◽  
Renewal Counting Process ◽  
Independent Identically Distributed

Let X (1) ≦ X (2) ≦ ·· ·≦ X (N(t)) be the order statistics of the first N(t) elements from a sequence of independent identically distributed random variables, where {N(t); t ≧ 0} is a renewal counting process independent of the sequence of X's. We give a complete description of the asymptotic distribution of sums made from the top kt extreme values, for any sequence kt such that kt → ∞, kt /t → 0 as t → ∞. We discuss applications to reinsurance policies based on large claims.

Sign in / Sign up

Export Citation Format

Share Document