Finding Order in Chaos: A Novel Data Augmentation Method for Time Series in Contrastive Learning

The success of contrastive learning is well known to be dependent on data augmentation. Although the degree of data augmentations has been well controlled by utilizing pre-defined techniques in some domains like vision, time-series data augmentation is less explored and remains a challenging problem due to the complexity of the data generation mechanism, such as the intricate mechanism involved in the cardiovascular system. Moreover, there is no widely recognized and general time-series augmentation method that can be applied across different tasks. In this paper, we propose a novel data augmentation method for quasi-periodic time-series tasks that aims to connect intra-class samples together, and thereby find order in the latent space. Our method builds upon the well-known mixup technique by incorporating a novel approach that accounts for the periodic nature of non-stationary time-series. Also, by controlling the degree of chaos created by data augmentation, our method leads to improved feature representations and performance on downstream tasks. We evaluate our proposed method on three time-series tasks, including heart rate estimation, human activity recognition, and cardiovascular disease detection. Extensive experiments against state-of-the-art methods show that the proposed approach outperforms prior works on optimal data generation and known data augmentation techniques in the three tasks, reflecting the effectiveness of the presented method. Source code: https://github.com/eth-siplab/Finding_Order_in_Chaos

Paper

References (86)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer CSD85/10 · confidence 5/52023-07-03

Summary

This paper presents a new time series augmentation method which adopts Mixup on the amplitude and phase, respectively, after transforming the time series in the frequency domain, thus avoiding the destructive extrapolation from linear Mixup.

Strengths

1. The authors propose a novel mixup method in the frequency domain for time series, avoiding the destructive extrapolation resulting from linear Mixup. 2. The theoretical proof is complete and has some reference value.

Weaknesses

1. It is unclear whether it works when considering amplitude or phase alone for Mixup. The relevant ablation experiments must be performed consistently with the parameter settings of the original method. 2. Lack of convincing examples. For example, to illustrate the problem, perform Mixup on two samples where the frequency domain information in both samples that are strongly correlated with I(x,y) exactly cancels each other and shows whether the newly generated samples have specific frequency domain information that can be identified. 3. The paper's content does not explain how to "Find Order in Chaos" mentioned in the title and how the "chaos" is reflected. And I'm confused about how the so-called "control the degree of chaos" proposed by the authors is done. 4. Assumption 2.1 is too idealistic. The label information of time series is not only related to the time domain but also the frequency domain, and focusing on the frequency domain information only does not achieve the classification well.

Questions

1. The ablation experiments considering amplitude or phase alone for mixup need to be performed consistently with the parameter settings of the original method. 2. Please give practical examples of how Mixup may corrupt the frequency domain information used to discriminate the generated samples. 3. It is not clear how the so-called "control the degree of chaos" proposed by the authors is done. 4. For data augmentation of time series, why does this paper choose to perform augmentation in the frequency domain instead of the time domain? In general, it is difficult to use only frequency domain information for classification over the time domain for time series classification tasks [1]. In contrast, the combination of time and frequency domain information can effectively improve the model's classification performance [2]. 5. What are the advantages of performing data augmentation in the frequency domain instead of doing data augmentation in the time domain of time series data? 6. Why are eight datasets chosen for experiments in this paper? Its inconsistency with existing benchmark datasets for time series prediction [3,4,5], classification [6,7] and anomaly detection [8] tasks. In addition, the comparison methods in this paper do not include benchmark methods in the time series domain. For example, benchmark methods for time series prediction include Informer [3], CoST [4], and FEDFormer [5], etc., time series classification methods include OS-CNN [6] and DSN [7], etc., and time series anomaly detection includes Anomaly Transformer [8], etc. [1] Cross reconstruction transformer for self-supervised time series representation learning. arXiv, 2022. [2] Self-Supervised Contrastive Pre-Training for Time Series via Time-Frequency Consistency. NeurIPS, 2022. [3] Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting. AAAI, 2021. [4] CoST: Contrastive Learning of Disentangled Seasonal-Trend Representations for Time Series Forecasting. ICLR, 2022. [5] FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting. ICML, 2022. [6] Omni-Scale CNNs: a simple and effective kernel size configuration for time series classification. ICLR, 2022. [7] Dynamic Sparse Network for Time Series Classification: Learning What to "See". NeurIPS, 2022. [8] Anomaly Transformer: Time Series Anomaly Detection with Association Discrepancy. ICLR, 2022.

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

5: You are absolutely certain about your assessment. You are very familiar with the related work and checked the math/other details carefully.

Soundness

3 good

Presentation

2 fair

Contribution

3 good

Limitations

The authors did not mention the limitations. I do not have any comments on this point.

Reviewer JMVG8/10 · confidence 3/52023-07-04

Summary

This paper proposes a novel mixup method for non-stationary time-series data to generate positive samples for the contrastive learning formulation. The proposed method mixes the magnitude and phase of each frequency component of two samples that are close in the latent space of a variational autoencoder. The authors prove that the mixup process in the frequency domain does not cause the loss of information while it generates diverse samples. The paper provides an extensive empirical evaluation to show that the proposed method learns better representations than existing contrastive learning baselines on eight time series datasets from three tasks.

Strengths

The paper studies an important and under-explored problem. Although contrastive learning is proven to work well on images, its performance on time series is yet limited due to the lack of good time series augmentations. While many existing work tries to find the good time series augmentations through extensive empirical studies, this paper proposes a theoretically well-grounded mix-up method for time series augmentation. Moreover, the empirical evaluation is also extensive and convincing.

Weaknesses

1. The hyperlinks of the citations and the references are missed. 2. I don't find where $x^*$ is defined. 3. It would be great if there is an algorithm box explaining the whole process of drawing samples, computing the degree of the augmentation, performing the mixup, and then training.

Questions

1. How do you select $\beta$? Would a very large (close to 1) $\beta$ limit the diversity of the augmented samples? 2. What does the instance selection (line 268) mean exactly?

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

4 excellent

Presentation

3 good

Contribution

4 excellent

Limitations

Yes

Reviewer hEg34/10 · confidence 4/52023-07-06

Summary

This paper is about a novel data augmentation method that can be used in contrastive learning for time-series tasks and aims to connect intra-class samples together, and find order in the latent space. The proposed method builds upon the mixup data augmentation technique by controlling the degree of chaos created by data augmentation. More specifically, the augmentation method considers the phase and the amplitude information as two separate features and then generates positive samples by controlling the mixup coefficients for each feature for each randomly chosen pair. This process helps to generate features that enhance intra-class similarity and help contrastive learning to learn class separated representations. The proposed method is evaluated using three time-series tasks: heart rate estimation, human activity recognition and cardiovascular disease detection and against state of the art comparison methods.

Strengths

- The paper is about an interesting topic, contrastive learning in time-series. - The proposed methodology is based on the idea of controlling the degree of chaos created by data augmentation methods. These ideas can be applied in the augmentation part of contrastive learning for other domain as well. - The proposed methodology shows improvement in the performance over ten comparison methods on three tasks and eight datasets. Some time-series contrastive learning methods are missing from the comparison though.

Weaknesses

- The writing in the paper can be improved. The Method and Results and Discussion sections need some organization, adding subsections will help with the structure. - The proposed method has incremental novelty. This method builds on top of known components. The writing needs improvements to make the contributions of this paper more clear. - The experimental setup also seems to be missing some important state of the art. No time-series specific contrastive learning method is included in the experiments for comparison. - The proposed methodology seems to have similarities with TS-TCC [80] and TFC [22] (the reference numbers align with the ones in the main paper) and since these are state of the art in contrastive learning for time-series, they should be part of the comparison methods. - A comparison of the methodology of the proposed method with [22] and [80] is needed as these paper are around the same ideas. What is different in the contributions of the proposed method? - Dataset statistics are missing from the Results and Discussion section. Adding them in a table helps with the understanding of the results.

Questions

My main concerns are regarding the readability of the paper and improvements in the structure of the paper, and the experimental setup that is missing time-series contrastive learning models. The results and the discussion will be more convincing and the performance difference more important if the author include the results of some other methods, like [22] and [80]. A comparison of the methodology and the concepts of the proposed method with [22] and [80] is needed as these paper are around the same ideas. What is different in the contributions of the proposed method?

Rating

4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

There are no limitations or negative societal impact from this work. The datasets used in the paper are all publicly available.

Reviewer JK7u4/10 · confidence 4/52023-07-08

Summary

This paper explores data augmentation for contrastive learning that better aligns with the nature of time series. Specifically, they tailor the mix-up method separately to amplitude and phase in the frequency domain. A theoretical analysis illustrates how the method enhances task-specific information, contrasting it to the linear mix-up method which potentially discards task-specific information. Experiments on time-series from three domains also demonstrated the advantages compared with previous mix-up and contrastive learning methods.

Strengths

1. This paper studies an important problem of designing augmentation for contrastive learning that adapts to the non-stationarity of time series. 2. The paper presents theoretical analysis of the benefits of proposed mix-up method compared with vanilla linear mix-up method. 3. The paper shows better performance on time-series datasets of multiple domains.

Weaknesses

