Fluctuations, effective learnability and metastability in analysis
From MaRDI portal
(Redirected from Publication:392289)
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
Cites work
- scientific article; zbMATH DE number 3481293 (Why is no real title available?)
- scientific article; zbMATH DE number 3535187 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 1966601 (Why is no real title available?)
- scientific article; zbMATH DE number 2085171 (Why is no real title available?)
- A constructive analysis of learning in Peano arithmetic
- A new use of Friedman's translation: interactive realizability
- A quantitative mean ergodic theorem for uniformly convex Banach spaces
- A quantitative nonlinear strong ergodic theorem for Hilbert spaces
- A semantics of evidence for classical arithmetic
- A uniform quantitative form of sequential weak compactness and Baillon's nonlinear ergodic theorem
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Approximation of fixed points of nonexpansive mappings
- Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces
- Automata, Languages and Programming
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- Explicit provability and constructive semantics
- Fragments of arithmetic
- Games with 1-backtracking
- Halpern's iteration in CAT(0) spaces
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Iterative Algorithms for Nonlinear Operators
- Language identification in the limit
- Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness
- Local stability of ergodic averages
- Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Mean Ergodic Theorems for Nonlinear Operators
- Nicht konstruktiv beweisbare Sätze der Analysis
- On quantitative versions of theorems due to F. E. Browder and R. Wittmann
- On the computational content of convergence proofs via Banach limits
- Real hypercomputation and continuity
- Relative constructivity
- Some logical metatheorems with applications in functional analysis
- Square functions in ergodic theory
- Strongly uniform bounds from semi-constructive proofs
- The mean ergodic theorem
- Ultraproducts and metastability
Cited in
(11)- Effective results on nonlinear ergodic averages in \(\text{CAT}(\kappa)\) spaces
- On the extraction of computational content from noneffective convergence proofs in analysis
- Prenex normal form theorems in semi-classical arithmetic
- Quantitative results on Fejér monotone sequences
- A quantitative multiparameter mean ergodic theorem
- Fluctuation bounds for ergodic averages of amenable groups
- CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC
- Quantitative results for Halpern iterations of nonexpansive mappings
- Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
- Fluctuation-Dissipation Theorem and Models of Learning
- 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)
