Sample Complexity

A Distribution Testing Approach to Clustering Distributions COLT 2026 Boosting with List-Decodable Codes COLT 2026 Causal Discovery in Action: Learning Chain-Reaction Mechanisms from Interventions CLeaR 2026 Cloning is as Hard as Learning for Stabilizer States COLT 2026 Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity COLT 2026 Finite Sample Bounds for Learning with Score Matching COLT 2026 High-Accuracy Log-Concave Sampling with Stochastic Queries COLT 2026 Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach COLT 2026 Invited Open Problem: Does Differential Privacy Make PAC Learning Much Harder? COLT 2026 Learning Conditional Averages COLT 2026 Low-Degree Method Fails to Predict Robust Subspace Recovery COLT 2026 Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs (extended abstract) COLT 2026 On efficient robust regression with subquadratic samples COLT 2026 On Randomized Algorithms in Online Strategic Classification COLT 2026 Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation? COLT 2026 Probably Correct Optimal Stable Matching under Two-Sided Uncertainty UAI 2026 Query Efficient Structured Matrix Learning COLT 2026 Recovery thresholds for hidden weighted sparse graphs (extended abstract) COLT 2026 Rethinking Dataset Distillation: Hard Truths about Soft Labels CVPR 2026 Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model ALT 2026 Sample-Efficient Omniprediction for Proper Losses COLT 2026 The Role of Contextual Information in Best Arm Identification JMLR 2026 The Sample Complexity of Multiclass and Sparse Contextual Bandits COLT 2026 The Sample Complexity of Parameter-Free Stochastic Convex Optimization JMLR 2026 Tight Sample Complexity Bounds for Entropic Best Policy Identification COLT 2026