UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A Generalized Representer Theorem

Computational Learning Theory, 2001, Vol.2111, p.416-426

2001

Volltextzugriff (PDF)

Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

Computational Learning Theory, 2001, Vol.2111, p.224-240

2001

Volltextzugriff (PDF)

A geometric approach to leveraging weak learners

Theoretical computer science, 2002-07, Vol.284 (1), p.67-108

2002

Volltextzugriff (PDF)

Learning Additive Models Online with Fast Evaluating Kernels

Computational Learning Theory, 2001, Vol.2111, p.444-460

2001

Volltextzugriff (PDF)

Optimizing Average Reward Using Discounted Rewards

Computational Learning Theory, 2001, Vol.2111, p.605-615

2001

Volltextzugriff (PDF)

Pattern Recognition and Density Estimation under the General i.i.d. Assumption

Computational Learning Theory, 2001, Vol.2111, p.337-353

2001

Volltextzugriff (PDF)

Smooth Boosting and Learning with Malicious Noise

Computational Learning Theory, 2001, Vol.2111, p.473-489

2001

Volltextzugriff (PDF)

Ultraconservative Online Algorithms for Multiclass Problems

Computational Learning Theory, 2001, Vol.2111, p.99-115

2001

Volltextzugriff (PDF)

Agnostic Boosting

Computational Learning Theory, 2001, Vol.2111, p.507-516

2001

Volltextzugriff (PDF)

A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning

Computational Learning Theory, 2001, Vol.2111, p.427-443

2001

Volltextzugriff (PDF)

Learning Rates for Q-Learning

Computational Learning Theory, 2001, Vol.2111, p.589-604

2001

Volltextzugriff (PDF)

Strong Entropy Concentration, Game Theory, and Algorithmic Randomness

Computational Learning Theory, 2001, Vol.2111, p.320-336

2001

Volltextzugriff (PDF)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces

Computational Learning Theory, 2001, Vol.2111, p.402-415

2001

Volltextzugriff (PDF)

Geometric Bounds for Generalization in Boosting

Computational Learning Theory, 2001, Vol.2111, p.461-472

2001

Volltextzugriff (PDF)

Bounds on Sample Size for Policy Evaluation in Markov Environments

Computational Learning Theory, 2001, Vol.2111, p.616-629

2001

Volltextzugriff (PDF)

Learning Regular Sets with an Incomplete Membership Oracle

Computational Learning Theory, 2001, Vol.2111, p.574-588

2001

Volltextzugriff (PDF)

Limitations of Learning via Embeddings in Euclidean Half-Spaces

Computational Learning Theory, 2001, Vol.2111, p.385-401

2001

Volltextzugriff (PDF)

On Boosting with Optimal Poly-Bounded Distributions

Computational Learning Theory, 2001, Vol.2111, p.490-506

2001

Volltextzugriff (PDF)

A General Dimension for Exact Learning

Computational Learning Theory, 2001, Vol.2111, p.354-367

2001

Volltextzugriff (PDF)

On the Synthesis of Strategies Identifying Recursive Functions

Computational Learning Theory, 2001, Vol.2111, p.160-176

2001

Volltextzugriff (PDF)

Toward a Computational Theory of Data Acquisition and Truthing

Computational Learning Theory, 2001, Vol.2111, p.194-207

2001

Volltextzugriff (PDF)

On Using Extended Statistical Queries to Avoid Membership Queries

Computational Learning Theory, 2001, Vol.2111, p.529-545

2001

Volltextzugriff (PDF)

When Can Two Unsupervised Learners Achieve PAC Separation?

Computational Learning Theory, 2001, Vol.2111, p.303-319

2001

Volltextzugriff (PDF)

Efficiently Approximating Weighted Sums with Exponentially Many Terms

Computational Learning Theory, 2001, Vol.2111, p.82-98

2001

Volltextzugriff (PDF)

Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries

Computational Learning Theory, 2001, Vol.2111, p.546-557

2001

Volltextzugriff (PDF)

1 – 25 von 39

Menü

Weitere Dienste

Einstellungen

A Generalized Representer Theorem

Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

A geometric approach to leveraging weak learners

Learning Additive Models Online with Fast Evaluating Kernels

Optimizing Average Reward Using Discounted Rewards

Pattern Recognition and Density Estimation under the General i.i.d. Assumption

Smooth Boosting and Learning with Malicious Noise

Ultraconservative Online Algorithms for Multiclass Problems

Agnostic Boosting

A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning

Learning Rates for Q-Learning

Strong Entropy Concentration, Game Theory, and Algorithmic Randomness

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces

Geometric Bounds for Generalization in Boosting

Bounds on Sample Size for Policy Evaluation in Markov Environments

Learning Regular Sets with an Incomplete Membership Oracle

Limitations of Learning via Embeddings in Euclidean Half-Spaces

On Boosting with Optimal Poly-Bounded Distributions

A General Dimension for Exact Learning

On the Synthesis of Strategies Identifying Recursive Functions

Toward a Computational Theory of Data Acquisition and Truthing

On Using Extended Statistical Queries to Avoid Membership Queries

When Can Two Unsupervised Learners Achieve PAC Separation?

Efficiently Approximating Weighted Sums with Exponentially Many Terms

Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries

Aktive Filter

Suchergebnisse filtern