Statistical query lower bounds for tensor PCA

被引：0
|
作者：
Dudeja, Rishabh [1 ]
Hsu, Daniel [2 ]
机构：
[1] Department of Statistics, Columbia University, New York,NY,10027, United States
[2] Department of Computer Science, Columbia University, New York,NY,10027, United States
来源：
Journal of Machine Learning Research | 2021年 / 22卷
关键词：
36;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Statistical Query Lower Bounds for Tensor PCA
    Dudeja, Rishabh
    Hsu, Daniel
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [2] New lower bounds for statistical query learning
    Yang, K
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 70 (04) : 485 - 509
  • [3] Statistical-Query Lower Bounds via Functional Gradients
    Goel, Surbhi
    Gollakota, Aravind
    Klivans, Adam
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [4] Statistical Query Lower Bounds for List-Decodable Linear Regression
    Diakonikolas, Ilias
    Kane, Daniel M.
    Pensia, Ankit
    Pittas, Thanasis
    Stewart, Alistair
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021,
  • [5] STATISTICAL THRESHOLDS FOR TENSOR PCA
    Jagannath, Aukosh
    Lopatto, Patrick
    Miolane, Leo
    [J]. ANNALS OF APPLIED PROBABILITY, 2020, 30 (04): : 1910 - 1933
  • [6] A statistical model for tensor PCA
    Montanari, Andrea
    Richard, Emile
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [7] Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law
    Simchowitz, Max
    El Alaoui, Ahmed
    Recht, Benjamin
    [J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 1249 - 1259
  • [8] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [9] Quantum query algorithms and lower bounds
    Ambainis, A
    [J]. Classical and New Paradigms of Computation and Their Complexity Hierarchies, 2004, 23 : 15 - 32
  • [10] A method to prove query lower bounds
    Jagadish, M.
    Iyer, Sridhar
    [J]. ITICSE 2014 - Proceedings of the 2014 Innovation and Technology in Computer Science Education Conference, 2014, : 81 - 86
12345