Pages that link to "Item:Q2328061"
From MaRDI portal
The following pages link to Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model (Q2328061):
Displaying 6 items.
- Statistical estimation of ergodic Markov chain kernel over discrete state space (Q2214258) (← links)
- Best lower bound on the probability of a binomial exceeding its expectation (Q2244539) (← links)
- (Q4614114) (← links)
- A Lower Bound for Agnostically Learning Disjunctions (Q5434065) (← links)
- A remark about a learning risk lower bound (Q6067523) (← links)
- Out-of-distributional risk bounds for neural operators with applications to the Helmholtz equation (Q6572185) (← links)