Co-occurring keywords · papers mentioning both
Papers
Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
COLT 2026
Learning depth-3 circuits via quantum agnostic boosting
COLT 2026
Learning with Simulators: No Regret in a Computationally Bounded World
COLT 2026
Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
COLT 2026
Matrix Completion with Incomplete Side Information via Orthogonal Complement Projection
ICML 2025
Sampling Boundary for Causal Effect Estimation
ACML 2025
Bagging is an Optimal PAC Learner (Extended Abstract)
IJCAI 2024
On the Computability of Robust PAC Learning
COLT 2024
Probably approximately correct stability of allocations in uncertain coalitional games with private sampling
L4DC 2024
Realizable Learning is All You Need
COLT 2022
Supervised learning through the lens of compression
NeurIPS 2016
Probably Approximately Correct MDP Learning and Control With Temporal Logic Constraints
RSS 2014
Predictive PAC Learning and Process Decompositions
NeurIPS 2013