Search for: All records

Creators/Authors contains: "Chen, Yu"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Physical reservoir computing leverages the intrinsic history-dependence and nonlinearity of hardware to encode spatiotemporal signals directly at the sensor level, enabling low-latency processing of dynamic inputs. Encoding delity depends on the separability of multi-state outputs, yet in practice it is often hampered by empirically chosen, suboptimal operating conditions. Here, we apply Bayesian optimization to improve the encoding performance of solution-processed Al₂O₃/In₂O₃ thin- lm transistors. By exploring a ve-dimensional pulse-parameter input space and using the normalized degree of separation for output state distinguishability, we demonstrate high- delity 6-bit temporal encoding corresponding to 64 output states. We further show that a model based on simpler 4-bit data can effectively guide optimization for more complex 6-bit tasks, substantially reducing experimental effort. Using a six-frame moving-car image sequence as a benchmark, we nd that the optimized 6-bit pulse conditions signi cantly enhance encoding accuracy, with 4-bit derived parameters performing comparably in terms of pixel errors. Shapley Additive Explanations (SHAP) analysis further reveals that gate-pulse amplitude and drain voltage are the dominant contributors to output state separation. This work establishes a data-driven strategy for identifying optimal operating conditions in reservoir devices and outlines a framework that can be transferred to diverse material platforms and physical reservoir implementations. 
    more » « less
    Free, publicly-accessible full text available December 1, 2027
  2. Free, publicly-accessible full text available August 14, 2027
  3. Free, publicly-accessible full text available October 26, 2027
  4. Free, publicly-accessible full text available July 1, 2027
  5. Free, publicly-accessible full text available June 30, 2027
  6. Free, publicly-accessible full text available June 27, 2027
  7. Free, publicly-accessible full text available August 3, 2027
  8. Free, publicly-accessible full text available June 30, 2027
  9. Free, publicly-accessible full text available August 3, 2027
  10. Free, publicly-accessible full text available August 3, 2027