Yao‐Wei Huang

LG
h-index39
3papers
10citations
Novelty43%
AI Score37

3 Papers

16.1SIMay 21
Fostering cultural change in research through innovative knowledge sharing, evaluation, and community engagement strategies

Junsuk Rho, Jinn-Kong Sheu, Andrew Forbes et al.

Scientific research needs a system that better values rigorous, reusable contributions. Although open knowledge and FAIR (findable, accessible, interoperable, and reusable) principles, along with coalitions and infrastructures, are accelerating reform, evaluation still often defaults to standardized metrics such as the h-index and journal impact factor. This misalignment still incentivizes quantity over quality, undermining integrity and reproducibility, and making it harder for communities to learn from and build on existing work. In this perspective, we bring together a global community of researchers, funding institutions, industrial partners, and publishers from 14 different countries across the 5 continents to advance ongoing debates on open science and research evaluation. Our contribution to the research practice is to offer an integrative conceptual framework, an open knowledge system, that links knowledge production, validation, assessment, and reuse into a single ecosystem view, and to translate into practical recommendations across key stakeholder roles (researchers, institutions/evaluators, funders, and publishers). By shifting attention from papers and bibliometrics toward reusable knowledge contributions and their validation, the framework highlights concrete levers for cultural change (what to share, when/how to validate, how to support reuse, and what to reward) and offers a practical lens that stakeholders can use to diagnose misaligned incentives and to design reforms that make high-quality, cumulative contributions visible and valued.

3.8LGSep 16, 2023
Test-Time Compensated Representation Learning for Extreme Traffic Forecasting

Zhiwei Zhang, Weizhong Zhang, Yaowei Huang et al.

Traffic forecasting is a challenging task due to the complex spatio-temporal correlations among traffic series. In this paper, we identify an underexplored problem in multivariate traffic series prediction: extreme events. Road congestion and rush hours can result in low correlation in vehicle speeds at various intersections during adjacent time periods. Existing methods generally predict future series based on recent observations and entirely discard training data during the testing phase, rendering them unreliable for forecasting highly nonlinear multivariate time series. To tackle this issue, we propose a test-time compensated representation learning framework comprising a spatio-temporal decomposed data bank and a multi-head spatial transformer model (CompFormer). The former component explicitly separates all training data along the temporal dimension according to periodicity characteristics, while the latter component establishes a connection between recent observations and historical series in the data bank through a spatial attention matrix. This enables the CompFormer to transfer robust features to overcome anomalous events while using fewer computational resources. Our modules can be flexibly integrated with existing forecasting methods through end-to-end training, and we demonstrate their effectiveness on the METR-LA and PEMS-BAY benchmarks. Extensive experimental results show that our method is particularly important in extreme events, and can achieve significant improvements over six strong baselines, with an overall improvement of up to 28.2%.

5.8LGOct 3, 2020
CorrAttack: Black-box Adversarial Attack with Structured Search

Zhichao Huang, Yaowei Huang, Tong Zhang

We present a new method for score-based adversarial attack, where the attacker queries the loss-oracle of the target model. Our method employs a parameterized search space with a structure that captures the relationship of the gradient of the loss function. We show that searching over the structured space can be approximated by a time-varying contextual bandits problem, where the attacker takes feature of the associated arm to make modifications of the input, and receives an immediate reward as the reduction of the loss function. The time-varying contextual bandits problem can then be solved by a Bayesian optimization procedure, which can take advantage of the features of the structured action space. The experiments on ImageNet and the Google Cloud Vision API demonstrate that the proposed method achieves the state of the art success rates and query efficiencies for both undefended and defended models.