default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinjian Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Zhenan Shao, Linjian Ma, Bo Li, Diane M. Beck:
Leveraging the Human Ventral Visual Stream to Improve Neural Network Robustness. CoRR abs/2405.02564 (2024)- [i11]Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik:
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. CoRR abs/2406.09769 (2024) - 2023
- [c8]Shan Cao, Qingfeng Wu, Linjian Ma:
TongueSAM: An Universal Tongue Segmentation Model Based on SAM with Zero-Shot. BIBM 2023: 4520-4526 - [c7]Yingdong Wang
, Qingfeng Wu, Weiqiang Lin, Linjian Ma, Ying Li:
MVARN: Multi-view Attention Relation Network for Figure Question Answering. KSEM (3) 2023: 30-38 - 2022
- [j3]Linjian Ma, Chao Yang:
Low rank approximation in simulations of quantum algorithms. J. Comput. Sci. 59: 101561 (2022) - [j2]Linjian Ma, Edgar Solomonik:
Accelerating alternating least squares for tensor decomposition by pairwise perturbation. Numer. Linear Algebra Appl. 29(4) (2022) - [c6]Linjian Ma, Edgar Solomonik:
Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs. NeurIPS 2022 - [i10]Linjian Ma, Edgar Solomonik:
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs. CoRR abs/2205.13163 (2022) - 2021
- [j1]Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik:
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition. SIAM J. Sci. Comput. 43(4): C290-C311 (2021) - [c5]Linjian Ma, Edgar Solomonik:
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. IPDPS 2021: 412-421 - [c4]Linjian Ma, Edgar Solomonik:
Fast and accurate randomized algorithms for low-rank tensor decompositions. NeurIPS 2021: 24299-24312 - [i9]Linjian Ma, Edgar Solomonik:
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions. CoRR abs/2104.01101 (2021) - [i8]Linjian Ma, Chao Yang:
Low Rank Approximation in Simulations of Quantum Algorithms. CoRR abs/2104.11396 (2021) - [i7]Zhewei Yao, Linjian Ma, Sheng Shen, Kurt Keutzer, Michael W. Mahoney:
MLPruning: A Multilevel Structured Pruning Framework for Transformer-based Models. CoRR abs/2105.14636 (2021) - 2020
- [c3]Linjian Ma, Jiayu Ye, Edgar Solomonik:
AutoHOOT: Automatic High-Order Optimization for Tensors. PACT 2020: 125-137 - [c2]Linjian Ma, Gabe Montague, Jiayu Ye, Zhewei Yao, Amir Gholami, Kurt Keutzer, Michael W. Mahoney:
Inefficiency of K-FAC for Large Batch Size Training. AAAI 2020: 5053-5060 - [c1]Sheng Shen, Zhen Dong, Jiayu Ye, Linjian Ma, Zhewei Yao, Amir Gholami, Michael W. Mahoney, Kurt Keutzer:
Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT. AAAI 2020: 8815-8821 - [i6]Linjian Ma, Jiayu Ye, Edgar Solomonik:
AutoHOOT: Automatic High-Order Optimization for Tensors. CoRR abs/2005.04540 (2020) - [i5]Linjian Ma, Edgar Solomonik:
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. CoRR abs/2010.12056 (2020)
2010 – 2019
- 2019
- [i4]Linjian Ma, Gabe Montague, Jiayu Ye, Zhewei Yao, Amir Gholami, Kurt Keutzer, Michael W. Mahoney:
Inefficiency of K-FAC for Large Batch Size Training. CoRR abs/1903.06237 (2019) - [i3]Sheng Shen, Zhen Dong, Jiayu Ye, Linjian Ma, Zhewei Yao, Amir Gholami, Michael W. Mahoney, Kurt Keutzer:
Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT. CoRR abs/1909.05840 (2019) - [i2]Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik:
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition. CoRR abs/1910.12331 (2019) - 2018
- [i1]Linjian Ma, Edgar Solomonik:
Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation. CoRR abs/1811.10573 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
