Skip to content
conftrace_

sample complexity

1,587 papers

Papers

Identification of mixtures of discrete product distributions in near-optimal sample and time complexity COLT 2024 Identifying Copeland Winners in Dueling Bandits with Indifferences AISTATS 2024 Improved High-Probability Bounds for the Temporal Difference Learning Algorithm via Exponential Stability COLT 2024 Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes AISTATS 2024 Improved Sample Complexity Bounds for Diffusion Model Training NeurIPS 2024 Improved Sample Complexity for Multiclass PAC Learning NeurIPS 2024 Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games ICML 2024 Increasing information for model predictive control with semi-Markov decision processes L4DC 2024 Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs AISTATS 2024 Inherent limitations of dimensions for characterizing learnability of distribution classes COLT 2024 Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares Extended Abstract COLT 2024 Is Behavior Cloning All You Need? Understanding Horizon in Imitation Learning NeurIPS 2024 Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"? COLT 2024 Is Inverse Reinforcement Learning Harder than Standard Reinforcement Learning? A Theoretical Perspective ICML 2024 Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps COLT 2024 Learnability Gaps of Strategic Classification COLT 2024 Learning Accurate and Interpretable Decision Trees UAI 2024 Learning and Transferring Sparse Contextual Bigrams with Linear Transformers NeurIPS 2024 Learning bounded-degree polytrees with known skeleton ALT 2024 Learning Coalition Structures with Games AAAI 2024 Learning Conditional Invariances through Non-Commutativity ICLR 2024 Learning Cut Generating Functions for Integer Programming NeurIPS 2024 Learning from higher-order correlations, efficiently: hypothesis tests, random features, and neural networks NeurIPS 2024 Learning Hierarchical Polynomials with Three-Layer Neural Networks ICLR 2024 Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds COLT 2024