← Search

Tao Yao

5 accepted papers

2026

SimDiff: Simpler Yet Better Diffusion Model for Time Series Point Forecasting

AAAI 2026technical

Diffusion models have recently shown promise in time series forecasting, particularly for probabilistic predictions. However, they often fail to achieve state-of-the-art point estimation performance compared to regression-based methods. This limitation stems from difficulties in providing sufficient

Cited by 0SourcePDFScholar
2025

MISA: Memory-Efficient LLMs Optimization with Module-wise Importance Sampling

NeurIPS 2025poster

The substantial memory demands of pre-training and fine-tuning large language models (LLMs) require memory-efficient optimization algorithms. One promising approach is layer-wise optimization, which treats each transformer block as a single layer and optimizes it sequentially, while freezing the oth…

Cited by 0SourceScholar
2022

FiLM: Frequency improved Legendre Memory Model for Long-term Time Series Forecasting

NeurIPS 2022accept

Recent studies have shown that deep learning models such as RNNs and Transformers have brought significant performance gains for long-term forecasting of time series because they effectively utilize historical information. We found, however, that there is still great room for improvement in how to p…

2022

Tracking Fast Trajectories with a Deformable Object using a Learned Model

ICRA 2022poster

We propose a method for robotic control of deformable objects using a learned nonlinear dynamics model. After collecting a dataset of trajectories from the real system, we train a recurrent neural network (RNN) to approximate its input-output behavior with a latent state-space model. The RNN interna…

Cited by 12SourceScholar
2018

Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Covariates

ICML 2018oral

In this paper, we propose a Minimax Concave Penalized Multi-Armed Bandit (MCP-Bandit) algorithm for a decision-maker facing high-dimensional data with latent sparse structure in an online learning and decision-making process. We demonstrate that the MCP-Bandit algorithm asymptotically achieves the o…

Cited by 59SourcePDFScholar