OGBench
PulseAugur coverage of OGBench — every cluster mentioning OGBench across labs, papers, and developer communities, ranked by signal.
5 day(s) with sentiment data
-
ReBRAC-v2 advances offline reinforcement learning with simplified, high-performance methods
Researchers have introduced ReBRAC-v2, an updated approach to offline reinforcement learning that modernizes conventional actor-critic methods while maintaining algorithmic simplicity. This new method utilizes an exact-…
-
Research paper critiques contrastive critics in AI policy search
A new research paper titled "Good Rankers, Bad Objectives: Bilinear Contrastive Critics under Expressive Policy Search" explores the limitations of contrastive critics in AI policy search. The paper demonstrates that wh…
-
New HiQC Algorithm Enhances Offline RL for Long-Horizon Tasks
Researchers have introduced Hierarchical Implicit Q-Chunking (HiQC), a novel algorithm designed to improve offline goal-conditioned reinforcement learning for long-horizon tasks. HiQC addresses the 'curse of horizon' by…
-
New methods enhance diffusion policy training and inference speed
Researchers have developed new methods to improve the efficiency and stability of diffusion policies, a type of AI model gaining popularity for decision-making tasks. One approach, DIPOLE, introduces a novel reinforceme…
-
New DAGR method refines goal representations in reinforcement learning
Researchers have introduced DAGR, a novel approach to state-conditioned goal representations in reinforcement learning. DAGR refines existing goal embeddings by incorporating the current state through multi-scale gated …
-
MoP-JEPA introduces hard-assigned predictors for improved stochastic world models
Researchers have introduced MoP-JEPA, a novel approach to stochastic JEPA world models that addresses limitations in predicting successor states in environments with branching transitions. Unlike traditional JEPA models…
-
New method enhances offline reinforcement learning with Dual Advantage Fields
Researchers have introduced Dual Advantage Fields (DAF), a novel method for offline goal-conditioned reinforcement learning. DAF transforms dual value models into local advantage signals by learning an action-effect mod…
-
New Laplacian Representation Enhances Reinforcement Learning Planning
Researchers have introduced Laplacian Representations for Decision-Time Planning (ALPS), a new hierarchical planning algorithm designed for model-based reinforcement learning. ALPS utilizes the Laplacian representation …
-
New OgBench framework evaluates GNNs on omics data
Researchers have introduced OgBench, a new framework designed to evaluate Graph Neural Networks (GNNs) specifically for omics data. This type of biological data presents a unique challenge where the number of samples is…
-
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…
-
New Algorithm CARL Enhances Skill Reusability in Hierarchical RL
Researchers have developed a new algorithm called CARL (Contrastive Action-based Representations for Reusable Local Control) to improve the reusability of skills in Hierarchical Reinforcement Learning (HRL). CARL exploi…
-
New TRQAM Algorithm Stabilizes Off-Policy Reinforcement Learning
A new paper introduces Trust Region Q-Adjoint Matching (TRQAM), an algorithm designed to stabilize off-policy reinforcement learning for pretrained flow policies. TRQAM addresses issues of instability and model collapse…
-
New TRQAM algorithm stabilizes off-policy reinforcement learning
Researchers have developed Trust Region Q-Adjoint Matching (TRQAM), a novel algorithm designed to stabilize off-policy reinforcement learning. TRQAM addresses instability issues by adaptively controlling the KL divergen…
-
New CIG reward method enhances reinforcement learning exploration
Researchers have introduced Conditional Information Gain (CIG), a novel reward mechanism for reinforcement learning designed to improve exploration strategies. CIG addresses limitations of existing methods by providing …
-
New flow map policies accelerate generative AI for robotics
Researchers have developed a new class of generative policies called flow map policies, designed to accelerate action generation in complex control problems. These policies learn to make large jumps within generative dy…
-
Refining Compositional Diffusion improves long-horizon planning by mitigating mode-averaging.
Researchers have developed Refining Compositional Diffusion (RCD), a new method to improve long-horizon trajectory planning for robots. RCD addresses the issue of mode-averaging in compositional diffusion planning, wher…
-
Gemma 4 31B weights show cross-modal transfer via thin trainable interface
Researchers have demonstrated that frozen weights from the Gemma 4 31B text-pretrained model can be effectively reused across different modalities, including robotics and associative recall tasks. By employing a thin, t…