SearcharxivSearch

arXiv subjects

Haibo Ruan

Publications and source records attributed to Haibo Ruan.

8 recordsLinked to original sources

Beyond Prompts: Measuring and Optimizing LLM Tool-Agent Harnesses

LLM tool agents can be improved without retraining by modifying the runtime harness around a fixed model: prompts, tool interfaces, middleware, state handling, and recovery logic. We study this setting as resource-bounded harness selection for fixed-model multi-turn tool agents, with the search surface scoped to prompts and tool-boundary middleware: edits are guarded intercepts at the tool boundary, not arbitrary rewriting of agent execution logic. Our optimizer-agnostic protocol reports mean held-out lift, worst-condition lift, repeatability, logged cost diagnostics, and RelLift95(B), a conservative estimate of the held-out gain of the harness selected under budget B. We instantiate the protocol with prompt-only and prompt-plus-middleware optimizers, including PRISM, which clusters failures and routes repairs to prompt, tool-boundary middleware, or joint edit surfaces within a Pareto search. On BFCL multi-round, tau2-Retail, and tau2-Telecom, PRISM obtains mean held-out lifts of 14.2, 14.9, and 10.1 percentage points and positive empirical RelLift95 on all three benchmarks, and a component ablation attributes the margin chiefly to failure-surface routing and the edit-pattern constraint. Across optimizers, the results show that some search procedures can occasionally find large gains but still choose brittle updates, so the reliability of the chosen harness should be reported alongside average held-out lift.

cs.AI

Symmetry Analysis of Coupled Scalar Systems under Time Delay

We study systems of coupled units in a general network configuration with a coupling delay. We show that the destabilizing bifurcations from an equilibrium are governed by the extreme eigenvalues of the coupling matrix of the network. Based on the equivariant degree method and its computational packages, we perform a symmetry classification of destabilizing bifurcations in bidirectional rings of coupled units. Both stationary and oscillatory bifurcations are discussed. We also introduce the concept of secondary dominating orbit types to capture bifurcating solutions of submaximal nature.

nlin.PS

Classification of Codimension-1 Singular Bifurcations in Low-dimensional DAEs

The study of bifurcations of differential-algebraic equations (DAEs) is the topic of interest for many applied sciences, such as electrical engineering, robotics, etc. While some of them were investigated already, the full classification of such bifurcations has not been done yet. In this paper, we consider bifurcations of quasilinear DAEs with a singularity and provide a full list of all codimension-one bifurcations in lower-dimensional cases. Among others, it includes singularity-induced bifurcations (SIBs), which occur when an equilibrium branch intersects a singular manifold causing certain eigenvalues of the linearized problem to diverge to infinity. For these and other bifurcations, we construct the normal forms, establish the non-degeneracy conditions and give a qualitative description of the dynamics. Also, we study singular homoclinic and heteroclinic bifurcations, which were not considered before.

math.DS

Degeneracy Index and Poincaré-Hopf Theorem

A degenerate dynamical system is characterized by a state-dependent multiplier of the time derivative of the state in the time evolution equation. It can give rise to Hamiltonian systems whose symplectic structure possesses a non-constant rank throughout the phase space. Around points where the multiplier becomes singular, flow can experience abrupt and irreversible changes. We introduce a topological index for degenerate dynamical systems around these {\it degeneracy points} and show that it refines and extends the usual topological index in accordance with the Poincaré-Hopf Theorem.

math-ph

Synchrony in Gene Regulatory Networks

We consider two mathematical dynamical models of gene regulatory networks (GRNs) and obtain results on robust synchronization on these dynamical models based on the existing theoretical results in the coupled cell network formalism. We also explore the concepts of quotient networks and network lifting in the context of GRNs which are related to the process of gene duplication and the phenomenon of genetic redundancy.

math.DS

Reduced Lattices of Synchrony Subspaces and their Indices

For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an intersection of the partition lattice of $n$ elements and a lattice of invariant subspaces of the associated adjacency matrix. We assign integer tuples with synchrony subspaces, and use them for identifying equivalent synchrony subspaces to be merged. Based on this equivalence, the initial lattice of synchrony subspaces can be reduced to a lattice of synchrony subspaces which corresponds to a simple eigenvalue case discussed in our previous work. The result is a reduced lattice of synchrony subspaces, which affords a well-defined non-negative integer index that leads to bifurcation analysis in regular coupled cell networks.

math.DS

Effective AER Object Classification Using Segmented Probability-Maximization Learning in Spiking Neural Networks

Address event representation (AER) cameras have recently attracted more attention due to the advantages of high temporal resolution and low power consumption, compared with traditional frame-based cameras. Since AER cameras record the visual input as asynchronous discrete events, they are inherently suitable to coordinate with the spiking neural network (SNN), which is biologically plausible and energy-efficient on neuromorphic hardware. However, using SNN to perform the AER object classification is still challenging, due to the lack of effective learning algorithms for this new representation. To tackle this issue, we propose an AER object classification model using a novel segmented probability-maximization (SPA) learning algorithm. Technically, 1) the SPA learning algorithm iteratively maximizes the probability of the classes that samples belong to, in order to improve the reliability of neuron responses and effectiveness of learning; 2) a peak detection (PD) mechanism is introduced in SPA to locate informative time points segment by segment, based on which information within the whole event stream can be fully utilized by the learning. Extensive experimental results show that, compared to state-of-the-art methods, not only our model is more effective, but also it requires less information to reach a certain level of accuracy.

cs.NE

Unsupervised AER Object Recognition Based on Multiscale Spatio-Temporal Features and Spiking Neurons

This paper proposes an unsupervised address event representation (AER) object recognition approach. The proposed approach consists of a novel multiscale spatio-temporal feature (MuST) representation of input AER events and a spiking neural network (SNN) using spike-timing-dependent plasticity (STDP) for object recognition with MuST. MuST extracts the features contained in both the spatial and temporal information of AER event flow, and meanwhile forms an informative and compact feature spike representation. We show not only how MuST exploits spikes to convey information more effectively, but also how it benefits the recognition using SNN. The recognition process is performed in an unsupervised manner, which does not need to specify the desired status of every single neuron of SNN, and thus can be flexibly applied in real-world recognition tasks. The experiments are performed on five AER datasets including a new one named GESTURE-DVS. Extensive experimental results show the effectiveness and advantages of this proposed approach.

cs.NE