Researcher profile

Yiwen Chen

Yiwen Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
11topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

LASAR: Latent Adaptive Semantic Aligned Reasoning for Generative Recommendation

Large Language Models (LLMs) have demonstrated powerful reasoning capabilities through Chain-of-Thought (CoT) in various tasks, yet the inefficiency of token-by-token generation hinders real-world deployment in latency-sensitive recommender systems. Latent reasoning has emerged as an effective paradigm in LLMs, performing multi-step inference in a continuous hidden-state space to achieve stronger reasoning at lower cost. However, this paradigm remains underexplored in mainstream generative recommendation. Adapting it reveals three unique challenges: (1) the gap between prior-less Semantic ID (SID) symbols and continuous latent reasoning - SIDs lack pre-trained semantics, hindering joint optimization; (2) representation drift due to a lack of reasoning chain supervision; and (3) the suboptimality of applying a globally fixed reasoning depth. To address these, we propose LASAR (Latent Adaptive Semantic Aligned Reasoning), an SFT-then-RL framework. First, we bridge this gap via two-stage training: Stage 1 grounds SID semantics before Stage 2 introduces latent reasoning, ensuring efficient convergence. Second, we mitigate representation drift through explicit CoT semantic alignment. Step-wise bidirectional KL divergence constrains the latent reasoning trajectory using hidden-state anchors extracted from CoT text, while a Policy Head predicts per-sample reasoning depth. Third, during the GRPO-based RL phase, terminal-only KL alignment accommodates variable-length reasoning, and REINFORCE optimizes the Policy Head to dynamically allocate steps. This nearly halves the average latent step count while simultaneously improving recommendation quality. Experiments on three real-world datasets demonstrate that LASAR outperforms all baselines. It adds marginal inference latency and is roughly 20 times faster than generating explicit CoT text.

preprint2026arXiv

Route Before Retrieve: Activating Latent Routing Abilities of LLMs for RAG vs. Long-Context Selection

Recent advances in large language models (LLMs) have expanded the context window to beyond 128K tokens, enabling long-document understanding and multi-source reasoning. A key challenge, however, lies in choosing between retrieval-augmented generation (RAG) and long-context (LC) strategies: RAG is efficient but constrained by retrieval quality, while LC supports global reasoning at higher cost and with position sensitivity. Existing methods such as Self-Route adopt failure-driven fallback from RAG to LC, but remain passive, inefficient, and hard to interpret. We propose Pre-Route, a proactive routing framework that performs structured reasoning before answering. Using lightweight metadata (e.g., document type, length, initial snippet), Pre-Route enables task analysis, coverage estimation, and information-need prediction, producing explainable and cost-efficient routing decisions. Our study shows three key findings: (i) LLMs possess latent routing ability that can be reliably elicited with guidelines, allowing single-sample performance to approach that of multi-sample (Best-of-N) results; (ii) linear probes reveal that structured prompts sharpen the separability of the "optimal routing dimension" in representation space; and (iii) distillation transfers this reasoning structure to smaller models for lightweight deployment. Experiments on LaRA (in-domain) and LongBench-v2 (OOD) confirm that Pre-Route outperforms Always-RAG, Always-LC, and Self-Route baselines, achieving superior overall cost-effectiveness.

preprint2023arXiv

Deep-learning-aided Low-complexity DOA Estimators for Ultra-Massive MIMO Overlapped Receive Array

Massive multiple input multiple output(MIMO)-based fully-digital receive antenna arrays bring huge amount of complexity to both traditional direction of arrival(DOA) estimation algorithms and neural network training, which is difficult to satisfy high-precision and low-latency applications in future wireless communications. To address this challenge, two estimators called OPSC and OSAP-CBAM-CNN are proposed in this paper. The computational complexity of the traditional DOA algorithm is first considered to be reduced by dividing the total set of antennas into multiple overlapped subarrays uniformly, each subarray crosses each other proportionally and performs DOA estimation to generate coarse angles, and all angles are coherently combined to get the better estimation, the final DOA estimation can given by maximum likelihood alternating projection(ML-AP) in a very small range, which has a better performance than the direct partitioning of subarrays. To further reduce the complexity of traditional estimation algorithms, deep neural networks(DNN) are utilized to offline train the relationship between the received signal covariance matrix and the estimated angles. Due to the high complexity of the training network based on large-scale arrays, in the OSAP-CBAM-CNN method, the complex network is divided into several smaller networks based on the overlapped subarray to give rough DOA estimations, followed by coherent combining and AP algorithm to get the final DOA estimation. Simulation results show that as the number of antennas goes to large-scale, the proposed methods can achieve a remarkable complexity reduction over conventional ML-AP algorithm.

preprint2022arXiv

Conservation of the particle-hole symmetry in the pseudogap state in optimally-doped Bi2Sr2CuO6+δ superconductor

The pseudogap state is one of the most enigmatic characteristics in the anomalous normal state properties of the high temperature cuprate superconductors. A central issue is to reveal whether there is a symmetry breaking and which symmetries are broken across the pseudogap transition. By performing high resolution laser-based angle-resolved photoemission measurements on the optimally-doped Bi2Sr1.6La0.4CuO6+δ superconductor, we report the observations of the particle-hole symmetry conservation in both the superconducting state and the pseudogap state along the entire Fermi surface. These results provide key insights in understanding the nature of the pseudogap and its relation with high temperature superconductivity.

