arXiv subjects

Baoyuan Liu

Publications and source records attributed to Baoyuan Liu.

3 recordsLinked to original sources

arXiv2026

Eluna: An Agentic LLM System for Automating Warehouse Operations with Reasoning and Task Execution

Warehouse operations are governed by Standard Operating Procedures (SOPs) that encode complex, multi-system decision logic, which must be executed reliably under strict time constraints, yet LLM agents lack mechanisms to enforce procedural compliance and degrade under the context overload full SOP specifications introduce. We present Eluna, a production-deployed agentic system for reliable SOP execution. Eluna is a graph-guided, multi-agent framework that encodes SOPs as directed acyclic graphs with progressive disclosure and delegates independent tasks to parallel sub-agents, each with persistent code execution and live data access. To meet production latency and accuracy needs, we use asymmetric episodic distillation where a strong teacher is improved through episodic error memories, then a smaller student is fine-tuned on the corrected trajectories with memory stripped, internalizing corrections without inference-time overhead. On a 13-task benchmark and two production applications, our fine-tuned models match or exceed their teacher, beat all larger off-the-shelf baselines, and reach 94% expert agreement on the ticket processing application.

cs.LG↗

arXiv2023

GUGA-based MRCI approach with Core-Valence Separation Approximation (CVS) for the calculation of the Core-Excited States of molecules

We develop and demonstrate how to use the GUGA-based MRCISD with Core-Valence Separation approximation (CVS) to compute the core-excited states. Firstly, perform a normal SCF or valence MCSCF calculation to optimize the molecular orbitals. Secondly, rotate the optimized target core orbitals and append to the active space, form an extended CVS active space, and perform a CVS-MCSCF calculation for core-excited states. Finally, construct the CVS-MRCI expansion space, and perform a CVS-MRCI calculation to optimize the CI coefficients based on the variational method. The CVS approximation with GUGA-based methods can be implemented by flexible truncation of the Distinct Row Table (DRT). Eliminating the valence-excited configurations from the CVS-MRCI expansion space can prevent variational collapse in the Davidson iteration diagonalization. The accuracy of the CVS-MRCI scheme was investigated for excitation energies and compared with that of the CVS-MCSCF method. The results show that CVS-MRCI is capable of reproducing well-matched vertical core excitation energies that are consistent with experiments, by combining large basis sets and a rational reference space. The calculation results also highlight the fact that the dynamic correlation between electrons makes an undeniable contribution in core-excited states.

physics.comp-ph↗

arXiv2017

Design of Efficient Convolutional Layers using Single Intra-channel Convolution, Topological Subdivisioning and Spatial "Bottleneck" Structure

Deep convolutional neural networks achieve remarkable visual recognition performance, at the cost of high computational complexity. In this paper, we have a new design of efficient convolutional layers based on three schemes. The 3D convolution operation in a convolutional layer can be considered as performing spatial convolution in each channel and linear projection across channels simultaneously. By unravelling them and arranging the spatial convolution sequentially, the proposed layer is composed of a single intra-channel convolution, of which the computation is negligible, and a linear channel projection. A topological subdivisioning is adopted to reduce the connection between the input channels and output channels. Additionally, we also introduce a spatial "bottleneck" structure that utilizes a convolution-projection-deconvolution pipeline to take advantage of the correlation between adjacent pixels in the input. Our experiments demonstrate that the proposed layers remarkably outperform the standard convolutional layers with regard to accuracy/complexity ratio. Our models achieve similar accuracy to VGG, ResNet-50, ResNet-101 while requiring 42, 4.5, 6.5 times less computation respectively.

cs.CV↗