Pith. sign in

REVIEW 3 major objections 2 minor 53 references

Spectral fluctuations and crossovers in multilayer network

T0 review · 3 major / 2 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Multilayer network spectra obey one universal random-matrix curve as layer coupling grows.

desk verdict The abstract promises a multilayer-network RMT paper; the body is an unrelated hardware-accelerator manuscript, so the submission cannot be evaluated. read the letter →

arxiv 2508.12913 v2 pith:3TYJFNMZ submitted 2025-08-18 math-ph math.MPnlin.CDphysics.data-an

Himanshu Shekhar , Ashutosh Dheer , Santosh Kumar , N. Sukumar This is my paper · ORCID
classification math-phmath.MPnlin.CDphysics.data-an MSC 15B5260B2005C82
keywords multilayernetworksrandommatrixtheoryspectralfluctuationsGaussianorthogonalensemblelevelspacingdistributioncrossovermodelproteininteratomicdistanceeigenvaluestatistics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to show that multilayer networks, not just single layers, have universal spectral fluctuations in the random-matrix sense. Writing the adjacency matrix in blocks, the authors rescale each block to equalize variances and then study how eigenvalue statistics change when inter-layer coupling is strengthened. They propose a crossover model in which the spectrum moves smoothly from two independent Gaussian Orthogonal Ensembles at weak coupling to a single Gaussian Orthogonal Ensemble at strong coupling. They test the prediction on interatomic distance networks built from protein crystal structures, arguing that random-matrix theory can serve as a practical probe of real multilayer systems. If correct, the same few spectral statistics that describe atomic and disordered systems would also describe layered biological and technological networks.

What carries the argument

The central object is the block adjacency matrix $$\begin{pmatrix} A_{11} & A_{12} \\ A_{21} & A_{22} \end{pmatrix},$$ where the diagonal blocks hold intra-layer connections and the off-diagonal blocks hold inter-layer connections. The mechanism is variance equalization: a scaling factor per block makes the entries of all blocks comparable in variance, and then a single control parameter, the relative inter-layer to intra-layer strength, drives a one-parameter crossover in the level-spacing statistics. This rescaling is what lets the same Wigner-Dyson fluctuation statistics reappear across different multilayer architectures.

What would settle it

Generate synthetic bilayer matrices with known independent GOE diagonal blocks and controlled inter-layer variance, apply the paper's per-block rescaling, and measure the bulk level-spacing ratio $\langle r \rangle$ across coupling strengths. If the measured curve does not follow the model's one-parameter crossover, or if it jumps abruptly from the two-GOE value to the single-GOE value, the universality claim fails. The test should fix the rescaling constants in advance from variance formulas rather than fitting them per spectrum.

Watch

Extended reading notes

Core claim

The central claim is that, after applying one scaling factor per block of a multilayer adjacency matrix to equalize the variances of intra-layer and inter-layer entries, the eigenvalue fluctuations of the network fall into the GOE universality class. As the relative strength of inter-layer to intra-layer connections increases, the spectral statistics interpolate continuously between the statistics of two independent GOE spectra and the statistics of a single GOE spectrum. The paper further claims that this same behavior appears in interatomic distance networks derived from three protein crystal structures, so universality persists beyond synthetic random graphs.

Load-bearing premise

The load-bearing premise is that rescaling each block by one number is enough to bring the whole adjacency matrix into the GOE universality class, so that the observed Wigner-like statistics are not an artifact of choosing the scales after looking at the data.

Editorial extensions

If this is right

  • Spectral statistics of multilayer networks can be compared directly across different layer counts and coupling patterns once each block is variance-scaled.
  • The fitted crossover parameter provides a single number expressing how strongly layers communicate, potentially serving as a spectral measure of coupling strength.
  • Protein interatomic distance networks with different structures, such as those built from 1EWT, 1EWK, and 1UW6, should show the same universal fluctuation statistics after scaling.
  • Increasing inter-layer coupling should drive any multilayer system from two-GOE to single-GOE statistics, not to a new class of statistics.
  • Random-matrix fluctuation measures can be used as a diagnostic of topological and dynamical complexity in real multilayer networks, not merely in synthetic ensembles.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the crossover parameter is identifiable from spectra alone, it could act as a model-free estimator of layer coupling in networks whose true edge weights are unknown or noisy.
  • The same block-rescaling and crossover logic may apply to graph Laplacians and normalized adjacency matrices, which would extend the result to diffusion and synchronization dynamics on multilayer networks.
  • The protein application suggests a testable extension: fitted crossover parameters could be checked for correlation with protein size, fold class, or the density of inter-chain contacts.
  • A natural stress test would be to apply the scaling procedure to multilayer networks with highly heterogeneous intra-layer degrees, where a single per-block scale factor may be too crude to restore GOE statistics.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The paper as submitted claims to investigate spectral fluctuations in multilayer networks within random matrix theory, proposing block-wise variance equalization, a crossover model for bilayer networks, and an application to protein interatomic distance networks. The abstract states that universality of spectral fluctuations persists across multilayer architectures and that the crossover model captures a smooth transition from two independent GOEs to a single GOE. However, the body text supplied with the submission is an unrelated hardware-architecture paper titled "SparseMap: A Sparse Tensor Accelerator Framework Based on Evolution Strategy," with arXiv ID 2508.12906v1. None of the claimed multilayer random matrix theory, spectral statistics, crossover model, scaling factors, or protein analyses appear in the text. As a result, the technical content of the abstract cannot be checked or reproduced from the submitted manuscript.

Significance. If the claims in the abstract were correct, the paper would establish a useful universality statement for multilayer network spectra and demonstrate a concrete application to protein crystal structures. The crossover scenario from two independent GOEs to a single GOE is scientifically interesting and the application to proteins 1EWT, 1EWK, and 1UW6 is potentially valuable. However, the submission provides no derivations, no numerical experiments, no data analysis, and no reproducible code for these claims. The body text is a different manuscript about sparse tensor accelerator optimization. Thus the significance of the claimed result is currently unassessable from the submitted evidence.

major comments (3)
  1. [Full text, pages 1–14] The submitted body is not the paper described in the abstract. The header and footer identify "SparseMap: A Sparse Tensor Accelerator Framework Based on Evolution Strategy," and the visible arXiv ID in the body is 2508.12906v1, not 2508.12913. The text concerns hardware design-space exploration for sparse tensor accelerators and contains no discussion of multilayer networks, random matrix ensembles, GOE spectral statistics, eigenvalue spacing, or the proteins 1EWT, 1EWK, and 1UW6. Consequently, the central claim that spectral fluctuations are universal across multilayer architectures has no supporting derivation, plot, table, or protocol in the manuscript. This is a load-bearing missing-support issue that prevents substantive evaluation.
  2. [Abstract, third sentence] The block-scaling step is stated only as "Applying appropriate scaling factors for these blocks, we equalize variances across inter- and intra-layers." The manuscript supplies no definition of these factors, no formula, and no statement of whether they are predetermined from model parameters or tuned to the data. Without that information, the subsequent universality claim is unfalsifiable and the risk of circularity raised in the review is real: if the factors are chosen to make the rescaled matrix Wigner-like, the observed universality would be put in by construction. A concrete fix would be to give closed-form scaling factors in terms of the model parameters and show that the level-spacing distribution is Wigner-like across a range of connectivities without data-dependent rescaling.
  3. [Abstract, fifth sentence] The crossover model is not defined anywhere in the submitted text. There is no definition of the crossover parameter, no derivation of the two-GOE to one-GOE transition, and no numerical or analytical results showing a smooth spectral crossover as the inter-layer to intra-layer connection strength varies. The protein network application is also entirely absent: the text does not describe how interatomic distance networks are constructed from the crystal structures, nor does it report spectral statistics for 1EWT, 1EWK, or 1UW6. These omissions are load-bearing because the abstract presents the crossover model and the protein analyses as evidence for the universality claim.
minor comments (2)
  1. [Full text, page 1] The journal-template header "JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021" is a placeholder, and the arXiv ID printed in the body differs from the submitted paper ID; the manuscript appears to be the wrong document and should be verified before any further review.
  2. [Full text throughout] Since the body is a different manuscript, I have not catalogued style or typographical issues for the claimed multilayer-network paper; the correct text must be supplied before presentation issues can be meaningfully assessed.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity demonstrable: the supplied body is an unrelated sparse-accelerator paper, so the RMT multilayer claims have no derivation chain to audit.

full rationale

The abstract claims GOE universality across multilayer networks, a crossover model, and protein network tests, with the key step: "Applying appropriate scaling factors for these blocks, we equalize variances across inter- and intra-layers." The supplied full text, however, is SparseMap (arXiv:2508.12906v1 [cs.LG]), a hardware design-space exploration paper containing no multilayer adjacency matrices, no variance-equalization derivation, no crossover parameter, no level-spacing statistics, and no 1EWT/1EWK/1UW6 analysis. There is therefore no chain of equations from the block-scaling input to the universality output that can be inspected for equivalence. The only candidate circular step is the abstract's "appropriate scaling factors," which a reader might suspect are fit to force Wigner-like spectra; but the body does not specify the fitting rule, and equalizing block variances is not by itself equivalent to enforcing GOE level repulsion, so no reduction can be exhibited. This is a missing-support/provenance failure (the body does not match the abstract), not a demonstrated circularity. Under the hard rule to claim circularity only when quoting an exhibited reduction, the correct circularity finding is a clean 0, with the correctness risk deferred to the missing content rather than scored as circularity.

Assumptions & free parameters 2 free parameters · 3 assumptions · 0 invented entities

The abstract introduces no new physical entities. Its free parameters are the block scaling factors and the crossover strength, neither of which is specified. The core unproved premise is that variance equalization by scaling is sufficient to place the matrix in the GOE universality class.

free parameters (2)
  • Block scaling factors for intra-layer and inter-layer adjacency blocks = not specified
    The abstract states 'applying appropriate scaling factors for these blocks, we equalize variances'; these factors are free parameters whose values are not given and could be fit to the data.
  • Crossover parameter (relative strength of inter-layer to intra-layer connection) = not specified
    The crossover model varies the relative inter-layer connection strength; its definition and any fitted value are not given in the abstract.
assumptions (3)
  • domain assumption A multilayer network is represented by a block adjacency matrix with independent intra- and inter-layer blocks
    This structural assumption underlies the entire analysis and is stated at the start of the abstract.
  • domain assumption Rescaling block variances makes the spectral statistics follow the GOE universality class
    The abstract asserts that after scaling, universal RMT statistics apply; this is an unproved premise and is also the likely site of circularity.
  • domain assumption Protein crystal structures can be encoded as interatomic distance networks whose spectra are comparable to random matrix ensembles
    The application to 1EWT, 1EWK, and 1UW6 relies on this mapping, which is announced but not derived in the abstract.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Spectral fluctuations and crossovers in multilayer network." pith.science (2026). https://pith.science/paper/3TYJFNMZ

@misc{pith2026250812913,
  author       = {Pith},
  title        = {Pith review of: Spectral fluctuations and crossovers in multilayer network},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3TYJFNMZ}},
  note         = {Machine review of arXiv:2508.12913}
}
read the original abstract

We investigate spectral fluctuations in multilayer networks within the random matrix theory (RMT) framework to characterize universal and non-universal features. The adjacency matrix of a multilayer network exhibits a block structure, with diagonal blocks representing intra-layer connections and off-diagonal blocks encoding inter-layer connections. Applying appropriate scaling factors for these blocks, we equalize variances across inter- and intra-layers, enabling direct comparison of spectral statistics. We analyze eigenvalue spectra across multilayer network configurations with varying inter- and intra-layer connectivities. Introducing a crossover model for bilayer networks, we capture the smooth transition of spectral properties from block-diagonal (two independent GOEs) to single-layer (one GOE) statistics as the relative strength of inter-layer to intra-layer connection varies. Furthermore, we analyze interatomic distance networks derived from protein crystal structures, including 1EWT, 1EWK, and 1UW6, to demonstrate applicability. Our findings reveal that the universality of spectral fluctuations persists across multilayer network architectures and highlight RMT as a robust tool for probing topological and dynamical complexities of real-world networks.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

53 extracted references · 37 canonical work pages

  1. [1]

    Tensorflow: a system for large-scale machine learning,

    M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard et al. , “Tensorflow: a system for large-scale machine learning,” in 12th USENIX symposium on operating systems design and implementation (OSDI 16) , 2016, pp. 265–283

    2016

  2. [2]

    Pytorch: An imperative style, high-performance deep learning library,

    A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al. , “Pytorch: An imperative style, high-performance deep learning library,” Advances in neural information processing systems , vol. 32, 2019

    2019

  3. [3]

    A survey of recommendation systems: recommendation models, techniques, and application fields,

    H. Ko, S. Lee, Y . Park, and A. Choi, “A survey of recommendation systems: recommendation models, techniques, and application fields,” Electronics, vol. 11, no. 1, p. 141, 2022

    2022

  4. [4]

    Tiirec: A tensor approach for tag-driven item recommendation with sparse user generated content,

    L. Yu, J. Huang, G. Zhou, C. Liu, and Z.-K. Zhang, “Tiirec: A tensor approach for tag-driven item recommendation with sparse user generated content,” Information Sciences, vol. 411, pp. 122–135, 2017

    work page 2017

  5. [5]

    Hierarchical analysis of power distribution networks,

    M. Zhao, R. V . Panda, S. S. Sapatnekar, T. Edwards, R. Chaudhry, and D. Blaauw, “Hierarchical analysis of power distribution networks,” in Proceedings of the 37th Annual Design Automation Conference , 2000, pp. 150–155

    work page 2000

  6. [6]

    Feasta: A flexible and efficient accelerator for sparse tensor algebra in machine learning,

    K. Zhong, Z. Zhu, G. Dai, H. Wang, X. Yang, H. Zhang, J. Si, Q. Mao, S. Zeng, K. Hong et al. , “Feasta: A flexible and efficient accelerator for sparse tensor algebra in machine learning,” in Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 , 2024, pp. 349–366

    work page 2024

  7. [7]

    Eyeriss: An energy- efficient reconfigurable accelerator for deep convolutional neural net- works,

    Y . H. Chen, T. Krishna, J. S. Emer, and V . Sze, “Eyeriss: An energy- efficient reconfigurable accelerator for deep convolutional neural net- works,” Solid-state Circuits Conference , 2016

    work page 2016

  8. [8]

    Cnvlutin: Ineffectual-neuron-free deep neural network computing,

    J. Albericio, P. Judd, T. Hetherington, T. Aamodt, N. E. Jerger, and A. Moshovos, “Cnvlutin: Ineffectual-neuron-free deep neural network computing,” ACM SIGARCH Computer Architecture News , vol. 44, no. 3, pp. 1–13, 2016

    2016

