Co-occurring keywords · papers mentioning both
Papers
A Fine-grained Characterization of PAC Learnability
COLT 2025
Are Multiple Instance Learning Algorithms Learnable for Instances?
NeurIPS 2024
Inherent limitations of dimensions for characterizing learnability of distribution classes
COLT 2024
Learning Neural Networks with Sparse Activations
COLT 2024
On the (In)feasibility of ML Backdoor Detection as an Hypothesis Testing Problem
AISTATS 2024
Trustworthy Actionable Perturbations
ICML 2024
Understanding Server-Assisted Federated Learning in the Presence of Incomplete Client Participation
ICML 2024
Adversarially Robust PAC Learnability of Real-Valued Functions
ICML 2023
Find a witness or shatter: the landscape of computable PAC learning.
COLT 2023
PAC Learning and Stabilizing Hedonic Games: Towards a Unifying Approach.
AAAI 2023
Universal Rates for Multiclass Learning
COLT 2023
A Theory of PAC Learnability under Transformation Invariances
NeurIPS 2022
Faster Fundamental Graph Algorithms via Learned Predictions
ICML 2022
On characterizations of learnability with computable learners
COLT 2022
Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes
NeurIPS 2022
Learning and certification under instance-targeted poisoning
UAI 2021
Comparing Sample-Wise Learnability across Deep Neural Network Models
AAAI 2019
Open Problem: Monotonicity of Learning
COLT 2019
PAC Learnability of Node Functions in Networked Dynamical Systems
ICML 2019
Minimizing a Submodular Function from Samples
NeurIPS 2017
Learning Influence Functions from Incomplete Observations
NeurIPS 2016
Learnability of Influence in Networks
NeurIPS 2015