sampling complexity

An Anytime Algorithm for Good Arm Identification JMLR 2026 Fast Score-Based Sampling via Log-Concave Reductions COLT 2026 Bilevel Reinforcement Learning via the Development of Hyper-gradient without Lower-Level Convexity AISTATS 2025 Improved Convergence Rate for Diffusion Probabilistic Models ICLR 2025 Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion ICML 2025 Exponential Spectral Pursuit: An Effective Initialization Method for Sparse Phase Retrieval ICML 2024 One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently NeurIPS 2024 Statistical-Computational Trade-offs for Density Estimation NeurIPS 2024 Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion JMLR 2023 Informed Learning by Wide Neural Networks: Convergence, Generalization and Sampling Complexity ICML 2022 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem AAAI 2019 Which Factorization Machine Modeling Is Better: A Theoretical Answer with Optimal Guarantee AAAI 2019 The Information-Theoretic Requirements of Subspace Clustering with Missing Data ICML 2016 Universal Matrix Completion ICML 2014