Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model

Drugs administered through various routes can lead to nonlinear elimination, resulting in complex pharmacokinetic behaviors crucial to understanding efficacious drug dosing.
When a drug is administered through a constant intravenous infusion and eliminated via nonlinear pharmacokinetics, it follows zero-order input. For example, oral drugs undergo first-order absorption upon administration and are eliminated through nonlinear pharmacokinetics.
In the case of subcutaneously administered drugs,...

Associative Learning

Associative Learning

Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...

Purposive Learning

Purposive Learning

E. C. Tolman emphasized the purposiveness of behavior — the idea that much of our behavior is goal-directed. For instance, employees who aim for a promotion work diligently to meet their targets. Tolman argued that when classical conditioning and operant conditioning occur, the organism acquires certain expectations. In classical conditioning, a child might fear a dog because they expect it to bite. In operant conditioning, a person might consistently work overtime because they expect a bonus...

The Precise Definition of a Limit

The Precise Definition of a Limit

Understanding the formal definition of a limit is essential for precise mathematical analysis. This concept allows us to rigorously determine how a function behaves near a particular point without relying on ambiguous notions such as "getting close." The ε-δ definition plays a foundational role in calculus, ensuring analytical clarity and logical consistency in limit evaluation.The formal definition states that the limit of a function f(x) as x approaches a is L, written asif for every ε >...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

An On-Demand TDMA Approach Optimized for Low-Latency IoT Applications.

Sensors (Basel, Switzerland)·2022

Same author

Towards the Definition of an Intelligent Triage and Continuous Monitoring System for Hospital Emergency Departments and Clinics.

Studies in health technology and informatics·2019

Same author

Adaptive and learning systems.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2009

Same journal

Strategic Ability Updating in Concurrent Games by Coalitional Commitment.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2015

Same journal

Meta-Analysis of the First Facial Expression Recognition Challenge.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Adjustable model-based fusion method for multispectral and panchromatic images.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Face Feature Weighted Fusion Based on Fuzzy Membership Degree for Video Face Recognition.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

A New Adaptive Fast Cellular Automaton Neighborhood Detection and Rule Identification Algorithm.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Human-arm-and-hand-dynamic model with variability analyses for a stylus-based haptic interface.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

See all related articles

Search research articles

Related Experiment Videos

A new class of epsilon-optimal learning automata.

Georgios I Papadimitriou¹, Maria Sklira, Andreas S Pomportsis

¹Department of Informatics, Aristotle University, 54124 Thessaloniki, Greece. gp@csd.auth.gr

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|September 17, 2004

Summary

This summary is machine-generated.

A novel stochastic estimator enhances learning automata performance in random environments. This new approach ensures faster, more accurate convergence to optimal actions compared to existing methods.

Related Experiment Videos

Area of Science:

Machine Learning
Artificial Intelligence
Control Theory

Background:

Learning automata are computational models that learn to select optimal actions in an environment.
Traditional deterministic estimators can be slow to adapt, especially in stationary random environments.
P-model absorbing learning automata are a specific class used for decision-making under uncertainty.

Purpose of the Study:

To introduce a new class of P-model absorbing learning automata utilizing a stochastic estimator.
To improve the speed and accuracy of convergence to optimal actions in stationary random environments.
To analyze the asymptotic behavior and prove the epsilon-optimality of the proposed scheme.

Main Methods:

Development of a novel stochastic estimator for learning automata.
Relaxation of dependence on environmental responses for infrequently selected actions.
Analysis of asymptotic behavior and theoretical proof of epsilon-optimality.
Extensive simulations comparing the proposed scheme with deterministic methods (DP(RI) and DGPA).

Main Results:

The proposed stochastic estimator allows infrequently chosen actions a better chance to be identified as optimal.
The learning automaton demonstrates rapid and accurate convergence to the optimal action.
The scheme is theoretically proven to be epsilon-optimal in all stationary random environments.
Simulation results show faster convergence compared to deterministic-estimator-based schemes.

Conclusions:

The introduced stochastic estimator offers a significant advancement for P-model absorbing learning automata.
The new approach enhances learning efficiency and reliability in stationary random environments.
The findings suggest a more robust and faster learning mechanism for adaptive systems.