7 papers
TailedTS: Benchmark Dataset for Heavy-Tailed Time Series Prediction and Periodicity Quantification
Xinyu Chen, HanQin Cai, Lijun Ding +1
We present TailedTS, a large-scale benchmark dataset derived from Wikipedia hourly page view observations throughout 2024, specifically designed to test time series forecasting mod…
Memory Efficient Full-gradient Attacks (MEFA) Framework for Adversarial Defense Evaluations
Yuan Du, Mitchel Hill, HanQin Cai
This work studies the robust evaluation of iterative stochastic purification defenses under white-box adversarial attacks. Our key technical insight is that gradient checkpointing…
Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
Chandler Smith, HanQin Cai, Abiy Tasissa
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a bro…
Recovering Wasserstein Distance Matrices from Few Measurements
Muhammad Rana, Abiy Tasissa, HanQin Cai +2
This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddin…
A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
Euclidean Distance Matrix (EDM), which consists of pairwise squared Euclidean distances of a given point configuration, finds many applications in modern machine learning. This pap…
Structured Sampling for Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
This paper addresses the problem of estimating the positions of points from distance measurements corrupted by sparse outliers. Specifically, we consider a setting with two types o…