Coarse-Grained Smoothness for RL in Metric Spaces

10/23/2021
by   Omer Gottesman, et al.
0

Principled decision-making in continuous state–action spaces is impossible without some assumptions. A common approach is to assume Lipschitz continuity of the Q-function. We show that, unfortunately, this property fails to hold in many typical domains. We propose a new coarse-grained smoothness definition that generalizes the notion of Lipschitz continuity, is more widely applicable, and allows us to compute significantly tighter bounds on Q-functions, leading to improved learning. We provide a theoretical analysis of our new smoothness definition, and discuss its implications and impact on control and exploration in continuous domains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2014

On Lipschitz Continuity and Smoothness of Loss Functions in Learning to Rank

In binary classification and regression problems, it is well understood ...
research
02/10/2021

On the Regularity of Attention

Attention is a powerful component of modern neural networks across a wid...
research
12/22/2017

An Algorithm for Computing Lipschitz Inner Functions in Kolmogorov's Superposition Theorem

Kolmogorov famously proved that multivariate continuous functions can be...
research
02/25/2022

Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions

The performance of online convex optimization algorithms in a dynamic en...
research
06/27/2023

Oscillations and differences in Triebel-Lizorkin-Morrey spaces

In this paper we are concerned with Triebel-Lizorkin-Morrey spaces ℰ^s_u...
research
02/05/2019

Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting

We study contextual bandit learning with an abstract policy class and co...
research
12/10/2020

A Study of Condition Numbers for First-Order Optimization

The study of first-order optimization algorithms (FOA) typically starts ...

Please sign up or login with your details

Forgot password? Click here to reset