No article text was recorded for this version.
stochastic reward perturbation
Version 1 of 163 papers94 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Worst-Case Regret Bounds for Exploration via Randomized Value Functions
- Blog: Randomized Exploration in Reinforcement Learning with General Value Function Approximation
- Blog: Perturbed-History Exploration in Stochastic Multi-Armed Bandits
- Blog: Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration
- Blog: Learning Neural Contextual Bandits through Perturbed Rewards
- Blog: Diffusion Reward: Learning Rewards via Conditional Video Diffusion
- Blog: Making RL with Preference-based Feedback Efficient via Randomization
- Blog: Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models
- Blog: Randomized Exploration for Reinforcement Learning with General Value Function Approximation
- Blog: Learning Contextual Bandits Through Perturbed Rewards
- Blog: Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models
- Blog: Randomized Exploration in Generalized Linear Bandits
- Blog: EVaDE : Event-Based Variational Thompson Sampling for Model-Based Reinforcement Learning
- Blog: Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation
- Blog: Perturbed-History Exploration in Stochastic Linear Bandits
- Blog: Dynamic Learning in Large Matching Markets
- Blog: Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
- Blog: Towards tractable optimism in model-based reinforcement learning
- Blog: Fighting Wildfires under Uncertainty - A Sequential Resource Allocation Approach
- Blog: Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation
- Blog: Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration $\&$ Planning
- Blog: Randomized Exploration in Generalized Linear Bandits
- Blog: CORe: Capitalizing On Rewards in Bandit Exploration
- Blog: Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration & Planning
- Blog: An Arm-Wise Randomization Approach to Combinatorial Linear Semi-Bandits
- Blog: Deep Exploration via Randomized Value Functions
- Blog: Policy Optimization as Online Learning with Mediator Feedback
- Blog: Reinforcement Learning with Perturbed Rewards
- Blog: No-regret Exploration in Contextual Reinforcement Learning
- Blog: Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
- Blog: Deep Exploration via Randomized Value Functions
- Blog: Randomized Exploration in Reinforcement Learning with General Value Function Approximation
- Blog: Minimax Optimal Bandits for Heavy Tail Rewards
- Blog: Near-optimal Oracle-efficient Algorithms for Stationary and Non-Stationary Stochastic Linear Bandits
- Blog: Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards
- Blog: Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits
- Blog: Dynamic Service Fee Pricing under Strategic Behavior: Actions as Instruments and Phase Transition
- Blog: Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning
- Blog: Linear Thompson Sampling Revisited
- Blog: RL for Consistency Models: Faster Reward Guided Text-to-Image Generation
- Blog: Making RL with Preference-based Feedback Efficient via Randomization
- Blog: Maillard Sampling: Boltzmann Exploration Done Optimally
- Blog: An efficient algorithm for learning with semi-bandit feedback
- Blog: VIPeR: Provably Efficient Algorithm for Offline RL with Neural Function Approximation
- Blog: Near-Optimal Randomized Exploration for Tabular Markov Decision Processes
- Blog: Flow Matching with Injected Noise for Offline-to-Online Reinforcement Learning
- Blog: Dynamic pricing and assortment under a contextual MNL demand
- Blog: Frequentist Regret Bounds for Randomized Least-Squares Value Iteration
- Blog: R3L: Connecting Deep Reinforcement Learning to Recurrent Neural Networks for Image Denoising via Residual Recovery
- Blog: Randomized Exploration for Reinforcement Learning with General Value Function Approximation
- Blog: Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics
- Blog: Construction d'un joueur artificiel pour Tetris
- Blog: Why is Posterior Sampling Better than Optimism for Reinforcement Learning?
- Blog: Perturbed-History Exploration in Stochastic Linear Bandits
- Blog: Autoregressive Bandits
- Blog: Multi Agent Reinforcement Learning for Sequential Satellite Assignment Problems
- Blog: Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
- Blog: The dynamics of explore–exploit decisions reveal a signal-to-noise mechanism for random exploration
- Blog: Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning
- Blog: Deterministic policy gradient: Convergence analysis
Showing 60 of 63 papers.
History & citation
Current · Permanent link
- This direction split from Randomized Exploration via Stochastic Perturbation (75% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_stochastic_reward_perturbation_707069c4,
title = {stochastic reward perturbation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/stochastic-reward-perturbation/rdr_707069c4b2ad404da6baf8bc6f230870},
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_stochastic_reward_perturbation_707069c4_v1,
title = {stochastic reward perturbation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/stochastic-reward-perturbation/rdr_707069c4b2ad404da6baf8bc6f230870/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}