Singapore

Typical domestic Immersion water heater systems are always turned on during the winter, it heats quickly rather than efficiently and ignores predictable demand windows and ambient losses. We study deadline-aware control, where the aim is to reach a target temperature at a specified time while minimising energy. We introduce an efficient Gymnasium environment that models an immersion hot-water heater with first-order thermal losses and discrete on and off actions ${0, 6000}$ W applied every 120 s. Methods include a time-optimal bang-bang baseline, a zero-shot Monte Carlo Tree Search planner, and a Proximal Policy Optimization policy. We report total energy (Wh) under identical physics. Across sweeps of initial temperature (10–30 °C), deadline (30–90 steps), and target temperature (40–80 °C), PPO achieves the most energy-efficient performance at a 60-step horizon (2 h) it uses 3.23 kWh, versus bang-bang’s 4.37–10.45 kWh and MCTS’s 4.18–6.46 kWh, yielding savings of 26\% at 30 steps and 69\% at 90 steps. In a representative trajectory (50 kg, 20 °C ambient, 60 °C target), PPO consumes 54\% less energy than bang-bang and 33\% less than MCTS. These results show that learned, deadline-aware control reduces energy under identical physics where planners provide partial savings without training, while policies offer near-zero-cost inference once trained.

AAAI 2026

Deadline-Aware, Energy-Efficient Control of Domestic Immersion Hot Water Heater

ml: reinforcement learning

pomdps)

prs: planning with markov models (mdps

ru: sequential decision making

We are pleased to announce the Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI-24), which will be held in Vancouver, British Columbia at the Vancouver Convention Centre – West Building from 20-27 February, 2024.

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-24 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.

We expect for AAAI-24 to be an in-person conference – one author of all accepted papers will be expected to present work in person unless there are exceptional circumstances that prevent this.