Show all 53 references
  1. [9]

    Eyeriss v2: A flexible accelerator for emerging deep neural networks on mobile devices,

    Y .-H. Chen, T.-J. Yang, J. Emer, and V . Sze, “Eyeriss v2: A flexible accelerator for emerging deep neural networks on mobile devices,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vol. 9, no. 2, pp. 292–308, 2019

    2019

  2. [10]

    Extensor: An accelerator for sparse tensor algebra,

    K. Hegde, H. Asghari-Moghaddam, M. Pellauer, N. Crago, A. Jaleel, E. Solomonik, J. Emer, and C. W. Fletcher, “Extensor: An accelerator for sparse tensor algebra,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 319–333

    2019

  3. [11]

    Matraptor: A sparse-sparse matrix multiplication accelerator based on row-wise product,

    N. Srivastava, H. Jin, J. Liu, D. Albonesi, and Z. Zhang, “Matraptor: A sparse-sparse matrix multiplication accelerator based on row-wise product,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 2020, pp. 766–780

    2020

  4. [12]

    Gospa: An energy- efficient high-performance globally optimized sparse convolutional neu- ral network accelerator,

    C. Deng, Y . Sui, S. Liao, X. Qian, and B. Yuan, “Gospa: An energy- efficient high-performance globally optimized sparse convolutional neu- ral network accelerator,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2021, pp. 1110– 1123

    2021

  5. [13]

    Outerspace: An outer product based sparse matrix multiplication accelerator,

    S. Pal, J. Beaumont, D.-H. Park, A. Amarnath, S. Feng, C. Chakrabarti, H.-S. Kim, D. Blaauw, T. Mudge, and R. Dreslinski, “Outerspace: An outer product based sparse matrix multiplication accelerator,” in 2018 IEEE International Symposium on High Performance Computer Architectu...

    2018

  6. [14]

    Scnn: An accelerator for compressed-sparse convolutional neural networks,

    A. Parashar, M. Rhu, A. Mukkara, A. Puglielli, R. Venkatesan, JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021 14 B. Khailany, J. Emer, S. W. Keckler, and W. J. Dally, “Scnn: An accelerator for compressed-sparse convolutional neural networks,” ACM SIGARCH computer arc...

    2021

  7. [15]

    Sigma: A sparse and irregular gemm ac- celerator with flexible interconnects for dnn training,

    E. Qin, A. Samajdar, H. Kwon, V . Nadella, S. Srinivasan, D. Das, B. Kaul, and T. Krishna, “Sigma: A sparse and irregular gemm ac- celerator with flexible interconnects for dnn training,” in 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA). IE...

    2020

  8. [16]

    Sparten: A sparse tensor accelerator for convolutional neural networks,

    A. Gondimalla, N. Chesnut, M. Thottethodi, and T. Vijaykumar, “Sparten: A sparse tensor accelerator for convolutional neural networks,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, 2019, pp. 151–165

    2019

  9. [17]

    Sparsity-aware and re-configurable npu architecture for samsung flagship mobile soc,

    J.-W. Jang, S. Lee, D. Kim, H. Park, A. S. Ardestani, Y . Choi, C. Kim, Y . Kim, H. Yu, H. Abdel-Azizet al., “Sparsity-aware and re-configurable npu architecture for samsung flagship mobile soc,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (IS...

    2021

  10. [18]

    Sparseloop: An analytical, energy-focused design space exploration methodology for sparse tensor accelerators,

    Y . N. Wu, P. A. Tsai, A. Parashar, V . Sze, and J. S. Emer, “Sparseloop: An analytical, energy-focused design space exploration methodology for sparse tensor accelerators,” in 2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) , 2021

    2021

  11. [19]

    NVDLA Deep Learning Accelerator,

    NVIDIA, “NVDLA Deep Learning Accelerator,” NVIDIA Corporation, Tech. Rep., 2020, white Paper. [Online]. Available: http://nvdla.org

    2020

  12. [20]

    Nvidia a100 tensor core gpu architecture,

    NVIDIA, “Nvidia a100 tensor core gpu architecture,” NVIDIA Corporation, Tech. Rep., 2020, white Paper. [Online]. Available: https://resources.nvidia.com/en-us-tensor-core/ nvidia-ampere-architecture-whitepaper

    2020

  13. [21]

    A low-power general matrix multiplication acceler- ator with sparse weight-and-output stationary dataflow,

    P. Liu and Y . Wang, “A low-power general matrix multiplication acceler- ator with sparse weight-and-output stationary dataflow,” Micromachines, vol. 16, no. 1, p. 101, 2025

    2025

  14. [22]

    Sparch: Efficient architecture for sparse matrix multiplication,

    Z. Zhang, H. Wang, S. Han, and W. J. Dally, “Sparch: Efficient architecture for sparse matrix multiplication,” in 2020 IEEE Interna- tional Symposium on High Performance Computer Architecture (HPCA). IEEE, 2020, pp. 261–274

    2020

  15. [23]

    Remap: A spatiotemporal cnn accelerator optimization methodology and toolkit thereof,

    B. Zhao, T. Xia, H. Zhai, F. Ma, Y . Du, H. Chang, W. Zhao, and P. Ren, “Remap: A spatiotemporal cnn accelerator optimization methodology and toolkit thereof,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems: A publication of the IEEE Circuits and...

    2023

  16. [24]

    Gamma: automating the hw mapping of dnn models on accelerators via genetic algorithm,

    T. Krishna and S. Kao, “Gamma: automating the hw mapping of dnn models on accelerators via genetic algorithm,” in ICCAD ’20: IEEE/ACM International Conference on Computer-Aided Design , 2020

    2020

  17. [25]

    Confuciux: Autonomous hardware resource assignment for dnn accelerators using reinforcement learning,

    S.-C. Kao, G. Jeong, and T. Krishna, “Confuciux: Autonomous hardware resource assignment for dnn accelerators using reinforcement learning,” in 2020 53rd Annual IEEE/ACM International Symposium on Microar- chitecture (MICRO). IEEE, 2020, pp. 622–636

    2020

  18. [26]

    Towards an auto- tuning system design for optimal sparse compression format selection with user expertise,

    I. Mehrez, O. Hamdi-Larbi, T. Dufaud, and N. Emad, “Towards an auto- tuning system design for optimal sparse compression format selection with user expertise,” in 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) . IEEE, 2016, pp. 1–6

    2016

  19. [27]

    Cdpu: Co-designing compression and decompression processing units for hyperscale sys- tems,

    S. Karandikar, A. N. Udipi, J. Choi, J. Whangbo, J. Zhao, S. Kanev, E. Lim, J. Alakuijala, V . Madduri, Y . S. Shaoet al., “Cdpu: Co-designing compression and decompression processing units for hyperscale sys- tems,” in Proceedings of the 50th Annual International Symposium on...

    2023

  20. [28]

    Extending sparse tensor accelerators to support multiple compression formats,

    E. Qin, G. Jeong, W. Won, S.-C. Kao, H. Kwon, S. Srinivasan, D. Das, G. E. Moon, S. Rajamanickam, and T. Krishna, “Extending sparse tensor accelerators to support multiple compression formats,” in 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . ...

    2021

  21. [29]

    Medea: A multi-objective evolutionary approach to dnn hardware mapping,

    E. Russo, M. Palesi, S. Monteleone, D. Patti, G. Ascia, and V . Catania, “Medea: A multi-objective evolutionary approach to dnn hardware mapping,” in 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 2022, pp. 226–231

    2022

  22. [30]

    Learning by playing solving sparse reward tasks from scratch,

    M. Riedmiller, R. Hafner, T. Lampe, M. Neunert, J. Degrave, T. Wiele, V . Mnih, N. Heess, and J. T. Springenberg, “Learning by playing solving sparse reward tasks from scratch,” in International conference on machine learning . PMLR, 2018, pp. 4344–4353

    2018

  23. [31]

    Dealing with sparse rewards in reinforcement learning,

    J. Hare, “Dealing with sparse rewards in reinforcement learning,” arXiv preprint arXiv:1910.09281, 2019

    1910 arXiv

  24. [32]

    Dual- side sparse tensor core,

    Y . Wang, C. Zhang, Z. Xie, C. Guo, Y . Liu, and J. Leng, “Dual- side sparse tensor core,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2021, pp. 1083– 1095

    2021

  25. [33]

    An overview of data compression techniques,

    S. B. Wright, “An overview of data compression techniques,” Ph.D. dissertation, University of Washington, 1989

    1989

  26. [34]

    [Online]

    (2016). [Online]. Available: https://github.com/baidu-research/ deepbench

    2016

  27. [35]

    Integrated particle swarm optimization (i-pso): An adaptive design space exploration framework for power- performance tradeoff in architectural synthesis,

    A. Sengupta and V . K. Mishra, “Integrated particle swarm optimization (i-pso): An adaptive design space exploration framework for power- performance tradeoff in architectural synthesis,” in Fifteenth Interna- tional Symposium on Quality Electronic Design . IEEE, 2014, pp. 60– 67

    2014

  28. [36]

    Autonomous design of noise- mitigating structures using deep reinforcement learning,

    S. B. Gebrekidan and S. Marburg, “Autonomous design of noise- mitigating structures using deep reinforcement learning,” The Journal of the Acoustical Society of America , vol. 156, no. 1, pp. 151–163, 2024

    2024

  29. [37]

    A fast and elitist multiobjective genetic algorithm: Nsga-ii,

    K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: Nsga-ii,” IEEE transactions on evolu- tionary computation, vol. 6, no. 2, pp. 182–197, 2002

    2002

  30. [38]

    Automated docking using a lamarckian genetic algorithm and an empirical binding free energy function,

    G. M. Morris, D. S. Goodsell, R. S. Halliday, R. Huey, W. E. Hart, R. K. Belew, and A. J. Olson, “Automated docking using a lamarckian genetic algorithm and an empirical binding free energy function,” Journal of computational chemistry, vol. 19, no. 14, pp. 1639–1662, 1998

    1998

  31. [39]

    Develop- ment and validation of a genetic algorithm for flexible docking,

    G. Jones, P. Willett, R. C. Glen, A. R. Leach, and R. Taylor, “Develop- ment and validation of a genetic algorithm for flexible docking,” Journal of molecular biology , vol. 267, no. 3, pp. 727–748, 1997

    1997

  32. [40]

    Multiobjective optimization using nondominated sorting in genetic algorithms,

    J. Schaffer, “Multiobjective optimization using nondominated sorting in genetic algorithms,” in Proceedings of the First International Conference on Genetic Algorithms and Their Applications . Lawrence Erlbaum Associates, 1985, pp. 160–168

    1985

  33. [41]

    Genetic algorithms in search, optimization and machine learning,

    G. Zames, “Genetic algorithms in search, optimization and machine learning,” Inf Tech J, vol. 3, no. 1, p. 301, 1981

    1981

  34. [42]

    Mitchell, An introduction to genetic algorithms

    M. Mitchell, An introduction to genetic algorithms . MIT press, 1998

    1998

  35. [43]

    Gene expression programming: A survey,

    J. Zhong, L. Feng, and Y .-S. Ong, “Gene expression programming: A survey,” IEEE Computational Intelligence Magazine , vol. 12, no. 3, pp. 54–72, 2017

    2017

  36. [44]

    A review of population initial- ization techniques for evolutionary algorithms,

    B. Kazimipour, X. Li, and A. K. Qin, “A review of population initial- ization techniques for evolutionary algorithms,” in 2014 IEEE congress on evolutionary computation (CEC) . IEEE, 2014, pp. 2585–2592

    2014

  37. [45]

    Initialization strategies and diversity in evolutionary timetabling,

    E. K. Burke, J. P. Newall, and R. F. Weare, “Initialization strategies and diversity in evolutionary timetabling,” Evolutionary computation, vol. 6, no. 1, pp. 81–103, 1998

    1998

  38. [46]

    Natural evolutionary strategies for variational quantum computation,

    A. Anand, M. Degroote, and A. Aspuru-Guzik, “Natural evolutionary strategies for variational quantum computation,” Machine Learning: Science and Technology, vol. 2, no. 4, p. 045012, 2021

    2021

  39. [47]

    An advanced initialization technique for metaheuristic optimization: a fusion of latin hypercube sampling and evolutionary behaviors,

    H. Escobar-Cuevas, E. Cuevas, K. Avila, and O. Avalos, “An advanced initialization technique for metaheuristic optimization: a fusion of latin hypercube sampling and evolutionary behaviors,” Computational and Applied Mathematics, vol. 43, no. 4, p. 234, 2024

    2024

  40. [48]

    Latin hypercube initialization strategy for design space exploration of deep neural network architectures,

    H. R. Medeiros, D. M. Izidio, A. P. d. A. Ferreira, and E. N. da S. Barros, “Latin hypercube initialization strategy for design space exploration of deep neural network architectures,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion , 2019, pp. 295–296

    2019

  41. [49]

    The initialization of evolutionary multi- objective optimization algorithms,

    M. Hamdan and O. Qudah, “The initialization of evolutionary multi- objective optimization algorithms,” in Advances in Swarm and Com- putational Intelligence: 6th International Conference, ICSI 2015, held in conjunction with the Second BRICS Congress, CCI 2015, Beijing, China, ...

    2015

  42. [50]

    A multistrategy differential evolution algorithm combined with latin hypercube sampling applied to a brain–computer interface to improve the effect of node displacement,

    H. Chang, Y . Sun, S. Lu, and D. Lin, “A multistrategy differential evolution algorithm combined with latin hypercube sampling applied to a brain–computer interface to improve the effect of node displacement,” Scientific Reports, vol. 14, no. 1, p. 20420, 2024

    2024

  43. [51]

    R. Y . Rubinstein and D. P. Kroese, Simulation and the Monte Carlo method. John Wiley & Sons, 2016

    2016

  44. [52]

    In-datacenter performance analysis of a tensor processing unit,

    N. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, S. Bates, S. Bhatia, N. Boden, A. Borchers et al. , “In-datacenter performance analysis of a tensor processing unit,” in Proceedings of the 44th annual international symposium on computer architecture , 2017...

    2017

  45. [53]

    Sparsegpt: Massive language models can be accurately pruned in one-shot,

    E. Frantar and D. Alistarh, “Sparsegpt: Massive language models can be accurately pruned in one-shot,” in International Conference on Machine Learning. PMLR, 2023, pp. 10 323–10 337

    2023

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.