preprint2022arXiv

Economical Precise Manipulation and Auto Eye-Hand Coordination with Binocular Visual Reinforcement Learning

Precision robotic manipulation tasks (insertion, screwing, precisely pick, precisely place) are required in many scenarios. Previous methods achieved good performance on such manipulation tasks. However, such methods typically require tedious calibration or expensive sensors. 3D/RGB-D cameras and torque/force sensors add to the cost of the robotic application and may not always be economical. In this work, we aim to solve these but using only weak-calibrated and low-cost webcams. We propose Binocular Alignment Learning (BAL), which could automatically learn the eye-hand coordination and points alignment capabilities to solve the four tasks. Our work focuses on working with unknown eye-hand coordination and proposes different ways of performing eye-in-hand camera calibration automatically. The algorithm was trained in simulation and used a practical pipeline to achieve sim2real and test it on the real robot. Our method achieves a competitively good result with minimal cost on the four tasks.

preprint2022arXiv

Rapid Phase Ambiguity Elimination Methods for DOA Estimator via Hybrid Massive MIMO Receive Array

For a sub-connected hybrid multiple-input multiple-output (MIMO) receiver with $K$ subarrays and $N$ antennas, there exists a challenging problem of how to rapidly remove phase ambiguity in only single time-slot. First, a DOA estimator of maximizing received power (Max-RP) is proposed to find the maximum value of $K$-subarray output powers, where each subarray is in charge of one sector, and the center angle of the sector corresponding to the maximum output is the estimated true DOA. To make an enhancement on precision, Max-RP plus quadratic interpolation (Max-RP-QI) method is designed. In the proposed Max-RP-QI, a quadratic interpolation scheme is adopted to interpolate the three DOA values corresponding to the largest three receive powers of Max-RP. Finally, to achieve the CRLB, a Root-MUSIC plus Max-RP-QI scheme is developed. Simulation results show that the proposed three methods eliminate the phase ambiguity during one time-slot and also show low-computational-complexities. In particular, the proposed Root-MUSIC plus Max-RP-QI scheme can reach the CRLB, and the proposed Max-RP and Max-RP-QI are still some performance losses $2dB\thicksim4dB$ compared to the CRLB.

preprint2022arXiv

Real2Sim or Sim2Real: Robotics Visual Insertion using Deep Reinforcement Learning and Real2Sim Policy Adaptation

Reinforcement learning has shown a wide usage in robotics tasks, such as insertion and grasping. However, without a practical sim2real strategy, the policy trained in simulation could fail on the real task. There are also wide researches in the sim2real strategies, but most of those methods rely on heavy image rendering, domain randomization training, or tuning. In this work, we solve the insertion task using a pure visual reinforcement learning solution with minimum infrastructure requirement. We also propose a novel sim2real strategy, Real2Sim, which provides a novel and easier solution in policy adaptation. We discuss the advantage of Real2Sim compared with Sim2Real.

preprint2022arXiv

Two Low-complexity DOA Estimators for Massive/Ultra-massive MIMO Receive Array

Eigen-decomposition-based direction finding methods of using large-scale/ultra-large-scale fully-digital receive antenna arrays lead to a high or ultra-high complexity. To address the complexity dilemma, in this paper, three low-complexity estimators are proposed: partitioned subarray auto-correlation combining (PSAC), partitioned subarray cross-correlation combining (PSCC) and power iteration max correlation successive convex approximation (PI-Max-CSCA). Compared with the conventional no-partitioned direction finding method like root multiple signal classification (Root-MUSIC), in the PSAC method, the total set of antennas are equally partitioned into subsets of antennas, called subarrays, each subarray performs independent DOA estimation, and all DOA estimates are coherently combined to give the final estimation. For a better performance, the cross-correlation among sub-arrays is further exploited in the PSCC method to achieve the near-Cramer-Rao lower bound (CRLB) performance with the help of auto-correlation. To further reduce the complexity, in the PI-Max-CSCA method, using a fraction of all subarrays to make an initial coarse direction measurement (ICDM), the power iterative method is adopted to compute the more precise steering vector (SV) by exploiting the total array, and a more accurate DOA value is found using ICDM and SV through the maximum correlation method solved by successive convex approximation. Simulation results show that as the number of antennas goes to large-scale, the proposed three methods can achieve a dramatic complexity reduction over conventional Root-MUISC. Particularly, the PSCC and PI-Max-CSCA can reach the CRLB while the PSAC shows a substantial performance loss.

preprint2021arXiv

Error Analysis of Surrogate Models Constructed through Operations on Sub-models

Model-based methods are popular in derivative-free optimization (DFO). In most of them, a single model function is built to approximate the objective function. This is generally based on the assumption that the objective function is one blackbox. However, some real-life and theoretical problems show that the objective function may consist of several blackboxes. In those problems, the information provided by each blackbox may not be equal. In this situation, one could build multiple sub-models that are then combined to become a final model. In this paper, we analyze the relation between the accuracy of those sub-models and the model constructed through their operations. We develop a broad framework that can be used as a theoretical tool in model error analysis and future research in DFO algorithms design.