IJCAI 2026 Papers

The Personal AI landscape is currently dominated by "Black Box" Retrieval-Augmented Generation. While standard vector databases offer statistical matching, they suffer from a fundamental lack of accountability: when an AI hallucinates or retrieves sensitive data, the user cannot inspect the cause nor correct the error. Worse, "deleting" a concept from a vector space is mathematically imprecise, leaving behind probabilistic "ghosts" that violate true privacy. We propose Ruva, the first "Glass Box" architecture designed for Human-in-the-Loop Memory Curation. Ruva grounds Personal AI in a Personal Knowledge Graph, enabling users to inspect what the AI knows and to perform precise redaction of specific facts. By shifting the paradigm from Vector Matching to Graph Reasoning, Ruva ensures the "Right to be Forgotten." Users are the editors of their own lives; Ruva hands them the pen.

We present SparseDR, a novel differentiable rendering algorithm designed for sparse representations based on Signed Distance Fields (SDF). We leverage the Sparse Brick Set representation and propose an adaptation of redistancing for sparse SDFs. This enables SparseDR to surpass existing works in accuracy of surface reconstruction by increasing the effective resolution of the SDF representation. SparseDR is efficiently implemented in C++ and Vulkan, achieving several times shorter reconstruction time than other methods.

Coupled power-traffic simulations are valuable for studying EV charging stress and outage propagation, but existing tools typically require scripts and opaque configurations. We present LLM-to-Map, a demo system that exposes a real-time multi-domain simulator through structured LLM tool orchestration. Natural-language requests are mapped to typed tool calls that coordinate SUMO traffic simulation, PyPSA power-flow analysis, V2G actions, and map operations. The agent operates over a fixed tool schema and emits auditable execution logs in the UI so users can inspect every action and parameter. Tool execution is deterministic: each request resolves to explicit API calls, and unsafe or destructive actions can require confirmation. The tool layer provides JSON schemas and parameter validation, preventing arbitrary code execution and enabling reproducible runs. The agent receives live system state (loads, EV statistics, V2G status, time, temperature) to support context-aware multi-step commands; when an LLM is unavailable, a deterministic parser preserves the same tool interface. The backend synchronizes cross-domain events (EV charging demand and substation failures) and streams state updates to a 3D map interface. We describe the architecture, coupling and synchronization, and a demo workflow that showcases multi-step scenario control and reporting for non-experts without writing scripts. Demo video: https://youtu.be/CpEgCZPl_2g; code: https://github.com/MarouaneBenbrahim/Map-LLM.

This paper presents the primary research challenges and key findings from the 15th International Automated Negotiating Agents Competition (ANAC 2025), one of the official competitions of IJCAI 2025. We focus on two critical domains: multideal negotiations and the development of agents capable of concurrent negotiation within complex supply chain management environments. Furthermore, this work analyzes the results of the competition and outlines strategic directions for future iterations.

The increasing use of neural networks (NNs) in high-stakes decision-making requires rigorous analysis to ensure safety, fairness, and explainability. Formal verification tools for neural networks typically focus on determining the satisfiability of properties such as safety or fairness. However, many fairness and explainability tasks go beyond satisfiability and instead rely on arbitrary optimization objectives. To address such problems, neural networks are often encoded as mixed-integer linear optimization (MILO) problems with linear objectives. In practice, these encodings are usually implemented in an ad-hoc manner, limiting comparability across works, reducing transparency, and increasing implementation effort. We address this gap by introducing eNNcode, a user-friendly PyPI library that converts any piecewise-linear neural network in Open Neural Network Exchange (ONNX) format into a MILO instance. The library supports arbitrary constraints on input and output nodes, as well as user-defined optimization objectives. Our experiments show that eNNcode achieves performance comparable to existing libraries, despite its simplicity and ease of use. Overall, eNNcode facilitates reproducible and standardized optimization-based analysis of neural networks.

The Digital Roads project at Cambridge University is leveraging digitalisation, automation, and low-carbon materials to build an Automated Maintenance Plant (AMP) for UK road networks, aimed at minimising repair times to reduce congestion, improving safety, and contributing to the UK’s net-zero goals through faster, more accurate, and efficient road maintenance.

