matrix multiplication

Optimization without Retraction on the Random Generalized Stiefel Manifold ICML 2024 SAS: Structured Activation Sparsification ICLR 2024 Efficient Low-rank Backpropagation for Vision Transformer Adaptation NeurIPS 2023 Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products NeurIPS 2023 MatrixVT: Efficient Multi-Camera to BEV Transformation for 3D Perception ICCV 2023 Winning Both the Accuracy of Floating Point Activation and the Simplicity of Integer Arithmetic ICLR 2023 CryptoGCN: Fast and Scalable Homomorphically Encrypted Graph Convolutional Network Inference NeurIPS 2022 Fast algorithm for overcomplete order-3 tensor decomposition COLT 2022 Fast and accurate optimization on the orthogonal manifold without retraction AISTATS 2022 Fast Regression for Structured Inputs ICLR 2022 GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale NeurIPS 2022 Iron: Private Inference on Transformers NeurIPS 2022 Maximum Class Separation as Inductive Bias in One Matrix NeurIPS 2022 Sketching Algorithms and Lower Bounds for Ridge Regression ICML 2022 Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks NeurIPS 2021 Chebyshev Polynomial Codes: Task Entanglement-based Coding for Distributed Matrix Multiplication ICML 2021 Multiplying Matrices Without Multiplying ICML 2021 Near-Optimal Entrywise Sampling of Numerically Sparse Matrices COLT 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021 Coded Sequential Matrix Multiplication For Straggler Mitigation NeurIPS 2020 Sample complexity bounds for localized sketching AISTATS 2020 What if Neural Networks had SVDs? NeurIPS 2020 Exact Gaussian Processes on a Million Data Points NeurIPS 2019 Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices JMLR 2019 Provably Powerful Graph Networks NeurIPS 2019