Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 13 (1993), S. 259-284 
    ISSN: 0885-6125
    Keywords: Genetic algorithms ; reinforcement learning ; neural networks ; adaptive control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Empirical tests indicate that at least one class of genetic algorithms yields good performance for neural network weight optimization in terms of learning rates and scalability. The successful application of these genetic algorithms to supervised learning problems sets the stage for the use of genetic algorithms in reinforcement learning problems. On a simulated inverted-pendulum control problem, “genetic reinforcement learning” produces competitive results with AHC, another well-known reinforcement learning paradigm for neural networks that employs the temporal difference method. These algorithms are compared in terms of learning rates, performance-based generalization, and control behavior over time.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 13 (1993), S. 259-284 
    ISSN: 0885-6125
    Keywords: Genetic algorithms ; reinforcement learning ; neural networks ; adaptive control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Empirical tests indicate that at least one class of genetic algorithms yields good performance for neural network weight optimization in terms of learning rates and scalability. The successful application of these genetic algorithms to supervised learning problems sets the stage for the use of genetic algorithms in reinforcement learning problems. On a simulated inverted-pendulum control problem, “genetic reinforcement learning” produces competitive results with AHC, another well-known reinforcement learning paradigm for neural networks that employs the temporal difference method. These algorithms are compared in terms of learning rates, performance-based generalization, and control behavior over time.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: As online markets for the exchange of goods and services become more common, the study of markets composed, at least in part, of autonomous agents has taken on increasing importance. In contrast to traditional complete–information economic scenarios, agents that are operating in an electronic marketplace often do so under considerable uncertainty. In order to reduce their uncertainty, these agents must learn about the world around them. When an agent producer is engaged in a learning task in which data collection is costly, such as learning the preferences of a consumer population, it is faced with a classic decision problem: when to explore and when to exploit. If the agent has a limited number of chances to experiment, it must explicitly consider the cost of learning (in terms of foregone profit) against the value of the information acquired. Information goods add an additional dimension to this problem; due to their flexibility, they can be bundled and priced according to a number of different price schedules. An optimizing producer should consider the profit each price schedule can extract, as well as the difficulty of learning of this schedule.In this paper, we demonstrate the tradeoff between complexity and profitability for a number of common price schedules. We begin with a one–shot decision as to which schedule to learn. Schedules with moderate complexity are preferred in the short and medium term, as they are learned quickly, yet extract a significant fraction of the available profit. We then turn to the repeated version of this one–shot decision and show that moderate complexity schedules, in particular two–part tariff, perform well when the producer must adapt to nonstationarity in the consumer population. When a producer can dynamically change schedules as it learns, it can use an explicit decision–theoretic formulation to greedily select the schedule which appears to yield the greatest profit in the next period. By explicitly considering both the learnability and the profit extracted by different price schedules, a producer can extract more profit as it learns than if it naively chose models that are accurate once learned.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 6 (1992), S. 367-388 
    ISSN: 1573-7470
    Keywords: Genetic algorithm ; schema theorem ; hyperplane competitions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Holland's fundamental theorem of genetic algorithms (the “schema theorem”) provides a lower bound on the sampling rate of a single hyperplane during genetic search. However, the theorem tracks the change in representation for a single hyperplaneas if its representation is independent of other hyperplanes. Hyperplane samples are clearly interdependent and interactions in the hyperplane samples means that Holland's notion of “implicit parallelism” does not universally hold when conflicting hyperplanes interact. A set of equations are defined which allows one to model the interaction of strings, or of schemata representing hyperplanes at order-N and hyperplanes less than order-N. These equations do not account for the effects of higher order hyperplanes or co-lateral competitions. Nevertheless, these equations can serve to better describe the interaction of primary hyperplane competitors.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...