{"total":32,"rows":[{"id":"2105.08306","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","created":"2021-05-18","cited_by_count":25,"area":null},{"id":"2401.07298","title":"Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems","created":"2024-01-14","cited_by_count":20,"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":"2402.11156","title":"Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2108.11124","title":"Inductive Matrix Completion Using Graph Autoencoder","created":"2021-08-25","cited_by_count":9,"area":null},{"id":"2110.03975","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","created":"2021-10-08","cited_by_count":6,"area":null},{"id":"2104.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"area":null},{"id":"2110.13969","title":"Nonparametric Matrix Estimation with One-Sided Covariates","created":"2021-10-26","cited_by_count":5,"area":null},{"id":"2205.05957","title":"Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction","created":"2022-05-12","cited_by_count":5,"area":null},{"id":"2201.13052","title":"Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2306.00342","title":"Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks","created":"2023-06-01","cited_by_count":4,"area":null},{"id":"2309.11516","title":"Private Matrix Factorization with Public Item Features","created":"2023-09-17","cited_by_count":3,"area":null},{"id":"2505.22602","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","created":"2025-05-28","cited_by_count":3,"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":"2303.15946","title":"Item Graph Convolution Collaborative Filtering for Inductive Recommendations","created":"2023-03-28","cited_by_count":2,"area":null},{"id":"2402.03954","title":"Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness","created":"2024-02-06","cited_by_count":2,"area":null},{"id":"2102.05249","title":"Policy Augmentation: An Exploration Strategy for Faster Convergence of Deep Reinforcement Learning Algorithms","created":"2021-02-10","cited_by_count":1,"area":null},{"id":"2206.12486","title":"Variational Bayesian inference for CP tensor completion with side information","created":"2022-06-24","cited_by_count":1,"area":null},{"id":"2302.03933","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2405.03651","title":"Adaptive Retrieval and Scalable Indexing for k-NN Search with Cross-Encoders","created":"2024-05-06","cited_by_count":1,"area":null},{"id":"2411.12965","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","created":"2024-11-20","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":"2603.11304","title":"Worst-case low-rank approximations","created":"2026-03-11","cited_by_count":1,"area":null},{"id":"2605.07075","title":"ModelLens: Finding the Best for Your Task from Myriads of Models","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2102.03674","title":"Generating Artificial Core Users for Interpretable Condensed Data","created":"2021-02-06","cited_by_count":0,"area":null},{"id":"2112.06362","title":"Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards","created":"2021-12-13","cited_by_count":0,"area":null},{"id":"2201.08516","title":"LRSVRG-IMC: An SVRG-Based Algorithm for LowRank Inductive Matrix Completion","created":"2022-01-21","cited_by_count":0,"area":null},{"id":"2208.04312","title":"NRBdMF: A recommendation algorithm for predicting drug effects considering directionality","created":"2022-08-05","cited_by_count":0,"area":null},{"id":"2502.04758","title":"Differential Privacy of Quantum and Quantum-Inspired Classical Recommendation Algorithms","created":"2025-02-07","cited_by_count":0,"area":null},{"id":"2603.24833","title":"Robust Matrix Estimation with Side Information","created":"2026-03-25","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":"2605.20559","title":"Group-Aware Matrix Estimation and Latent Subspace Recovery","created":"2026-05-19","cited_by_count":0,"area":null}],"next_cursor":null}