default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanQin Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]HanQin Cai
, Zehan Chao, Longxiu Huang, Deanna Needell:
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptions. SIAM J. Imaging Sci. 17(1): 225-247 (2024)- [j9]Xinyu Chen, Zhanhong Cheng, HanQin Cai, Nicolas Saunier, Lijun Sun:
Laplacian Convolutional Representation for Traffic Time Series Imputation. IEEE Trans. Knowl. Data Eng. 36(11): 6490-6502 (2024) - [c7]HanQin Cai, Longxiu Huang, Chandra Kundu, Bowen Su:
On the Robustness of Cross-Concentrated Sampling for Matrix Completion. CISS 2024: 1-5 - [i22]HanQin Cai, Longxiu Huang, Chandra Kundu, Bowen Su:
On the Robustness of Cross-Concentrated Sampling for Matrix Completion. CoRR abs/2401.15566 (2024) - [i21]HanQin Cai, Longxiu Huang, Xiliang Lu, Juntao You:
Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent. CoRR abs/2406.07409 (2024) - [i20]Bowen Su, Juntao You, HanQin Cai, Longxiu Huang:
Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion. CoRR abs/2406.11092 (2024) - [i19]Xue Wang, Tian Zhou, Jianqing Zhu, Jialin Liu, Kun Yuan, Tao Yao, Wotao Yin, Rong Jin, HanQin Cai:
S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching. CoRR abs/2408.08567 (2024) - [i18]Xinyu Chen, HanQin Cai, Fuqiang Liu, Jinhua Zhao:
Correlating Time Series with Interpretable Convolutional Kernels. CoRR abs/2409.01362 (2024) - 2023
- [j8]HanQin Cai, Longxiu Huang, Pengyu Li, Deanna Needell:
Matrix Completion With Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling. IEEE Trans. Pattern Anal. Mach. Intell. 45(8): 10100-10113 (2023) - [j7]HanQin Cai, Jian-Feng Cai, Juntao You:
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion. SIAM J. Sci. Comput. 45(3): 1172-1198 (2023) - [c6]Zheng Tan, Longxiu Huang, HanQin Cai, Yifei Lou:
Non-Convex Approaches for Low-Rank Tensor Completion under Tubal Sampling. ICASSP 2023: 1-5 - [c5]Jialin Liu, Xiaohan Chen, Zhangyang Wang, Wotao Yin, HanQin Cai:
Towards Constituting Mathematical Structures for Learning to Optimize. ICML 2023: 21426-21449 - [i17]Zheng Tan, Longxiu Huang, HanQin Cai, Yifei Lou:
Non-convex approaches for low-rank tensor completion under tubal sampling. CoRR abs/2303.12721 (2023) - [i16]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption. CoRR abs/2305.04080 (2023) - [i15]Jialin Liu, Xiaohan Chen, Zhangyang Wang, Wotao Yin, HanQin Cai:
Towards Constituting Mathematical Structures for Learning to Optimize. CoRR abs/2305.18577 (2023) - 2022
- [j6]HanQin Cai, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. SIAM J. Optim. 32(2): 687-714 (2022) - [c4]Keaton Hamm, Mohamed Meskini, HanQin Cai:
Riemannian CUR Decompositions for Robust Principal Component Analysis. TAG-ML 2022: 152-160 - [i14]HanQin Cai, Jian-Feng Cai, Juntao You:
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion. CoRR abs/2204.03316 (2022) - [i13]Keaton Hamm, Mohamed Meskini, HanQin Cai:
Riemannian CUR Decompositions for Robust Principal Component Analysis. CoRR abs/2206.09042 (2022) - [i12]HanQin Cai, Longxiu Huang, Pengyu Li, Deanna Needell:
Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling. CoRR abs/2208.09723 (2022) - 2021
- [j5]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions. J. Mach. Learn. Res. 22: 185:1-185:36 (2021) - [j4]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. SIAM J. Imaging Sci. 14(4): 1472-1503 (2021) - [j3]HanQin Cai, Keaton Hamm, Longxiu Huang, Jiaqi Li, Tao Wang:
Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation. IEEE Signal Process. Lett. 28: 116-120 (2021) - [j2]HanQin Cai, Jian-Feng Cai, Tianming Wang, Guojian Yin:
Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery. IEEE Trans. Signal Process. 69: 809-821 (2021) - [c3]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition *. ICCVW 2021: 189-197 - [c2]HanQin Cai, Yuchen Lou, Daniel McKenzie, Wotao Yin:
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization. ICML 2021: 1193-1203 - [c1]HanQin Cai, Jialin Liu, Wotao Yin:
Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection. NeurIPS 2021: 16977-16989 - [i11]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. CoRR abs/2101.05231 (2021) - [i10]HanQin Cai, Yuchen Lou, Daniel McKenzie, Wotao Yin:
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization. CoRR abs/2102.10707 (2021) - [i9]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions. CoRR abs/2103.11037 (2021) - [i8]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition. CoRR abs/2108.10448 (2021) - [i7]Bum-Su Kim, HanQin Cai, Daniel McKenzie, Wotao Yin:
Curvature-Aware Derivative-Free Optimization. CoRR abs/2109.13391 (2021) - [i6]HanQin Cai, Jialin Liu, Wotao Yin:
Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection. CoRR abs/2110.05649 (2021) - 2020
- [i5]HanQin Cai, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. CoRR abs/2003.13001 (2020) - [i4]HanQin Cai, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
SCOBO: Sparsity-Aware Comparison Oracle Based Optimization. CoRR abs/2010.02479 (2020) - [i3]HanQin Cai, Keaton Hamm, Longxiu Huang, Jiaqi Li, Tao Wang:
Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation. CoRR abs/2010.07422 (2020)
2010 – 2019
- 2019
- [j1]HanQin Cai, Jian-Feng Cai, Ke Wei:
Accelerated Alternating Projections for Robust Principal Component Analysis. J. Mach. Learn. Res. 20: 20:1-20:33 (2019) - [i2]HanQin Cai, Jian-Feng Cai, Tianming Wang, Guojian Yin:
Fast and Robust Spectrally Sparse Signal Recovery: A Provable Non-Convex Approach via Robust Low-Rank Hankel Matrix Reconstruction. CoRR abs/1910.05859 (2019) - 2017
- [i1]HanQin Cai, Jian-Feng Cai, Ke Wei:
Accelerated Alternating Projections for Robust Principal Component Analysis. CoRR abs/1711.05519 (2017)
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-23 20:36 CEST 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:
