Author of the publication

Low-Complexity Levenberg-Marquardt Algorithm for Tensor Canonical Polyadic Decomposition.

, and . ICASSP, page 3922-3926. IEEE, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms., , , and . NeurIPS, page 7845-7855. (2019)Finding Second-Order Stationary Points Efficiently in Smooth Nonconvex Linearly Constrained Optimization Problems., , , , and . NeurIPS, (2020)Vulture: VULnerabilities in impuTing drUg REsistance., , , and . BCB, page 56:1-56:6. ACM, (2023)Detecting Overlapping and Correlated Communities without Pure Nodes: Identifiability and Algorithm., and . ICML, volume 97 of Proceedings of Machine Learning Research, page 2859-2868. PMLR, (2019)Perturbed Projected Gradient Descent Converges to Approximate Second-order Points for Bound Constrained Nonconvex Problems., , , and . ICASSP, page 5356-5360. IEEE, (2019)Streaming Tensor Factorization for Infinite Data Sources., , , and . SDM, page 81-89. SIAM, (2018)Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér-Rao Bound., , , , and . CoRR, (2015)Joint Tensor Factorization and Outlying Slab Suppression With Applications., , , , and . IEEE Trans. Signal Process., 63 (23): 6315-6328 (2015)Volume-Regularized Nonnegative Tucker Decomposition with Identifiability Guarantees., and . ICASSP, page 1-5. IEEE, (2023)Block-Term Tensor Decomposition Via Constrained Matrix Factorization., and . MLSP, page 1-6. IEEE, (2019)