Singapore

The feedback loop of &quot;&quot;system recommendation → user feedback
→ system re-recommendation&quot;&quot; in industrial recommendation sys-
tems results in highly similar and convergent recommendation
results. This loop reinforces homogeneous content, creates filter
bubble effects, and diminishes user satisfaction. Recently, large lan-
guage models (LLMs) have demonstrated potential in serendipity
recommendation, thanks to their extensive world knowledge and
superior reasoning capabilities. However, these models still face
challenges in ensuring the rationality of the reasoning process,
the usefulness of the reasoning results, and meeting the latency
requirements of industrial recommendation systems (RSs). To ad-
dress these challenges, we propose a method that leverages large
language models to dynamically construct user knowledge graphs,
thereby enhancing the serendipity of recommendation systems.
This method comprises a two-stage framework: (1) two-hop inter-
est reasoning, where user static profiles and historical behaviors
are utilized to dynamically construct user knowledge graphs via
large language models. Two-hop reasoning, which can enhance the
quality and accuracy of LLM reasoning results, is then performed
on the constructed graphs to identify users’ potential interests; and
(2) Near-line adaptation, a cost-effective approach to deploying the
aforementioned models in industrial recommendation systems. We
propose a u2i (user-to-item) retrieval model that also incorporates
i2i (item-to-item) retrieval capabilities, the retrieved items not only
exhibit strong relevance to users’ newly emerged interests but also
retain the high conversion rate of traditional u2i retrieval. Under
offline human expert evaluation criteria, the larger the better, the distribution of user potential interest
scores is as follows: 1% for a score of 0, 3% for a score of 1, and 96%
for a score of 2. Our online experiments on the Dewu app, which
has tens of millions of users, indicate that the method increased the
exposure novelty rate by 4.62%, the click novelty rate by 4.85%, the
average view duration per person by 0.15%, unique visitor click-
through rate by 0.07%, and unique visitor interaction penetration
by 0.30%, thereby enhancing user experience.

AAAI 2026

Enhancing Serendipity Recommendation System by Constructing Dynamic User Knowledge Graphs with Large Language Models

The feedback loop of ""system recommendation → user feedback
→ system re-recommendation"" in industrial recommendation sys-
tems results in highly similar and convergent recommendation
results. This loop reinforces homogeneous content, creates filter
bubble effects, and diminishes user satisfaction. Recently, large lan-
guage models (LLMs) have demonstrated potential in serendipity
recommendation, thanks to their extensive world knowledge and
superior reasoning capabilities. However, these models still face
challenges in ensuring the rationality of the reasoning process,
the usefulness of the reasoning results, and meeting the latency
requirements of industrial recommendation systems (RSs). To ad-
dress these challenges, we propose a method that leverages large
language models to dynamically construct user knowledge graphs,
thereby enhancing the serendipity of recommendation systems.
This method comprises a two-stage framework: (1) two-hop inter-
est reasoning, where user static profiles and historical behaviors
are utilized to dynamically construct user knowledge graphs via
large language models. Two-hop reasoning, which can enhance the
quality and accuracy of LLM reasoning results, is then performed
on the constructed graphs to identify users’ potential interests; and
(2) Near-line adaptation, a cost-effective approach to deploying the
aforementioned models in industrial recommendation systems. We
propose a u2i (user-to-item) retrieval model that also incorporates
i2i (item-to-item) retrieval capabilities, the retrieved items not only
exhibit strong relevance to users’ newly emerged interests but also
retain the high conversion rate of traditional u2i retrieval. Under
offline human expert evaluation criteria, the larger the better, the distribution of user potential interest
scores is as follows: 1% for a score of 0, 3% for a score of 1, and 96%
for a score of 2. Our online experiments on the Dewu app, which
has tens of millions of users, indicate that the method increased the
exposure novelty rate by 4.62%, the click novelty rate by 4.85%, the
average view duration per person by 0.15%, unique visitor click-
through rate by 0.07%, and unique visitor interaction penetration
by 0.30%, thereby enhancing user experience.

workshop paper

We are pleased to announce the Fortieth AAAI Conference on Artificial Intelligence (AAAI-26), which will be held in Singapore EXPO from January 20 to January 27, 2026.

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-26 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.<br><br>