In order to access the AAAI-24 event page you need to register [here](https://aaai.org/aaai-conference/registration/)

AAAI 2024

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. 

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.

To access this event page, you need to log in with the **email address you registered with**. 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.

Infrared and visible object detection (IVOD) is essential for numerous around-the-clock applications. Despite notable advancements, current IVOD models exhibit notable performance declines when confronted with incomplete modality data, particularly if the dominant modality is missing. In this paper, we take a thorough investigation on modality incomplete IVOD problem from an architecture compatibility perspective. Specifically, we propose a plug-and-play Scarf Neck module for DETR variants, which introduces a modalityagnostic deformable attention mechanism to enable the IVOD detector to flexibly adapt to any single or double modalities during training and inference. When training Scarf-DETR, we design a pseudo modality dropout strategy to fully utilize the multi-modality information, making the detector compatible and robust to both working modes of single and double modalities. Moreover, we introduce a comprehensive benchmark for the modality-incomplete IVOD task aimed at thoroughly assessing situations where the absent modality is either dominant or secondary. Our proposed Scarf-DETR not only performs excellently in missing modality scenarios but also achieves superior performances on the standard IVOD modality complete benchmarks. We will release our code.

On Modality Incomplete Infrared-Visible Object Detection: An Architecture Compatibility Perspective

Semi-supervised learning (SSL) has emerged as a critical paradigm for medical image segmentation, mitigating the immense cost of dense annotations. However, prevailing SSL frameworks are fundamentally “inward-looking”, recycling information and biases solely from within the target dataset. This design triggers a vicious cycle of confirmation bias under class imbalance, leading to the catastrophic failure to recognize minority classes. To dismantle this systemic issue, we propose a paradigm shift to a multi-level “outward-looking” framework. Our primary innovation is Foundational Knowledge Distillation (FKD), which looks outward beyond the confines of medical imaging by introducing a pre-trained visual foundation model, DINOv3, as an unbiased external semantic teacher. Instead of trusting the student’s biased high confidence, our method distills knowledge from DINOv3’s robust understanding of high semantic uniqueness, providing a stable, cross-domain supervisory signal that anchors the learning of minority classes. To complement this core strategy, we further look outward within the data by proposing Progressive Imbalance-aware CutMix (PIC), which creates a dynamic curriculum that adaptively forces the model to focus on minority classes in both labeled and unlabeled subsets. This layered strategy forms our framework, DINO-Mix, which breaks the vicious cycle of bias and achieves remarkable performance on challenging semi-supervised class-imbalanced medical image segmentation benchmarks Synapse and AMOS.

DINO-Mix: Distilling Foundational Knowledge with Cross-Domain CutMix for Semi-supervised Class-imbalanced Medical Image Segmentation

Membership inference attacks (MIAs) test whether a data point was part of a model's training set, posing serious privacy risks. Existing methods often depend on shadow models or heavy query access, which limits their practicality. We propose GP-MIA, an efficient and interpretable approach based on Gaussian process (GP) meta-modeling. Using post-hoc metrics such as accuracy, entropy, dataset statistics, and optional sensitivity features (e.g. gradients, NTK measures) from a single trained model, GP-MIA trains a GP classifier to distinguish members from non-members while providing calibrated uncertainty estimates. Experiments on synthetic data, real-world fraud detection data, CIFAR-10, and WikiText-2 show that GP-MIA achieves high accuracy and generalizability, offering a practical alternative to existing MIAs.

Training data membership inference via Gaussian process meta-modeling: a post-hoc analysis approach

Recursive Self-Improvement (RSI) is an effective approach to alleviating data scarcity. This paper explores the application of RSI in text-to-image diffusion models, addressing the challenge of training collapse caused by biased synthetic data. We identify two key factors contributing to this collapse: the lack of perceptual alignment and the accumulation of generative hallucinations. To mitigate these issues, we propose three strategies: (1) a prompt construction and filtering pipeline designed to facilitate the generation of perceptual aligned data, (2) a preference sampling method to identify human-preferred samples and filter out generative hallucinations, and (3) a distribution-based weighting scheme to penalize selected samples with hallucinatory errors. Our extensive experiments validate the effectiveness of these approaches.

Generating on Generated: An Approach Towards Self-Evolving Diffusion Models

Machine learning holds great promise for advancing the field of medicine, with electronic health records (EHRs) serving as a primary data source. However, EHRs are often sparse and contain missing data due to various challenges and limitations in data collection and sharing between healthcare providers. Existing techniques for imputing missing values predominantly focus on known unknowns, such as missing or unavailable values of lab test results; most do not explicitly address situations where it is difficult to distinguish what is missing. For instance, a missing diagnosis code in an EHR could signify either that the patient has not been diagnosed with the condition or that a diagnosis was made, but not shared by a provider. Such situations fall into the paradigm of unknown unknowns. To address this challenge, we develop a general purpose algorithm for denoising data to recover unknown missing values in binary EHRs. We design a transformer-based denoising neural network where the output is thresholded adaptively to recover values in cases where we predict data are missing. Our method demonstrates improved accuracy in denoising medical codes within a real EHR dataset compared to existing imputation approaches and leads to increased performance on downstream tasks using the denoised data. In particular, when applying our method to a real world application, predicting hospital readmission from EHRs, our method achieves statistically significant improvement over all existing baselines.

Imputation of Unknown Missingness in Sparse Electronic Health Records

Sequential recommendation (SR) systems leverage users’ historical interaction sequences and are widely adopted on online platforms to deliver personalized suggestions effectively. Recent advancements in self-attention and contrastive learning-based models have significantly improved SR performance. However, these methods often utilize user behavior on a fixed, single time scale, making them insensitive to the temporal evolution of user interests. While these models effectively capture long-term preferences, they are biased toward persistent behavioral patterns and fail to reflect transient, short-term dynamics, as indicated by their minimal performance degradation on shuffled interaction sequences. To address these challenges, we propose Hierarchical INTerests-aware Sequential Recommendation (HINT). Instead of relying on contrastive learning and self-attention methods, HINT implements a hierarchical user interests modeling approach. Specifically, it first forms multiple sequences by applying variable-kernel average pooling to the original sequence, a technique designed to capture user interests across multiple time scales. It then employs a Fourier transform-based filtering to adaptively denoise each view by processing its low- and high-frequency components. Subsequently, HINT uses an attention-based adaptive aggregation mechanism to integrate the multi-scale views. This allows the model to focus on salient information within the hierarchical interests representations, resulting in a more accurate and comprehensive user profile. Extensive experiments conducted on four real-world datasets demonstrate that HINT outperforms other state-of-the-art baselines.

Hierarchical Interests Modeling on Multiple Time Scales for Sequential Recommendation

In data-scarce settings, learning accurate and interpretable
models for tabular classification remains a fundamental chal-
lenge. We propose a novel pipeline for few-shot tabular clas-
sification that distills the predictive power of large founda-
tion models into globally interpretable student models. Given
a tabular dataset, we generate synthetic data using CTGAN
to approximate the underlying distribution. We then train
high-capacity teacher models (TabLLM, TabPFN, TabM) on
a small number of labeled examples and use them to pseu-
dolabel the synthetic data. Finally, we train student explainer
models (i.e., XGBoost, logistic regression, decision trees,
Generalized Linear Rule Model (GLRM), and TTnet) on
this pseudolabeled synthetic dataset. These student models
are globally and exactly interpretable, yielding logical de-
cision rules (e.g., disjunctive normal form) that fully repro-
duce their predictions. Across 15 tabular binary classification
benchmarks, our distilled models generally outperform base-
lines trained directly on the few-shot data, with improved
ROC AUC scores in the low-shot (4-16 samples) to mid-
and higher-shot settings (up to 256 samples). In particular,
TabPFN-based distillation achieves strong and reliable im-
provements across the entire shot spectrum, not only in heavy
data scarcity but also in broader low-data regimes. This work
demonstrates that foundation models can be effectively lever-
aged as teachers to produce small, transparent, and high-
performing classifiers. Our approach advances the goal of re-
liable and interpretable machine learning in real-world set-
tings where labeled data is limited.

Towards Globally Interpretable Few-Shot Tabular Learning: Distilling Foundation Models

'LLM-as-a-judge,'' which utilizes large language models (LLMs) as evaluators, has proven effective in many evaluation tasks.
However, evaluator LLMs exhibit numerical bias, a phenomenon where certain evaluation scores are generated disproportionately often, leading reduced evaluation performance.
This study investigates the cause of this bias.
Given that most evaluator LLMs are aligned through instruction tuning and preference tuning, and that prior research suggests alignment reduces output diversity, we hypothesize that numerical bias arises from alignment.
To test this, we compare outputs from pre- and post-alignment LLMs, and observe that alignment indeed increases numerical bias.
We also explore mitigation strategies for post-alignment LLMs, including temperature scaling, distribution calibration, and score range adjustment.
Among these, score range adjustment is most effective in reducing bias and improving performance, though still heuristic.
Our findings highlight the need for further work on optimal score range selection and more robust mitigation strategies.

Exploring the Effects of Alignment on Numerical Bias in Large Language Models

Adaptations are one of the most prominent methods that enable the utilization of large backbone models for those who have limited computational resources. Yet, even in their last resort of using adaptations, many face a dead end in training when adaptation data are insufficient. Since the acquisition of adaptation data is arduous, the situation frequently appears, daunting without a particular solution. Often, even with extra training or random data augmentation, the performance of adaptations does not improve. To address this, we organize a solid probabilistic background and sampling method that focuses on the enormous amount of backbone data used for pre-training. We name the method, Backbone Augmented Training (BAT). First, we formulate and prove two key probabilistic propositions: one establishes the validity of BAT, while the other identifies a condition under which BAT benefits adaptation. Furthermore, we introduce an original data sampling scheme that satisfies these propositions and present ALgorithm for BAT (ALBAT) to efficiently implement this approach. ALBAT effectively enhances adaptation training even when other methods meet performance stalemate due to adaptation data scarcity.

BAT: Backbone Augmented Training for Adaptations

This paper investigates how the degree of group fairness changes when the degree of individual fairness is actively controlled. As a metric quantifying individual fairness, we consider generalized entropy (GE) recently introduced into machine learning community. To control the degree of individual fairness, we design a classification algorithm satisfying a given degree of individual fairness through an empirical risk minimization (ERM) with a fairness constraint specified in terms of GE. We show the PAC learnability of the fair ERM problem by proving that the true fairness degree does not deviate much from an empirical one with high probability for finite VC dimension if the sample size is big enough. Our experiments show that strengthening individual fairness degree does not always lead to enhancement of group fairness.

Downloads

Next from AAAI 2026

On Modality Incomplete Infrared-Visible Object Detection: An Architecture Compatibility Perspective

Similar lecture

Analyzing Generalization in Policy Networks: A Case Study with the Double-Integrator System | VIDEO