Demo Data from EDBT 2026 / reviewers in the wild / expert
Hao Wang 0176
dblp:181/2812-176
· DBLP profile ↗
7ranked-venue papers
0as first author
7since 2021 · last 2026
0000-0002-3035-3064ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
4 papers |
Time series and sequential data · 43% Learning paradigms · 20% Deep learning architectures and training · 11% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 67% Bioinformatics and computational biology · 33% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Time series and sequential data › time series analysis
time series classification |
1.6 | 2 | 2025 | FIC-TSC: Learning Time Series Classification with Fisher Information Constraint · ICML 2025 TimeMIL: Advancing Multivariate Time Series Classification via a Time-aware Multiple Instance Learning · ICML 2024 |
Machine learning › Deep learning architectures and training
attention mechanism |
0.9 | 1 | 2025 | Sequence Complementor: Complementing Transformers for Time Series Forecasting with Learnable Sequences · AAAI 2025 |
Machine learning › Trustworthy machine learning › robustness
distribution shift |
0.9 | 1 | 2025 | FIC-TSC: Learning Time Series Classification with Fisher Information Constraint · ICML 2025 |
Machine learning › Transfer learning and domain adaptation
domain shift |
0.9 | 1 | 2025 | FIC-TSC: Learning Time Series Classification with Fisher Information Constraint · ICML 2025 |
Machine learning › Time series and sequential data › time series analysis
time series forecasting |
0.9 | 1 | 2025 | Sequence Complementor: Complementing Transformers for Time Series Forecasting with Learnable Sequences · AAAI 2025 |
Bioinformatics and computational biology › survival analysis
survival prediction |
0.9 | 1 | 2025 | Cracking Instance Jigsaw Puzzles: An Alternative to Multiple Instance Learning for Whole Slide Image Analysis · ICCV 2025 |
Medical and health informatics › computational pathology › histopathology image analysis
whole slide image analysis |
0.9 | 1 | 2025 | Cracking Instance Jigsaw Puzzles: An Alternative to Multiple Instance Learning for Whole Slide Image Analysis · ICCV 2025 |
Medical and health informatics › computational pathology › histopathology image analysis › whole slide image analysis
whole slide image classification |
0.9 | 1 | 2025 | Cracking Instance Jigsaw Puzzles: An Alternative to Multiple Instance Learning for Whole Slide Image Analysis · ICCV 2025 |
Machine learning › Learning paradigms
multiple instance learning |
0.8 | 1 | 2024 | TimeMIL: Advancing Multivariate Time Series Classification via a Time-aware Multiple Instance Learning · ICML 2024 |
Machine learning › Time series and sequential data › time series analysis › time series classification
multivariate time series classification |
0.8 | 1 | 2024 | TimeMIL: Advancing Multivariate Time Series Classification via a Time-aware Multiple Instance Learning · ICML 2024 |
Machine learning › Learning paradigms
weakly supervised learning |
0.8 | 1 | 2024 | TimeMIL: Advancing Multivariate Time Series Classification via a Time-aware Multiple Instance Learning · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
siamese network · 1.7optimal transport · 1.7multiple instance learning · 1.7instance normalization · 0.9information theory · 0.9flat minima · 0.9fisher information constraint · 0.9diversification loss · 0.9transformer · 0.8attention pooling · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | RobustFormer: Noise-Robust Pre-training for Images and VideosabstractWhile deep learning-based models like transformers, have revolutionized time-series and vision tasks, they remain highly susceptible to noise and often overfit on noisy patterns rather than robust features. This issue is exacerbated in vision transformers, which rely on pixel-level details that can easily be corrupt. To address this, we leverage the discrete wavelet transform (DWT) for its ability to decompose into multi-resolution layers, isolating noise primarily in the high frequency domain while preserving essential low-frequency information for resilient feature learning. Conventional DWT-based methods, however, struggle with computational inefficiencies due to the requirement for a subsequent inverse discrete wavelet transform (IDWT) step. In this work, we introduce RobustFormer, a novel framework that enables noise-robust masked autoencoder (MAE) pre-training for both images and videos by using DWT for efficient downsampling, eliminating the need for expensive IDWT reconstruction and simplifying the attention mechanism to focus on noise-resilient multi-scale representations. To our knowledge, RobustFormer is the first DWT-based method fully compatible with video inputs and MAE-style pre-training. Extensive experiments on noisy image and video datasets demonstrate that our approach achieves up to 8% increase in Top-1 classification accuracy under severe noise conditions in Imagenet-C and up to 2.7% in Imagenet-P standard benchmarks compared to the baseline and up to 13% higher Top-1 accuracy on UCF-101 under severe custom noise perturbations while maintaining similar accuracy scores for clean datasets. We also observe the reduction of computation complexity by up to 4.4% through IDWT removal compared to VideoMAE baseline without any performance drop. Ashish Bastola, Nishant Luitel, Hao Wang 0176, Danda Pani Paudel, Roshni Poudel, Abolfazl Razi |
WACV | 3 |
| 2026 | Prompt-OT: An Optimal Transport Regularization Paradigm for Knowledge Preservation in Vision-Language Model AdaptationabstractVision-language models (VLMs) such as CLIP demonstrate strong performance but struggle when adapted to downstream tasks. Prompt learning has emerged as an efficient and effective strategy to adapt VLMs while preserving their pre-trained knowledge. However, existing methods still lead to overfitting and degrade zero-shot generalization. To address this challenge, we propose an optimal transport (OT)-guided prompt learning framework that mitigates forgetting by preserving the structural consistency of feature distributions between pre-trained and fine-tuned models. Unlike conventional point-wise constraints, OT naturally captures cross-instance relationships and expands the feasible parameter space for prompt tuning, allowing a better tradeoff between adaptation and generalization. Our approach enforces joint constraints on both vision and text representations, ensuring a holistic feature alignment. Extensive experiments on benchmark datasets demonstrate that our simple yet effective method outperforms existing prompt learning strategies in base-to-novel generalization, cross-dataset evaluation, and domain generalization, without requiring additional augmentation or ensemble techniques. Xiwen Chen, Peijie Qiu, Hao Wang 0176, Haiyu Wu, Aristeidis Sotiras, Yalin Wang 0001, Abolfazl Razi |
WACV | 4 |
| 2025 | Sequence Complementor: Complementing Transformers for Time Series Forecasting with Learnable SequencesabstractSince its introduction, the transformer has shifted the development trajectory away from traditional models (e.g., RNN, MLP) in time series forecasting, which is attributed to its ability to capture global dependencies within temporal tokens. Follow-up studies have largely involved altering the tokenization and self-attention modules to better adapt Transformers for addressing special challenges like non-stationarity, channel-wise dependency, and variable correlation in time series. However, we found that the expressive capability of sequence representation is a key factor influencing Transformer performance in time forecasting after investigating several representative methods, where there is an almost linear relationship between sequence representation entropy and mean square error, with more diverse representations performing better. In this paper, we propose a novel attention mechanism with Sequence Complementors and prove feasible from an information theory perspective, where these learnable sequences are able to provide complementary information beyond current input to feed attention. We further enhance the Sequence Complementors via a diversification loss that is theoretically covered. The empirical evaluation of both long-term and short-term forecasting has confirmed its superiority over the recent state-of-the-art methods. Xiwen Chen, Peijie Qiu, Hao Wang 0176, Aristeidis Sotiras, Yalin Wang 0001, Abolfazl Razi |
AAAI | 5 |
| 2025 | Cracking Instance Jigsaw Puzzles: An Alternative to Multiple Instance Learning for Whole Slide Image AnalysisabstractWhile multiple instance learning (MIL) has shown to be a promising approach for histopathological whole slide image (WSI) analysis, its reliance on permutation invariance significantly limits its capacity to effectively uncover semantic correlations between instances within WSIs. Based on our empirical and theoretical investigations, we argue that approaches that are not permutation-invariant but better capture spatial correlations between instances can offer more effective solutions. In light of these findings, we propose a novel alternative to existing MIL for WSI analysis by learning to restore the order of instances from their randomly shuffled arrangement. We term this task as cracking an instance jigsaw puzzle problem, where semantic correlations between instances are uncovered. To tackle the instance jigsaw puzzles, we propose a novel Siamese network solution, which is theoretically justified by optimal transport theory. We validate the proposed method on WSI classification and survival prediction tasks, where the proposed method outperforms the recent state-of-the-art MIL competitors. The code is available at https://github.com/xiwenc1/MIL-JigsawPuzzles. Xiwen Chen, Peijie Qiu, Hao Wang 0176, Xuanzhao Dong, Yalin Wang 0001, Abolfazl Razi, Aristeidis Sotiras |
ICCV | 4 |
| 2025 | FIC-TSC: Learning Time Series Classification with Fisher Information ConstraintabstractAnalyzing time series data is crucial to a wide spectrum of applications, including economics, online marketplaces, and human healthcare. In particular, time series classification plays an indispensable role in segmenting different phases in stock markets, predicting customer behavior, and classifying worker actions and engagement levels. These aspects contribute significantly to the advancement of automated decision-making and system optimization in real-world applications. However, there is a large consensus that time series data often suffers from domain shifts between training and test sets, which dramatically degrades the classification performance. Despite the success of (reversible) instance normalization in handling the domain shifts for time series regression tasks, its performance in classification is unsatisfactory. In this paper, we propose $\textit{FIC-TSC}$, a training framework for time series classification that leverages Fisher information as the constraint. We theoretically and empirically show this is an efficient and effective solution to guide the model converges toward flatter minima, which enhances its generalizability to distribution shifts. We rigorously evaluate our method on 30 UEA multivariate and 85 UCR univariate datasets. Our empirical results demonstrate the superiority of the proposed method over 14 recent state-of-the-art methods. Xiwen Chen, Peijie Qiu, Hao Wang 0176, Yalin Wang 0001, Aristeidis Sotiras, Abolfazl Razi |
ICML | 4 |
| 2024 | TimeMIL: Advancing Multivariate Time Series Classification via a Time-aware Multiple Instance LearningabstractDeep neural networks, including transformers and convolutional neural networks (CNNs), have significantly improved multivariate time series classification (MTSC). However, these methods often rely on supervised learning, which does not fully account for the sparsity and locality of patterns in time series data (e.g., quantification of diseases-related anomalous points in ECG and abnormal detection in signal). To address this challenge, we formally discuss and reformulate MTSC as a weakly supervised problem, introducing a novel multiple-instance learning (MIL) framework for better localization of patterns of interest and modeling time dependencies within time series. Our novel approach, TimeMIL, formulates the temporal correlation and ordering within a time-aware MIL pooling, leveraging a tokenized transformer with a specialized learnable wavelet positional token. The proposed method surpassed 26 recent state-of-the-art MTSC methods, underscoring the effectiveness of the weakly supervised TimeMIL in MTSC. The code is available https://github.com/xiwenc1/TimeMIL. Xiwen Chen, Peijie Qiu, Hao Wang 0176, Aristeidis Sotiras, Yalin Wang 0001, Abolfazl Razi |
ICML | 5 |
| 2021 | Towards Boosting Channel Attention for Real Image Denoising: Sub-band Pyramid Attention
Haiyu Wu, Xiwen Chen, Hao Wang 0176, Abolfazl Razi |
ICIG (3) | 4 |