Mathematical intuition, deep learning, and Robbins' problem

DOI10.1365/S13291-024-00277-3MaRDI QIDQ6554586zbMATH OpenFDO

Authors F. Thomas Bruss

Publication date 12 June 2024

Published in Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1365/S13291-024-00277-3

zbMATH Keywords

curse of dimensiondifferential equationequivalent problemGoldbach conjectureintuitionopen problemssecretary problemsequential selectionTaylor polynomialtwin primesvague objectives

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) General topics in artificial intelligence (68T01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Moments of Random Sums and Robbins' Problem of Optimal Stopping
• Deep optimal stopping
• The mathematics of artificial intelligence
• A new strategy for Robbins' problem of optimal stopping
• What is Known About Robbins' Problem?

Cites work

• A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank
• A game version of the Cowan-Zabczyk-Bruss' problem
• A new strategy for Robbins' problem of optimal stopping
• A random walk version of Robbins' problem: small horizon
• A rank-based selection with cardinal payoffs and a cost of choice
• A secretary problem with missing observations
• A unified approach for solving sequential selection problems
• A unified approach to a class of best choice problems with an unknown number of options
• An extension of the last-success-problem
• Approximate Optimal Stopping of Dependent Sequences
• Approximation of optimal stopping problems.
• Approximative solutions of optimal stopping and selection problems
• Conditions for quasi-stationarity of the Bayes rule in selection problems with an unknown number of rankable options
• Deep learning
• Every planar map is four colorable. I: Discharging
• scientific article; zbMATH DE number 4054689 (Why is no real title available?)
• scientific article; zbMATH DE number 3790964 (Why is no real title available?)
• scientific article; zbMATH DE number 67282 (Why is no real title available?)
• scientific article; zbMATH DE number 939771 (Why is no real title available?)
• Minimizing the expected rank with full information
• Moments of Random Sums and Robbins' Problem of Optimal Stopping
• On Threshold Strategies and the Smooth-Fit Principle for Optimal Stopping Problems
• One step further : an explicit solution to Robbins’ problem when n = 4
• Optimal selection based on relative rank (the 'Secretary Problem')
• Optimal stopping of strong Markov processes
• Optimal Stopping with Rank-Dependent Loss
• The Best Choice Problem for a Random Number of Objects
• The best-or-worst and the postdoc problems
• The Optimal Choice of a Subset of a Population
• The secretary problem: minimizing the expected rank with I.I.D. random variables
• What is Known About Robbins' Problem?
• What is mathematics?
• Winning Rate in the Full-Information Best-Choice Problem

This page was built for publication: Mathematical intuition, deep learning, and Robbins' problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554586)