arXiv subjects

Bei Wu

Publications and source records attributed to Bei Wu.

9 recordsLinked to original sources

arXiv2026

Agentic metasurface design with self-correcting language-model systems

Automated metasurface design is increasingly important, and recent advances in language-model systems are opening a route toward agentic optical design. Yet modern metasurface applications, from metalenses and holography to optical computing, require long design chains spanning modeling, simulation, coding, optimization and evaluation. These chains are error-prone, whereas existing language-model-based metasurface tools remain largely limited to simple objectives, predefined pipelines or language-to-layout generation. Here we introduce MetaDesigner, a self-correcting language-model system for agentic metasurface design. From a natural-language optical objective, MetaDesigner plans the design route, retrieves domain knowledge, invokes simulation and optimization tools, generates missing tool code and identifies errors through a dedicated Verifier. We demonstrate three tasks of increasing complexity: an RGB metalens with three independent focal spots, a six-plane full-color hologram with an average structural similarity index measure (SSIM) of 0.97, and an optoelectronic hybrid neural network for image style transfer. These tasks require 74, 136 and 90 reasoning steps, respectively, and the system self-corrects errors in frequency mapping, numerical aperture estimation, network-parameter counting and loss-function description. These results establish MetaDesigner as a self-correcting route to agentic metasurface design, where language-model systems can not only execute optical design tasks but also extend, inspect and repair the design process itself.

physics.optics↗

arXiv2026

Elder-Sim: A Psychometrically Validated Platform for Personality-Stable Elderly Digital Twins

Background: LLMs enable patient-facing conversational agents, creating a pathway toward digital twins that capture older adults' lived experiences and behavioral responses across time. A central barrier is personality drift -- inconsistent trait expression across repeated interactions -- which undermines reliability of generated trajectories and intervention-response simulation in geriatric care. Objective: To develop ELDER-SIM, a multi-role elderly-care conversational platform for building personality-stable digital twin agents, and to propose a psychometric validation framework for quantifying personality consistency in LLM-based agents. Methods: ELDER-SIM was implemented via n8n workflow orchestration with local LLM inference (Ollama/vLLM), integrating (1) Big Five (OCEAN) trait specifications, (2) a Cognitive Conceptualization Diagram (CCD) grounded in Beck's CBT framework, and (3) a MySQL-based long-term memory module. Ablation studies across four conditions -- Baseline, +Memory, +CCD, and +LoRA (fine-tuned on 19,717 instruction pairs from CHARLS) -- were evaluated via Cronbach's $\alpha$, ICC, and role discrimination accuracy. Results: Reliability was acceptable to excellent across conditions (Cronbach's $\alpha$: 0.70--0.94; ICC: 0.85--0.96). Role discrimination improved from 83.3% (Baseline) to 88.9% (+Memory), 94.4% (+CCD), and 97.2% (+LoRA). CCD produced the largest consistency gain (mean $\alpha$ 0.702$\to$0.892), while LoRA achieved the highest overall consistency ($\alpha$ 0.940; ICC 0.958). Conclusions: ELDER-SIM provides a psychometrically validated approach for constructing personality-consistent elderly digital twin agents. Structured cognitive modeling and domain adaptation reduce personality drift, supporting reliable longitudinal simulation for elderly mental health care and reproducible in silico evaluation before clinical deployment.

cs.HC↗

arXiv2025

A scalable and programmable optical neural network in a time-synthetic dimension

Programmable optical neural networks (ONNs) can offer high-throughput and energy-efficient solutions for accelerating artificial intelligence (AI) computing. However, existing ONN architectures, typically based on cascaded unitary transformations such as Mach-Zehnder interferometer meshes, face inherent scalability limitations due to spatial encoding, which causes optical components and system complexity to scale quadratically with network size. A promising solution to this challenge is the use of synthetic dimensions to enhance scalability, though experimental demonstration has remained scarce. Here, we present the first experimental demonstration of an all-optical, highly scalable, programmable ONN operating in a time-synthetic dimension. By implementing a time-cycle computation paradigm analogous to gate cycling in conventional spatial photonic circuits, our approach achieves a gate count surpassing that of state-of-the-art programmable photonic processors. Unlike conventional ONN architectures that rely on real-space wave interferences, our framework exploits time-reflection and time-refraction to perform computations, fundamentally eliminating backscattering errors through causality constraints. To bridge the gap between simulation and reality, we introduce an in-situ training framework that dynamically adapts to experimental errors, achieving performance exceeding traditional in silico learning paradigms. Our synthetic-dimension-based approach provides a compact, scalable, backscattering-free, and programmable neuromorphic computing architecture, advancing the potential for next-generation photonic AI systems.

physics.optics↗

arXiv2024

Estimation of Integrated Volatility Functionals with Kernel Spot Volatility Estimators

For a multidimensional It\^o semimartingale, we consider the problem of estimating integrated volatility functionals. Jacod and Rosenbaum (2013) studied a plug-in type of estimator based on a Riemann sum approximation of the integrated functional and a spot volatility estimator with a forward uniform kernel. Motivated by recent results that show that spot volatility estimators with general two-side kernels of unbounded support are more accurate, in this paper, an estimator using a general kernel spot volatility estimator as the plug-in is considered. A biased central limit theorem for estimating the integrated functional is established with an optimal convergence rate. Unbiased central limit theorems for estimators with proper de-biasing terms are also obtained both at the optimal convergence regime for the bandwidth and when applying undersmoothing. Our results show that one can significantly reduce the estimator's bias by adopting a general kernel instead of the standard uniform kernel. Our proposed bias-corrected estimators are found to maintain remarkable robustness against bandwidth selection in a variety of sampling frequencies and functions.

