Image de couverture de livre

GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Tyler, Niroula, Pradeep, Ray, Archan, Subrahmanya, Pragna, Pistoia, Marco, Kumar, Niraj
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Numerical Analysis
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel GPU-Accelerated Randomized Construction of Approximate Cholesky Preconditioners
par: Liang, Tianyu, et autres
Publié: (2025)

Harmonic Decomposition in Data Sketches
par: Wang, Dingyu
Publié: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
par: Robinson, Peter, et autres
Publié: (2025)

A Reexamination of the Communication Bandwidth Cost Analysis of A Parallel Recursive Algorithm for Solving Triangular Systems of Linear Equations
par: Tang, Yuan
Publié: (2024)

On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System
par: Mackarov, Igor
Publié: (2006)

A Reexamination of the COnfLUX 2.5D LU Factorization Algorithm
par: Tang, Yuan
Publié: (2024)

New Improvements in Solving Large LABS Instances Using Massively Parallelizable Memetic Tabu Search
par: Zhang, Zhiwei, et autres
Publié: (2025)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
par: Laukemann, Jan, et autres
Publié: (2024)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
par: McCoy, Hunter, et autres
Publié: (2025)

Adaptive Massively Parallel Coloring in Sparse Graphs
par: Latypov, Rustam, et autres
Publié: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
par: Augustine, John, et autres
Publié: (2024)

Eventually Lattice-Linear Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)

Constrained Cuts, Flows, and Lattice-Linearity
par: Streit, Robert, et autres
Publié: (2025)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

Online Load and Graph Balancing for Random Order Inputs
par: Im, Sungjin, et autres
Publié: (2024)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
par: Chang, Yi-Jun, et autres
Publié: (2022)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
par: Kreis, Lara, et autres
Publié: (2026)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
par: Fischer, Orr, et autres
Publié: (2025)

Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models
par: Zhou, Huanjian, et autres
Publié: (2024)

A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems
par: Higgins, Andrew J., et autres
Publié: (2025)

FlashSketch: Sketch-Kernel Co-Design for Fast Sparse Sketching on GPUs
par: Dwaraknath, Rajat Vadiraj, et autres
Publié: (2026)

Balls and Bins and the Infinite Process with Random Deletions
par: Berenbrink, Petra, et autres
Publié: (2025)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
par: Izumi, Taisuke, et autres
Publié: (2023)

VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
par: Cannizzo, Fabio
Publié: (2023)

GPU Acceleration of Sparse Fully Homomorphic Encrypted DNNs
par: D'Agata, Lara, et autres
Publié: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
par: Feist, Dankrad, et autres
Publié: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)