AI Chat AI Image Generator AI Video Text to Speech

On limitations of learning algorithms in competitive environments

11/25/2020

∙

by Alexander Y Klimenko, et al.

∙

∙

We discuss conceptual limitations of generic learning algorithms acting in a competitive environment, and demonstrate that they are subject to constraints that are analogous to the constraints on knowledge imposed by the famous theorems of Gödel, Church and Turing.

Alexander Y Klimenko
1 publication
Dimitri A Klimenko
1 publication

page 1

page 2

page 3

page 4

research

∙ 10/31/2014

A Comparison of learning algorithms on the Arcade Learning Environment

Reinforcement learning agents have traditionally been evaluated on small...

0 Aaron Defazio, et al. ∙

research

∙ 02/09/2022

The no-free-lunch theorems of supervised learning

The no-free-lunch theorems promote a skeptical conclusion that all possi...

0 Tom F. Sterkenburg, et al. ∙

research

∙ 07/30/2013

Optimistic Concurrency Control for Distributed Unsupervised Learning

Research on distributed machine learning algorithms has focused primaril...

0 Xinghao Pan, et al. ∙

research

∙ 10/11/2021

Performance Analysis of Fractional Learning Algorithms

Fractional learning algorithms are trending in signal processing and ada...

0 Abdul Wahab, et al. ∙

research

∙ 10/26/2020

Balanced cooperative modeling

Machine learning techniques are often used for supporting a knowledge en...

0 Katharina Morik, et al. ∙

research

∙ 05/27/2019

Learning by stochastic serializations

Complex structures are typical in machine learning. Tailoring learning a...

0 Pablo Strasser, et al. ∙

research

∙ 09/14/2023

Learning Environment-Aware Affordance for 3D Articulated Object Manipulation under Occlusions

Perceiving and manipulating 3D articulated objects in diverse environmen...

0 Kai Cheng, et al. ∙