2 citations · 5 across the 4 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CL2021
LEAP: Learnable Pruning for Transformer-based Models
Zhewei Yao, Xiaoxia Wu, Linjian Ma +4
Pruning is an effective method to reduce the memory footprint and computational cost associated with large natural language processing models. However, current pruning algorithms e…
cs.CE2021
Low Rank Approximation in Simulations of Quantum Algorithms
Linjian Ma, Chao Yang
Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, so…
math.NA2021
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions
Linjian Ma, Edgar Solomonik
Low-rank Tucker and CP tensor decompositions are powerful tools in data analytics. The widely used alternating least squares (ALS) method, which solves a sequence of over-determine…