Sample Complexity
282 papers
Papers per year
1
2
4
3
4
2
5
5
4
11
5
3
6
10
26
26
27
33
48
28
29
'10
'15
'20
'25
Papers
Outlier-Robust Linear System Identification Under Heavy-Tailed Noise
L4DC 2025
Pure Exploration with Feedback Graphs
AISTATS 2025
Rates for Offline Reinforcement Learning with Adaptively Collected Data
L4DC 2025
Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control
AISTATS 2025
Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation
UAI 2025
Sample Complexity of Linear Regression Models for Opinion Formation in Networks
AAAI 2025
Tractable Multi-Agent Reinforcement Learning through Behavioral Economics
ICLR 2025
Agnostic Active Learning of Single Index Models with Linear Sample Complexity
COLT 2024
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
COLT 2024
Computation-information gap in high-dimensional clustering
COLT 2024
Demonstration-Regularized RL
ICLR 2024
Fast Rates for Bandit PAC Multiclass Classification
NeurIPS 2024
Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithms.
UAI 2024
Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
COLT 2024
Identification of mixtures of discrete product distributions in near-optimal sample and time complexity
COLT 2024
Improved Sample Complexity for Multiclass PAC Learning
NeurIPS 2024
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps
COLT 2024
Learning Accurate and Interpretable Decision Trees
UAI 2024
Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
COLT 2024
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
NeurIPS 2024
Metalearning with Very Few Samples Per Task
COLT 2024
Minimax-optimal reward-agnostic exploration in reinforcement learning
COLT 2024
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
UAI 2024
Near-Optimal Distributionally Robust Reinforcement Learning with General L_p Norms
NeurIPS 2024
Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit
NeurIPS 2024