SearcharxivSearch

arXiv subjects

Junyan Chen

Publications and source records attributed to Junyan Chen.

4 recordsLinked to original sources

Rare Earth Ion Coupling Implements Attention-Like Reservoir Computing

We present a physical computing paradigm that harnesses the intrinsic nonlinear dynamics of rare earth doped core shell nanoparticles as a computational substrate. By directly exploiting cross relaxation and energy transfer upconversion processes, the system realizes a state dependent transfer function whose effective decay rate evolves with the instantaneous Er3+ population, which mathematically analogous to gating and attention mechanisms in recurrent neural networks. The three spectrally resolved emission channels inherently span disparate timescales, endowing the reservoir with native multitimescale feature extraction without auxiliary engineering. Under the reservoir computing framework, the coupled three channel system achieves a total memory capacity exceeding fourfold that of a single ion reservoir; capacity decomposition further reveals that the nonzero cross memory capacity is a direct signature of many body Tm3+@Er3+ coupling. On the Mackey Glass and Santa Fe chaotic benchmarks, the system attains normalized mean squared errors of 1.2x10-3 and 2.1x10-2, respectively, with only 125 virtual nodes. These results establish rare earth nanoparticles as a compelling platform for compact and hardware integrable neuromorphic computing, and introduce "inward evolution", the deliberate exploitation of intra material quantum dynamics, as a generalizable design principle for next generation physical computing systems.

physics.optics

Compact All optical Reservoir Computing via Luminescence Dynamics in Rare-earth Ions-doped Nanocrystals

Optical neuromorphic computing offers a promising route to high speed, energy efficient information processing. However, photonic neurons, as the critical components for enhancing computational expressivity, still face significant bottlenecks in nonlinear mapping and memory capacity. Here, we demonstrate an all optical reservoir computing system based on rare earth ions doped nanocrystals for the first time, leveraging their intrinsic nonlinear luminescence dynamics and multitimescale memory. Unlike traditional schemes that require bulky optical delays or intricate resonant structures, our platform exploits the material's inherent properties: nonlinear cross-relaxation processes enable nonlinear mapping while millisecond-scale metastable energy levels provide fading memory. As a proof of concept, we achieve 90.7% accuracy in MNIST digit classification and low-error chaotic time-series prediction (NRMSE < 0.1) using the rare-earth ions based system. Our work significantly reduce system footprint and complexity, offering a scalable, fully optical solution for edge computing and real-time neuromorphic applications.

physics.optics

AMPO: Automatic Multi-Branched Prompt Optimization

Prompt engineering is very important to enhance the performance of large language models (LLMs). When dealing with complex issues, prompt engineers tend to distill multiple patterns from examples and inject relevant solutions to optimize the prompts, achieving satisfying results. However, existing automatic prompt optimization techniques are only limited to producing single flow instructions, struggling with handling diverse patterns. In this paper, we present AMPO, an automatic prompt optimization method that can iteratively develop a multi-branched prompt using failure cases as feedback. Our goal is to explore a novel way of structuring prompts with multi-branches to better handle multiple patterns in complex tasks, for which we introduce three modules: Pattern Recognition, Branch Adjustment, and Branch Pruning. In experiments across five tasks, AMPO consistently achieves the best results. Additionally, our approach demonstrates significant optimization efficiency due to our adoption of a minimal search strategy.

cs.CL

Bounding $s$ for vertex-primitive $s$-arc-transitive digraphs of alternating and symmetric groups

Determining an upper bound on $s$ for finite vertex-primitive $s$-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on $s$ is attained for some digraph admitting an almost simple $s$-arc-transitive group. In this paper, based on the work of Pan, Wu and Yin, we prove that $s\leqslant 2$ in the case where the group is an alternating or symmetric group.

math.CO