Fluctuations, effective learnability and metastability in analysis
From MaRDI portal
Publication:392289
DOI10.1016/J.APAL.2013.07.014zbMATH Open1319.03062OpenAlexW2159054279MaRDI QIDQ392289FDOQ392289
Authors: Ulrich Kohlenbach, Pavol Safarik 
Publication date: 13 January 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2013.07.014
Recommendations
- Fluctuation-Dissipation Theorem and Models of Learning
- On learnability, complexity and stability
- Learnability, stability and uniform convergence
- Algorithmic stability and meta-learning
- scientific article; zbMATH DE number 1849137
- Statistical analysis of learning dynamics
- On stochastic dynamics of supervised learning
Ergodic theorems, spectral theory, Markov operators (37A30) Nonlinear ergodic theorems (47H25) Constructive and recursive analysis (03F60) Functionals in proof theory (03F10)
Cites Work
- A quantitative mean ergodic theorem for uniformly convex Banach spaces
- Approximation of fixed points of nonexpansive mappings
- Iterative Algorithms for Nonlinear Operators
- Title not available (Why is that?)
- Some logical metatheorems with applications in functional analysis
- A semantics of evidence for classical arithmetic
- A new use of Friedman's translation: interactive realizability
- Language identification in the limit
- Halpern's iteration in CAT(0) spaces
- Explicit provability and constructive semantics
- Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces
- Local stability of ergodic averages
- Title not available (Why is that?)
- Ultraproducts and metastability
- Square functions in ergodic theory
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Strongly uniform bounds from semi-constructive proofs
- Relative constructivity
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- On the computational content of convergence proofs via Banach limits
- On quantitative versions of theorems due to F. E. Browder and R. Wittmann
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
- Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Real hypercomputation and continuity
- The mean ergodic theorem
- A uniform quantitative form of sequential weak compactness and Baillon's nonlinear ergodic theorem
- Mean Ergodic Theorems for Nonlinear Operators
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- Title not available (Why is that?)
- A quantitative nonlinear strong ergodic theorem for Hilbert spaces
- Title not available (Why is that?)
- A constructive analysis of learning in Peano arithmetic
- Title not available (Why is that?)
- Automata, Languages and Programming
- Nicht konstruktiv beweisbare Sätze der Analysis
- Games with 1-backtracking
- Fragments of arithmetic
Cited In (11)
- Fluctuation-Dissipation Theorem and Models of Learning
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs
- A quantitative multiparameter mean ergodic theorem
- Fluctuation bounds for ergodic averages of amenable groups
- CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC
- PRENEX NORMAL FORM THEOREMS IN SEMI-CLASSICAL ARITHMETIC
- Effective results on nonlinear ergodic averages in CAT spaces
- Quantitative results for Halpern iterations of nonexpansive mappings
- Quantitative results on Fejér monotone sequences
- On the extraction of computational content from noneffective convergence proofs in analysis
- The finitary content of sunny nonexpansive retractions
This page was built for publication: Fluctuations, effective learnability and metastability in analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392289)
