No article text was recorded for this version.
Lipschitz continuity assumption
Version 1 of 134 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Thompson Sampling for Combinatorial Network Optimization in Unknown Environments
- Blog: Approximate Relative Value Learning for Average-reward Continuous State MDPs
- Blog: Approximation Algorithms for Observer Aware MDPs
- Blog: Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces
- Blog: Contextual bandits with similarity information
- Blog: A Contraction Approach to Model-based Reinforcement Learning
- Blog: Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting
- Blog: Inverse Reinforcement Learning in a Continuous State Space with Formal Guarantees
- Blog: Towards Theoretical Understanding of Inverse Reinforcement Learning
- Blog: Policy Learning and Evaluation with Randomized Quasi-Monte Carlo
- Blog: Finite Continuum-Armed Bandits
- Blog: Beyond Cake Cutting: Allocating Homogeneous Divisible Goods
- Blog: Trajectory-Level Data Augmentation for Offline Reinforcement Learning
- Blog: Separable and Low-Rank Continuous Games
- Blog: Dynamic path learning in decision trees using contextual bandits
- Blog: Understanding What Affects the Generalization Gap in Visual Reinforcement Learning: Theory and Empirical Evidence
- Blog: DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits
- Blog: Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing
- Blog: Combinatorial Multi-Armed Bandit with General Reward Functions
- Blog: Multi-objective Contextual Multi-armed Bandit With a Dominant Objective
- Blog: Adaptive Discretization for Model-Based Reinforcement Learning
- Blog: Proper Value Equivalence
- Blog: Belief-Dependent Macro-Action Discovery in POMDPs using the Value of Information
- Blog: No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
- Blog: Model-Free Trajectory Optimization for Reinforcement Learning
- Blog: Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR
- Blog: Fractal Landscapes in Policy Optimization
- Blog: Unsupervised Data Generation for Offline Reinforcement Learning: A Perspective from Model
- Blog: Agent-Designed Contracts: How to Sell Hidden Actions
- Blog: Towards Theoretical Understanding of Inverse Reinforcement Learning
- Blog: Contextual Combinatorial Bandits With Changing Action Sets Via Gaussian Processes
- Blog: PERRY: Policy Evaluation with Confidence Intervals using Auxiliary Data
- Blog: Contextual Combinatorial Volatile Multi-armed Bandit with Adaptive Discretization
- Blog: Coarse-Grained Smoothness for Reinforcement Learning in Metric Spaces
History & citation
Current · Permanent link
- This direction split from Reinforcement Learning Beyond Lipschitz Smoothness (65% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_lipschitz_continuity_assumption_a4880f13,
title = {Lipschitz continuity assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-continuity-assumption/rdr_a4880f1371cf424a8648e10d953e75ed},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_lipschitz_continuity_assumption_a4880f13_v1,
title = {Lipschitz continuity assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-continuity-assumption/rdr_a4880f1371cf424a8648e10d953e75ed/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}