相关论文: Breadth-First Search vs. Restarting Random Walks f…

One of the main challenges in reinforcement learning is solving tasks with sparse reward. We show that the difficulty of discovering a distant rewarding state in an MDP is bounded by the expected cover time of a random walk over the graph…

Metaheuristic search methods have proven to be essential tools for tackling complex optimization challenges, but their full potential is often constrained by conventional algorithmic frameworks. In this paper, we introduce a novel approach…

The contextual bandit literature has traditionally focused on algorithms that address the exploration-exploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in…

This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects' net present value with unrestricted resources. The selected algorithms, being the most recently cited in the…

An algorithm (bliss) is proposed to speed up the construction of slow adaptive walks. Slow adaptive walks are adaptive walks biased towards closer points or smaller move steps. They were previously introduced to explore a search space, e.g.…

Heuristics used for solving hard real-time search problems have regions with depressions. Such regions are bounded areas of the search space in which the heuristic function is inaccurate compared to the actual cost to reach a solution.…

In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…

In this paper we study controlled continuous time random walks (CTRWs) and heuristically derive pay-off function dynamic programming (DP) equations which turn in the limit of standard scaling to fractional Hamilton Jacobi Bellman type…

Tree-structured LSTM is promising way to consider long-distance interaction over hierarchies. However, there have been few research efforts on the hyperparameter tuning of the construction and traversal of tree-structured LSTM. To name a…

Efficient exploration is one of the key challenges for reinforcement learning (RL) algorithms. Most traditional sample efficiency bounds require strategic exploration. Recently many deep RL algorithms with simple heuristic exploration…

The step-reinforced random walk (SRRW), where each step may replicate a randomly chosen past step, exhibits complex dependencies on the history. This paper introduces a generalized SRRW on groups, incorporating arbitrary transformations of…

Tasks involving high-risk-high-return (HRHR) actions, such as obstacle crossing, often exhibit multimodal action distributions and stochastic returns. Most reinforcement learning (RL) methods assume unimodal Gaussian policies and rely on…

. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…

A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…

Combinatorial generalization remains a central challenge in Deep Reinforcement Learning (DRL). Classical planning provides a simple yet challenging setting to study this problem through explicit relational descriptions, without requiring…

We study a variant of the Generalized Excited Random Walk (GERW) on $\mathbb{Z}^d$ introduced by Menshikov, Popov, Ram\'irez and Vachkovskaia in [Ann. Probab. 40 (5), 2012]. It consists of a particular version of the model studied in [arXiv…

In this article, we present new random walk methods to solve flow and transport problems in unsaturated/saturated porous media, including coupled flow and transport processes in soils, heterogeneous systems modeled through random hydraulic…

Randomized Uphill Climbing is a lightweight, stochastic search heuristic that has delivered state of the art equity alpha factors for quantitative hedge funds. I propose to generalize RUC into a model agnostic feature optimization framework…

This is a comprehensive review of the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic and its hybridization with Path Relinking (PR) over the past two decades. GRASP with PR has become a widely adopted approach for solving…

Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known…