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...

On-Line Portfolio Selection Using Multiplicative Updates

Mathematical finance, 1998-10, Vol.8 (4), p.325-347

1998

Volltextzugriff (PDF)

A Generalized Representer Theorem

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

2001

Volltextzugriff (PDF)

Discrete Prediction Games with Arbitrary Feedback and Loss

Computational Learning Theory, 2001, Vol.2111, p.208-223

2001

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)

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)

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)

On Using Extended Statistical Queries to Avoid Membership Queries

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

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)

On Learning Monotone DNF under Product Distributions

Computational Learning Theory, 2001, Vol.2111, p.558-573

2001

Volltextzugriff (PDF)

On Agnostic Learning with {0, ∗, 1}-Valued and Real-Valued Hypotheses

Computational Learning Theory, 2001, Vol.2111, p.289-302

2001

Volltextzugriff (PDF)

A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning

Computational Learning Theory, 2001, Vol.2111, p.65-81

2001

Volltextzugriff (PDF)

Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments

Computational Learning Theory, 2001, Vol.2111, p.128-142

2001

Volltextzugriff (PDF)

How Many Queries Are Needed to Learn One Bit of Information?

Computational Learning Theory, 2001, Vol.2111, p.1-13

2001

Volltextzugriff (PDF)

1 – 25 von 33

Suche als RSS-Feed

Aktive Filter

ThemaMathematics, Applied

KollektionIngentaConnect Journals

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(33)
Mit Volltextzugriff
(33)

Publikationsform

Buchkapitel
(31)
Artikel
(2)

Sprache

Englisch
(33)

Erscheinungsjahr

n.n

Thema

Science & Technology
(32)
Applied Sciences
(31)
Computer Science
(31)
Computer Science, Artificial Intelligence
(31)
Computer Science, Theory & Methods
(31)
Exact Sciences And Technology
(31)
Technology
(31)
Artificial Intelligence
(30)
Computer Science; Control Theory; Systems
(30)
Learning And Adaptive Systems
(29)
Markov Decision Process
(3)
Average Reward
(2)
Concept Class
(2)
Convex Combination
(2)
Convex Hull
(2)
Empirical Measure
(2)
Generalization Error
(2)
Half Space
(2)
Homogeneous Half Space
(2)
Inductive Inference
(2)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

Menü

Weitere Dienste

Einstellungen

On-Line Portfolio Selection Using Multiplicative Updates

A Generalized Representer Theorem

Discrete Prediction Games with Arbitrary Feedback and Loss

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

Agnostic Boosting

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

Learning Rates for Q-Learning

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

On Using Extended Statistical Queries to Avoid Membership Queries

Efficiently Approximating Weighted Sums with Exponentially Many Terms

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

On Learning Monotone DNF under Product Distributions

On Agnostic Learning with {0, ∗, 1}-Valued and Real-Valued Hypotheses

A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning

Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments

How Many Queries Are Needed to Learn One Bit of Information?

Aktive Filter

Suchergebnisse filtern