Some Implications of Interval Approach to Dimension for Network Complexity

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F22%3A00549873" target="_blank" >RIV/67985807:_____/22:00549873 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-88817-6_13" target="_blank" >http://dx.doi.org/10.1007/978-3-030-88817-6_13</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-88817-6_13" target="_blank" >10.1007/978-3-030-88817-6_13</a>

Result language

angličtina

Original language name

Some Implications of Interval Approach to Dimension for Network Complexity

Original language description

An interval approach to the concept of dimension is presented. Implications of exponentially growing quasiorthogonal dimension for estimates of network complexity are analyzed. Bounds on correlations of computational tasks represented by high-dimensional vectors are derived. Network complexity is explored from the point of view of the concentration of measure phenomenon.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA18-23827S" target="_blank" >GA18-23827S: Capabilities and limitations of shallow and deep networks</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2022

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Book/collection name

Computational Intelligence and Mathematics for Tackling Complex Problems 2

ISBN

978-3-030-88816-9

Number of pages of the result

7

Pages from-to

113-119

Number of pages of the book

238

Publisher name

Springer

Place of publication

Cham

UT code for WoS chapter

—