**Lack of baseline comparisons**: The paper compares with a list of mix-up methods and contrastive learning methods, and the authors also incorporate time-series augmentation methods into the framework in appendix. However, it would also be interesting to have (1) some direct comparisons with existing time-series augmentation methods, e.g., [1, 2] (both have mix-up augmentation in the time or frequency domain). (2) Contrastive learning methods dedicated for time-series domain [3, 4, 5, 6] (I am curious why [4] is not one of the baselines in experiments?) [1] FrAug: Frequency Domain Augmentation for Time Series Forecasting [2] Towards Diverse and Coherent Augmentation for Time-Series Forecasting [3] CoST: Contrastive Learning of Disentangled Seasonal-Trend Representations for Time Series Forecasting [4] Self-supervised contrastive pre-training for time series via time-frequency consistency [5] Unsupervised Representation Learning for Time Series with Temporal Neighborhood Coding [6] TS2Vec: Towards Universal Representation of Time Series **Experimental analysis**: Why linear mix-up method performs well in activity recognition task? Is there any difference in the setting of activity recognition compared with the other two tasks? **Writing**: 1. Consider defining notations of x, \tilde{x}, x^* before or in Proposition 2.3. 2. The title metions "order" and "chaos"; hence, a detailed explanation of these terms, as well as how the proposed method comprehensively accounts for the "non-stationarity" of time series, would be beneficial.

Questions

See weakness above.

Rating

4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

The paper did not explicitly discuss their limitations. Some comments and questions regarding limitations of the work are discussed in the weakness and question parts above.

Reviewer CSD82023-08-18

Thank you for your response. Most of my questions have been resolved. However, I still have some concerns. The examples provided by the authors are mainly focused on evident frequency features, such as electrocardiogram recordings. Nevertheless, time series in the real world also encompasses situations where frequency features are not as apparent,e.g., AllGestureWiimotex, MelbournePedestrian, and GestureMidAirD3 in UCR dataset.

Authorsrebuttal2023-08-19

Thanks for your response!

We thank the reviewer for the response but we want to highlight some points. In this paper, we showed a problem of mixup in quasi-periodic time-series data through both theoretical and empirical means. Then, we proposed a method that solves this problem and presented our results with 8 datasets and 14 baselines (previous data augmentation methods and several mixup techniques) where our method outperforms baselines in 7 datasets and ranks second in the other dataset. We provided examples where the data is mainly quasi-periodic (activity, cardiovascular, etc.) as we solve a problem directly related to that. There are hundreds of time-series data with different characteristics, we hoped that the reviewers would anticipate that and appreciate the contribution to the field of quasi-periodic signals. Also, we believe that the time series we demonstrate the performance of our method is of huge importance to the field of ML and health such as electrocardiograms, which make the contribution of this work valuable. Thank you once again for joining the discussion section.

Reviewer JMVG2023-08-19

Thank you for addressing my concerns. I maintain my initial recommendation to support the acceptance of the paper. The paper presents a novel time series augmentation approach with applicability across multiple popular contrastive learning frameworks. While the experiments do not encompass some benchmark datasets, the evaluation results across eight datasets unequivocally demonstrate the effectiveness of the proposed method.

Authorsrebuttal2023-08-19

Thanks!

We are glad to hear our contribution to the field is appreciated. Thank you once again for your time and appreciation of our work.

Reviewer JK7u2023-08-19

Thank the authors for the responses and additional experiments. After reading the rebuttal, I still have a few questions. 1. The authors said "But,as they emphasize different frequency components via random weights, its performance is quite low compared to ours (as can be seen from the submitted single-page pdf)", but I don't see the results of reference [2] in the pdf. 2. I understand that this paper emphasizes improved mix-up methods in contrastive learning for quasi-periodic time-series data, but that does not stand as a valid point for excluding comparison with other types of contrastive learning frameworks. Users are in search for better contrastive learning methods, regardless of the underlying frameworks. If the comparison has to be limited to other augmentation methods, it would be better to generalize the scope to broader settings beyond contrastive learning (e.g., supervised classification and forecasting), and show the merits of the proposed augmentation in general.

Reviewer hEg32023-08-22

Thank you for your response. After reading the other reviews and the rebuttal responses, I understand that the focus of this work is the data augmentation aspect and not a new contrastive learning model (and that was my understanding from the beginning), but I believe that in order to compare the proposed data augmentation strategy it is crucial to try it with the other state of the art contrastive learning models. It is very useful, that the readers who read this paper, would have an idea of what works best with this augmentation strategy and what does not. Also, since the focus of this work is the data augmentation strategy, it would be interesting to check how it works in all domains of supervised, self-supervised and unsupervised learning. Finally, one of the main reasons that we discuss about the focus of this work (data augmentation strategy vs. contrastive learning model) is the way the authors present their findings. Instead of using the names of the contrastive learning models, they could use the same contrastive learning model and only change the augmentation strategies. Then, they can present for example, the comparison of the methods not by using the names of the contrastive learning models, but instead by using the names of the data augmentation strategies. And they could also add one table with the data augmentation strategies in the state of the art and the corresponding models that those have been used in (i.e., table with two columns, one is model's name, one is augmentation strategy description). Overall, I do believe that this paper will make a stronger impact if both a comparison for the data augmentation strategies and the contrastive learning models will be included, as this is one of the mechanisms that researchers use the data augmentations to learn the time-series representations. As a result, I will keep my initial score as I am not fully convinced about the current state of the experimental setup.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC