Pith. sign in

REVIEW 16 cited by

Soft Actor-Critic for Discrete Action Settings

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.07207 v2 pith:Q6O7JZUZ submitted 2019-10-16 cs.LG cs.AIstat.ML

Soft Actor-Critic for Discrete Action Settings

classification cs.LG cs.AIstat.ML
keywords settingsactiondiscreteactor-criticsoftalgorithmapplicablestate-of-the-art
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Soft Actor-Critic is a state-of-the-art reinforcement learning algorithm for continuous action settings that is not applicable to discrete action settings. Many important settings involve discrete actions, however, and so here we derive an alternative version of the Soft Actor-Critic algorithm that is applicable to discrete action settings. We then show that, even without any hyperparameter tuning, it is competitive with the tuned model-free state-of-the-art on a selection of games from the Atari suite.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 16 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ACPO: Agent-Chained Policy Optimization for Multi-Agent Reinforcement Learning

    cs.AI 2026-06 unverdicted novelty 7.0

    ACPO decomposes the joint policy gradient into per-agent terms allowing independent actor training that collectively forms a joint gradient step in CTDE-based MARL.

  2. Back to the Familiar Future: Failure Recovery for VLA Policies via Pre-Imagined Milestone Selection

    cs.RO 2026-06 unverdicted novelty 7.0

    B2FF pre-generates a milestone bank of familiar future states from the clean initial observation and uses a recoverability-aware selector to guide VLA policies back from deviations, raising average success rate from 5...

  3. Your GFlowNet Secretly Learns an Optimal Transport Plan

    cs.LG 2026-06 unverdicted novelty 7.0

    Minimum-flow GFlowNets on graphs encode optimal transport plans, with the learned policy recovering the optimal coupling between source and target distributions.

  4. R2PS: Worst-Case Robust Real-Time Pursuit Strategies under Partial Observability

    cs.LG 2025-11 unverdicted novelty 7.0

    R2PS combines a proof that dynamic programming remains optimal under asynchronous evader moves, a belief preservation mechanism for partial observability, and integration into equilibrium policy generalization to prod...

  5. Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening

    cs.CR 2026-07 conditional novelty 6.0

    New game-theoretic and optimization models for honeypot placement, temporal decoy placement, and human-in-the-loop edge removal on Active Directory attack graphs, with hardness proofs and scalable heuristics.

  6. ACPO: Agent-Chained Policy Optimization for Multi-Agent Reinforcement Learning

    cs.AI 2026-06 reject novelty 6.0

    ACPO claims an exact decentralized decomposition of the cooperative MARL joint policy gradient via serialized agent-chained beliefs, but a key proof step is invalid, so the central claim is not established.

  7. Retry Policy Gradients in Continuous Action Spaces

    cs.AI 2026-06 unverdicted novelty 6.0

    ReMAC applies pathwise estimators to retry objectives in continuous RL, reshaping gradients to increase policy entropy and matching SAC performance without explicit regularization.

  8. Emotion Entanglement and Bayesian Inference for Multi-Dimensional Emotion Understanding

    cs.CL 2026-04 conditional novelty 6.0

    Hybrid RL-MPC trained on the full hybrid action space parametrizes continuous MPC via discrete rollouts and a critic terminal cost, yielding near-MINLP F1 strategies with recursive feasibility under a structural assumption.

  9. Dissecting Discrete Soft Actor-Critic: Limitations and Principled Alternatives

    cs.LG 2025-09 conditional novelty 6.0

    Shows entropy coupling limits DSAC on discrete tasks and introduces a generalized actor-critic framework with m-step critics and novel entropy-regularized objectives that perform robustly on Atari.

  10. FactorLibrary: From Polynomials to Circuits via Recursive Subgoals

    cs.LG 2026-06 unverdicted novelty 5.0

    FactorLibrary stores reusable subexpressions to help RL agents (especially PPO+MCTS top-down) find certified optimal arithmetic circuits for polynomials up to complexity 8 at 91.8% success rate.

  11. Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning

    cs.LG 2026-06 unverdicted novelty 5.0

    Survey mapping RL techniques onto LLM training and highlighting gaps in value-based, off-policy, and bootstrapping methods.

  12. Don't Forget the Critic: Value-Based Data Rehearsal for Multi-Cyclic Continual Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    Qreg+NWLU improves forgetting mitigation and knowledge transfer in value-based multi-cyclic CRL by using dynamic Q-value rehearsal and immediate regularization instead of waiting after the first task.

  13. Relative Entropy Pathwise Policy Optimization

    cs.LG 2025-07 unverdicted novelty 5.0

    REPPO is an on-policy RL method that combines pathwise policy gradients with relative entropy constraints to achieve stable training and high sample efficiency without replay buffers.

  14. Event-Driven Reinforcement Learning Enables Long-Horizon Control in Semiconductor Fabrication

    cs.LG 2026-06 unverdicted novelty 4.0

    Event-driven RL framework for semiconductor manufacturing control shows throughput and utilization gains in high-fidelity simulations under offline and online training.

  15. MacroNav: Multi-Task Context Representation Learning Enables Efficient Navigation in Unknown Environments

    cs.RO 2025-11 unverdicted novelty 4.0

    MacroNav learns multi-scale navigation-centric representations through multi-task self-supervised learning and combines them with graph-based reinforcement learning for efficient action selection, reporting gains in s...

  16. Deep Reinforcement Learning: From First Principles to Reasoning Models

    eess.SY 2026-07 unverdicted novelty 1.0

    A textbook survey of deep reinforcement learning, from Bellman foundations to DQN, PPO, MuZero, offline RL, and reasoning models, with UAV/SD-WAN examples throughout.