Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
High-order functions are the sole elements in a class of recursive functions. The functions are related to each other through application, i.e., applying a function to an argument...
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...