econ.EM↗

arXiv2024

TEaR: Improving LLM-based Machine Translation with Systematic Self-Refinement

Large Language Models (LLMs) have achieved impressive results in Machine Translation (MT). However, careful evaluations by human reveal that the translations produced by LLMs still contain multiple errors. Importantly, feeding back such error information into the LLMs can lead to self-refinement and result in improved translation performance. Motivated by these insights, we introduce a systematic LLM-based self-refinement translation framework, named \textbf{TEaR}, which stands for \textbf{T}ranslate, \textbf{E}stimate, \textbf{a}nd \textbf{R}efine, marking a significant step forward in this direction. Our findings demonstrate that 1) our self-refinement framework successfully assists LLMs in improving their translation quality across a wide range of languages, whether it's from high-resource languages to low-resource ones or whether it's English-centric or centered around other languages; 2) TEaR exhibits superior systematicity and interpretability; 3) different estimation strategies yield varied impacts, directly affecting the effectiveness of the final corrections. Additionally, traditional neural translation models and evaluation models operate separately, often focusing on singular tasks due to their limited capabilities, while general-purpose LLMs possess the capability to undertake both tasks simultaneously. We further conduct cross-model correction experiments to investigate the potential relationship between the translation and evaluation capabilities of general-purpose LLMs. Our code and data are available at https://github.com/fzp0424/self_correct_mt

cs.CL↗

arXiv2023

Knowledge-augmented Few-shot Visual Relation Detection

Visual Relation Detection (VRD) aims to detect relationships between objects for image understanding. Most existing VRD methods rely on thousands of training samples of each relationship to achieve satisfactory performance. Some recent papers tackle this problem by few-shot learning with elaborately designed pipelines and pre-trained word vectors. However, the performance of existing few-shot VRD models is severely hampered by the poor generalization capability, as they struggle to handle the vast semantic diversity of visual relationships. Nonetheless, humans have the ability to learn new relationships with just few examples based on their knowledge. Inspired by this, we devise a knowledge-augmented, few-shot VRD framework leveraging both textual knowledge and visual relation knowledge to improve the generalization ability of few-shot VRD. The textual knowledge and visual relation knowledge are acquired from a pre-trained language model and an automatically constructed visual relation knowledge graph, respectively. We extensively validate the effectiveness of our framework. Experiments conducted on three benchmarks from the commonly used Visual Genome dataset show that our performance surpasses existing state-of-the-art models with a large improvement.

cs.CV↗

arXiv2022

Kernel Estimation of Spot Volatility with Microstructure Noise Using Pre-Averaging

We first revisit the problem of estimating the spot volatility of an Itô semimartingale using a kernel estimator. We prove a Central Limit Theorem with optimal convergence rate for a general two-sided kernel. Next, we introduce a new pre-averaging/kernel estimator for spot volatility to handle the microstructure noise of ultra high-frequency observations. We prove a Central Limit Theorem for the estimation error with an optimal rate and study the optimal selection of the bandwidth and kernel functions. We show that the pre-averaging/kernel estimator's asymptotic variance is minimal for exponential kernels, hence, justifying the need of working with kernels of unbounded support as proposed in this work. We also develop a feasible implementation of the proposed estimators with optimal bandwidth. Monte Carlo experiments confirm the superior performance of the devised method.

econ.EM↗

arXiv2020

Knowledge forest: a novel model to organize knowledge fragments

With the rapid growth of knowledge, it shows a steady trend of knowledge fragmentization. Knowledge fragmentization manifests as that the knowledge related to a specific topic in a course is scattered in isolated and autonomous knowledge sources. We term the knowledge of a facet in a specific topic as a knowledge fragment. The problem of knowledge fragmentization brings two challenges: First, knowledge is scattered in various knowledge sources, which exerts users' considerable efforts to search for the knowledge of their interested topics, thereby leading to information overload. Second, learning dependencies which refer to the precedence relationships between topics in the learning process are concealed by the isolation and autonomy of knowledge sources, thus causing learning disorientation. To solve the knowledge fragmentization problem, we propose a novel knowledge organization model, knowledge forest, which consists of facet trees and learning dependencies. Facet trees can organize knowledge fragments with facet hyponymy to alleviate information overload. Learning dependencies can organize disordered topics to cope with learning disorientation. We conduct extensive experiments on three manually constructed datasets from the Data Structure, Data Mining, and Computer Network courses, and the experimental results show that knowledge forest can effectively organize knowledge fragments, and alleviate information overload and learning disorientation.

cs.AI↗

arXiv2019

Machine prediction of topological transitions in photonic crystals

We train artificial neural networks to distinguish the geometric phases of a set of bands in 1D photonic crystals. We find that the trained network yields remarkably accurate predictions of the topological phases for 1D photonic crystals, even for the geometric and material parameters that are outside of the range of the trained dataset. Another remarkable capability of the trained network is to predict the boundary of topological transition in the parameter space, where a large portion of trained data in the vicinity of that boundary is excluded purposely. The results indicate that the network indeed learns the very essence of the structure of Maxwell's equations, and has the ability of predicting the topological invariants beyond the range of the training dataset.

physics.optics↗