{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/q-learning","slug":"q-learning","name":"Q-Learning","full_name":"Q-Learning","full_name_withheld":false,"description_markdown":"**Q-Learning** is an off-policy temporal difference control algorithm:\r\n\r\n$$Q\\left(S\\_{t}, A\\_{t}\\right) \\leftarrow Q\\left(S\\_{t}, A\\_{t}\\right) + \\alpha\\left[R_{t+1} + \\gamma\\max\\_{a}Q\\left(S\\_{t+1}, a\\right) - Q\\left(S\\_{t}, A\\_{t}\\right)\\right] $$\r\n\r\nThe learned action-value function $Q$ directly approximates $q\\_{*}$, the optimal action-value function, independent of the policy being followed.\r\n\r\nSource: Sutton and Barto, Reinforcement Learning, 2nd Edition","description_state":"present","introduced_year":1984,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Off-Policy TD Control","url":"/methods/category/off-policy-td-control","pwc_aliases":[]}],"n_papers_tagged":1734,"archive_num_papers":1734,"papers_newest_first":[{"paper":null,"slug":"detecting-and-mitigating-reward-hacking-in","title":"Detecting and Mitigating Reward Hacking in Reinforcement Learning Systems: A Comprehensive Empirical Study","date":"2025-07-08","arxiv_id":"2507.05619","n_code_links":0,"syntology":null},{"paper":null,"slug":"2048-reinforcement-learning-in-a-delayed","title":"2048: Reinforcement Learning in a Delayed Reward Environment","date":"2025-07-07","arxiv_id":"2507.05465","n_code_links":0,"syntology":null},{"paper":null,"slug":"vrail-vectorized-reward-based-attribution-for","title":"VRAIL: Vectorized Reward-based Attribution for Interpretable Learning","date":"2025-06-19","arxiv_id":"2506.16014","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-based-policy","title":"Reinforcement Learning-Based Policy Optimisation For Heterogeneous Radio Access","date":"2025-06-18","arxiv_id":"2506.15273","n_code_links":0,"syntology":null},{"paper":null,"slug":"gcn-driven-reinforcement-learning-for","title":"GCN-Driven Reinforcement Learning for Probabilistic Real-Time Guarantees in Industrial URLLC","date":"2025-06-17","arxiv_id":"2506.15011","n_code_links":0,"syntology":null},{"paper":null,"slug":"implicit-constraint-aware-off-policy","title":"Implicit Constraint-Aware Off-Policy Correction for Offline Reinforcement Learning","date":"2025-06-16","arxiv_id":"2506.14058","n_code_links":0,"syntology":null},{"paper":null,"slug":"reindsplit-reinforced-dynamic-split-learning","title":"ReinDSplit: Reinforced Dynamic Split Learning for Pest Recognition in Precision Agriculture","date":"2025-06-16","arxiv_id":"2506.13935","n_code_links":0,"syntology":null},{"paper":null,"slug":"what-are-my-options-explaining-rl-agents-with","title":"\"What are my options?\": Explaining RL Agents with Diverse Near-Optimal Alternatives (Extended)","date":"2025-06-11","arxiv_id":"2506.09901","n_code_links":0,"syntology":null},{"paper":null,"slug":"reliable-critics-monotonic-improvement-and","title":"Reliable Critics: Monotonic Improvement and Convergence Guarantees for Reinforcement Learning","date":"2025-06-08","arxiv_id":"2506.07134","n_code_links":0,"syntology":null},{"paper":null,"slug":"bridging-the-performance-gap-between-target","title":"Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning With Iterated Q-Learning","date":"2025-06-04","arxiv_id":"2506.04398","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-performance-of-spike-based-deep-q","title":"Improving Performance of Spike-based Deep Q-Learning using Ternary Neurons","date":"2025-06-03","arxiv_id":"2506.03392","n_code_links":0,"syntology":null},{"paper":null,"slug":"getting-more-from-less-transfer-learning","title":"Getting More from Less: Transfer Learning Improves Sleep Stage Decoding Accuracy in Peripheral Wearable Devices","date":"2025-05-31","arxiv_id":"2506.00730","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-hanabi","title":"Reinforcement Learning for Hanabi","date":"2025-05-31","arxiv_id":"2506.00458","n_code_links":0,"syntology":null},{"paper":null,"slug":"combining-deep-architectures-for-information","title":"Combining Deep Architectures for Information Gain estimation and Reinforcement Learning for multiagent field exploration","date":"2025-05-29","arxiv_id":"2505.23865","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-global-convergence-rates-for-federated","title":"On Global Convergence Rates for Federated Policy Gradient under Heterogeneous Environment","date":"2025-05-29","arxiv_id":"2505.23459","n_code_links":0,"syntology":null},{"paper":null,"slug":"boformer-learning-to-solve-multi-objective","title":"BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL","date":"2025-05-28","arxiv_id":"2505.21974","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-general-purpose-theorem-for-high","title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging","date":"2025-05-27","arxiv_id":"2505.21796","n_code_links":0,"syntology":null},{"paper":"/paper/the-cell-must-go-on-agar-io-for-continual","slug":"the-cell-must-go-on-agar-io-for-continual","title":"The Cell Must Go On: Agar.io for Continual Reinforcement Learning","date":"2025-05-23","arxiv_id":"2505.18347","n_code_links":1,"syntology":null},{"paper":null,"slug":"offline-guarded-safe-reinforcement-learning","title":"Offline Guarded Safe Reinforcement Learning for Medical Treatment Optimization Strategies","date":"2025-05-22","arxiv_id":"2505.16242","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-stock-transactions","title":"Reinforcement Learning for Stock Transactions","date":"2025-05-22","arxiv_id":"2505.16099","n_code_links":0,"syntology":null},{"paper":null,"slug":"llm-explorer-a-plug-in-reinforcement-learning","title":"LLM-Explorer: A Plug-in Reinforcement Learning Policy Exploration Enhancement Driven by Large Language Models","date":"2025-05-21","arxiv_id":"2505.15293","n_code_links":0,"syntology":null},{"paper":null,"slug":"opa-pack-object-property-aware-robotic-bin","title":"OPA-Pack: Object-Property-Aware Robotic Bin Packing","date":"2025-05-19","arxiv_id":"2505.13339","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-a-reinforcement-learning-agent","title":"When a Reinforcement Learning Agent Encounters Unknown Unknowns","date":"2025-05-19","arxiv_id":"2505.13188","n_code_links":0,"syntology":null},{"paper":null,"slug":"imagination-limited-q-learning-for-offline","title":"Imagination-Limited Q-Learning for Offline Reinforcement Learning","date":"2025-05-18","arxiv_id":"2505.12211","n_code_links":0,"syntology":null},{"paper":null,"slug":"2505-11081","title":"ShiQ: Bringing back Bellman to LLMs","date":"2025-05-16","arxiv_id":"2505.11081","n_code_links":0,"syntology":null},{"paper":null,"slug":"2505-11478","title":"Automatic Reward Shaping from Confounded Offline Data","date":"2025-05-16","arxiv_id":"2505.11478","n_code_links":0,"syntology":null},{"paper":null,"slug":"bias-or-optimality-disentangling-bayesian","title":"Bias or Optimality? Disentangling Bayesian Inference and Learning Biases in Human Decision-Making","date":"2025-05-12","arxiv_id":"2505.08049","n_code_links":0,"syntology":null},{"paper":null,"slug":"convert-language-model-into-a-value-based","title":"Convert Language Model into a Value-based Strategic Planner","date":"2025-05-11","arxiv_id":"2505.06987","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-large-language-model-enhanced-q-learning","title":"A Large Language Model-Enhanced Q-learning for Capacitated Vehicle Routing Problem with Time Windows","date":"2025-05-09","arxiv_id":"2505.06178","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-game-theoretic","title":"Reinforcement Learning for Game-Theoretic Resource Allocation on Graphs","date":"2025-05-08","arxiv_id":"2505.06319","n_code_links":0,"syntology":null},{"paper":null,"slug":"merging-and-disentangling-views-in-visual","title":"Merging and Disentangling Views in Visual Reinforcement Learning for Robotic Manipulation","date":"2025-05-07","arxiv_id":"2505.04619","n_code_links":0,"syntology":null},{"paper":null,"slug":"interpretable-learning-dynamics-in","title":"Interpretable Learning Dynamics in Unsupervised Reinforcement Learning","date":"2025-05-06","arxiv_id":"2505.06279","n_code_links":0,"syntology":null},{"paper":"/paper/meta-black-box-optimization-through-offline-q","slug":"meta-black-box-optimization-through-offline-q","title":"Meta-Black-Box-Optimization through Offline Q-function Learning","date":"2025-05-04","arxiv_id":"2505.02010","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":4,"n_instrument":1,"unverified":3,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["metaevo/q-mamba"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"universal-approximation-theorem-of-deep-q","title":"Universal Approximation Theorem of Deep Q-Networks","date":"2025-05-04","arxiv_id":"2505.02288","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-one-modified-value-iteration","title":"Rank-One Modified Value Iteration","date":"2025-05-03","arxiv_id":"2505.01828","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximation-to-deep-q-network-by-stochastic","title":"Approximation to Deep Q-Network by Stochastic Delay Differential Equations","date":"2025-05-01","arxiv_id":"2505.00382","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-and-distributed-routing-in-iot","title":"Dynamic and Distributed Routing in IoT Networks based on Multi-Objective Q-Learning","date":"2025-05-01","arxiv_id":"2505.00918","n_code_links":0,"syntology":null},{"paper":null,"slug":"q-learning-with-clustered-smart-csmart-data","title":"Q-Learning with Clustered-SMART (cSMART) Data: Examining Moderators in the Construction of Clustered Adaptive Interventions","date":"2025-05-01","arxiv_id":"2505.00822","n_code_links":0,"syntology":null},{"paper":null,"slug":"interactive-double-deep-q-network-integrating","title":"Interactive Double Deep Q-network: Integrating Human Interventions and Evaluative Predictions in Reinforcement Learning of Autonomous Driving","date":"2025-04-28","arxiv_id":"2505.01440","n_code_links":0,"syntology":null},{"paper":null,"slug":"non-asymptotic-guarantees-for-average-reward","title":"Non-Asymptotic Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes","date":"2025-04-25","arxiv_id":"2504.18743","n_code_links":0,"syntology":null},{"paper":null,"slug":"sapo-rl-sequential-actuator-placement","title":"SAPO-RL: Sequential Actuator Placement Optimization for Fuselage Assembly via Reinforcement Learning","date":"2025-04-24","arxiv_id":"2504.17603","n_code_links":0,"syntology":null},{"paper":null,"slug":"alphagrad-non-linear-gradient-normalization","title":"AlphaGrad: Non-Linear Gradient Normalization Optimizer","date":"2025-04-22","arxiv_id":"2504.16020","n_code_links":0,"syntology":null},{"paper":null,"slug":"state-aware-iot-scheduling-using-deep-q","title":"State-Aware IoT Scheduling Using Deep Q-Networks and Edge-Based Coordination","date":"2025-04-22","arxiv_id":"2504.15577","n_code_links":0,"syntology":null},{"paper":null,"slug":"mixed-precision-conjugate-gradient-solvers","title":"Mixed-Precision Conjugate Gradient Solvers with RL-Driven Precision Tuning","date":"2025-04-19","arxiv_id":"2504.14268","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-the-theoretical-properties-of","title":"Understanding the theoretical properties of projected Bellman equation, linear Q-learning, and approximate value iteration","date":"2025-04-15","arxiv_id":"2504.10865","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-based-deep-reinforcement-learning-aided","title":"Graph Based Deep Reinforcement Learning Aided by Transformers for Multi-Agent Cooperation","date":"2025-04-11","arxiv_id":"2504.08195","n_code_links":0,"syntology":null},{"paper":null,"slug":"relaxing-the-markov-requirements-on","title":"A Framework of decision-relevant observability: Reinforcement Learning converges under relative ignorability","date":"2025-04-10","arxiv_id":"2504.07722","n_code_links":0,"syntology":null},{"paper":null,"slug":"state-estimation-using-particle-filtering-in","title":"State Estimation Using Particle Filtering in Adaptive Machine Learning Methods: Integrating Q-Learning and NEAT Algorithms with Noisy Radar Measurements","date":"2025-04-10","arxiv_id":"2504.07393","n_code_links":0,"syntology":null},{"paper":"/paper/deep-reinforcement-learning-algorithms-for-1","slug":"deep-reinforcement-learning-algorithms-for-1","title":"Deep Reinforcement Learning Algorithms for Option Hedging","date":"2025-04-07","arxiv_id":"2504.05521","n_code_links":1,"syntology":null},{"paper":"/paper/omniecon-nexus-global-microeconomic","slug":"omniecon-nexus-global-microeconomic","title":"OmniEcon Nexus: Global Microeconomic Simulation Engine","date":"2025-04-07","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"inverse-rl-scene-dynamics-learning-for","title":"Inverse RL Scene Dynamics Learning for Nonlinear Predictive Control in Autonomous Vehicles","date":"2025-04-02","arxiv_id":"2504.01336","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-operating-system-scheduling-using","title":"Dynamic Operating System Scheduling Using Double DQN: A Reinforcement Learning Approach to Task Optimization","date":"2025-03-31","arxiv_id":"2503.23659","n_code_links":0,"syntology":null},{"paper":null,"slug":"late-breaking-results-breaking-symmetry","title":"Late Breaking Results: Breaking Symmetry- Unconventional Placement of Analog Circuits using Multi-Level Multi-Agent Reinforcement Learning","date":"2025-03-29","arxiv_id":"2503.22958","n_code_links":0,"syntology":null},{"paper":null,"slug":"finite-time-bounds-for-two-time-scale","title":"Finite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise","date":"2025-03-24","arxiv_id":"2503.18391","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-in-switching-non","title":"Reinforcement Learning in Switching Non-Stationary Markov Decision Processes: Algorithms and Convergence Analysis","date":"2025-03-24","arxiv_id":"2503.18607","n_code_links":0,"syntology":null},{"paper":null,"slug":"bandwidth-reservation-for-time-critical","title":"Bandwidth Reservation for Time-Critical Vehicular Applications: A Multi-Operator Environment","date":"2025-03-22","arxiv_id":"2503.17756","n_code_links":0,"syntology":null},{"paper":null,"slug":"planning-and-learning-in-average-risk-aware","title":"Planning and Learning in Average Risk-aware MDPs","date":"2025-03-22","arxiv_id":"2503.17629","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-q-learning-with-gradient-target-tracking","title":"Deep Q-Learning with Gradient Target Tracking","date":"2025-03-20","arxiv_id":"2503.16700","n_code_links":0,"syntology":null},{"paper":"/paper/a-generalist-hanabi-agent","slug":"a-generalist-hanabi-agent","title":"A Generalist Hanabi Agent","date":"2025-03-17","arxiv_id":"2503.14555","n_code_links":1,"syntology":null},{"paper":null,"slug":"apf-boosting-adaptive-potential-function","title":"APF+: Boosting adaptive-potential function reinforcement learning methods with a W-shaped network for high-dimensional games","date":"2025-03-17","arxiv_id":"2503.13557","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-competitive-and-collusive-behaviors","title":"Exploring Competitive and Collusive Behaviors in Algorithmic Pricing with Deep Reinforcement Learning","date":"2025-03-14","arxiv_id":"2503.11270","n_code_links":0,"syntology":null},{"paper":null,"slug":"residual-policy-gradient-a-reward-view-of-kl","title":"Residual Policy Gradient: A Reward View of KL-regularized Objective","date":"2025-03-14","arxiv_id":"2503.11019","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-q-learning-dynamics-in-random","title":"Multi-Agent Q-Learning Dynamics in Random Networks: Convergence due to Exploration and Sparsity","date":"2025-03-13","arxiv_id":"2503.10186","n_code_links":0,"syntology":null},{"paper":"/paper/pairvdn-pair-wise-decomposed-value-functions","slug":"pairvdn-pair-wise-decomposed-value-functions","title":"PairVDN - Pair-wise Decomposed Value Functions","date":"2025-03-12","arxiv_id":"2503.09521","n_code_links":1,"syntology":null},{"paper":null,"slug":"intelligent-joint-security-and-delay","title":"Intelligent Joint Security and Delay Determinacy Performance Guarantee Strategy in RIS-Assisted IIoT Communication Systems","date":"2025-03-11","arxiv_id":"2503.08086","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-multi-objective-reinforcement","title":"A Novel Multi-Objective Reinforcement Learning Algorithm for Pursuit-Evasion Game","date":"2025-03-09","arxiv_id":"2503.06741","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-multi-agent-q-learning-for-policy","title":"Generative Multi-Agent Q-Learning for Policy Optimization: Decentralized Wireless Networks","date":"2025-03-07","arxiv_id":"2503.05970","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-inverse-q-learning-from","title":"Multi-Agent Inverse Q-Learning from Demonstrations","date":"2025-03-06","arxiv_id":"2503.04679","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-inspired-reinforcement-learning-in","title":"Quantum-Inspired Reinforcement Learning in the Presence of Epistemic Ambivalence","date":"2025-03-06","arxiv_id":"2503.04219","n_code_links":0,"syntology":null},{"paper":null,"slug":"do-iqs-dynamics-aware-offline-inverse-q","title":"DO-IQS: Dynamics-Aware Offline Inverse Q-Learning for Optimal Stopping with Unknown Gain Functions","date":"2025-03-05","arxiv_id":"2503.03515","n_code_links":0,"syntology":null},{"paper":null,"slug":"navigating-intelligence-a-survey-of-google-or","title":"Navigating Intelligence: A Survey of Google OR-Tools and Machine Learning for Global Path Planning in Autonomous Vehicles","date":"2025-03-05","arxiv_id":"2503.03338","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-and-uncertainty-aware","title":"An Efficient and Uncertainty-aware Reinforcement Learning Framework for Quality Assurance in Extrusion Additive Manufacturing","date":"2025-03-02","arxiv_id":"2503.00971","n_code_links":0,"syntology":null},{"paper":null,"slug":"2503-00372","title":"Nucleolus Credit Assignment for Effective Coalitions in Multi-agent Reinforcement Learning","date":"2025-03-01","arxiv_id":"2503.00372","n_code_links":0,"syntology":null},{"paper":null,"slug":"cycles-and-collusion-in-congestion-games","title":"Cycles and collusion in congestion games under Q-learning","date":"2025-02-26","arxiv_id":"2502.18984","n_code_links":0,"syntology":null},{"paper":null,"slug":"policy-learning-with-a-natural-language","title":"Policy Learning with a Natural Language Action Space: A Causal Approach","date":"2025-02-24","arxiv_id":"2502.17538","n_code_links":0,"syntology":null},{"paper":null,"slug":"human-ai-collaboration-in-cloud-security","title":"Human-AI Collaboration in Cloud Security: Cognitive Hierarchy-Driven Deep Reinforcement Learning","date":"2025-02-22","arxiv_id":"2502.16054","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-non-asymptotic-theory-of-seminorm-lyapunov","title":"A Non-Asymptotic Theory of Seminorm Lyapunov Stability: From Deterministic to Stochastic Iterative Algorithms","date":"2025-02-20","arxiv_id":"2502.14208","n_code_links":0,"syntology":null},{"paper":null,"slug":"algorithmic-collusion-under-observed-demand","title":"Algorithmic Collusion under Observed Demand Shocks","date":"2025-02-20","arxiv_id":"2502.15084","n_code_links":0,"syntology":null},{"paper":null,"slug":"causal-mean-field-multi-agent-reinforcement","title":"Causal Mean Field Multi-Agent Reinforcement Learning","date":"2025-02-20","arxiv_id":"2502.14200","n_code_links":0,"syntology":null},{"paper":null,"slug":"is-q-learning-an-ill-posed-problem","title":"Is Q-learning an Ill-posed Problem?","date":"2025-02-20","arxiv_id":"2502.14365","n_code_links":0,"syntology":null},{"paper":"/paper/ranking-joint-policies-in-dynamic-games-using","slug":"ranking-joint-policies-in-dynamic-games-using","title":"Ranking Joint Policies in Dynamic Games using Evolutionary Dynamics","date":"2025-02-20","arxiv_id":"2502.14724","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-objective-reinforcement-learning-for-3","title":"Multi-Objective Reinforcement Learning for Critical Scenario Generation of Autonomous Vehicles","date":"2025-02-18","arxiv_id":"2502.15792","n_code_links":0,"syntology":null},{"paper":null,"slug":"few-is-more-task-efficient-skill-discovery","title":"Few is More: Task-Efficient Skill-Discovery for Multi-Task Offline Multi-Agent Reinforcement Learning","date":"2025-02-13","arxiv_id":"2502.08985","n_code_links":0,"syntology":null},{"paper":"/paper/evolution-of-cooperation-in-a-bimodal-mixture","slug":"evolution-of-cooperation-in-a-bimodal-mixture","title":"Evolution of cooperation in a bimodal mixture of conditional cooperators","date":"2025-02-11","arxiv_id":"2502.07537","n_code_links":1,"syntology":null},{"paper":"/paper/conrft-a-reinforced-fine-tuning-method-for","slug":"conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","arxiv_id":"2502.05450","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["cccedric/conrft"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"seasonal-station-keeping-of-short-duration","title":"Seasonal Station-Keeping of Short Duration High Altitude Balloons using Deep Reinforcement Learning","date":"2025-02-07","arxiv_id":"2502.05014","n_code_links":0,"syntology":null},{"paper":null,"slug":"cleansurvival-automated-data-preprocessing","title":"CleanSurvival: Automated data preprocessing for time-to-event models using reinforcement learning","date":"2025-02-06","arxiv_id":"2502.03946","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-triangular-arbitrage-detection-via","title":"Efficient Triangular Arbitrage Detection via Graph Neural Networks","date":"2025-02-05","arxiv_id":"2502.03194","n_code_links":0,"syntology":null},{"paper":null,"slug":"vistaflow-photorealistic-volumetric","title":"VistaFlow: Photorealistic Volumetric Reconstruction with Dynamic Resolution Management via Q-Learning","date":"2025-02-05","arxiv_id":"2502.05222","n_code_links":0,"syntology":null},{"paper":"/paper/dual-ensembled-multiagent-q-learning-with","slug":"dual-ensembled-multiagent-q-learning-with","title":"Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer","date":"2025-02-04","arxiv_id":"2502.02018","n_code_links":1,"syntology":null},{"paper":"/paper/flow-q-learning","slug":"flow-q-learning","title":"Flow Q-Learning","date":"2025-02-04","arxiv_id":"2502.02538","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":4,"n_instrument":1,"unverified":2,"pointer_only":5,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["seohongpark/fql"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"resilient-uav-trajectory-planning-via-few","title":"Resilient UAV Trajectory Planning via Few-Shot Meta-Offline Reinforcement Learning","date":"2025-02-03","arxiv_id":"2502.01268","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-mdp-model-for-censoring-in-harvesting","title":"An MDP Model for Censoring in Harvesting Sensors: Optimal and Approximated Solutions","date":"2025-02-02","arxiv_id":"2502.00940","n_code_links":0,"syntology":null},{"paper":null,"slug":"computing-and-learning-mean-field-equilibria","title":"Computing and Learning Stationary Mean Field Equilibria with Scalar Interactions: Algorithms and Applications","date":"2025-02-02","arxiv_id":"2502.12024","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-from-suboptimal-data-in-continuous","title":"Learning from Suboptimal Data in Continuous Control via Auto-Regressive Soft Q-Network","date":"2025-02-01","arxiv_id":"2502.00288","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-quantum-circuit","title":"Reinforcement Learning for Quantum Circuit Design: Using Matrix Representations","date":"2025-01-27","arxiv_id":"2501.16509","n_code_links":0,"syntology":null},{"paper":null,"slug":"music-generation-using-human-in-the-loop","title":"Music Generation using Human-In-The-Loop Reinforcement Learning","date":"2025-01-25","arxiv_id":"2501.15304","n_code_links":0,"syntology":null},{"paper":null,"slug":"coordinating-ride-pooling-with-public-transit","title":"Coordinating Ride-Pooling with Public Transit using Reward-Guided Conservative Q-Learning: An Offline Training and Online Fine-Tuning Reinforcement Learning Framework","date":"2025-01-24","arxiv_id":"2501.14199","n_code_links":0,"syntology":null},{"paper":null,"slug":"bmg-q-localized-bipartite-match-graph","title":"BMG-Q: Localized Bipartite Match Graph Attention Q-Learning for Ride-Pooling Order Dispatch","date":"2025-01-23","arxiv_id":"2501.13448","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-return-distributions-with","title":"Optimizing Return Distributions with Distributional Dynamic Programming","date":"2025-01-22","arxiv_id":"2501.13028","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1734,"with_a_code_link":464,"where_syntology_ran_a_sample":126,"not_listed_spam_title":0,"listed":1734,"listed_where_code_ran":126,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":104,"every_run_a_failure_of_syntologys_instrument":22,"listed_with_a_run_with_no_instrument_failure":104,"listed_every_run_a_failure_of_syntologys_instrument":22,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":126,"papers_where_code_ran_first_page":"/method/q-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":18,"url":"/method/q-learning/papers/2","json":"/method/q-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":18,"url":"/method/q-learning/papers/3","json":"/method/q-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":18,"url":"/method/q-learning/papers/4","json":"/method/q-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":18,"url":"/method/q-learning/papers/5","json":"/method/q-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":18,"url":"/method/q-learning/papers/6","json":"/method/q-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":18,"url":"/method/q-learning/papers/7","json":"/method/q-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":18,"url":"/method/q-learning/papers/8","json":"/method/q-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":18,"url":"/method/q-learning/papers/9","json":"/method/q-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":18,"url":"/method/q-learning/papers/10","json":"/method/q-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":18,"url":"/method/q-learning/papers/11","json":"/method/q-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":18,"url":"/method/q-learning/papers/12","json":"/method/q-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":18,"url":"/method/q-learning/papers/13","json":"/method/q-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":18,"url":"/method/q-learning/papers/14","json":"/method/q-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":18,"url":"/method/q-learning/papers/15","json":"/method/q-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":18,"url":"/method/q-learning/papers/16","json":"/method/q-learning/papers/16.json","rows":100},{"order":"archive","page":17,"of":18,"url":"/method/q-learning/papers/17","json":"/method/q-learning/papers/17.json","rows":100},{"order":"archive","page":18,"of":18,"url":"/method/q-learning/papers/18","json":"/method/q-learning/papers/18.json","rows":34},{"order":"ran","page":1,"of":2,"url":"/method/q-learning/papers/ran/1","json":"/method/q-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/method/q-learning/papers/ran/2","json":"/method/q-learning/papers/ran/2.json","rows":26}],"tasks":[{"task":"/task/q-learning","name":"Q-Learning","papers":1321},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":898},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":783},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":776},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":409},{"task":"/task/decision-making","name":"Decision Making","papers":134},{"task":"/task/atari-games","name":"Atari Games","papers":103},{"task":"/task/multi-agent-reinforcement-learning","name":"Multi-agent Reinforcement Learning","papers":100},{"task":"/task/management","name":"Management","papers":74},{"task":"/task/offline-rl","name":"Offline RL","papers":64},{"task":"/task/scheduling","name":"Scheduling","papers":60},{"task":"/task/continuous-control","name":"Continuous Control","papers":46},{"task":"/task/openai-gym","name":"OpenAI Gym","papers":45},{"task":"/task/continuous-control","name":"continuous-control","papers":42},{"task":"/task/sequential-decision-making","name":"Sequential Decision Making","papers":34},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":33},{"task":"/task/imitation-learning","name":"Imitation Learning","papers":31},{"task":"/task/d4rl","name":"D4RL","papers":28},{"task":"/task/mujoco","name":"MuJoCo","papers":27},{"task":"/task/autonomous-vehicles","name":"Autonomous Vehicles","papers":25}],"tasks_shown":20,"n_tasks":393,"usage_by_year":[{"year":"2009","papers":1},{"year":"2010","papers":1},{"year":"2011","papers":1},{"year":"2013","papers":6},{"year":"2014","papers":5},{"year":"2015","papers":17},{"year":"2016","papers":23},{"year":"2017","papers":64},{"year":"2018","papers":110},{"year":"2019","papers":181},{"year":"2020","papers":243},{"year":"2021","papers":269},{"year":"2022","papers":188},{"year":"2023","papers":250},{"year":"2024","papers":269},{"year":"2025","papers":106}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/q-learning"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Q-Learning","read_at":"2026-10-05T01:00:48+00:00","query":"Q-Learning","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Q-Learning' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"56ee60daad6705961cbb06a8dbe3b035c91b1d46d47359f347b03d9e54002a48","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}