{"total":56,"rows":[{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","cited_by_count":21,"area":null},{"id":"2105.14016","title":"Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model","created":"2021-05-28","cited_by_count":18,"area":null},{"id":"2212.09961","title":"Uncertainty Quantification of MLE for Entity Ranking with Covariates","created":"2022-12-20","cited_by_count":16,"area":null},{"id":"2407.06172","title":"On Speeding Up Language Model Evaluation","created":"2024-07-08","cited_by_count":15,"area":null},{"id":"2106.02119","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","created":"2021-06-03","cited_by_count":13,"area":null},{"id":"2301.07040","title":"Optimal Algorithms for Latent Bandits with Cluster Structure","created":"2023-01-17","cited_by_count":12,"area":null},{"id":"2204.11516","title":"Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing","created":"2022-04-25","cited_by_count":11,"area":null},{"id":"2106.12933","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","created":"2021-06-24","cited_by_count":10,"area":null},{"id":"2310.06793","title":"Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning","created":"2023-10-10","cited_by_count":10,"area":null},{"id":"2209.03997","title":"Online Low Rank Matrix Completion","created":"2022-09-08","cited_by_count":9,"area":null},{"id":"2302.03682","title":"Approximate message passing from random initialization with applications to $\\mathbb{Z}_{2}$ synchronization","created":"2023-02-07","cited_by_count":9,"area":null},{"id":"2202.07079","title":"Synthetically Controlled Bandits","created":"2022-02-14","cited_by_count":8,"area":null},{"id":"2206.03569","title":"Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure","created":"2022-06-07","cited_by_count":7,"area":null},{"id":"2303.06198","title":"Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA","created":"2023-03-10","cited_by_count":7,"area":null},{"id":"2106.05850","title":"Matrix Completion with Model-free Weighting","created":"2021-06-09","cited_by_count":6,"area":null},{"id":"2310.06159","title":"Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization","created":"2023-10-09","cited_by_count":6,"area":null},{"id":"2106.02780","title":"Learning Treatment Effects in Panels with General Intervention Patterns","created":"2021-06-05","cited_by_count":5,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2209.08273","title":"Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity","created":"2022-09-17","cited_by_count":4,"area":null},{"id":"2210.00340","title":"Speed Up the Cold-Start Learning in Two-Sided Bandits with Many Arms","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2210.05355","title":"Multi-User Reinforcement Learning with Low Rank Rewards","created":"2022-10-11","cited_by_count":4,"area":null},{"id":"2306.13053","title":"Context-lumpable stochastic bandits","created":"2023-06-22","cited_by_count":4,"area":null},{"id":"2410.06376","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2404.17398","title":"Online Policy Learning and Inference by Matrix Completion","created":"2024-04-26","cited_by_count":3,"area":null},{"id":"2208.12063","title":"Partial Matrix Completion","created":"2022-08-25","cited_by_count":2,"area":null},{"id":"2212.08339","title":"Generalization Bounds for Inductive Matrix Completion in Low-noise Settings","created":"2022-12-16","cited_by_count":2,"area":null},{"id":"2311.03376","title":"Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints","created":"2023-10-31","cited_by_count":2,"area":null},{"id":"2403.14899","title":"Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information","created":"2024-03-22","cited_by_count":2,"area":null},{"id":"2503.00174","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","created":"2025-02-28","cited_by_count":2,"area":null},{"id":"2604.07372","title":"NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization","created":"2026-04-07","cited_by_count":2,"area":null},{"id":"2104.08026","title":"NoisyCUR: An algorithm for two-cost budgeted matrix completion","created":"2021-04-16","cited_by_count":1,"area":null},{"id":"2110.12046","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","created":"2021-10-22","cited_by_count":1,"area":null},{"id":"2211.09272","title":"A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency","created":"2022-11-17","cited_by_count":1,"area":null},{"id":"2303.10030","title":"How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?","created":"2023-03-17","cited_by_count":1,"area":null},{"id":"2311.15221","title":"The Local Landscape of Phase Retrieval Under Limited Samples","created":"2023-11-26","cited_by_count":1,"area":null},{"id":"2403.00184","title":"Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling","created":"2024-02-29","cited_by_count":1,"area":null},{"id":"2405.03063","title":"Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection","created":"2024-05-05","cited_by_count":1,"area":null},{"id":"2505.09612","title":"Adaptively-weighted Nearest Neighbors for Matrix Completion","created":"2025-05-14","cited_by_count":1,"area":null},{"id":"2601.20152","title":"Concentration Inequalities for Exchangeable Tensors and Matrix-valued Data","created":"2026-01-28","cited_by_count":1,"area":null},{"id":"2111.06302","title":"On Recovering the Best Rank-r Approximation from Few Entries","created":"2021-11-11","cited_by_count":0,"area":null},{"id":"2202.04061","title":"Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2302.05865","title":"Flag Aggregator: Scalable Distributed Training under Failures and Augmented Losses using Convex Optimization","created":"2023-02-12","cited_by_count":0,"area":null},{"id":"2310.01326","title":"Optimal Estimator for Linear Regression with Shuffled Labels","created":"2023-10-02","cited_by_count":0,"area":null},{"id":"2402.02459","title":"On Minimum Trace Factor Analysis -- An Old Song Sung to a New Tune","created":"2024-02-04","cited_by_count":0,"area":null},{"id":"2406.04588","title":"Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2406.05633","title":"Heterogeneous Treatment Effects in Panel Data","created":"2024-06-09","cited_by_count":0,"area":null},{"id":"2408.05843","title":"Online Matrix Completion: A Collaborative Approach with Hott Items","created":"2024-08-11","cited_by_count":0,"area":null},{"id":"2412.10005","title":"Matrix Completion via Residual Spectral Matching","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2501.07437","title":"Pairwise Comparisons without Stochastic Transitivity: Model, Theory and Applications","created":"2025-01-13","cited_by_count":0,"area":null},{"id":"2502.00320","title":"$k$-SVD with Gradient Descent","created":"2025-02-01","cited_by_count":0,"area":null},{"id":"2508.00091","title":"Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness","created":"2025-07-31","cited_by_count":0,"area":null},{"id":"2508.09685","title":"Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2511.13049","title":"Generalization Bounds for Semi-supervised Matrix Completion with Distributional Side Information","created":"2025-11-17","cited_by_count":0,"area":null},{"id":"2604.00060","title":"Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2605.17189","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","created":"2026-05-16","cited_by_count":0,"area":null},{"id":"2609.24501","title":"Tensor Completion using Subspace Information","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}