{"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/a3c","slug":"a3c","name":"A3C","full_name":"A3C","full_name_withheld":false,"description_markdown":"**A3C**, **Asynchronous Advantage Actor Critic**, is a policy gradient algorithm in reinforcement learning that maintains a policy $\\pi\\left(a\\_{t}\\mid{s}\\_{t}; \\theta\\right)$ and an estimate of the value\r\nfunction $V\\left(s\\_{t}; \\theta\\_{v}\\right)$. It operates in the forward view and uses a mix of $n$-step returns to update both the policy and the value-function. The policy and the value function are updated after every $t\\_{\\text{max}}$ actions or when a terminal state is reached. The update performed by the algorithm can be seen as $\\nabla\\_{\\theta{'}}\\log\\pi\\left(a\\_{t}\\mid{s\\_{t}}; \\theta{'}\\right)A\\left(s\\_{t}, a\\_{t}; \\theta, \\theta\\_{v}\\right)$ where $A\\left(s\\_{t}, a\\_{t}; \\theta, \\theta\\_{v}\\right)$ is an estimate of the advantage function given by:\r\n\r\n$$\\sum^{k-1}\\_{i=0}\\gamma^{i}r\\_{t+i} + \\gamma^{k}V\\left(s\\_{t+k}; \\theta\\_{v}\\right) - V\\left(s\\_{t}; \\theta\\_{v}\\right)$$\r\n\r\nwhere $k$ can vary from state to state and is upper-bounded by $t\\_{max}$.\r\n\r\nThe critics in A3C learn the value function while multiple actors are trained in parallel and get synced with global parameters every so often. The gradients are accumulated as part of training for stability - this is like parallelized stochastic gradient descent.\r\n\r\nNote that while the parameters $\\theta$ of the policy and $\\theta\\_{v}$ of the value function are shown as being separate for generality, we always share some of the parameters in practice. We typically use a convolutional neural network that has one [softmax](https://paperswithcode.com/method/softmax) output for the policy $\\pi\\left(a\\_{t}\\mid{s}\\_{t}; \\theta\\right)$ and one linear output for the value function $V\\left(s\\_{t}; \\theta\\_{v}\\right)$, with all non-output layers shared.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Asynchronous Methods for Deep Reinforcement Learning","paper":"/paper/asynchronous-methods-for-deep-reinforcement","first_author":"Volodymyr Mnih","n_authors":8,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/asynchronous-methods-for-deep-reinforcement"},"source":{"url":"http://arxiv.org/abs/1602.01783v2","title":"Asynchronous Methods for Deep Reinforcement Learning","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Policy Gradient Methods","url":"/methods/category/policy-gradient-methods","pwc_aliases":[]}],"n_papers_tagged":57,"archive_num_papers":57,"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":"energy-efficient-rsma-based-leo-satellite","title":"Energy Efficient RSMA-Based LEO Satellite Communications Assisted by UAV-Mounted BD-Active RIS: A DRL Approach","date":"2025-05-07","arxiv_id":"2505.04148","n_code_links":0,"syntology":null},{"paper":null,"slug":"intelligent-task-scheduling-for-microservices","title":"Intelligent Task Scheduling for Microservices via A3C-Based Reinforcement Learning","date":"2025-05-01","arxiv_id":"2505.00299","n_code_links":0,"syntology":null},{"paper":null,"slug":"demand-aware-beam-hopping-and-power","title":"Demand-Aware Beam Hopping and Power Allocation for Load Balancing in Digital Twin empowered LEO Satellite Networks","date":"2024-10-29","arxiv_id":"2411.08896","n_code_links":0,"syntology":null},{"paper":null,"slug":"survival-of-the-fittest-evolutionary","title":"Survival of the Fittest: Evolutionary Adaptation of Policies for Environmental Shifts","date":"2024-10-22","arxiv_id":"2410.19852","n_code_links":0,"syntology":null},{"paper":null,"slug":"physical-informed-inspired-deep-reinforcement","title":"Physical Informed-Inspired Deep Reinforcement Learning Based Bi-Level Programming for Microgrid Scheduling","date":"2024-10-15","arxiv_id":"2410.11932","n_code_links":0,"syntology":null},{"paper":null,"slug":"criticality-and-safety-margins-for","title":"Criticality and Safety Margins for Reinforcement Learning","date":"2024-09-26","arxiv_id":"2409.18289","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluation-of-reinforcement-learning-for","title":"Evaluation of Reinforcement Learning for Autonomous Penetration Testing using A3C, Q-learning and DQN","date":"2024-07-22","arxiv_id":"2407.15656","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-deep-reinforcement-learning-approach-for-20","title":"A Deep Reinforcement Learning Approach for Trading Optimization in the Forex Market with Multi-Agent Asynchronous Distribution","date":"2024-05-30","arxiv_id":"2405.19982","n_code_links":0,"syntology":null},{"paper":null,"slug":"sum-throughput-maximization-in-multi-bd","title":"Sum Throughput Maximization in Multi-BD Symbiotic Radio NOMA Network Assisted by Active-STAR-RIS","date":"2024-01-16","arxiv_id":"2401.08301","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-actions-and-control-of-focus-of","title":"Learning Actions and Control of Focus of Attention with a Log-Polar-like Sensor","date":"2023-09-22","arxiv_id":"2309.12634","n_code_links":0,"syntology":null},{"paper":null,"slug":"safety-margins-for-reinforcement-learning","title":"Safety Margins for Reinforcement Learning","date":"2023-07-25","arxiv_id":"2307.13642","n_code_links":0,"syntology":null},{"paper":"/paper/relu-to-the-rescue-improve-your-on-policy","slug":"relu-to-the-rescue-improve-your-on-policy","title":"ReLU to the Rescue: Improve Your On-Policy Actor-Critic with Positive Advantages","date":"2023-06-02","arxiv_id":"2306.01460","n_code_links":1,"syntology":null},{"paper":null,"slug":"double-a3c-deep-reinforcement-learning-on","title":"Double A3C: Deep Reinforcement Learning on OpenAI Gym Games","date":"2023-03-04","arxiv_id":"2303.02271","n_code_links":0,"syntology":null},{"paper":"/paper/solving-the-side-chain-packing-arrangement-of","slug":"solving-the-side-chain-packing-arrangement-of","title":"Reinforcement Learning for Molecular Dynamics Optimization: A Stochastic Pontryagin Maximum Principle Approach","date":"2022-12-06","arxiv_id":"2212.03320","n_code_links":1,"syntology":null},{"paper":null,"slug":"point-cloud-scene-completion-with-joint-color","title":"Point Cloud Scene Completion with Joint Color and Semantic Estimation from Single RGB-D Image","date":"2022-10-12","arxiv_id":"2210.05891","n_code_links":0,"syntology":null},{"paper":"/paper/deep-reinforcement-learning-for-a-two-echelon","slug":"deep-reinforcement-learning-for-a-two-echelon","title":"Comparing Deep Reinforcement Learning Algorithms in Two-Echelon Supply Chains","date":"2022-04-20","arxiv_id":"2204.09603","n_code_links":1,"syntology":null},{"paper":null,"slug":"rl-coseg-a-novel-image-co-segmentation","title":"RL-CoSeg : A Novel Image Co-Segmentation Algorithm with Deep Reinforcement Learning","date":"2022-04-12","arxiv_id":"2204.05951","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-reward-machines-a-study-in-partially","title":"Learning Reward Machines: A Study in Partially Observable Reinforcement Learning","date":"2021-12-17","arxiv_id":"2112.09477","n_code_links":0,"syntology":null},{"paper":null,"slug":"visual-explanation-using-attention-mechanism-1","title":"Visual Explanation using Attention Mechanism in Actor-Critic-based Deep Reinforcement Learning","date":"2021-03-06","arxiv_id":"2103.04067","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-survey-of-motion-planning-algorithms-for","title":"A review of motion planning algorithms for intelligent robotics","date":"2021-02-04","arxiv_id":"2102.02376","n_code_links":0,"syntology":null},{"paper":null,"slug":"asynchronous-advantage-actor-critic-non-1","title":"Towards Understanding Asynchronous Advantage Actor-critic: Convergence and Linear Speedup","date":"2020-12-31","arxiv_id":"2012.15511","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-scheduling-for-stochastic-edge-cloud","slug":"dynamic-scheduling-for-stochastic-edge-cloud","title":"Dynamic Scheduling for Stochastic Edge-Cloud Computing Environments using A3C learning and Residual Recurrent Neural Networks","date":"2020-09-01","arxiv_id":"2009.02186","n_code_links":1,"syntology":null},{"paper":null,"slug":"lagrangian-duality-in-reinforcement-learning","title":"Lagrangian Duality in Reinforcement Learning","date":"2020-07-20","arxiv_id":"2007.09998","n_code_links":0,"syntology":null},{"paper":"/paper/particle-based-adaptive-discretization-for","slug":"particle-based-adaptive-discretization-for","title":"PFPN: Continuous Control of Physically Simulated Characters using Particle Filtering Policy Network","date":"2020-03-16","arxiv_id":"2003.06959","n_code_links":1,"syntology":null},{"paper":"/paper/explore-and-exploit-with-heterotic-line","slug":"explore-and-exploit-with-heterotic-line","title":"Explore and Exploit with Heterotic Line Bundle Models","date":"2020-03-10","arxiv_id":"2003.04817","n_code_links":1,"syntology":null},{"paper":null,"slug":"asynchronous-policy-evaluation-in-distributed","title":"Fully Asynchronous Policy Evaluation in Distributed Reinforcement Learning over Networks","date":"2020-03-01","arxiv_id":"2003.00433","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-visual-communication-map-for-multi-agent","title":"A Visual Communication Map for Multi-Agent Deep Reinforcement Learning","date":"2020-02-27","arxiv_id":"2002.11882","n_code_links":0,"syntology":null},{"paper":null,"slug":"intelligent-roundabout-insertion-using-deep","title":"Intelligent Roundabout Insertion using Deep Reinforcement Learning","date":"2020-01-03","arxiv_id":"2001.00786","n_code_links":0,"syntology":null},{"paper":null,"slug":"intelligent-coordination-among-multiple","title":"Intelligent Coordination among Multiple Traffic Intersections Using Multi-Agent Reinforcement Learning","date":"2019-12-09","arxiv_id":"1912.03851","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversary-a3c-for-robust-reinforcement-1","title":"Adversary A3C for Robust Reinforcement Learning","date":"2019-12-01","arxiv_id":"1912.00330","n_code_links":0,"syntology":null},{"paper":"/paper/learning-reward-machines-for-partially","slug":"learning-reward-machines-for-partially","title":"Learning Reward Machines for Partially Observable Reinforcement Learning","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/vusfavariational-universal-successor-features","slug":"vusfavariational-universal-successor-features","title":"VUSFA:Variational Universal Successor Features Approximator to Improve Transfer DRL for Target Driven Visual Navigation","date":"2019-08-18","arxiv_id":"1908.06376","n_code_links":2,"syntology":null},{"paper":null,"slug":"incremental-reinforcement-learning-a-new","title":"Incremental Reinforcement Learning --- a New Continuous Reinforcement Learning Frame Based on Stochastic Differential Equation methods","date":"2019-08-08","arxiv_id":"1908.02974","n_code_links":0,"syntology":null},{"paper":null,"slug":"terminal-prediction-as-an-auxiliary-task-for","title":"Terminal Prediction as an Auxiliary Task for Deep Reinforcement Learning","date":"2019-07-24","arxiv_id":"1907.10827","n_code_links":0,"syntology":null},{"paper":null,"slug":"agent-modeling-as-auxiliary-task-for-deep","title":"Agent Modeling as Auxiliary Task for Deep Reinforcement Learning","date":"2019-07-22","arxiv_id":"1907.09597","n_code_links":0,"syntology":null},{"paper":"/paper/jointly-pre-training-with-supervised","slug":"jointly-pre-training-with-supervised","title":"Jointly Pre-training with Supervised, Autoencoder, and Value Losses for Deep Reinforcement Learning","date":"2019-04-03","arxiv_id":"1904.02206","n_code_links":1,"syntology":null},{"paper":"/paper/unsupervised-traffic-accident-detection-in","slug":"unsupervised-traffic-accident-detection-in","title":"Unsupervised Traffic Accident Detection in First-Person Videos","date":"2019-03-02","arxiv_id":"1903.00618","n_code_links":2,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["MoonBlvd/tad-IROS2019"],"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":"/paper/combinational-q-learning-for-dou-di-zhu","slug":"combinational-q-learning-for-dou-di-zhu","title":"Combinational Q-Learning for Dou Di Zhu","date":"2019-01-24","arxiv_id":"1901.08925","n_code_links":1,"syntology":null},{"paper":null,"slug":"using-monte-carlo-tree-search-as-a","title":"Using Monte Carlo Tree Search as a Demonstrator within Asynchronous Deep RL","date":"2018-11-30","arxiv_id":"1812.00045","n_code_links":0,"syntology":null},{"paper":"/paper/single-agent-policy-tree-search-with","slug":"single-agent-policy-tree-search-with","title":"Single-Agent Policy Tree Search With Guarantees","date":"2018-11-27","arxiv_id":"1811.10928","n_code_links":1,"syntology":null},{"paper":null,"slug":"gradient-band-based-adversarial-training-for","title":"Gradient Band-based Adversarial Training for Generalized Attack Immunity of A3C Path Finding","date":"2018-07-18","arxiv_id":"1807.06752","n_code_links":0,"syntology":null},{"paper":"/paper/crawling-in-rogues-dungeons-with-partitioned","slug":"crawling-in-rogues-dungeons-with-partitioned","title":"Crawling in Rogue's dungeons with (partitioned) A3C","date":"2018-04-23","arxiv_id":"1804.08685","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-brandom-ian-view-of-reinforcement-learning","title":"A Brandom-ian view of Reinforcement Learning towards strong-AI","date":"2018-03-07","arxiv_id":"1803.02912","n_code_links":0,"syntology":null},{"paper":"/paper/deep-neuroevolution-genetic-algorithms-are-a","slug":"deep-neuroevolution-genetic-algorithms-are-a","title":"Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning","date":"2017-12-18","arxiv_id":"1712.06567","n_code_links":12,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":null,"slug":"natural-value-approximators-learning-when-to","title":"Natural Value Approximators: Learning when to Trust Past Estimates","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/teaching-a-machine-to-read-maps-with-deep","slug":"teaching-a-machine-to-read-maps-with-deep","title":"Teaching a Machine to Read Maps with Deep Reinforcement Learning","date":"2017-11-20","arxiv_id":"1711.07479","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-search-through-a3c-reinforcement","title":"Improving Search through A3C Reinforcement Learning based Conversational Agent","date":"2017-09-17","arxiv_id":"1709.05638","n_code_links":0,"syntology":null},{"paper":"/paper/darla-improving-zero-shot-transfer-in","slug":"darla-improving-zero-shot-transfer-in","title":"DARLA: Improving Zero-Shot Transfer in Reinforcement Learning","date":"2017-07-26","arxiv_id":"1707.08475","n_code_links":1,"syntology":null},{"paper":"/paper/noisy-networks-for-exploration","slug":"noisy-networks-for-exploration","title":"Noisy Networks for Exploration","date":"2017-06-30","arxiv_id":"1706.10295","n_code_links":15,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"learning-to-factor-policies-and-action-value","title":"Learning to Factor Policies and Action-Value Functions: Factored Action Space Representations for Deep Reinforcement learning","date":"2017-05-20","arxiv_id":"1705.07269","n_code_links":0,"syntology":null},{"paper":"/paper/feature-control-as-intrinsic-motivation-for","slug":"feature-control-as-intrinsic-motivation-for","title":"Feature Control as Intrinsic Motivation for Hierarchical Reinforcement Learning","date":"2017-05-18","arxiv_id":"1705.06769","n_code_links":1,"syntology":null},{"paper":null,"slug":"equivalence-between-policy-gradients-and-soft","title":"Equivalence Between Policy Gradients and Soft Q-Learning","date":"2017-04-21","arxiv_id":"1704.06440","n_code_links":0,"syntology":null},{"paper":"/paper/the-reactor-a-fast-and-sample-efficient-actor","slug":"the-reactor-a-fast-and-sample-efficient-actor","title":"The Reactor: A fast and sample-efficient Actor-Critic agent for Reinforcement Learning","date":"2017-04-15","arxiv_id":"1704.04651","n_code_links":0,"syntology":null},{"paper":null,"slug":"tactics-of-adversarial-attack-on-deep","title":"Tactics of Adversarial Attack on Deep Reinforcement Learning Agents","date":"2017-03-08","arxiv_id":"1703.06748","n_code_links":0,"syntology":null},{"paper":"/paper/reinforcement-learning-through-asynchronous","slug":"reinforcement-learning-through-asynchronous","title":"Reinforcement Learning through Asynchronous Advantage Actor-Critic on a GPU","date":"2016-11-18","arxiv_id":"1611.06256","n_code_links":3,"syntology":null},{"paper":"/paper/asynchronous-methods-for-deep-reinforcement","slug":"asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","arxiv_id":"1602.01783","n_code_links":70,"syntology":{"ran":60,"of":95,"n_ran_checked":50,"n_instrument":10,"unverified":35,"pointer_only":20,"phrase":"60 ran (of which 20 constructed an object rather than computing a result; 50 with no instrument failure: 2 honoured, 1 violated, 47 with no contract checked; 10 where Syntology's instrument failed) · 35 unverified","official":null}}],"papers_shown":57,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":57,"with_a_code_link":20,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":57,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":1,"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":4,"papers_where_code_ran_first_page":"/method/a3c/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":"ran","page":1,"of":1,"url":"/method/a3c/papers/ran/1","json":"/method/a3c/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":40},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":40},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":40},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":26},{"task":"/task/atari-games","name":"Atari Games","papers":12},{"task":"/task/q-learning","name":"Q-Learning","papers":8},{"task":"/task/decision-making","name":"Decision Making","papers":5},{"task":"/task/scheduling","name":"Scheduling","papers":5},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":3},{"task":"/task/multi-agent-reinforcement-learning","name":"Multi-agent Reinforcement Learning","papers":3},{"task":"/task/representation-learning","name":"Representation Learning","papers":3},{"task":null,"name":"CPU","papers":2},{"task":"/task/continuous-control","name":"Continuous Control","papers":2},{"task":null,"name":"GPU","papers":2},{"task":"/task/mujoco","name":"MuJoCo","papers":2},{"task":"/task/openai-gym","name":"OpenAI Gym","papers":2},{"task":"/task/partially-observable-reinforcement-learning","name":"Partially Observable Reinforcement Learning","papers":2},{"task":"/task/problem-decomposition","name":"Problem Decomposition","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/continuous-control","name":"continuous-control","papers":2}],"tasks_shown":20,"n_tasks":61,"usage_by_year":[{"year":"2016","papers":2},{"year":"2017","papers":11},{"year":"2018","papers":5},{"year":"2019","papers":10},{"year":"2020","papers":8},{"year":"2021","papers":3},{"year":"2022","papers":4},{"year":"2023","papers":4},{"year":"2024","papers":7},{"year":"2025","papers":3}],"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/a3c"},"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=A3C","read_at":"2026-10-05T00:51:17+00:00","query":"A3C","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":"1602.01783","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 'A3C' -- 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":"edb7ea7b169db4f8f60cf950a087335687c1d09f5ad2357c84b20b4d8e580946","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}