{"total":20,"rows":[{"id":"2112.03548","title":"Private Robust Estimation by Stabilizing Convex Relaxations","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2310.02243","title":"Learning quantum Hamiltonians at any temperature in polynomial time","created":"2023-10-03","cited_by_count":23,"area":null},{"id":"2106.00058","title":"Stable and Interpretable Unrolled Dictionary Learning","created":"2021-05-31","cited_by_count":15,"area":null},{"id":"2410.21194","title":"SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications","created":"2024-10-28","cited_by_count":10,"area":null},{"id":"2206.10942","title":"List-Decodable Covariance Estimation","created":"2022-06-22","cited_by_count":8,"area":null},{"id":"2101.01509","title":"SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation","created":"2021-01-05","cited_by_count":7,"area":null},{"id":"2203.02790","title":"A Robust Spectral Algorithm for Overcomplete Tensor Decomposition","created":"2022-03-05","cited_by_count":7,"area":null},{"id":"2210.12816","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","created":"2022-10-23","cited_by_count":6,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2212.13597","title":"Optimal Regularization for a Data Source","created":"2022-12-27","cited_by_count":6,"area":null},{"id":"2202.06442","title":"Fast algorithm for overcomplete order-3 tensor decomposition","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2302.09347","title":"Closed-Loop Transcription via Convolutional Sparse Coding","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2210.10855","title":"Dictionary Learning for the Almost-Linear Sparsity Regime","created":"2022-10-19","cited_by_count":3,"area":null},{"id":"2211.03827","title":"Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models","created":"2022-11-07","cited_by_count":3,"area":null},{"id":"2408.16852","title":"The Star Geometry of Critic-Based Regularizer Learning","created":"2024-08-29","cited_by_count":3,"area":null},{"id":"2101.08310","title":"Non-Convex Compressed Sensing with Training Data","created":"2021-01-20","cited_by_count":1,"area":null},{"id":"2304.01768","title":"Convergence of alternating minimisation algorithms for dictionary learning","created":"2023-04-04","cited_by_count":1,"area":null},{"id":"2302.02548","title":"Learning Trees of $\\ell_0$-Minimization Problems","created":"2023-02-06","cited_by_count":0,"area":null},{"id":"2411.01721","title":"Computational Lower Bounds for Regret Minimization in Normal-Form Games","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2609.23812","title":"Iterative Atom Refinement: A Monotonicity Principle for Dictionary Learning","created":"2026-09-20","cited_by_count":0,"area":null}],"next_cursor":null}