Renewable energy is a key alternative to fossil fuels and their environmental harms. However, sub-Saharan African countries remain behind in their implementation, due to poor investment in the appropriate resource, among other causes. This information is dispersed as unstructured knowledge across scientific papers, making the task manually demanding for decision and policy makers. In this work, we combine the strength of Large Language Models (LLMs) and structured knowledge (Knowledge Graphs) in a neuro-symbolic framework to tackle this issue. We implement this approach in the hydropower field, building a question-answering system that uses Retrieval Augmented Generation (RAG) on a knowledge graph. Using LLMs such as LLaMA 3.1 8B, LLaMA 3.3 70B, LLaMA 4 Scout 17B, and Kimi K2, we observe an improvement in exact match of 48 − 60% across all models. These results support the ability of this framework to participate in evidence-based energy planning in developing countries.

LLMs increasingly serve as the control unit of AI agents. However, current systems struggle to support personalized interactions, as they lack effective mechanisms to remember and reuse user-specific information across sessions. To address this, our research is centered around how memory augmentation and agentic decision-making can enable personalization in long-term interactions with LLM-based agents. As a first step, we proposed CAIM, a memory framework inspired by cognitive AI principles that aims to simulate human thought processes to create more adaptable systems. Building on this, we extended CAIM with an agentic workflow and user-specific memory modules to support personalized behavior beyond static retrieval-based approaches. We conducted a user study to evaluate perceived personalization, comparing our memory-based approach to a RAG baseline. Our ongoing research focuses on how personalization can be measured without user studies, which are costly and hard to scale. The long-term goal of our research is to establish foundations for designing and evaluating personalized LLM-based systems.

This research studies interpretability methods for deep neural network--based radio receivers in future wireless communication systems. The work focuses on representation-level analysis and training data attribution techniques that reveal how models encode physical-layer channel conditions and how training data influence receiver behavior. These insights enable validation, adaptation, and more trustworthy deployment of data-driven communication systems under realistic channel conditions, while providing deeper understanding of model behavior.

My research initiates the use of large language models (LLMs) to automate the design of effective algorithms for challenging problems in computational social choice, namely participatory budgeting (PB) and facility location mechanism design. To this end, I propose two LLM-based frameworks that respectively generate interpretable PB rules and mechanisms fulfilling competing objectives, i.e., optimality vs. fairness or strategyproofness. Future directions include extending these frameworks to achieve provable guarantees and addressing other relevant areas such as fair division.

Multimodal deep learning for clinical decision support frequently fails in real-world deployments due to severe data missingness and sensor noise. Standard fusion and Mixture-of-Experts (MoE) architectures assume all modalities are uniformly informative, causing routing collapse and miscalibrated confidence when faced with corrupted inputs. My doctoral research addresses this fragility by shifting the paradigm from generative imputation to uncertainty-guided abstention. As a foundational step, I introduce QA-MoE (Quality-Aware MoE), which explicitly decouples reliability estimation from the routing process. By quantifying epistemic uncertainty, the model dynamically filters noisy modalities before fusion, ensuring sparse and stable inference. Building on this static robustness, my ongoing and future research extends to longitudinal and structured clinical data. I am developing PathFlow-EM, which integrates Expectation-Maximization to handle hidden variable distributions in unevenly sampled time-series, and Uncertainty-Guided Dynamic Topological Fusion (U-DTF), which uses topological data analysis to gate features based on evolving patient graphs. Ultimately, this research trajectory aims to deliver robust, calibration-aware architectures that form the computational basis for reliable Patient Digital Twins.

A vision-based robot can be faced with changing friction, gravity, or motor behavior, whose effects are observable only from pixels mid-episode. Visual model-based reinforcement learning struggles in such settings because most world models assume the latent factors driving these changes stay fixed during interaction, or fold them into a single context embedding. My thesis is developing a context-adaptive Mamba-based world model that infers K context vectors from short pixel-trajectory windows. Each vector steers a disjoint slice of the Mamba backbone through block-diagonal feature-wise linear modulation (FiLM), so distinct dynamics signals travel along parallel pathways rather than collapse into a single channel. The policy trains on imagined rollouts conditioned on the inferred context, and I show that its suboptimality is bounded by √K times the context-inference error along a Lipschitz chain through FiLM, the SSM, and the decoder. Evaluation spans within-episode shifts on DeepMind Control (Walker, Quadruped) and mode/difficulty switching on Atari, against an inferred-context baseline and a privileged-context oracle.

