Edge Rewrite
restyle Source code View original
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

AlphaChip

Add links
From Wikipedia, the free encyclopedia

AlphaChip is a deep reinforcement learning method for automated chip floorplanning. It was developed at Google and is now a portion of the offerings of the spinoff Ricursive. The basic ideas were introduced in a 2021 paper, which describes an approach to macro placement, a stage of chip floorplanning. It is based on reinforcement learning (RL), a machine learning method in which a system iteratively improves its decisions by optimizing performance-based reward signals.[1]

The claims of the 2021 paper have engendered considerable controversy.

Background

[edit]
A CPU floorplan with structural blocks indicated by yellow outlines. Within blocks, macros of different sizes and "glue logic" in between can be seen. SRAM memories represent some of the largest macros.

Chip design for modern integrated circuits is a complex, expert-driven process that relies on electronic design automation (EDA). It determines the cost and performance of the final chip, and typically takes weeks or months to complete. Advances that produce better designs, or complete the process faster, are commercially and academically significant.[2][3][1]

Macro placement, the step performed by AlphaChip, is the portion of chip design that determines the locations of large circuit components (macros).[4][5] The number of macros per circuit typically ranges from several to thousands.[4]

A full evaluation of the quality of a proposed placement is slow. Wiring must be performed after placement, and strongly influences the power, performance, and area (PPA) of the completed chip. A full wiring calculation is too slow to use when investigating changes in placement, so placement tools typically use a proxy cost, a simplified objective function used to guide the placement algorithm during training and evaluation.[1] The faithfulness of the chosen proxy cost to the final objective cost is a critical aspect of placer performance.[6][7][8]

2021 Nature paper

[edit]

In 2021, Nature published a paper under the title “A graph‑placement methodology for fast chip design” co‑authored by 21 Google-affiliated researchers. The paper reported that an RL agent could generate macro placements for integrated circuits "in under six hours" and achieve improvements over human-designed layouts in power, timing performance, and area (PPA), standard chip-quality metrics referring respectively to energy consumption, chip operating speed, and silicon footprint (evaluated after wire routing).[1] It introduced a sequential macro placement algorithm in which macros are placed one at a time instead of optimizing their locations concurrently. At each step, the algorithm selects a location for a single macro on a discretized chip canvas, conditioning its decision on the placements of previously placed macros. This sequential formulation converts macro placement into a long-horizon decision process in which early placement choices constrain later ones. After macro placement, force-directed placement is applied to place standard cells connected to the macros. Deep reinforcement learning is used to train a policy network to place macros by maximizing a reward that reflects final placement quality (for example, wirelength and congestion). Policy learning occurs during self‑play for one or multiple circuit designs. Further placement optimizations refine the overall layout by balancing wirelength, density, and overlap constraints, while treating the macro locations produced by the RL policy as fixed obstacles. The approach relies on pre-training, in which the RL model is first trained on a corpus of prior designs (twenty in the Nature paper) to learn general placement patterns before being fine-tuned on a specific chip.[9]

Circuit examples used in the study were parts of proprietary Google TPU designs, called blocks (or floorplan partitions). The paper reported results on five blocks and described the approach as generalizable across chip designs.

Controversy

[edit]

The AlphaChip controversy refers to a series of public, scholarly, and legal disputes surrounding the 2021 Nature paper.[10]

The primary technical question is whether the new techniques have been adequately proven to be better than existing techniques. Few direct and publicly verifiable comparisons are available, and both internal Google studies and external attempts to replicate the algorithm have failed to show the claimed benefits. As of 2026, neither Google nor Ricursive has released any results from running its algorithm on modern public benchmarks. This lack of public and explicit comparisons has resulted in considerable skepticism over the paper's claims. In addition, the inability of others (both inside and outside of Google) to replicate the claimed results have sparked concerns about the paper’s methodology, reproducibility, and scientific integrity.

Internal dispute at Google

[edit]

In 2022, Satrajit Chatterjee, a Google engineer involved in reviewing the AlphaChip work, raised concerns internally and drafted an alternative analysis, Stronger Baselines. A leaked copy of this unpublished manuscript[11] argues that established methods outperform the RL approach in a fair comparison. In March 2022, Google declined to publish this analysis and terminated Chatterjee's employment.[2][3]

Chatterjee filed a wrongful dismissal lawsuit, alleging that representations related to the AlphaChip research involved fraud and scientific misconduct.[12] According to court documents, Chatterjee's study was conducted "in the context of a large potential Google Cloud deal". He noted that it "would have been unethical to imply that we had revolutionary technology when our tests showed otherwise" and claimed Google was deliberately withholding material information.[13][2] Furthermore, the committee that reviewed his paper and disapproved its publication was allegedly chaired by subordinates of Jeff Dean, a senior co-author of the Nature paper.[13]: 30 [13] Google’s subsequent motion to dismiss was denied, holding that Chatterjee had plausibly alleged retaliation for refusing to engage in conduct he believed would violate state or federal law.[14][12]

External critism

[edit]

Evaluation and replication

[edit]

The Nature paper described the reduction in design-process time as going from "days or weeks" to "hours", but did not provide per-design time breakdowns or specify the number of engineers, their level of expertise, or the baseline tools and workflow against which this comparison was made. It was also unclear whether the "days or weeks" baseline included time spent on other tasks such as functional design changes. The paper also evaluated the method on fewer benchmarks (five) than is common in the field, and showed mixed results across different evaluation goals[15][16]

While the approach was described as improving circuit area, critics argue the RL optimization did not alter the overall circuit area, as it adjusted only the locations of fixed-shape non-overlapping circuit components within a fixed rectangular layout boundary.[6][15][16]

Because macro placement is largely geometric and its fundamental algorithms are not tied to a specific process node, competing approaches can be evaluated on public benchmarks (tests) across technologies, rather than primarily on proprietary internal designs.[3][17][16][18] This is standard procedure when comparing academic placers.[19][20][21][22][23] In contrast, Google initially reported results on internal proprietary designs, and has since compared directly to only one external placer (DreamPlace),[24], out of many competing placers, and only on older examples. As of 2026 neither Google nor Ricursive has offered direct comparisons with prior methods on more realistic and modern benchmarks.[17][18]

Researchers at the University of California, San Diego (UC San Diego), led by professors Chung-Kuan Cheng and Andrew B. Kahng, have re-implemented the AlphaChip algorithm, working from the description in the paper and the released source code. In 2023, they placed a wide variety of public domain designs using five different placers: their AlphaChip replicate, classic simulated annealing (as described in Stronger Baselines), a leading academic placer (RePlace), a commercial placer (CMP from Cadence), and human placement.[6] In these results, the AlphaChip algorithm did not outperform existing techniques. AlphaChip raised numerous objections to this comparison,[7] and Kahng et. al. in turn replied.[a] After taking the objections into account, they re-did the placements, fully routed them (to avoid any reliance on proxy objectives), and measured the resulting wire length.[15] A portion of their extensive comparisons is shown here;[b] in no cases did the AlphaChip replicate give a shorter wire length than the existing commercial placer.

Routed wire length as determined by results from different placement algorithms
Benchmark AlphaChip (replicate)AnnealingAcademicCommercialHuman
Ariane465398513405468
Black Parrot332289269231259
Mempool112115113103108

They conclude that the reinforcement-learning approach described in the Nature publication did not consistently outperform established placement methods and typically required significantly greater computational effort.[15]

Additional criticism noted the claimed six-hour runtime bound per circuit example did not account for pre-training. In the described experiments, RL policies were trained on twenty circuit blocks and then evaluated on five additional blocks, but the reported runtime reflected only the evaluation phase.[1][15][16] The evaluation reported in the paper relied on computing resources that were larger than those used by other tools.[16]

