Online $\mathrm{L}^{\natural}$-Convex Minimization

arXiv:2404.17158v1 Announce Type: new
Abstract: An online decision-making problem is a learning problem in which a player repeatedly makes decisions in order to minimize the long-term loss. These problems that emerge in applications often have nonlinear combinatorial objective functions, and developing algorithms for such problems has attracted considerable attention. An existing general framework for dealing with such objective functions is the online submodular minimization. However, practical problems are often out of the scope of this framework, since the domain of …

abstract algorithms applications arxiv attention cs.lg decision decisions framework functions general long-term loss making natural stat.ml type