Foundation models’ versatile generalization has driven their broad adoption, yet their deployment is constrained by critical gaps in trustworthiness. First, we conduct a survey to present a comprehensive analysis of what constitute trustworthy foundation model and examined approaches for each requirement from a lifecycle perspective. We identify out-of-distribution (OOD) robustness as the primary technical bottleneck, where performance collapse under distribution shifts invalidates other pillars like fairness and accountability. The nature of this vulnerability is two-fold: first, a reliance on spurious background cues during inference, and second, dimensional collapse in the representation space during fine-tuning. This research aims to mitigate these failures by developing mechanistic insights and algorithmic solutions during foundation model adaptation and deployment phases of the lifecycle.

RAG systems ground LLM responses in external evidence, yet their trustworthiness remains underspecified. Retrieval, re-ranking, and generation are optimized independently with no unified account of whether the system is interpretable, grounded, and traceable. My thesis operationalizes trustworthy RAG through three current sub-goals, each at the stage where it is most vulnerable. For traceability, REASONS benchmarks LLMs on 20K papers, showing attribution failures are systematic even under retrieval augmentation. For interpretability, IMRNNs decomposes dense embeddings via learned adapters, exposing human-readable query-document matching at retrieval. For grounding, METEORA replaces opaque re-ranking with rationale-driven selection, ensuring generation operates over explicitly justified context. I unify these under Interpretable Knowledge Flow (IKnowFlow), where trustworthiness is preserved across stage boundaries rather than checked at output. IKnowFlow will next address two longstanding blind spots: negation-awareness in retrieval, where surface similarity masks semantic inversion, and provenance-aware verification through structured source graphs.

Neural networks enable high-performance decision-making, but their deployment in safety-critical settings requires formal guarantees that may become invalid after changes in the system dynamics. This research studies how such guarantees can be recovered using information from the initial verification, enabling post-deployment analysis to assess preservation, quantify degradation, and restore compliant behavior without recomputing verification from scratch.

As AI systems are increasingly deployed in high-stakes settings, two concerns become particularly important: cautiousness (awareness of model limitations for risk-aware decisions) and explainability (providing human-understandable justifications). My PhD research develops methods that enable both, from theoretical and application perspectives. On the theoretical side, I formalize cautious and interpretable models for multiple uncertainty frameworks, with algorithms for explanation and preference elicitation under uncertainty. On the application side, I implement these methods in post-stroke rehabilitation, designing AI systems that analyze multimodal clinical data to support individualized rehabilitation planning.

Analogical reasoning, the ability to map different domains using their structural similarity, is a core mechanism of human cognition that supports tasks such as problem-solving, argumentation, and creativity. Despite recent advances in AI systems, including Large Language Models (LLMs), they still struggle to perform analogical reasoning reliably. In this project, we get inspiration by cognitive theories of analogy and try to develop models that can better capture and perform analogical reasoning. As a key component, we investigate abstraction levels and study how to best extract and represent them. In addition, we systematically analyze the limitations of LLMs by developing a dataset annotated with analogical structure and explore fine-tuning approaches to improve their analogical reasoning abilities.

Despite advances in the computational analysis of multiple sclerosis, the ability to accurately predict disease progression remains limited due to unimodal approaches in the context of deep learning. KG-MultiMS proposes as a multimodal deep-learning framework that integrates data from three heterogeneous sources: (1) MRI volumes using the Swin-UNETR architecture to learn both semantic embeddings and segmentation masks of brain lesions; (2) tabular clinical variables using the FT-Tokenizer architecture to learn clinical embeddings; (3) medical knowledge graph based on the Harvard-Oxford atlas using a Heterogeneous Graph Transformer to learn contextual embeddings from patient-specific subgraphs. A cross-attention mechanism will allow for leveraging multimodal contributions by dynamically weighting them based on the anatomical-functional concordance represented in the contextual embeddings.

Deep learning models for clinical time-series forecasting face significant challenges in generalizability when deployed across different clinical settings. Various choices in the deep learning pipeline can affect a model's out-of-distribution performance. This abstract introduces a comprehensive benchmarking framework to assess domain generalization and adaptation under varying distribution shifts in multivariate time-series forecasting using real-world data. Preliminary empirical results on the influence of backbone model architecture and a proxy metric, the robustness slope, are presented alongside remaining challenges.