Q-learning
PulseAugur coverage of Q-learning — every cluster mentioning Q-learning across labs, papers, and developer communities, ranked by signal.
7 day(s) with sentiment data
-
New Heavy-Ball Q-Learning method promises faster reinforcement learning convergence
Researchers have introduced a novel Heavy-Ball Q-Learning method designed to enhance reinforcement learning algorithms. This new approach establishes convergence guarantees and identifies conditions under which it can t…
-
New robust Q-learning algorithm tackles mean-field control with Wasserstein uncertainty
Researchers have developed a new robust Q-learning algorithm designed for mean-field control problems. This algorithm addresses challenges posed by Wasserstein uncertainty in common noise laws by integrating a quantizat…
-
Quantum Annealing boosts AI for predictive maintenance · 2 sources tracked
Researchers have developed a novel Quantum Annealing enhanced Q-Learning (QAQL) framework to improve Remaining Useful Lifetime (RUL) prediction in predictive maintenance. This approach integrates quantum annealing's sam…
-
New Q-Learning Algorithms Offer Fine-Grained Regret Bounds
Researchers have developed new algorithms for Q-learning that provide more precise regret bounds in episodic tabular Markov Decision Processes. These advancements address limitations in existing methods by offering fine…
-
New theory advances Q-learning in continuous stochastic control
Researchers have published a paper on arXiv detailing a theoretical advancement in Q-learning, a fundamental algorithm in reinforcement learning. The study focuses on the mathematical underpinnings of Q-learning within …
-
New Q-Learning Method Enhances Stability with Geometric Target Updates
Researchers have introduced a new method called the $\lambda$-target update for linear Q-learning, which averages periodic target updates with geometric weights. This technique aims to improve the stability of Q-learnin…
-
New algorithm BLINQ learns Whittle indices for Markov Decision Processes
Researchers have developed BLINQ, a novel model-based algorithm designed to learn Whittle indices for Markov Decision Processes. This new approach constructs an empirical estimate of the MDP and then computes the indice…
-
New research explores Q-learning stability and offline RL methods
Two new research papers explore advancements in reinforcement learning techniques. One paper introduces Drift Q-Learning, a method that combines a drift-based behavioral regularizer with critic-driven policy improvement…
-
Lyapunov framework analyzes stochastic algorithm convergence
Researchers have published a paper detailing a Lyapunov-based framework for analyzing the finite-time convergence of stochastic iterative algorithms. This approach uses generalized Moreau envelopes as universal Lyapunov…
-
Delayed regulation destabilizes adaptive AI agents, study finds
A new research paper explores how delays in regulatory intervention can destabilize adaptive multi-agent systems. The study found that reactive agents, which immediately respond to signals, are highly susceptible to ins…
-
Q-learning integration boosts offline In-Context RL performance
A new research paper explores the effectiveness of integrating Reinforcement Learning (RL) objectives into offline In-Context Reinforcement Learning (ICRL) methods. Experiments across over 150 datasets in GridWorld and …
-
New RL policies boost high-frequency trading performance
Researchers have developed new reinforcement learning policies for high-frequency trading on limit order books. Their approach utilizes Order-Flow signals as a state representation and employs policy-gradient methods, s…
-
New WA* framework achieves zero-shot generalization in AI planning
Researchers have developed a novel self-improving planning framework called WA* that combines a value heuristic represented by a Relational Graph Neural Network with Q-learning. This approach guides search and uses the …
-
New Q-learning algorithm robust to corrupted rewards
Researchers have developed a new variant of Q-learning designed to handle adversarially corrupted rewards in reinforcement learning settings. This novel algorithm is analyzed under asynchronous sampling conditions and p…
-
New Q-learning method achieves n^{-1/4} Gaussian approximation bound
Researchers have developed a new method for approximating Gaussian distributions in entropy-regularized Q-learning with function approximation. The study establishes convergence rates for averaged iterates generated by …
-
Q-Learning Error Analysis Reveals Overestimation Dynamics
Researchers have developed a novel finite-time error analysis for Q-learning algorithms using constant step sizes. The analysis decomposes the error into negative and positive components, revealing that the negative par…
-
Q-learning agent mimics insect behavior for odor source detection
Researchers have developed a Q-learning agent capable of navigating turbulent flows to find odor sources, utilizing a minimal memory of the time elapsed since the last scent detection. This agent successfully learned st…
-
LLM and Q-learning enhance cloud intrusion detection system
Researchers have developed a novel multi-layer intrusion detection system (IDS) for cloud environments that integrates large language models (LLMs) and adaptive Q-learning. This system operates across network, host, and…
-
New Long-Horizon Q-Learning method improves reinforcement learning accuracy
Researchers have introduced Long-Horizon Q-Learning (LQL), a novel method designed to improve the stability of value-based reinforcement learning. LQL addresses the issue of compounding estimation errors in traditional …
-
New ME-AM framework enhances offline RL with entropy maximization
Researchers have introduced Maximum Entropy Adjoint Matching (ME-AM), a new framework designed to improve offline reinforcement learning. This method addresses limitations in existing approaches, such as popularity bias…