Pages that link to "Item:Q4336393"
From MaRDI portal
The following pages link to Efficient agnostic learning of neural networks with bounded fan-in (Q4336393):
Displayed 19 items.
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm (Q863343) (← links)
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint (Q869974) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- Learning by mirror averaging (Q955138) (← links)
- Scale-sensitive dimensions and skeleton estimates for classification (Q1265744) (← links)
- The complexity of model classes, and smoothing noisy data (Q1274410) (← links)
- Nonlinear orthogonal series estimates for random design regression (Q1399276) (← links)
- Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression (Q1582357) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization (Q1763096) (← links)
- A note on margin-based loss functions in classification (Q1770065) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Functional aggregation for nonparametric regression. (Q1848794) (← links)
- Local greedy approximation for nonlinear regression and neural network training. (Q1848831) (← links)
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
- Approximation and learning by greedy algorithms (Q2477053) (← links)
- Boosting with early stopping: convergence and consistency (Q2583412) (← links)
- Large-Margin Classification in Infinite Neural Networks (Q3057218) (← links)