Learning and Exploitation Do Not Conflict Under Minimax Optimality

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-62858-4_89
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimality Conditions and Duality for Nonsmooth Minimax Programming Problems Under Generalized Invexity

Filomat
Mathematics
2016English

Learning Locally Minimax Optimal Bayesian Networks

International Journal of Approximate Reasoning
Applied MathematicsTheoretical Computer ScienceArtificial IntelligenceSoftware
2010English

Professionals Do Not Play Minimax: Evidence From Major League Baseball and the National Football League

2009English

Minimax Portfolio Optimization Under Interval Uncertainty

Journal of Advanced Computational Intelligence and Intelligent Informatics
Computer VisionPattern RecognitionHuman-Computer InteractionArtificial Intelligence
2015English

Optimality and Parametric Duality for Nonsmooth Minimax Fractional Programming Problems Involving L-Invex-Infine Functions

Pesquisa Operacional
Management ScienceOperations Research
2016English

Abstract Conflict Driven Learning

ACM SIGPLAN Notices
Computer Science
2013English

Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Q-PSP Learning: An Exploitation-Oriented Q-Learning Algorithm and Its Applications

Transactions of the Society of Instrument and Control Engineers
1999English

Women (Do Not) Belong Here: Gender-Work Identity Conflict Among Female Police Officers

Frontiers in Psychology
Psychology
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy