SearcharxivSearch

arXiv subjects

Abiola Babatunde

Publications and source records attributed to Abiola Babatunde.

3 recordsLinked to original sources

Controlled Evaluation of Graph and Multimodal Augmentation in RAG for Document Question Answering

Graph and multimodal extensions to retrieval-augmented generation (RAG) are often evaluated end to end, making it difficult to isolate whether gains arise from retrieval, prompt-side context, visual access, generator capability, or benchmark construction. We present a stage- and evidence-controlled evaluation across five RAG configurations, four multimodal generators, and three document corpora. The same LLM-extracted knowledge graph is used either after retrieval as provenance-constrained triple injection (+KG) or during retrieval as entity-bridged passage expansion (+KGret). Prompt-side graph injection yields no consistent accuracy improvement and generally reduces faithfulness. In contrast, +KGret increases gold-evidence completeness from 0.22 to 0.46 on HotpotQA bridge questions and from 0.50 to 0.72 on SPIQA cross-paper questions, improving accuracy for every generator on both evidence-deficient sets while having little effect on retrieval-complete controls. For visual question answering, matched caption-answerable and verified pixel-only protocols show that apparent multimodal gains are sensitive to textual leakage. Programmatic checks reveal answer recoverability from captions, corpus text, and model responses generated without complete gold evidence. Accuracy on incomplete-evidence questions reaches 0.35--0.71 on widely disseminated corpora, compared with 0 on PubLayNet, indicating that raw accuracy can overstate retrieval-attributable performance. These results show that graph augmentation is most effective when it changes retrieval under evidence deficits, while multimodal evaluation requires explicit verification that answers are unavailable through text.

eess.IV

LLMs for Agentic Home Energy Management

Home Energy Management Systems (HEMS) can reduce residential electricity costs, but many require users to express everyday preferences as technical constraints. This paper presents a tool-calling ReAct agent that converts natural-language requests into schedules for multiple household appliances using half-hourly Octopus Agile prices, weather forecasts, photovoltaic generation estimates, and household demand data. Five large language model backends are evaluated against a mixed-integer linear programming benchmark across dynamic tariff conditions, constraint conflicts, weather-aware scheduling, and a seven-day rolling deployment. Native function calling achieves high scheduling success and near-optimal cost on ordinary tariff days, whereas text-parsed actions reduce reliability. Constraint-conflict testing shows that low cost does not guarantee safe or feasible behaviour. Claude Sonnet 4.6 performs best in power-cap and infeasibility scenarios, while Qwen-3 achieves higher overall constraint compliance than GPT-4o-mini. The evaluation also identifies fabricated schedules, failed commitments, and reasoning-to-action failures in which models explain a deadline correctly but commit an invalid schedule. Weather-aware scheduling reduces cost and increases solar self-consumption under overcast conditions, but provides limited or adverse economic value under some dynamic-price regimes. Across the evaluated seven-day period, the agents capture 96.7-98.0% of the savings available between an off-peak timer and the MILP oracle and outperform the rule-based policies. The results support LLM-based HEMS orchestration, provided that every committed schedule is checked by an independent deterministic feasibility validator before actuation. Code and a live demonstration are available at https://github.com/sokistar24/ecohome-experiments and https://www.ecohomeagent.com/.

eess.SY

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons

The Conflict-Driven Cylindrical Algebraic Covering algorithm has proven well suited for performing theory validation checks in the satisfiability modulo theories paradigm for non-linear real arithmetic. CDCAC repurposes the theory underpinning classical cylindrical algebraic decomposition for SMT solving and is implemented in the SMT solvers cvc5 and SMT-RAT, as well as the computer algebra system Maple. It was previously observed that when using cylindrical algebraic decomposition for an SMT theory call, the output can be optimised by solving a single set covering problem instance that minimises the conflict clause. In this paper we consider the corresponding optimisation for CDCAC and observe that CDCAC naturally gives rise to multiple such optimisations within a single call. Each time a covering is generalised in one dimension, the resulting cell in the next dimension is labelled with theory constraints that cannot be satisfied together. We seek the smallest subset of constraints whose union covers all labels from the cells in the current covering. We call this optimisation problem a set covering problem with reasons. To simplify this problem, we introduce a data reduction step that generalises Beasley reduction for the classical set covering problem and show that this step alone solves many of the instances arising from SMT-LIB benchmarks. We then propose an exact solver based on linear programming to efficiently solve the remaining cases. Integrating these techniques into CDCAC has the potential to significantly improve SMT solver performance for non-linear real arithmetic problems.

cs.DS