SearcharxivSearch

arXiv subjects

Amir Amini

Publications and source records attributed to Amir Amini.

4 recordsLinked to original sources

Memory Reward Inflation in Self-Improving LLM Agents

Self-improving LLM agents increasingly learn from experience without updating any weights. Each episode is stored in an external memory, scored, and retrieved for similar future tasks to shape later behavior. Viewed through a reward lens, the stored score is a proxy reward for an implicit, non-parametric policy. Each retrieved episode then becomes a policy-improvement step whose reliability hinges on how that score is produced. In deployment, ground-truth labels are unavailable, so the stored reward is at best an LLM assessment. This substitution creates a failure mode, the *Echo Gap*, across the memory-based self-improving agents and model families studied. Incorrect episodes receive inflated rewards; thus, the agent preferentially reuses the very mistakes it has most confident in. Because the error compounds through memory rather than averaging out and the confirming judge's errors remain correlated with the original self-grading bias, so it cannot identify which memories are overvalued. The missing property is formalized as the *Error-Independence Assumption* (EIA), which we prove is a *necessary* condition for correcting the inflation, not merely a description of a good verifier: a usable signal must track truth *and* decorrelate its error from the memory bias, and the recoverable payoff is a closed-form function of exactly those two quantities. We further show the inflation compounds not only when retrieval ranks by the stored score but also under plain similarity retrieval which is the regime the deployed agent uses. Finally, the answer-free de-inflation algorithm LUCID delivers a consistent end-to-end gain on the BIRD text-to-SQL benchmark. It raises execution accuracy to $56.9\%$, above both a Memento-style self-graded agent ($54.0\%$, a $+2.9$-point mean gain across seeds) and a memory-less agent of identical architecture ($52.4\%$).

cs.AI

Secure Dynamic Event-triggered Consensus Under Asynchronous Denial of Service

This article proposes a secure implementation for consensus using a dynamic event-triggered (DET) communication scheme in high-order nonlinear multi-agent systems (MAS) under asynchronous (distributed) denial of service (DoS) attacks. By introducing a linear auxiliary trajectory of the system, the DET data transmission scheme among the neighboring agents is employed to reduce the communication for each agent. The asynchronous DoS attacks can block each communication channel among the cooperative agents independently in an unknown pattern. To guarantee state consensus of auxiliary MAS under DoS, a linear matrix inequality (LMI) based optimization approach is proposed which simultaneously designs all the unknown DET communication parameters as well as the state feedback control gain. In addition to asynchronous DoS attacks over the graph topology, the destructive effects of independent DoS attacks over the communication links between actual and auxiliary states are compensated as an additional layer of resiliency for the system. The output of each agent ultimately tracks the auxiliary state of the system and this results in the output consensus.

eess.SY

Performance Constrained Distributed Event-triggered Consensus in Multi-agent Systems

The paper proposes a distributed eventtriggered consensus approach for linear multi-agent systems with guarantees over rate of convergence, resilience to control gain uncertainties, and Pareto optimality of design parameters, namely, the event-triggering threshold (ET) and control gain. The event-triggered consensus problem is first converted to stability problem of an equivalent system. The Lyapunov stability theorem is then used to incorporate the performance constraints with the event-triggered consensus. Using an approximated linear scalarization method, the ET and the control gain are designed simultaneously by solving a convex constrained optimization problem. Followed by some preliminary steps, the optimization can be performed locally, i.e., no global information is required. The effectiveness of the proposed approach is studied through simulations for an experimental multi-agent system.

eess.SY

H_inf Consensus of nonlinear complex multi-agent systems using dynamic output feedback controller: An LMI approach

This paper investigates a new method for consensus in a group of nonlinear complex multi-agent systems using fixed-order non-fragile dynamic output feedback controller, via an LMI approach. The proposed scheme is decentralized in the sense that each agent relies on the relative output information among the adjacent agents. The consensus based controllers are designed to minimize the effects of nonlinear terms of the agents as well as external disturbances. Converting consensus problem to stabilization of an equivalent augmented system using proper transformations, Lyapunov stability theorem is applied to obtain unknown controller parameters in order to guarantee consensus and simultaneously acquire considered control objectives. Finally, to demonstrate the effectiveness of the proposed algorithm and compare with similar earlier researches, a numerical example on a multi-agent system consisting of single link flexible manipulators is carried out.

math.OC