A tale of two efficient value iteration algorithms for solving linear mdps with large action space
Abstract Markov Decision Process (MDP) with large action space naturally occurs in many
applications such as language processing, information retrieval, and recommendation …
applications such as language processing, information retrieval, and recommendation …
Rejection sampling for weighted jaccard similarity revisited
X Li, P Li - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
Efficiently computing the weighted Jaccard similarity has become an active research topic in
machine learning and theory. For sparse data, the standard technique is based on the …
machine learning and theory. For sparse data, the standard technique is based on the …
Fast neural ranking on bipartite graph indices
Neural network based ranking has been widely adopted owing to its powerful capacity in
modeling complex relationships (eg, users and items, questions and answers). Online …
modeling complex relationships (eg, users and items, questions and answers). Online …
GCWSNet: Generalized consistent weighted sampling for scalable and accurate training of neural networks
We propose using" powered generalized min-max''(pGMM) hashed (linearized) via the"
generalized consistent weighted sampling''(GCWS) for training (deep) neural networks …
generalized consistent weighted sampling''(GCWS) for training (deep) neural networks …
Constrained approximate similarity search on proximity graph
Search engines and recommendation systems are built to efficiently display relevant
information from those massive amounts of candidates. Typically a three-stage mechanism …
information from those massive amounts of candidates. Typically a three-stage mechanism …
EGM: enhanced graph-based model for large-scale video advertisement search
Video advertisements may grasp customers' attention instantly and are often adored by
advertisers. Since the corpus is vast, achieving an efficient query-to-video search can be …
advertisers. Since the corpus is vast, achieving an efficient query-to-video search can be …
Proximity graph maintenance for fast online nearest neighbor search
Approximate Nearest Neighbor (ANN) search is a fundamental technique for (eg,) the
deployment of recommender systems. Recent studies bring proximity graph-based methods …
deployment of recommender systems. Recent studies bring proximity graph-based methods …
Building K-Anonymous User Cohorts with Consecutive Consistent Weighted Sampling (CCWS)
To retrieve personalized campaigns and creatives while protecting user privacy, digital
advertising is shifting from member-based identity to cohort-based identity. Under such …
advertising is shifting from member-based identity to cohort-based identity. Under such …
Weighted Diversified Sampling for Efficient Data-Driven Single-Cell Gene-Gene Interaction Discovery
Gene-gene interactions play a crucial role in the manifestation of complex human diseases.
Uncovering significant gene-gene interactions is a challenging task. Here, we present an …
Uncovering significant gene-gene interactions is a challenging task. Here, we present an …
Pb-Hash: Partitioned b-bit Hashing
Many hashing algorithms including minwise hashing (MinHash), one permutation hashing
(OPH), and consistent weighted sampling (CWS) generate integers of B bits. With k hashes …
(OPH), and consistent weighted sampling (CWS) generate integers of B bits. With k hashes …