arXiv research

Algorithm reduces regret in SSP problems with LFA.

In this paper, we prove some convergence results of a special case of optimistic policy iteration algorithm for stochastic shortest path problem. We consider both Monte Carlo and $TD(λ)$ methods for the policy evaluation step under the condition that the termination state will eventually be reached almost surely.

Paper tackles offline SSP with value iteration for policy evaluation and learning.

Unified algorithm for optimizing rewards in stochastic path problems.

New algorithms for planning with adversarial changes in costs.

New algorithm reduces regret in stochastic shortest path problems.

New algorithms minimize regret in SSP with optimal sparse updates.

Generative models use Riemannian manifolds to improve latent space interpretation.

New algorithm reduces regret in linear mixture SSPs without cost bounds.

Study shows sample complexity for learning optimal policies in SSP with generative model.

Generative Flow Networks solve shortest path problems in graphs.

Study online learning in MDPs with aggregate bandit feedback, achieving low regret in both stochastic and adversarial settings.

Paper studies CLO with partial feedback, improving decision-making in uncertain contexts.

Study shows hard sample complexity for learning optimal policies in stochastic shortest path problems.

New algorithm learns optimal path in reinforcement learning with linear approximations.

We introduce efficient algorithms which achieve nearly optimal regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a special case of the linear stochastic bandits problem. We show how the diffi…

Bayesian framework for SSP problem learns optimal strategy through interactions.

The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest pa…

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges …

Paper identifies reductive MDPs, solving them in polynomial time.

There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many situations fail to take into ac…

Landmark-based node embeddings approximate shortest path distances in random graphs.

Computing shortest path distances between nodes lies at the heart of many graph algorithms and applications. Traditional exact methods such as breadth-first-search (BFS) do not scale up to contemporary, rapidly evolving today's massive networks. Therefore, it is required to find approximation methods to enable scalable…

We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distance-based supervised learning method, such as Nearest Neighbor methods and SVMs…

We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of disjoint low dimensional manifolds. We argue, theoretically and experimentally, that this leads to higher clustering accuracy. We also pres…

Matching datasets of multiple modalities has become an important task in data analysis. Existing methods often rely on the embedding and transformation of each single modality without utilizing any correspondence information, which often results in sub-optimal matching performance. In this paper, we propose a nonlinear…

Q-learning for average cost MDPs gets a concentration bound.

Study examines how information flows in Indian stock market during crises.

The problem of multiple surface clustering is a challenging task, particularly when the surfaces intersect. Available methods such as Isomap fail to capture the true shape of the surface nearby the intersection and result in incorrect clustering. The Isomap algorithm uses the shortest path between points. The main draw…

EntroPath learns manifold geometry from diffusion paths.

Control Contraction Metrics (CCMs) provide a nonlinear controller design involving an offline search for a Riemannian metric and an online search for a shortest path between the current and desired trajectories. In this paper, we generalize CCMs to Finsler geometry, allowing the use of non-Riemannian metrics. We provid…

The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it shows how to deal with equality constraints on a subset of transition probabilities and develops a generic algorithm for solving this constrain…

New method reduces regret for sparse adversarial SSP problems.

We examine the existence of tangent hyperplanes to subriemannian balls. Strictly abnormal shortest paths are allowed

A new method extracts events and their arguments efficiently from text.

New RL approach builds short ancestral recombination graphs.

Study examines how wind affects shortest paths on Finsler manifolds.

Paper finds shortest geodesic paths on hyperbolic surfaces.

This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representati…

New bounds on shortest geodesic loops on a sphere.

This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior [30, 42, 49]. The framework assumes a unit f…

PathNNs improve graph neural networks by distinguishing non-isomorphic graphs.

We introduce economic models based on Boolean Delay Equations: this formalism makes easier to take into account the complexity of the interactions between firms and is particularly appropriate for studying the propagation of an initial damage due to a catastrophe. Here we concentrate on simple cases, which allow to und…

Agent learns to navigate uncertain 3D maps using a hybrid planner.

Revisits Isomap, showing it constructs Euclidean representations of geodesic structure.

We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians…

We generalize stochastic smoothing for gradient estimation of non-differentiable functions.

Paper proposes efficient sample collection strategy for RL.