Surprise Minimization
Surprise minimization, a burgeoning field, focuses on designing systems that learn to predict and adapt to unexpected events, thereby improving efficiency and robustness. Current research explores this concept through various computational models, including Bayesian approaches that quantify surprise using metrics like Kullback-Leibler divergence and Bayesian surprise, often within reinforcement learning frameworks. These methods are being applied to diverse areas, such as robotics (improving swarm behavior and internal model building), recommender systems (enhancing serendipity), and even traffic safety (detecting surprising driver actions), demonstrating the broad applicability of this principle.
Papers
July 9, 2024
June 17, 2024
May 5, 2024
May 4, 2024
December 14, 2023
August 11, 2023
July 27, 2023
May 12, 2023
December 1, 2021