To access this event page, you need to log in with the **email address you registered with**. <br>Access credentials will be sent to your email from Underline -  subject line "Welcome to AAAI 2026". Please be sure to check your spam email folder if you do not see an email confirmation right away.

Please log in

To access this event page, you are required to register.
Please complete your registration to continue.

We recommend reading [**the registration information**](https://aaai.org/conference/aaai/aaai-26/registration/) first.

**Online Registration Form**: https://aaai.getregistered.net/conference-2026 

Registration Required

We are pleased to announce the Fortieth AAAI Conference on Artificial Intelligence (AAAI-26), which will be held in Singapore EXPO from January 20 to January 27, 2026.

Large Language Models (LLMs) have demonstrated exceptional capabilities but face two critical deployment challenges: high computational costs and scarcity of personalized domain training data. We address these dual challenges through a comprehensive framework that combines synthetic data generation with inference optimization techniques. Our approach employs LLMs for zero-shot and few-shot synthetic dataset creation while applying structural pruning, knowledge distillation, quantization, and prompt caching for computational efficiency. We evaluate three architectural paradigms: encoder-only, encoder-decoder, and decoder-only on synthetic building permit classification and assess optimization techniques on public benchmarks. Our systematic evaluation reveals that strategic architectural selection based on task characteristics is more critical than model complexity: encoder-only models provide superior efficiency-accuracy trade-offs for high-throughput scenarios, demonstrating that understanding problem requirements enables effective deployment without requiring the largest available models. Knowledge distillation emerges as the key optimization technique for personalized domains, recovering pruning-induced performance degradation with Llama3-8B+KD achieving 87.1% accuracy at 20% pruning while exceeding unpruned baselines. Complementary optimization strategies, including dynamic caching (5-18% latency reduction with zero performance loss) and hardware acceleration (up to 200× speedup) enable flexible deployment configurations for domain specific applications.

Domain-Specific LLM Adaptation: Bridging Personalization and Efficiency Through Synthetic Data and Optimization

As AI becomes more personal, e.g., Agentic AI, there is an increasing need for personalizing models for various use cases. Personalized federated learning (PFL) enables each client to collaboratively leverage other clients' knowledge for better adaptation to the task of interest, without privacy risks. Despite its potential, existing PFL methods remain confined to rather simplified scenarios where data and models are the same across clients. To move towards realistic scenarios, we propose FedMosaic, a method that jointly addresses data and model heterogeneity with a task-relevance-aware model aggregation strategy to reduce parameter interference, and a dimension-invariant module that enables knowledge sharing across heterogeneous architectures without huge computational cost. To mimic the real-world task diversity, we propose a multi-modal PFL benchmark spanning 40 distinct tasks with distribution shifts over time. The empirical study shows that FedMosaic outperforms the state-of-the-art PFL methods, excelling in both personalization and generalization capabilities under challenging, realistic scenarios.

Not All Clients Are Equal: Collaborative Model Personalization on Heterogeneous Multi-Modal Clients

Personalizing Large Language Model (LLM) agents requires conditioning them on user-specific data, creating a critical trade-off between task utility and data disclosure. While the utility of adding user data often exhibits diminishing returns (i.e., submodularity), enabling near-optimal greedy selection, real-world personalization is complicated by structural constraints. These include logical dependencies (e.g., selecting fact A requires fact B), categorical quotas (e.g., select at most one writing style), and hierarchical rules (e.g., select at most two social media preferences, of which at most one can be for a professional network). These constraints violate the assumptions of standard subset selection algorithms. We propose a principled method to formally model such constraints. We introduce a compilation process that transforms a user‚Äôs knowledge graph with dependencies into a set of abstract macro-facets. Our central result is a proof that common hierarchical and quota-based constraints over these macro-facets form a valid laminar matroid. This theoretical characterization lets us cast structured personalization as submodular maximization under a matroid constraint, enabling greedy with constant-factor guarantees (and (1‚àí1/e) via continuous greedy) for a much richer and more realistic class of problems.

Structured Personalization: Modeling Constraints as Matroids for Data-Minimal LLM Agents

Large Language Models (LLMs) are typically aligned for safety during the post-training phase; however, they may still generate harmful outputs that pose risks to users. 
This challenge underscores the need for robust safeguards that operate across both model inputs and outputs. In this work, we introduce RoGuard 1.0, a state-of-the-art instruction fine-tuned LLM designed to enhance the safety of LLM systems through comprehensive input‚Äìoutput moderation, using a pipeline of LLMs to enhance moderation capability. 
Built on the Llama-3.1-8B-Instruct backbone, our model is instruction fine-tuned to generalize across previously unseen safety taxonomies and demonstrates strong performance on out-of-domain safety benchmarks. 
The instruction fine-tuning process uses a mix of synthetic and open-source safety datasets, augmented with chain-of-thought (CoT) rationales and input inversion to enhance contextual understanding and decision making. 
To support systematic evaluation, we also release RoGuard Evaluation, a new benchmark featuring an extensible safety taxonomy to assess the effectiveness of LLM guardrails and moderation frameworks.

Taxonomy-Adaptive Moderation Model with Robust Guardrails for Large Language Models

Large foundation models (LFMs) transform healthcare AI in prevention, diagnostics, and treatment. However, whether LFMs can provide truly personalized treatment recommendations remains an open question. Recent research has revealed multiple challenges for personalization, including the fundamental generalizability paradox: models achieving high accuracy in one clinical study perform at chance level in others, demonstrating that personalization and external validity exist in tension. This exemplifies broader contradictions in AI-driven healthcare: the privacy-performance paradox, scale-specificity paradox, and the automation-empathy paradox. As another challenge, the degree of causal understanding required for personalized recommendations, as opposed to mere predictive capacities of LFMs, remains an open question. N-of-1 trials -- crossover self-experiments and the gold standard for individual causal inference in personalized medicine -- resolve these tensions by providing within-person causal evidence while preserving privacy through local experimentation. Despite their impressive capabilities, this paper argues that LFMs cannot replace N-of-1 trials. We argue that LFMs and N-of-1 trials are complementary: LFMs excel at rapid hypothesis generation from population patterns using multimodal data, while N-of-1 trials excel at causal validation for a given individual. We propose a hybrid framework that combines the strengths of both to enable personalization and navigate the identified paradoxes: LFMs generate ranked intervention candidates with uncertainty estimates, which trigger subsequent N-of-1 trials. Clarifying the boundary between prediction and causation and explicitly addressing the paradoxical tensions are essential for responsible AI integration in personalized medicine.

Personalization of Large Foundation Models for Health Interventions

Real-world deployment of large vision‚Äìlanguage models (LVLMs) makes everyday photos vulnerable to unintended geolocation inference, motivating techniques that enable safe, user-controllable personalization and privacy-aware deployment. We present Adversarial Tiled Location Anonymity Shield (ATLAS), a fully user-side, zero-query, black-box image-layer adaptation module that can be inserted before any LVLM to control the visibility of geospatial and contextual cues under strict perceptual constraints. ATLAS learns such modulations through a Mixture-of-Tiles (MoT) formulation: a semantic segmenter decomposes an image into regions, and a compact tile bank is routed by learned semantic gates and assembled per region before blending with the input to yield a perceptually faithful image that misdirects LVLM geolocation inference. ATLAS is trained on multiple frozen surrogate vision encoders (e.g., LLaMA-4 vision tower, CLIP, BLIP), each paired with lightweight GeoHeads for geolocation supervision; tower-wise losses are aggregated to guide the MoT generator while keeping all backbones frozen. We further explore two complementary training domains: a pixel-space variant perturbing texture and color statistics, and a frequency-space variant modulating low-frequency phase structure to probe distribution-level fragility. On OpenStreetView-5M, ATLAS reduces country-level accuracy by over 40\% and increases mean localization error by over 3,000 km under matched perceptual fidelity. In practice, ATLAS serves as a deployable personalization-safety layer, complementing dialogue-level policies with portable, image-level control, offering a practical path toward privacy-preserving and user-controllable personalization in real-world LVLM deployments.

ATLAS: User-Side Personalization and Privacy Protection Against Geolocation Risks in Large Vision–Language Models

Recent advancements in large language models (LLMs) have significantly enhanced many aspects of research and daily lives. While LLMs are inherently powerful, their performance can be further improved through post-training tailored to specific user needs. For individual users who are unable to directly finetune base models due to resource constraints, classifier guidance offers a more cost-effective solution for controlled text generation. However, traditional ways of applying classifier guidance (CFG) dose not transfer well to Diffusion Large Language Models (DLLMs), which would suffer from instability, criterion mismatch and slow inference. In this work, we propose an efficient approach to utilize and adapt classifier guidance on DLLMs, substantially reducing training and inference time while delivering notable improvements in task performance.

Controlled Text Generation of DLLMs with Efficient Classifier Guidance

Foundation models for knowledge graphs (KGs) achieve strong cohort-level performance in link prediction, yet fail to capture individual user preferences; a key disconnect between general relational reasoning and personalized ranking. We propose GatedBias, a lightweight inference-time personalization framework that adapts frozen KG embeddings to individual user contexts without retraining or compromising global accuracy. Our approach introduces structure-gated adaptation: profile-specific features combine with graph-derived binary gates to produce interpretable, per-entity biases, requiring only ${\sim}300$ trainable parameters. We evaluate GatedBias on two benchmark datasets (Amazon-Book and Last-FM), demonstrating statistically significant improvements in alignment metrics while preserving cohort performance. Counterfactual perturbation experiments validate causal responsiveness; entities benefiting from specific preference signals show 6--30$\times$ greater rank improvements when those signals are boosted. These results show that personalized adaptation of foundation models can be both parameter-efficient and causally verifiable, bridging general knowledge representations with individual user needs.

Lightweight Inference-Time Personalization for Frozen Knowledge Graph Embeddings

Online grocery shopping presents unique challenges for sequential recommendations due to repetitive purchase patterns and complex item relationships within the baskets. Unlike traditional e-commerce, grocery recommendations must capture both complementary item associations and temporal dependencies across shopping sessions. To address these challenges in Amazon's online grocery business, we propose T-REX, a novel transformer architecture that generates personalized category-level suggestions by learning both short-term basket dependencies and long-term user preferences. Our approach introduces three key innovations: (1) an efficient sampling strategy utilizing dynamic sequence splitting for sparse shopping patterns, (2) an adaptive positional encoding scheme for temporal patterns, and (3) a category-level modeling approach that reduces dimensionality while maintaining recommendation quality. Although masked language modeling techniques like BERT4Rec excel at capturing item relations, they prove less suitable for next basket generation due to information leakage issues. In contrast, T-REX's causal masking approach better aligns with the sequential nature of basket generation, enabling more accurate next-basket predictions. Experiments on large-scale grocery offline data and online A/B tests show significant improvement over existing systems.

T-REX: Transformer-based Category Sequence Generation for Grocery Basket Recommendation

Language identification is a crucial first step in multilingual systems such as chatbots and virtual assistants, enabling linguistically and culturally accurate user experiences. Errors at this stage can cascade into downstream failures, setting a high bar for accuracy. Yet, existing language identification tools struggle with key cases--such as music requests where the song title and user language differ. Open-source tools like LangDetect, FastText are fast but less accurate, while large language models, though effective, are often too costly for low-latency or low-resource settings. We introduce PolyLingua, a lightweight Transformer-based model for in-domain language detection and fine-grained language classification. It employs a two-level contrastive learning framework combining instance-level separation and class-level alignment with adaptive margins, yielding compact and well-separated embeddings even for closely related languages. Evaluated on two challenging datasets‚ÄîAmazon Massive (multilingual digital assistant utterances) and a Song dataset (music requests with frequent code-switching)‚ÄîPolyLingua achieves $99.25\%$ F1 and $98.15\%$ F1, respectively, surpassing Sonnet 3.5 while using 10√ó fewer parameters, making it ideal for compute- and latency-constrained environments.

Premium content

Next from AAAI 2026

Domain-Specific LLM Adaptation: Bridging Personalization and Efficiency Through Synthetic Data and Optimization

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES