On definable normality
Por Mário Edmundo (Faculdade de Ciências, CMAF-CIO, Universidade de Lisboa).
Lógica
The original sin of proof-theoretic semantics
Por Bogdan Dicher (Centro de Filosofia, Universidade de Lisboa).
Intuitionism, nonstandard arithmetic and functional interpretations (part 2)
Por Bruno Dinis (Universidade de Lisboa, CMAF-CIO).
Intuitionism, nonstandard arithmetic and functional interpretations
Por Bruno Dinis (Universidade de Lisboa, CMAF-CIO).
On the fundamental theorem of statistical learning
Por Alex Usvyatsov (Universidade de Lisboa, CMAF-CIO).
Complementary logic and proof-theoretic many-valuedness
Por Gabriele Pulcini (FCT, Universidade Nova de Lisboa).
Seminários de Lógica Matemática
Pigeons do not jump high / Using o-minimality to compute lower bounds on sample complexity of neural networks (part 2)
Pigeons do not jump high 15h00
Por Ludovic Patey (Institut Camille Jordain, Lyon).
Using o-minimality to compute lower bounds on sample complexity of neural networks
Por Alex Usvyatsov (Universidade de Lisboa, CMAF-CIO).
Abstract: I will discuss the concept of sample complexity in statistical learning theory. Then I will show how definability of many hypothesis classes (for example, essentially all artificial neural networks used in practice) in o-minimal structures, helps to compute tighter lower bounds on sample complexity for these hypothesis classes.
A refined interpretation of intuitionistic logic by means of atomic polymorphism
Por José Espírito Santo (Universidade do Minho).
Collection in Proof Mining: a general principle
Por Pedro Pinto (Universidade de Lisboa).
Páginas
- « primeira
- ‹ anterior
- …
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- seguinte ›
- última »