✦ LIBER ✦

Tight bounds for the probability of overfitting

✍ Scribed by K. V. Vorontsov

Book ID: 111454966
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 183 KB
Volume: 80
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562409060032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact combinatorial bounds on the probab

Exact combinatorial bounds on the probability of overfitting for empirical risk minimization

✍ K. V. Vorontsov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 437 KB

Combinatorial probability and the tightn

Combinatorial probability and the tightness of generalization bounds

✍ K. V. Vorontsov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 365 KB

Exact estimates of the probability of ov

Exact estimates of the probability of overfitting for multidimensional modeling families of algorithms

✍ P. V. Botov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 521 KB

Toward a tight upper bound for the error

Toward a tight upper bound for the error probability of the binary Gaussian classification problem

✍ Moataz M.H. El Ayadi; Mohamed S. Kamel; Fakhri Karray 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Tight upper bounds for the discrepancy o

Tight upper bounds for the discrepancy of half-spaces

✍ J. Matoušek 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 441 KB

Tight Bounds for the Maximum Acyclic Sub

Tight Bounds for the Maximum Acyclic Subgraph Problem

✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph