sample complexity

Choosing the p in Lp Loss: Adaptive Rates for Symmetric Mean Estimation COLT 2024 Clustering Items From Adaptively Collected Inconsistent Feedback AISTATS 2024 Combinatorial Causal Bandits without Graph Skeleton ACML 2024 Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints AISTATS 2024 Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression COLT 2024 Computational-Statistical Gaps in Gaussian Single-Index Models (Extended Abstract) COLT 2024 Confident Natural Policy Gradient for Local Planning in q_π-realizable Constrained MDPs NeurIPS 2024 Consistency of Neural Causal Partial Identification NeurIPS 2024 Decentralized Online Learning in General-Sum Stackelberg Games UAI 2024 Demonstration-Regularized RL ICLR 2024 Depth Separation in Norm-Bounded Infinite-Width Neural Networks COLT 2024 Derandomizing Multi-Distribution Learning NeurIPS 2024 Dimension-free Private Mean Estimation for Anisotropic Distributions NeurIPS 2024 Dissimilarity Bandits AISTATS 2024 Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity JMLR 2024 Distributionally Robust Model-based Reinforcement Learning with Large State Spaces AISTATS 2024 Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms NeurIPS 2024 Distributional Preference Alignment of LLMs via Optimal Transport NeurIPS 2024 Distribution Learning with Valid Outputs Beyond the Worst-Case NeurIPS 2024 Efficient Algorithms for Learning Monophonic Halfspaces in Graphs COLT 2024 Efficiently Learning One-Hidden-Layer ReLU Networks via SchurPolynomials COLT 2024 Eliciting Kemeny Rankings AAAI 2024 Entropy testing and its application to testing Bayesian networks NeurIPS 2024 Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits ICML 2024 Faster Maximum Inner Product Search in High Dimensions ICML 2024