Search Results for author: Anthony K. H. Tung

Found 10 papers, 4 papers with code

Towards Controllable Time Series Generation

no code implementations6 Mar 2024 Yifan Bao, Yihao Ang, Qiang Huang, Anthony K. H. Tung, Zhiyong Huang

This underscores its adeptness in seamlessly integrating latent features with external conditions.

Time Series Time Series Generation

Diversity-Aware $k$-Maximum Inner Product Search Revisited

no code implementations21 Feb 2024 Qiang Huang, Yanhao Wang, Yiqun Sun, Anthony K. H. Tung

To bridge this gap, we revisit and refine the diversity-aware $k$MIPS (D$k$MIPS) problem by incorporating two well-known diversity objectives -- minimizing the average and maximum pairwise item similarities within the results -- into the original relevance objective.

Recommendation Systems

From Zero to Hero: Detecting Leaked Data through Synthetic Data Injection and Model Querying

no code implementations6 Oct 2023 Biao Wu, Qiang Huang, Anthony K. H. Tung

In this paper, we concentrate on the domain of tabular data and introduce a novel methodology, Local Distribution Shifting Synthesis (\textsc{LDSS}), to detect leaked data that are used to train classification models.

TSGBench: Time Series Generation Benchmark

1 code implementation7 Sep 2023 Yihao Ang, Qiang Huang, Yifan Bao, Anthony K. H. Tung, Zhiyong Huang

Synthetic Time Series Generation (TSG) is crucial in a range of applications, including data augmentation, anomaly detection, and privacy preservation.

Anomaly Detection Data Augmentation +3

Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search

1 code implementation21 Feb 2023 Qiang Huang, Anthony K. H. Tung

Finding the nearest neighbor to a hyperplane (or Point-to-Hyperplane Nearest Neighbor Search, simply P2HNNS) is a new and challenging problem with applications in many research domains.

SAH: Shifting-aware Asymmetric Hashing for Reverse $k$-Maximum Inner Product Search

1 code implementation23 Nov 2022 Qiang Huang, Yanhao Wang, Anthony K. H. Tung

To speed up the Maximum Inner Product Search (MIPS) on item vectors, we design a shifting-invariant asymmetric transformation and develop a novel sublinear-time Shifting-Aware Asymmetric Locality Sensitive Hashing (SA-ALSH) scheme.

Blocking

Modeling Spatial Nonstationarity via Deformable Convolutions for Deep Traffic Flow Prediction

no code implementations8 Jan 2021 Wei Zeng, Chengqiao Lin, Kang Liu, Juncong Lin, Anthony K. H. Tung

Furthermore, to better fit with convolutions, we suggest to first aggregate traffic flows according to pre-conceived regions or self-organized regions based on traffic flows, then dispose to sequentially organized raster images for network input.

Traffic Prediction

Robust Federated Recommendation System

no code implementations15 Jun 2020 Chen Chen, Jingfeng Zhang, Anthony K. H. Tung, Mohan Kankanhalli, Gang Chen

We argue that the key to Byzantine detection is monitoring of gradients of the model parameters of clients.

Recommendation Systems

Do Multi-Hop Question Answering Systems Know How to Answer the Single-Hop Sub-Questions?

no code implementations EACL 2021 Yixuan Tang, Hwee Tou Ng, Anthony K. H. Tung

Multi-hop question answering (QA) requires a model to retrieve and integrate information from different parts of a long text to answer a question.

Multi-hop Question Answering Question Answering

A Generic Inverted Index Framework for Similarity Search on the GPU - Technical Report

1 code implementation28 Mar 2016 Jingbo Zhou, Qi Guo, H. V. Jagadish, Luboš Krčál, Siyuan Liu, Wenhao Luan, Anthony K. H. Tung, Yueji Yang, Yuxin Zheng

We propose a novel generic inverted index framework on the GPU (called GENIE), aiming to reduce the programming complexity of the GPU for parallel similarity search of different data types.

Cannot find the paper you are looking for? You can Submit a new open access paper.