Pages that link to "Item:Q1014429"

The following pages link to An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429):

Displaying 2 items.

• Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
• The regularized least squares algorithm and the problem of learning halfspaces (Q1944907) (← links)