Co-occurring keywords · papers mentioning both
Papers
Sample Average Approximation for Conditional Stochastic Optimization with Dependent Data
ICML 2024
Sample Complexity Bounds for Estimating Probability Divergences under Invariances
ICML 2024
Sample Complexity Characterization for Linear Contextual MDPs
AISTATS 2024
Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
NeurIPS 2024
Sample Complexity of Interventional Causal Representation Learning
NeurIPS 2024
Sample Complexity of Neural Policy Mirror Descent for Policy Optimization on Low-Dimensional Manifolds
JMLR 2024
Sample Complexity of Posted Pricing for a Single Item
NeurIPS 2024
Sample Complexity of Variance-Reduced Distributionally Robust Q-Learning
JMLR 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning
NeurIPS 2024
Sample-Efficient Agnostic Boosting
NeurIPS 2024
Sample-Efficient Constrained Reinforcement Learning with General Parameterization
NeurIPS 2024
Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data
ICLR 2024
Sample-Efficient Personalization: Modeling User Parameters as Low Rank Plus Sparse Components
AISTATS 2024
Sample-Efficient Private Learning of Mixtures of Gaussians
NeurIPS 2024
Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge
AAAI 2024
Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
ICML 2024
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity
COLT 2024
Semi-supervised Group DRO: Combating Sparsity with Unlabeled Data
ALT 2024
Sequential learning of the Pareto front for multi-objective bandits
AISTATS 2024
Settling the sample complexity of online reinforcement learning
COLT 2024
SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problem
ICLR 2024
Single-Trajectory Distributionally Robust Reinforcement Learning
ICML 2024
Sliding Down the Stairs: How Correlated Latent Variables Accelerate Learning with Neural Networks
ICML 2024
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
COLT 2024
Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
ICLR 2024