Co-occurring keywords · papers mentioning both
Papers
Near-Optimal Learning and Planning in Separated Latent MDPs
COLT 2024
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
AISTATS 2024
Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit
NeurIPS 2024
New Lower Bounds for Testing Monotonicity and Log Concavity of Distributions
COLT 2024
New Sample Complexity Bounds for Sample Average Approximation in Heavy-Tailed Stochastic Programming
ICML 2024
No Dimensional Sampling Coresets for Classification
ICML 2024
Occupancy-based Policy Gradient: Estimation, Convergence, and Optimality
NeurIPS 2024
Offline Reinforcement Learning: Role of State Aggregation and Trajectory Data
COLT 2024
Offline RL with Observation Histories: Analyzing and Improving Sample Complexity
ICLR 2024
On f-Divergence Principled Domain Adaptation: An Improved Framework
NeurIPS 2024
On Computationally Efficient Multi-Class Calibration
COLT 2024
On Representation Complexity of Model-based and Model-free Reinforcement Learning
ICLR 2024
On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)
NeurIPS 2024
On the Benefits of Public Representations for Private Transfer Learning under Distribution Shift
NeurIPS 2024
On the Complexity of Teaching a Family of Linear Behavior Cloning Learners
NeurIPS 2024
On the Computational Benefit of Multimodal Learning
ALT 2024
On the Empirical Complexity of Reasoning and Planning in LLMs
EMNLP 2024
On the Expressivity of Recurrent Neural Cascades
AAAI 2024
On the Role of Information Structure in Reinforcement Learning for Partially-Observable Sequential Teams and Games
NeurIPS 2024
On the Sample Complexity and Metastability of Heavy-tailed Policy Search in Continuous Control
JMLR 2024
On the sample complexity of conditional independence testing with Von Mises estimator with application to causal discovery
ICML 2024
On the sample complexity of parameter estimation in logistic regression with normal design
COLT 2024
On the sample complexity of privately learning half-spaces
ACML 2024
On the Sample Complexity of Two-Layer Networks: Lipschitz Vs. Element-Wise Lipschitz Activation
ALT 2024
On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation
AISTATS 2024