Co-occurring keywords · papers mentioning both
Papers
CE-GPPO: Coordinating Entropy via Gradient-Preserving Clipping Policy Optimization in Reinforcement Learning
ACL 2026
Cognitively Inspired Developmental Trajectories Improve Explore-Exploit Dynamics in Neural Agent Emergent Communication
CoNLL 2026
Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract)
AAAI 2026
FROST: Factual Reasoning via Optimized Stochastic Trajectories in Large Language Models during Inference
ACL 2026
Neural Exploitation and Exploration of Contextual Bandits
JMLR 2026
RebRL: Reinforcing Discrete Visual Diffusion Models with Rebalanced Timestep Credits
CVPR 2026
ReLaX: Reasoning with Latent Exploration for Large Reasoning Models
CVPR 2026
Should You Use Your Large Language Model to Explore or Exploit?
UAI 2026
Taming Extreme Tokens: Covariance-Aware GRPO with Gaussian-Kernel Advantage Reweighting
ACL 2026
Towards Effective Code-Integrated Reasoning
AAAI 2026
Visual-RRT: Finding Paths toward Visual-Goals via Differentiable Rendering
CVPR 2026
Active Geospatial Search for Efficient Tenant Eviction Outreach
AAAI 2025
Asymptotic Extinction in Large Coordination Games
AAAI 2025
B-STaR: Monitoring and Balancing Exploration and Exploitation in Self-Taught Reasoners
ICLR 2025
Exploring Exploration in Bayesian Optimization
UAI 2025
LASeR: Towards Diversified and Generalizable Robot Design with Large Language Models
ICLR 2025
MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximization
ICLR 2025
MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity
COLING 2025
Monte Carlo Tree Diffusion for System 2 Planning
ICML 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits
AAAI 2025
Towards Cost Sensitive Decision Making
AISTATS 2025
𝜙-Decoding: Adaptive Foresight Sampling for Balanced Inference-Time Exploration and Exploitation
ACL 2025
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
NeurIPS 2024
Code Repair with LLMs gives an Exploration-Exploitation Tradeoff
NeurIPS 2024
Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms
NeurIPS 2024