Starting in 2022, multiple researchers and commentators called for results on publicly available benchmarks to settle the dispute through independent verification and comparison.[2][3][17][25] No positive independent replications of the Nature results have been reported in peer-reviewed literature three[16] and four[15] years since publication.

As of 2026, none of the commercial companies with competing products have adopted AlphaChip's approach. A 2026 statement by Thomas Andersen, vice president for AI & Machine Learning at Synopsys, states: "In core EDA algorithms, there have been attempts with reinforcement learning to come up with better solutions, but that hasn’t really panned out."[26]

Research integrity concerns

[edit]

In October 2024, sixteen methodological concerns were grouped into categories and itemized as "initial doubts" in a detailed critique by chip design researcher and former University of Michigan professor Igor L. Markov in Communications of the ACM,[16] from an arXiv preprint in 2023.[8] The critique described multiple questionable research practices in the evaluation of AlphaChip, particularly around selective reporting of benchmarks and outcomes (cherry-picking), selective use of metrics, and selective choice of baselines. As of 2026, this paper was prefaced with an ACM "EXPRESSION OF CONCERN: An investigation is underway regarding the content and transparency of disclosure for this article."

Nature editorial actions

[edit]

In April 2022, the peer review file for the Nature article was included as a supplementary information file.[27]

In September 2023, Nature added an editor's note to "A graph placement methodology for fast chip design" stating that the paper's performance claims had been called into question and that the editors were investigating the concerns. On 21 September 2023, Andrew B. Kahng's accompanying News & Views article was retracted; the retraction notice said that new information about the methods used in the Google paper had become available after publication and had changed the author’s assessment, and it also said that Nature was conducting an independent investigation of the paper’s performance claims. By late September 2024, the editor's note was removed without explanation,[28][16] but Nature published an addendum to the original paper (dated 26 September 2024). The addendum introduced the name AlphaChip for the proposed RL technique and described methodological details that critics had previously identified as missing, including the use of initial locations.[29] The addendum addressed some methodological details but still lacked the full training and evaluation inputs needed for independent replication.[16][18]

Author responses

[edit]

Lead authors Azalia Mirhoseini and Anna Goldie rejected internal allegations of fraud or serious methodological flaws, describing whistleblower Satrajit Chatterjee's complaints as a "campaign of misinformation."[30] Google spokespeople stated that the method had been vetted, open-sourced, independently replicated, and deployed "around the world."[25] Academics replied that independent replications had not shown the result claimed, and the use of AlphaChip in production does not prove its superiority over prior methods.[15][16] Google researchers also argued that critics omitted pre-training and used insufficient compute. In response, academics pointed out that Google code release[31] included no support for pre-training, the examples used for pre-training were not publicly available, and the compute used in attempted replication equaled the levels reported in the paper. Goldie, Mirhoseini, and Dean responded to the CACM paper with a letter to the editor, describing its meta-analysis as "regurgitating… unpublished, non-peer-reviewed arguments" and containing "thinly veiled fraud allegations already found to be without merit by Nature."[32]

In December 2024, ACM's editor-in-chief, James Larus, publicly invited Jeff Dean and his co-authors to submit their technical response to critiques for peer review.[33]

See also

[edit]

Notes

[edit]
  1. ↑ Google objections to 2023 comparison: (a) Pre-training was not used. (b) Used an order of magnitude fewer compute resources. (c) Did not train to convergence. (d) Evaluated on non-representative benchmarks. (e) Reimplemented algorithm rather than using released code. 2025 UCSD replies: (a) Training added according to spec. (b) Additional and sufficient resources (as specified in Nature paper) added. (c) Some cases still don't converge despite doubling iterations allowed. (d) Test cases using older technology removed. (e) Google supplied code is used for final iterations.
  2. ↑ When multiple AlphaChip variants were tried, only the best result is shown. Results rounded to three digits and orders of magnitude dropped. Best result in bold.

References

