Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval

Authors:
Sylvester Eriksson-Bique;Mary Solbrig;Michael Stefanelli;Sarah Warkentin;Ralph Abbey;Ilse C. F. Ipsen
Affiliations:
sylvester.eriksson-bique@helsinki.fi;solbrigm@reed.edu;stefane3@tcnj.edu;swarkentin@hmc.edu;rwabbey@ncsu.edu and ipsen@math.ncsu.edu;-
Venue:
SIAM Journal on Scientific Computing
Year:
2011

Citing 19
Cited 2

Random sampling with a reservoir

ACM Transactions on Mathematical Software (TOMS)
Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Approximating matrix multiplication for pattern recognition tasks

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Matrices, Vector Spaces, and Information Retrieval

SIAM Review
Random projection in dimensionality reduction: applications to image and text data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Near-optimal sparse fourier representations via sampling

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
When Is ''Nearest Neighbor'' Meaningful?

ICDT '99 Proceedings of the 7th International Conference on Database Theory
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Fast monte-carlo algorithms for finding low-rank approximations

Journal of the ACM (JACM)
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

SIAM Journal on Computing
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

SIAM Journal on Computing
Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis

Journal of Computational Physics
Improved Approximation Algorithms for Large Matrices via Random Projections

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Ordinal Ranking for Google's PageRank

SIAM Journal on Matrix Analysis and Applications
Document clustering using nonnegative matrix factorization

Information Processing and Management: an International Journal
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

SIAM Review
Quick simulation: a review of importance sampling techniques in communications systems

IEEE Journal on Selected Areas in Communications

Randomized Algorithms for Matrices and Data

Foundations and Trends® in Machine Learning
Sampling techniques for monte carlo matrix multiplication with applications to image processing

MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We perform importance sampling for a randomized matrix multiplication algorithm by Drineas, Kannan, and Mahoney and derive probabilities that minimize the expected value (with regard to the distributions of the matrix elements) of the variance. We compare these optimized probabilities with uniform probabilities and derive conditions under which the actual variance of the optimized probabilities is lower. Numerical experiments with query matching in information retrieval applications illustrate that the optimized probabilities produce more accurate matchings than the uniform probabilities and that they can also be computed efficiently.