The menu-dependent nature of regret-minimization creates subtleties when it is applied to dynamic decision problems. Firstly, it is not clear whether \emph{forgone opportunities} should be included in the \emph{menu}, with respect to which regrets are computed, at different points of the decision problem. If forgone opportunities are included, however, we can characterize when a form of dynamic consistency is guaranteed. Secondly, more subtleties arise when sophistication is used to deal with dynamic inconsistency. In the full version of this paper, we examine, axiomatically and by common examples, the implications of different menu definitions for sophisticated, regret-minimizing agents.
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);School of Artificial Intelligence, University of Chinese Academy of Sciences(中国科学院大学人工智能学院);Tencent AI Lab(腾讯AI实验室);Tsinghua University(清华大学);School of Future Technology, University of Chinese Academy of Sciences(中国科学院大学未来技术学院)
FOSSIL: Regret-Minimizing Curriculum Learning for Metadata-Free and Low-Data Mpox Diagnosis
Computer Science Division, Gwinnett Technical College, Lawrenceville, GA, USA(基普顿技术学院计算机科学系);Department of Computer Science, University of Kentucky, Lexington, KY, USA(肯塔基大学计算机科学系);Department of Biomedical Engineering, Kumoh National Institute of Technology, Gumi, South Korea(Kumoh国立技术学院生物医学工程系);Department of Biology, Georgia Institute of Technology, Atlanta, GA, USA(佐治亚理工学院生物学系);Oaro Dermatology Center, Seongnam, Gyeonggi-do, South Korea(Oaro皮肤科中心)
One More Turn, Less Regret: A Regret-Based Multi-Turn Benchmark for LLMs' Clarification Policies
MBZUAI(穆罕默德·本·扎耶德人工智能大学);BKAI Research Center, Hanoi University of Science and Technology(河内科技大学BKAI研究中心);INSAIT, Sofia University "St. Kliment Ohridski"(索非亚大学“圣克莱门特·奥赫里德斯基”INSAIT)
Provably Efficient Exploration in Reward Machines with Low Regret
Department of Computer Science, University of Copenhagen(哥本哈根大学计算机科学系);Department of Information and Communication Technologies, Universitat Pompeu Fabra(庞培法布拉大学信息与通信技术系);University of Lille(里尔大学);Inria(法国国家信息与自动化研究所);CNRS(法国国家科学研究中心);Centrale Lille(里尔中央理工学院)
YUKTI: From Natural-Language Situations to Robust, Verifiable Decisions An Uncertainty-Typed Proposition IR, Assumption-Robust Pareto Frontiers, and a Regret Certificate