[edit]
  1. 1 2 3 4 5 Mirhoseini, Azalia; Goldie, Anna; Yazgan, Mustafa; et al. (2021). "A graph placement methodology for fast chip design". Nature. 594 (7862): 207–212. Bibcode:2021Natur.594..207M. doi:10.1038/s41586-021-03544-w. PMID 34108699.
  2. 1 2 3 4 Wakabayashi D, Metz C (2022-05-02). "Another Firing Among Google's A.I. Brain Trust, and More Discord". The New York Times. ISSN 0362-4331. Archived from the original on 2022-06-12. Retrieved 2022-06-12.
  3. 1 2 3 4 Dave, Paresh (2022-05-03). "Google faces internal battle over research on AI to speed chip design". Reuters.
  4. 1 2 Yan, Jackey Z.; Viswanathan, Natarajan; Chu, Chris (2009). "Handling complexities in modern large-scale mixed-size placement". Proceedings of the 46th Annual Design Automation Conference. ACM. pp. 436–441. doi:10.1145/1629911.1630028. See Table 1.
  5. ↑ A. Kahng, J. Lienig, I. Markov, J. Hu: "VLSI Physical Design: From Graph Partitioning to Timing Closure", Springer (2022), doi:10.1007/978-90-481-9591-6, ISBN 978-3-030-96414-6, pp. 10-13.
  6. 1 2 3 Cheng, Chung-Kuan; Kahng, Andrew B.; Kundu, Sayak; Wang, Yucheng; Wang, Zhiang (2023). "Assessment of Reinforcement Learning for Macro Placement". Proceedings of the 2023 International Symposium on Physical Design. ACM. pp. 158–166. arXiv:2302.11014. doi:10.1145/3569052.3578926. ISBN 978-1-4503-9978-4. Note: The arXiv version has been updated as of March 2026.
  7. 1 2 Goldie, Anna; Mirhoseini, Azalia; Dean, Jeff. "That Chip Has Sailed: A Critique of Unfounded Skepticism Around AI for Chip Design". arXiv:2411.10053 [cs.AI].
  8. 1 2 Markov, Igor L. (2023). "The False Dawn: Reevaluating Google's Reinforcement Learning for Chip Macro Placement". arXiv:2306.09633 [cs.LG].
  9. ↑ Yue, Summer; Songhori, Ebrahim M.; Jiang, Joe Wenjie; Boyd, Toby; Goldie, Anna; Mirhoseini, Azalia; Guadarrama, Sergio (2022). "Scalability and generalization of circuit training for chip floorplanning". Proceedings of the International Symposium on Physical Design (ISPD). ACM. pp. 65–70. doi:10.1145/3505170.3511478.
  10. ↑ Moore, Samuel K. (April 4, 2023). "Ending an Ugly Chapter in Chip Design". IEEE Spectrum. No. June 2023.
  11. ↑ "Stronger Baselines for Evaluating Deep Reinforcement Learning in Chip Placement" (PDF).
  12. 1 2 "Fired Google AI engineer's whistleblower lawsuit moves ahead". Hindustan Times. 2023-07-21.
  13. 1 2 3 Satrajit Chatterjee v. Google, LLC (Case no. 22CV398683) (Superior Court of California, County of Santa Clara 21 February 2023) ("The full complaint as filed in Santa Clara County, detailing Chatterjee’s whistleblower allegations and claims against Google."), Text.
  14. ↑ Burnson, Robert (2023-07-20). "Fired Google engineer's whistleblower lawsuit moves forward". Bloomberg.
  15. 1 2 3 4 5 6 7 Cheng, Chung-Kuan; Kahng, Andrew B.; Kundu, Sayak; Wang, Zhiang (2025). "An Updated Assessment of Reinforcement Learning for Macro Placement". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems: 1. doi:10.1109/TCAD.2025.3644293.
  16. 1 2 3 4 5 6 7 8 9 10 Markov, Igor L. (2024). "Reevaluating Google's Reinforcement Learning for IC Macro Placement". Communications of the ACM. 67 (12): 54–71. arXiv:2306.09633. doi:10.1145/3676845.
  17. 1 2 3 Goth, Gregory (2023-03-29). "More details, but not enough". Communications of the ACM.
  18. 1 2 3 Halper, Mark (2024-11-04). "Updates Spark Uproar". Communications of the ACM.
  19. ↑ Kahng, A. B.; Wang, Q. (2005). "Implementation and extensibility of an analytic placer". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24 (5): 734–747. doi:10.1109/TCAD.2005.846366.
  20. ↑ Lu, J.; Du, P.; Cheng, C.-K.; Kahng, A. B. (2015). "ePlace: Electrostatics-Based Placement Using Fast Fourier Transform and Nesterov's Method". ACM Transactions on Design Automation of Electronic Systems. 20 (2): 17:1–17:34. doi:10.1145/2699873.
  21. ↑ Chen, T.-C.; Jiang, Z.-W.; Hsu, T.-C.; Chen, H.-C.; Chang, Y.-W. (2008). "NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27 (7): 1228–1240. doi:10.1109/TCAD.2008.923063.
  22. ↑ Cheng, C.-K.; Kahng, A. B.; Kang, I.; Wang, L. (2019). "RePlAce: Advancing Solution Quality and Routability Validation in Global Placement". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 38 (9): 1717–1730. doi:10.1109/TCAD.2018.2859220.
  23. ↑ Lin, Y.; Jiang, Z.; Gu, J.; Li, W.; Dhar, S.; Ren, H.; Khailany, B.; Pan, D. Z. (2021). "DREAMPlace: Deep Learning Toolkit-Enabled GPU Acceleration for Modern VLSI Placement". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40 (4): 748–761. doi:10.1109/TCAD.2020.3003843.
  24. ↑ Jiang, Zixuan; Songhori, Ebrahim; Wang, Shen; Goldie, Anna; Mirhoseini, Azalia; Jiang, Joe; Lee, Young-Joon; Pan, David Z. (2021-09-06). "Delving into Macro Placement with Reinforcement Learning". arXiv:2109.02587 [cs.LG].
  25. 1 2 Hsu J (2024-10-14). "Google says its AI designs chips better than humans - Experts disagree". New Scientist. Archived from the original on March 5, 2025. Retrieved 2025-07-27.
  26. ↑ "AI's Potential And Limitations In Chip Design".
  27. ↑
  28. ↑ Joelving, Fredrik (2023-09-26). "Nature flags doubts over Google AI study, pulls commentary". Retraction Watch.
  29. ↑ Mirhoseini, Azalia; Goldie, Anna; Yazgan, Mustafa; et al. (2024-09-26). "Addendum: A graph placement methodology for fast chip design". Nature. 634 (8034): E10–E11. Bibcode:2024Natur.634E..10G. doi:10.1038/s41586-024-08032-5.
  30. ↑ Simonite, Tom (2022-05-31). "Tension Inside Google Over a Fired AI Researcher's Conduct". Wired. Retrieved 2026-01-25.
  31. ↑ Mirhoseini, Azalia; Goldie, Anna; et al. (2022). "Author Correction: A graph placement methodology for fast chip design". Nature. 604 (7906): E24. Bibcode:2022Natur.604E..24M. doi:10.1038/s41586-022-04657-6.
  32. ↑ Goldie, Anna; Mirhoseini, Azalia; Dean, Jeff (2024-12-20). "Is It Math or CS? Or Is It Both?". Communications of the ACM. Analyzing 'Meta-analysis'.
  33. ↑ Larus, James (2024-12-20). "Is It Math or CS? Or Is It Both?". Communications of the ACM. Editor-in-Chief’s response.
Retrieved from "https://en.wikipedia.org/w/index.php?title=AlphaChip&oldid=1366171271"