Mathematical Learning Models — Theory and Algorithms
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference
Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference

Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference

|
     0     
5
4
3
2
1




International Edition


About the Book

This volume contains most of the contributions presented at the conference "Mathematical Learning Models - Theory and Algorithms". The conference was organized by the Institute of Applied Mathematics of the University of Bonn under the auspices of the Sonderforschungs­ bereich 72. It took place in the Physikzentrum in Bad Honnef near to Bonn from May 3 - May 7, 1982. The idea of the organizers was to bring together experts who work on very related problems, but partially by using different approaches. The main subjects of the program were: - mathematical learning models, - bandit problems, - stochastic approximation procedures, - sequential decision processes with unknown law of nature. We felt that in a sense "learning" was a common concept for all these branches. In the contributions the state of the art in the above topics was presented from different pOints of view with special regard to recent advances. The exchange of results and opinions was continued in many fruitful and vivid discussions. The atmosphere of the conference center offered a suitable and pleasant framework for the scientific program. We express our gratitude to all contributors for making the con­ ference successful. Simultaneously we hope that further work on the above mentioned field has been stimulated.

Table of Contents:
The Minimax Risk for the Two-Armed Bandit Problem.- Bandit Problems with Random Discounting.- Stochastic Approximation on a Bounded Convex Set.- Learning Automaton for Finite Semi-Markov Decision Processes.- A Local Asymptotic Minimax Optimality of an Adaptive Robbins-Monro Stochastic Approximation Procedure.- Dynamic Allocation Indices for Bayesian Bandits.- The Role of Dynamic Allocation Indices in the Evaluation of Suboptimal Strategies for Families of Bandit Processes.- On the Discretization Technique for Optimal Discounted Control of the Wiener Process.- Asymptotic Properties of Learning Models.- On the Infinitesimal Characterization of Monotone Stopping Problems in Continuous Time.- Numerical Investigation of the Two-Armed Bandit.- Uniform Bounds for a Dynamic Programming Model under Adaptive Control Using Exponentially Bounded Error Probabilities.- Stochastic Regression Models and Consistency of the Least Squares Identification Scheme.- Recursive Identification Techniques.- An Optimization Problem for Matrices with Application to Decision Models.- On a Class of Learning Algorithms with Symmetric Behavior under Success and Failure.- Convergence of a General Stochastic Approximation Process under Convex Constraints and Some Applications.- On Kersting’s Theorem on Weak Convergence of Recursions.- On Continuous Time Learning Models.- Convergence of Stochastic Approximation Algorithms with Non-Additive Dependent Disturbances and Applications.- Sequential Probability Ratio Tests for Homogeneous Markov Chains.- Allocation Rules for Sequential Clinical Trials.- Non-Deterministic Modelling and its Application in Adaptive Optimal Control.


Best Sellers


Product Details
  • ISBN-13: 9780387909134
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Height: 235 mm
  • No of Pages: 226
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 0387909133
  • Publisher Date: 27 Sep 1983
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: Proceedings of a Conference


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference
Springer-Verlag New York Inc. -
Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Learning Models — Theory and Algorithms: Proceedings of a Conference

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!