NDLI: Efficient band approximation of Gram matrices for large scale kernel methods on GPUs

Content Provider	IEEE Xplore Digital Library
Author	Hussein, M. Abd-Almageed, W.
Copyright Year	2009
Description	Author affiliation: Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA (Abd-Almageed, W.) \|\| Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA (Hussein, M.)
Abstract	Kernel-based methods require O(N2) time and space complexities to compute and store non-sparse Gram matrices, which is prohibitively expensive for large scale problems. We introduce a novel method to approximate a Gram matrix with a band matrix. Our method relies on the locality preserving properties of space filling curves, and the special structure of Gram matrices. Our approach has several important merits. First, it computes only those elements of the Gram matrix that lie within the projected band. Second, it is simple to parallelize. Third, using the special band matrix structure makes it space efficient and GPU-friendly. We developed GPU implementations for the Affinity Propagation (AP) clustering algorithm using both our method and the COO sparse representation. Our band approximation is about 5 times more space efficient and faster to construct than COO. AP gains up to 6x speedup using our method without any degradation in its clustering performance.
Starting Page	1
Ending Page	10
File Size	554913
Page Count	10
File Format	PDF
ISBN	9781605587448
DOI	10.1145/1654059.1654091
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-11-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Association for Computing Machinery, Inc. (ACM)
Subject Keyword	sparse matrices GPU Gram matrices affinity propagation kernel methods space filling curves
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient band approximation of Gram matrices for large scale kernel methods on GPUs

Approximate kernel matrix computation on GPUs forlarge scale learning applications

Efficient band approximation of gram matrices for large scale kernel methods on gpus.

Effective dynamic load balance using space-filling curves for large-scale SPH simulations on GPU-rich supercomputers

Auto-Tuning CUDA Parameters for Sparse Matrix-Vector Multiplication on GPUs

A memory transaction model for Sparse Matrix-Vector multiplications on GPUs

Fast Sparse Matrix-Vector Multiplication on GPUs for Graph Applications

Primal space sparse kernel partial least squares regression for large scale problems

Efficient Implementation of the Overlap Operator on Multi-GPUs

Efficient band approximation of Gram matrices for large scale kernel methods on GPUs

Similar Documents

Efficient band approximation of Gram matrices for large scale kernel methods on GPUs

Approximate kernel matrix computation on GPUs forlarge scale learning applications

Efficient band approximation of gram matrices for large scale kernel methods on gpus.

Effective dynamic load balance using space-filling curves for large-scale SPH simulations on GPU-rich supercomputers

Auto-Tuning CUDA Parameters for Sparse Matrix-Vector Multiplication on GPUs

A memory transaction model for Sparse Matrix-Vector multiplications on GPUs

Fast Sparse Matrix-Vector Multiplication on GPUs for Graph Applications

Primal space sparse kernel partial least squares regression for large scale problems

Efficient Implementation of the Overlap Operator on Multi-GPUs

Efficient band approximation of Gram matrices for large scale kernel methods on GPUs