REVIEW 5 major objections 4 minor 38 references
Systolic Array-based Accelerator for Structured State-Space Models
T0 review · 5 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read This paper claims that EpochCore, a systolic-array accelerator built around reconfigurable LIMA-PE processing elements and a diagonal dataflow, runs S4 and Liquid-S4 inference on Long Range Arena workloads roughly 2000x faster than an…
desk verdict A plausible SSM-specialized systolic array with real PE-level novelty, but the headline speedups rest on an underspecified baseline and a single-layer workload; the Mamba support claim contradicts the paper's own Section III.G. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing piece is the LIMA-PE processing element with its four MAC modes: Fixed Recurrent Integration (FRI-MAC), Time-Varying Recurrent Integration (TRI-MAC), Banded Weight-Stationary (BWS-MAC), and Traditional Output-Stationary (TOS-MAC). FRI-MAC computes $x \leftarrow A \cdot x + B \cdot u(t)$ in a single cycle, TRI-MAC adds the input-dependent coefficient for Liquid-S4, and the multiplexer network lets any PE be reconfigured in place. ProDF then wires the dataflow by adding a northeast-to-southwest diagonal movement, so a single row of PEs handles the scalar-vector product and the recurrent update while the remaining rows perform the output matrix multiplication without intermediate writes to SRAM. That unification is what converts the SSM layer from a multi-step, memory-bound operation into one pipelined sweep through the array.
What would settle it
Run the same S4 and Liquid-S4 inference workloads on an Nvidia A100 using the optimized S4 CUDA kernels and measure wall-clock latency; if the real GPU latency is within a small multiple of EpochCore's simulated latency, the claimed 2000x collapses. Independently, recompute the Figure 13 latency breakdown, since the listed values do not obviously yield the claimed drop in the S4 layer's share from 95% to 7%.
Extended reading notes
Core claim
The paper's central claim is that the recurrent update of a structured state-space model is a first-class systolic-array operation, not an awkward special case. EpochCore's LIMA-PE implements a cardinal MAC of the form $x \leftarrow a \cdot x + b$, with a variant computing $x \leftarrow (a+b)\cdot x + b$ for time-varying coefficients, so each element of the state vector is updated in one cycle inside the array. Combined with the ProDF dataflow, which lets inputs move diagonally while partial results move vertically, the entire S4 or Liquid-S4 layer (input scaling, recurrent integration, and the output linear map) is evaluated in a single sweep through the array. The authors claim this is the first accelerator that executes multiple structured SSMs natively while preserving support for GEMM-based DNN layers, and they report the large speedups on LRA workloads against a GPU and against systolic-array baselines.
Load-bearing premise
The evaluation assumes the GPU and systolic-array baselines are near-optimally implemented and that the custom cycle simulator predicts real hardware behavior for EpochCore and the baselines alike, with the 2000x speedup claim resting on that equivalence.
Editorial extensions
If this is right
- If the reported numbers hold, S4 and Liquid-S4 layers on LRA-scale sequences stop being the dominant latency contributor, falling from roughly 95% of GPU runtime to about 7% on EpochCore.
- Because weights stay stationary in the array across an entire batch, EpochCore's on-chip SRAM bandwidth demand is concentrated in the initial weight load, so consecutive inferences reuse the loaded weights almost for free.
- A single row of LIMA-PEs updates the whole state vector in one cycle per input token, so the per-token latency of the recurrent step does not grow with state-map size $N$.
- For conventional GEMM layers, EpochCore matches the TPU-style systolic array cycle-for-cycle but pays a 2x area penalty and a 1.3x energy penalty, trading DNN-layer efficiency for SSM-layer efficiency.
Reading between the lines
- The same single-cycle recurrent MAC pattern could be applied to other element-wise recurrences, such as gated recurrent units or diagonal linear RNNs, but the paper does not evaluate those models.
- A direct way to test the 2000x figure is to run the public optimized S4 CUDA kernels on an A100 and compare measured latency to the paper's simulated EpochCore numbers; the paper does not report that comparison.
- The diagonal banded-matrix dataflow suggests a general systolic-array template for sparse or structured matrix operations beyond SSMs, although the paper only demonstrates it on S4, Liquid-S4, and GEMM.
- If the simulated energy numbers carry over to silicon, an EpochCore-like card could shift long-context inference from data-center GPUs to edge devices, but that extrapolation depends on simulator fidelity.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes EpochCore, a 2D systolic-array accelerator with a reconfigurable processing element (LIMA-PE) that supports fixed and time-varying recurrent integration, banded-matrix operations, and traditional GEMM dataflows. The authors also introduce ProDF, a programmable dataflow that pipelines scalar-vector multiplication, recurrent integration, and the linear output layer of S4 and Liquid-S4 models in a single array pass. The paper claims roughly 2000x speedup over an A100 GPU for S4/Liquid-S4 inference, 250x latency and 45x energy improvements over a sparse systolic array, and 25x speedup over a 1D FFT-based systolic array. The evaluation combines RTL synthesis of the PE in 45nm with a ScaleSim-based cycle simulator and CACTI-based memory modeling for the full accelerator.
Significance. If the quantitative claims were reliable, the paper would make a useful contribution: a unified systolic-array design that handles both SSM-specific recurrences and conventional DNN layers, with explicit microarchitectural support for complex-valued fixed-point arithmetic and gated-clock power management. The authors do provide concrete RTL-level PE synthesis results, a detailed dataflow mapping, and ablations over state-map size, SRAM capacity, and PE utilization. These are real strengths. However, the headline speedups are not yet established: the GPU baseline is unspecified, the simulator is unvalidated, and at least one presented latency figure is internally inconsistent with the claimed factor. The significance is therefore conditional on a substantially stronger evaluation.
major comments (5)
- [Section IV.A and abstract] The 2000x speedup over a GPU is not supported as written because the GPU baseline is never concretely specified. The methodology describes the EpochCore RTL synthesis and ScaleSim/CACTI simulation, but provides no A100 kernel description, no cuDNN/cuFFT settings, no measured wall-clock runtime, and no comparison with the public S4 or Liquid-S4 CUDA implementations. The headline claim is therefore a ratio between EpochCore's simulated cycle count and an unknown GPU number, and it cannot be independently checked or reproduced.
- [Section IV.D, Figure 13] The numeric latency labels in Figure 13 are inconsistent with the claimed 2000x improvement. The visible ratio between 174 ms and 1.28 ms is about 136x, not 2000x, and the sentence stating that EpochCore reduces S4 layer latency from approximately 95% to 7% appears to be comparing Sparse-SA with EpochCore rather than establishing the GPU speedup. The figure, its key, and the surrounding text need to be reconciled so that the reported speedup is reproducible from the plotted data.
- [Section IV.C and Table III] The 250x and 45x improvements over Sparse-SA are presented without accounting for EpochCore's own costs. Section III.B reports a 2x area increase, 1.3-1.6x power increase, and a 5% reduction in maximum frequency for the fully loaded LIMA-PE, and Section IV.C states a 2x area penalty, 1.3x energy penalty, and 5% latency increase for GEMM operations. A specialized dataflow is expected to beat a generic systolic array on SSM workloads, so the paper should also report area-normalized or throughput-per-area comparisons and show how the headline factors change when these overheads are included.
- [Section IV.A, Figures 10 and 13] The evaluation is entirely simulator-derived, but the ScaleSim-based cycle simulator and the custom memory-bandwidth simulator are not validated against real hardware or against published baseline measurements. No error bars, sensitivity analyses, or configuration sweeps are provided for the 2000x, 250x, and 45x factors. Because the quantitative conclusions depend on the simulator's fidelity, the authors should at least include a sensitivity analysis over clock frequency, SRAM bandwidth, batch size, and baseline optimization level.
- [Section IV.A and Section IV.D] There is a precision mismatch between EpochCore and the GPU baseline. EpochCore is evaluated with 32-bit fixed-point arithmetic and 16-bit complex fixed-point, while the GPU precision is unspecified and no accuracy comparison is provided. Since the central claim is about performing the same inference task, the paper needs to report whether 32-bit fixed-point achieves accuracy comparable to the floating-point references on the LRA benchmarks, or explicitly state the accuracy loss.
minor comments (4)
- [Figure 13] The bars in Figure 13 are not clearly keyed: it is difficult to determine which latency values correspond to the GPU, Sparse-SA, and EpochCore for the S4 versus DNN portions, and the labels are visually ambiguous.
- [Section IV.D, Figure 14] The latency numbers in Figure 14 (e.g., 10.5 ms, 4.4 ms, 38.4 ms, 0.37 ms, 0.73 ms, 5.9 ms, 0.0057 ms, 0.0015 ms, 0.0021 ms) are not explained in the caption or text; the reader cannot infer which value corresponds to which accelerator or dataset.
- [Abstract and Section VI] The abstract and conclusion state different speedup figures without qualification: the abstract says approximately 2000x over a GPU, while the conclusion says up to 250x over Sparse-SA and only mentions 2000x as a peak, and Table VII lists a 2000x speedup for Liquid-S4. These claims should be stated with the same baseline and the same range so that the reader is not left with contradictory numbers.
- [Introduction and Section VI] The introduction states that EpochCore achieves 30x lower memory bandwidth than the 1D FFT-based SA, while the conclusion says memory bandwidth usage is reduced by 3x. These two statements refer to different comparisons or different metrics and should be reconciled.
Circularity Check
No significant circularity: the claimed speedups are simulation-based comparisons against weakly specified baselines, but no derivation or prediction reduces to its own input by definition.
full rationale
I walked the paper's derivation chain from the S4/Liquid-S4 recurrence equations through the LIMA-PE MAC modes (FRI-MAC, TRI-MAC, BWS-MAC, TOS-MAC) and the ProDF dataflow to the reported speedups. The hardware operations are defined directly from the model equations (Eqs. 3, 5, 10, 11), and the latency claims (e.g., one new output token per cycle after an N+2 cycle fill) follow from the described systolic mapping rather than from a fitted parameter or a self-citation. There are no citations to the authors' own prior work serving as load-bearing evidence, no imported uniqueness theorem, and no attempt to justify a modeling choice by an unverified self-citation. The evaluation does rely on the authors' own ScaleSim-based cycle simulator and an unspecified GPU/TPU baseline, so the absolute 2000x/250x numbers are not independently checkable from the paper alone; however, that is a benchmarking and validation limitation, not a circularity. The statement that traditional WS/OS dataflows 'would require N clock cycles' is an analytical modeling assumption, not a reduction of the result to its own definition. I find no step where a 'prediction' is equivalent to an input by construction, and no self-referential derivation chain. Score 0.
Assumptions & free parameters
free parameters (4)
- Systolic array dimensions (64x64) =
64x64
- Operating frequency (700 MHz) =
700 MHz
- On-chip SRAM capacities (16 MB input/output, 16 MB weights) =
16 MB
- Data precision (32-bit fixed-point, 16-bit real/imag complex) =
32-bit / 16-bit
assumptions (4)
- domain assumption The S4 and Liquid-S4 discretizations (Eqs. 3 and 5) are the correct updates for the corresponding continuous ODEs as defined in [9] and [12].
- domain assumption The diagonalized HiPPO matrix retains model accuracy, as proposed by DSS/S4 [11], [9].
- ad hoc to paper Fixed-point arithmetic at 32-bit (real) or 16-bit (complex) is accurate enough for the LRA benchmarks.
- ad hoc to paper The ScaleSim cycle simulator and CACTI memory models provide accurate estimates for the baseline TPU/GPU and EpochCore.
Cite this review
Pith. "Pith review of Systolic Array-based Accelerator for Structured State-Space Models." pith.science (2026). https://pith.science/paper/CWYBFGHU
@misc{pith2026250721394,
author = {Pith},
title = {Pith review of: Systolic Array-based Accelerator for Structured State-Space Models},
year = {2026},
howpublished = {\url{https://pith.science/paper/CWYBFGHU}},
note = {Machine review of arXiv:2507.21394}
}
read the original abstract
Sequence modeling is crucial for AI to understand temporal data and detect complex time-dependent patterns. While recurrent neural networks (RNNs), convolutional neural networks (CNNs), and Transformers have advanced in capturing long-range dependencies, they struggle with achieving high accuracy with very long sequences due to limited memory retention (fixed context window). State-Space Models (SSMs) leverage exponentially decaying memory enabling lengthy context window and so they process very long data sequences more efficiently than recurrent and Transformer-based models. Unlike traditional neural models like CNNs and RNNs, SSM-based models require solving differential equations through continuous integration, making training and inference both compute- and memory-intensive on conventional CPUs and GPUs. In this paper we introduce a specialized hardware accelerator, EpochCore, for accelerating SSMs. EpochCore is based on systolic arrays (SAs) and is designed to enhance the energy efficiency and throughput of inference of SSM-based models for long-range sequence tasks. Within the SA, we propose a versatile processing element (PE) called LIMA-PE to perform traditional and specialized MAC operations to support traditional DNNs and SSMs. To complement the EpochCore microarchitecture, we propose a novel dataflow, ProDF, which enables highly efficient execution of SSM-based models. By leveraging the LIMA-PE microarchitecture and ProDF, EpochCore achieves on average 2000x improvement in performance on LRA datasets compared to a GPU and 250x gains in performance and 45x improvement in energy efficiency, over traditional SA-based accelerators (TPU).
Figures
Figures from the paper (13 more)
Reference graph
Works this paper leans on
- [1]
-
[2]
M. Alwani, H. Chen, M. Ferdman, and P. Milder, “Fused-layer cnn accelerators,” in2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), 2016, pp. 1–12
work page 2016
-
[3]
Fft computation with systolic arrays, a new architecture,
V . Boriakoff, “Fft computation with systolic arrays, a new architecture,” IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 41, no. 4, pp. 278–284, 1994
work page 1994
-
[4]
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,”IEEE Journal of Solid-State Circuits, vol. 52, no. 1, pp. 127– 138, 2017
2017
-
[5]
Gate-variants of gated recurrent unit (gru) neural networks,
R. Dey and F. M. Salem, “Gate-variants of gated recurrent unit (gru) neural networks,” in2017 IEEE 60th International Midwest Symposium on Circuits and Systems (MWSCAS), 2017, pp. 1597–1600
2017
-
[6]
Hungry hungry hippos: Towards language modeling with state space models,
D. Y . Fu, T. Dao, K. K. Saab, A. W. Thomas, A. Rudra, and C. R ´e, “Hungry hungry hippos: Towards language modeling with state space models,” 2023. [Online]. Available: https://arxiv.org/abs/2212.14052
arXiv 2023
-
[7]
Mamba: Linear-time sequence modeling with selective state spaces,
A. Gu and T. Dao, “Mamba: Linear-time sequence modeling with selective state spaces,”arXiv preprint arXiv:2312.00752, 2023
arXiv 2023
-
[8]
Hippo: Recurrent memory with optimal polynomial projections,
A. Gu, T. Dao, S. Ermon, A. Rudra, and C. R ´e, “Hippo: Recurrent memory with optimal polynomial projections,” inAdvances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, Eds., vol. 33. Curran Associates, Inc., 2020, pp. 1474–1487. [Online]. Available: https://proceedings.neurips.cc/paper files/paper/...
work page 2020
Show all 38 references
-
[9]
Efficiently modeling long sequences with structured state spaces,
A. Gu, K. Goel, and C. R ´e, “Efficiently modeling long sequences with structured state spaces,” 2022. [Online]. Available: https: //arxiv.org/abs/2111.00396
2022 arXiv
-
[10]
Combining recurrent, convolutional, and continuous-time models with linear state space layers,
A. Gu, I. Johnson, K. Goel, K. Saab, T. Dao, A. Rudra, and C. R ´e, “Combining recurrent, convolutional, and continuous-time models with linear state space layers,” inAdvances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y . Dauphin, P. Liang, and J. W...
2021
-
[11]
Diagonal state spaces are as effective as structured state spaces,
A. Gupta, A. Gu, and J. Berant, “Diagonal state spaces are as effective as structured state spaces,” 2022. [Online]. Available: https://arxiv.org/abs/2203.14343
2022 arXiv
-
[12]
Liquid time-constant networks,
R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” 2020. [Online]. Available: https: //arxiv.org/abs/2006.04439
2020 arXiv
-
[13]
Liquid structural state-space models,
R. Hasani, M. Lechner, T.-H. Wang, M. Chahine, A. Amini, and D. Rus, “Liquid structural state-space models,” 2022. [Online]. Available: https://arxiv.org/abs/2209.12951
2022 arXiv
-
[14]
Sparse-tpu: adapting systolic arrays for sparse matrices,
X. He, S. Pal, A. Amarnath, S. Feng, D.-H. Park, A. Rovinski, H. Ye, Y . Chen, R. Dreslinski, and T. Mudge, “Sparse-tpu: adapting systolic arrays for sparse matrices,” inProceedings of the 34th ACM International Conference on Supercomputing, ser. ICS ’20. New York, NY , USA: A...
2020
-
[15]
Long short-term memory,
S. Hochreiter and J. Schmidhuber, “Long short-term memory,”Neural Computation, vol. 9, no. 8, pp. 1735–1780, 1997
1997
-
[16]
In-datacenter performance analysis of a tensor processing unit,
N. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, and et al., “In-datacenter performance analysis of a tensor processing unit,” 2017
2017
-
[17]
Vga: Hardware accelerator for scalable long sequence model inference,
S. Y . Lee, H. Lee, J. Hong, S. Cho, and J. W. Lee, “Vga: Hardware accelerator for scalable long sequence model inference,” in2024 57th IEEE/ACM International Symposium on Microarchitecture (MICRO), 2024, pp. 1444–1457
2024
-
[18]
tcfft: Accelerating half-precision fft through tensor cores,
B. Li, S. Cheng, and J. Lin, “tcfft: Accelerating half-precision fft through tensor cores,” 2021. [Online]. Available: https://arxiv.org/abs/ 2104.11471
2021 arXiv
-
[19]
Marca: Mamba accelerator with reconfigurable architecture,
J. Li, S. Huang, J. Xu, J. Liu, L. Ding, N. Xu, and G. Dai, “Marca: Mamba accelerator with reconfigurable architecture,” 2024. [Online]. Available: https://arxiv.org/abs/2409.11440
2024 arXiv
-
[20]
Cacti- p: Architecture-level modeling for sram-based structures with advanced leakage reduction techniques,
S. Li, K. Chen, J. H. Ahn, J. B. Brockman, and N. P. Jouppi, “Cacti- p: Architecture-level modeling for sram-based structures with advanced leakage reduction techniques,” in2011 IEEE/ACM International Con- ference on Computer-Aided Design (ICCAD), 2011, pp. 694–701
2011
-
[21]
Mamba-nd: Selective state space modeling for multi-dimensional data,
S. Li, H. Singh, and A. Grover, “Mamba-nd: Selective state space modeling for multi-dimensional data,” inEuropean Conference on Computer Vision. Springer, 2025, pp. 75–92
2025
-
[22]
Dual-path rnn: Efficient long sequence modeling for time-domain single-channel speech separation,
Y . Luo, Z. Chen, and T. Yoshioka, “Dual-path rnn: Efficient long sequence modeling for time-domain single-channel speech separation,” inICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020, pp. 46–50
2020
-
[23]
Long range language modeling via gated state spaces,
H. Mehta, A. Gupta, A. Cutkosky, and B. Neyshabur, “Long range language modeling via gated state spaces,” 2022. [Online]. Available: https://arxiv.org/abs/2206.13947
2022 arXiv
-
[24]
The illusion of state in state-space models,
W. Merrill, J. Petty, and A. Sabharwal, “The illusion of state in state-space models,” 2025. [Online]. Available: https://arxiv.org/abs/ 2404.08819
2025 arXiv
-
[25]
Mamba-360: Survey of state space models as transformer alternative for long sequence modelling: Methods, applications, and challenges,
B. N. Patro and V . S. Agneeswaran, “Mamba-360: Survey of state space models as transformer alternative for long sequence modelling: Methods, applications, and challenges,” 2024. [Online]. Available: https://arxiv.org/abs/2404.16112
2024 arXiv
-
[26]
A systematic methodology for characterizing scalability of dnn accelerators using scale-sim,
A. Samajdar, J. M. Joseph, Y . Zhu, P. Whatmough, M. Mattina, and T. Krishna, “A systematic methodology for characterizing scalability of dnn accelerators using scale-sim,” in2020 IEEE International Sympo- sium on Performance Analysis of Systems and Software (ISPASS), 2020, pp. 58–68
2020
-
[27]
Simplified state space layers for sequence modeling,
J. T. H. Smith, A. Warrington, and S. W. Linderman, “Simplified state space layers for sequence modeling,” 2023. [Online]. Available: https://arxiv.org/abs/2208.04933
2023 arXiv
-
[28]
Scaling equations for the accurate prediction of cmos device performance from 180nm to 7nm,
A. Stillmaker and B. Baas, “Scaling equations for the accurate prediction of cmos device performance from 180nm to 7nm,” Integration, vol. 58, pp. 74–81, 2017. [Online]. Available: https: //www.sciencedirect.com/science/article/pii/S0167926017300755
2017
-
[29]
Long range arena: A benchmark for efficient transformers,
Y . Tay, M. Dehghani, S. Abnar, Y . Shen, D. Bahri, P. Pham, J. Rao, L. Yang, S. Ruder, and D. Metzler, “Long range arena: A benchmark for efficient transformers,” 2020
2020
-
[30]
Feather: A reconfigurable accelerator with data reordering support for low-cost on-chip dataflow switching,
J. Tong, A. Itagi, P. Chatarasi, and T. Krishna, “Feather: A reconfigurable accelerator with data reordering support for low-cost on-chip dataflow switching,” 2024. [Online]. Available: https://arxiv.org/abs/2405.13170
2024 arXiv
-
[31]
N. S. University. (2024) Freepdk45. [Online]. Available: https: //eda.ncsu.edu/freepdk/freepdk45/
2024
-
[32]
Attention is all you need,
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. u. Kaiser, and I. Polosukhin, “Attention is all you need,” inAdvances in Neural Information Processing Systems, I. Guyon, U. V . Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnet...
2017
-
[33]
Sequence to sequence – video to text,
S. Venugopalan, M. Rohrbach, J. Donahue, R. Mooney, T. Darrell, and K. Saenko, “Sequence to sequence – video to text,” 2015
2015
-
[34]
Fastmamba: A high-speed and efficient mamba accelerator on fpga with accurate quantization,
A. Wang, H. Shao, S. Ma, and Z. Wang, “Fastmamba: A high-speed and efficient mamba accelerator on fpga with accurate quantization,”
-
[35]
State-space models with layer-wise nonlinearity are universal approximators with exponential decaying memory,
S. Wang and B. Xue, “State-space models with layer-wise nonlinearity are universal approximators with exponential decaying memory,” inAdvances in Neural Information Processing Systems, A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, Eds., vol. 36. Curran A...
2023
-
[36]
Heterogeneous systolic array architecture for compact cnns hardware accelerators,
R. Xu, S. Ma, Y . Wang, Y . Guo, D. Li, and Y . Qiao, “Heterogeneous systolic array architecture for compact cnns hardware accelerators,” IEEE Transactions on Parallel and Distributed Systems, vol. 33, no. 11, pp. 2860–2871, 2022
2022
-
[37]
Using bidirectional lstm recurrent neural networks to learn high-level abstractions of sequential features for automated scoring of non-native spontaneous speech,
Z. Yu, V . Ramanarayanan, D. Suendermann-Oeft, X. Wang, K. Zechner, L. Chen, J. Tao, A. Ivanou, and Y . Qian, “Using bidirectional lstm recurrent neural networks to learn high-level abstractions of sequential features for automated scoring of non-native spontaneous speech,” in...
2015
-
[2025]
Available: https://arxiv.org/abs/2505.18975
[Online]. Available: https://arxiv.org/abs/2505.18975
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.