16 citations · 27 across the 5 of their papers we have counts for
7 papers
Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendation
Jianling Wang, Haokai Lu, Sai zhang +10
Recommendation system serves as a conduit connecting users to an incredibly large, diverse and ever growing collection of contents. In practice, missing information on fresh (and t…
Long-Term Value of Exploration: Measurements, Findings and Algorithms
Yi Su, Xiangyu Wang, Elaine Ya Le +12
Effective exploration is believed to positively influence the long-term user experience on recommendation platforms. Determining its exact benefits, however, has been challenging.…
Improving the numerical stability of fast matrix multiplication
Grey Ballard, Austin R. Benson, Alex Druinsky +2
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoreti…
Parallelizing Gaussian Process Calculations in R
Christopher J. Paciorek, Benjamin Lipshitz, Wei Zhuo +3
We consider parallel computation for Gaussian process calculations to overcome computational and memory constraints on the size of datasets that can be analyzed. Using a hybrid par…
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
Grey Ballard, James Demmel, Olga Holtz +2
Graph expansion analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous methods, such as geometric embedding, are not applicable. This…
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
Grey Ballard, James Demmel, Olga Holtz +2
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for…