Fetching the paper…
Reading the bibliography…
Unsupervised representation learning approaches aim to learn discriminative feature representations from unlabeled data, without the requirement of annotating every sample.
A. Kolesnikov, X. Zhai, and L. Beyer, “Revisiting self-supervised visual representation learning,” in CVPR . Computer Vision Foundation / IEEE, 2019, pp. 1920–1929
1929
Earlier work this paper cites.
T. W. Liao, “Clustering of time series data - a survey,” Pattern Recognit. , vol. 38, no. 11, pp. 1857–1874, 2005
2005
Earlier work this paper cites.
G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” science , vol. 313, no. 5786, pp. 504–507, 2006
2006
Earlier work this paper cites.
M. Längkvist, L. Karlsson, and A. Loutfi, “A review of unsupervised feature learning and deep learning for time-series modeling,” Pattern Recognit. Lett. , vol. 42, pp. 11–24, 2014
2014
Earlier work this paper cites.
M. Mirza and S. Osindero, “Conditional generative adversarial nets,” CoRR , vol. abs/1411.1784, 2014
2014
Earlier work this paper cites.
A. Hyvärinen and H. Morioka, “Unsupervised feature extraction by time-contrastive learning and nonlinear ICA,” in NIPS , 2016, pp. 3765–3773
2016
Earlier work this paper cites.
J. Xie, R. B. Girshick, and A. Farhadi, “Unsupervised deep embedding for clustering analysis,” in ICML , ser. JMLR Workshop and Conference Proceedings, vol. 48. JMLR.org, 2016, pp. 478–487
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR . IEEE Computer Society, 2016, pp. 770–778
2016
Earlier work this paper cites.
2017
Earlier work this paper cites.
A. J. Bagnall, J. Lines, A. Bostrom, J. Large, and E. J. Keogh, “The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances,” Data Min. Knowl. Discov. , vol. 31, no. 3, pp. 606–660, 2017
2017
Earlier work this paper cites.
A. Fakhrazari and H. Vakilzadian, “A survey on time series data mining,” in EIT . IEEE, 2017, pp. 476–481
2017
Earlier work this paper cites.
P. Malhotra, V. TV, L. Vig, P. Agarwal, and G. Shroff, “Timenet: Pre-trained deep recurrent neural network for time series classification,” in ESANN , 2017
2017
Earlier work this paper cites.
O. L. Hasna and R. Potolea, “Time series - A taxonomy based survey,” in ICCP . IEEE, 2017, pp. 231–238
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein GAN,” CoRR , vol. abs/1701.07875, 2017
2017
Earlier work this paper cites.
G. Katz, C. W. Barrett, D. L. Dill, K. Julian, and M. J. Kochenderfer, “Reluplex: An efficient SMT solver for verifying deep neural networks,” in CAV (1) , ser. Lecture Notes in Computer Science, vol. 10426. Springer, 2017, pp. 97–117
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
M. Caron, P. Bojanowski, A. Joulin, and M. Douze, “Deep clustering for unsupervised learning of visual features,” in ECCV (14) , ser. Lecture Notes in Computer Science, vol. 11218. Springer, 2018, pp. 139–156
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
M. Mehralian and B. Karasfi, “Rdcgan: Unsupervised representation learning with regularized deep convolutional generative adversarial networks,” in 2018 9th Conference on Artificial Intelligence and Robotics and 2nd Asia-Pacific International Symposium , 2018, pp. 31–38
2018
Earlier work this paper cites.
A. Creswell, T. White, V. Dumoulin, K. Arulkumaran, B. Sengupta, and A. A. Bharath, “Generative adversarial networks: An overview,” IEEE Signal Process. Mag. , vol. 35, no. 1, pp. 53–65, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
E. Wong, F. R. Schmidt, J. H. Metzen, and J. Z. Kolter, “Scaling provable adversarial defenses,” in NeurIPS , 2018, pp. 8410–8419
2018
Earlier work this paper cites.
Q. Ma, J. Zheng, S. Li, and G. W. Cottrell, “Learning representations for time series clustering,” in NeurIPS , 2019, pp. 3776–3786
2019
Earlier work this paper cites.
H. I. Fawaz, G. Forestier, J. Weber, L. Idoumghar, and P. Muller, “Deep learning for time series classification: a review,” Data Min. Knowl. Discov. , vol. 33, no. 4, pp. 917–963, 2019
2019
Earlier work this paper cites.
A. Abanda, U. Mori, and J. A. Lozano, “A review on distance based time series classification,” Data Min. Knowl. Discov. , vol. 33, no. 2, pp. 378–412, 2019
2019
Earlier work this paper cites.
J. Franceschi, A. Dieuleveut, and M. Jaggi, “Unsupervised scalable representation learning for multivariate time series,” in NeurIPS , 2019, pp. 4652–4663
2019
Earlier work this paper cites.
J. Yoon, D. Jarrett, and M. van der Schaar, “Time-series generative adversarial networks,” in NeurIPS , 2019, pp. 5509–5519
2019
Earlier work this paper cites.
H. J. Banville, G. Moffat, I. Albuquerque, D. Engemann, A. Hyvärinen, and A. Gramfort, “Self-supervised representation learning from electroencephalography signals,” in MLSP . IEEE, 2019, pp. 1–6
2019
Earlier work this paper cites.
M. S. Sarfraz, V. Sharma, and R. Stiefelhagen, “Efficient parameter-free clustering using first neighbor relations,” in CVPR . Computer Vision Foundation / IEEE, 2019, pp. 8934–8943
2019
Earlier work this paper cites.
Q. Ma, J. Zheng, S. Li, and G. W. Cottrell, “Learning representations for time series clustering,” in NeurIPS , 2019, pp. 3776–3786
2019
Earlier work this paper cites.
J. Donahue and K. Simonyan, “Large scale adversarial representation learning,” in NeurIPS , 2019, pp. 10 541–10 551
2019
Earlier work this paper cites.
D. Li, D. Chen, B. Jin, L. Shi, J. Goh, and S. Ng, “MAD-GAN: multivariate anomaly detection for time series data with generative adversarial networks,” in ICANN (4) , ser. Lecture Notes in Computer Science, vol. 11730. Springer, 2019, pp. 703–716
2019
Earlier work this paper cites.
S. Schneider, A. Baevski, R. Collobert, and M. Auli, “wav2vec: Unsupervised pre-training for speech recognition,” in INTERSPEECH . ISCA, 2019, pp. 3465–3469
2019
Earlier work this paper cites.
E. D. Cubuk, B. Zoph, D. Mané, V. Vasudevan, and Q. V. Le, “Autoaugment: Learning augmentation strategies from data,” in CVPR . Computer Vision Foundation / IEEE, 2019, pp. 113–123
2019
Earlier work this paper cites.
S. Lim, I. Kim, T. Kim, C. Kim, and S. Kim, “Fast autoaugment,” in NeurIPS , 2019, pp. 6662–6672
2019
Earlier work this paper cites.
A. A. Cook, G. Misirli, and Z. Fan, “Anomaly detection for iot time-series data: A survey,” IEEE Internet Things J. , vol. 7, no. 7, pp. 6481–6494, 2020
2020
Earlier work this paper cites.
J. Polge, J. Robert, and Y. L. Traon, “A case driven study of the use of time series classification for flexibility in industry 4.0,” Sensors , vol. 20, no. 24, p. 7273, 2020
2020
Earlier work this paper cites.
O. B. Sezer, M. U. Gudelek, and A. M. Özbayoglu, “Financial time series forecasting with deep learning : A systematic literature review: 2005-2019,” Appl. Soft Comput. , vol. 90, p. 106181, 2020
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
C. Guo, M. Lu, and J. Chen, “An evaluation of time series summary statistics as features for clinical prediction tasks,” BMC Medical Informatics Decis. Mak. , vol. 20, no. 1, p. 48, 2020
2020
Earlier work this paper cites.
A. Gupta, H. P. Gupta, B. Biswas, and T. Dutta, “Approaches and applications of early classification of time series: A review,” IEEE Trans. Artif. Intell. , vol. 1, no. 1, pp. 47–61, 2020
2020
Earlier work this paper cites.
X. Zhan, J. Xie, Z. Liu, Y. Ong, and C. C. Loy, “Online deep clustering for unsupervised representation learning,” in CVPR . Computer Vision Foundation / IEEE, 2020, pp. 6687–6696
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
I. Misra and L. van der Maaten, “Self-supervised learning of pretext-invariant representations,” in CVPR . Computer Vision Foundation / IEEE, 2020, pp. 6706–6716
2020
Earlier work this paper cites.
Q. Xie, M. Luong, E. H. Hovy, and Q. V. Le, “Self-training with noisy student improves imagenet classification,” in CVPR . Computer Vision Foundation / IEEE, 2020, pp. 10 684–10 695
2020
Earlier work this paper cites.
T. Chen, S. Kornblith, M. Norouzi, and G. E. Hinton, “A simple framework for contrastive learning of visual representations,” in ICML , ser. Proceedings of Machine Learning Research, vol. 119. PMLR, 2020, pp. 1597–1607
2020
Earlier work this paper cites.
J. Grill, F. Strub, F. Altché, C. Tallec, P. H. Richemond, E. Buchatskaya, C. Doersch, B. Á. Pires, Z. Guo, M. G. Azar, B. Piot, K. Kavukcuoglu, R. Munos, and M. Valko, “Bootstrap your own latent - A new approach to self-supervised learning,” in NeurIPS , 2020
2020
Earlier work this paper cites.
K. He, H. Fan, Y. Wu, S. Xie, and R. B. Girshick, “Momentum contrast for unsupervised visual representation learning,” in CVPR . Computer Vision Foundation / IEEE, 2020, pp. 9726–9735
2020
Earlier work this paper cites.
T. Wang and P. Isola, “Understanding contrastive representation learning through alignment and uniformity on the hypersphere,” in ICML , ser. Proceedings of Machine Learning Research, vol. 119. PMLR, 2020, pp. 9929–9939
2020
Cited alongside, same era.
T. Chen, S. Kornblith, K. Swersky, M. Norouzi, and G. E. Hinton, “Big self-supervised models are strong semi-supervised learners,” in NeurIPS , 2020
2020
Cited alongside, same era.
M. Caron, I. Misra, J. Mairal, P. Goyal, P. Bojanowski, and A. Joulin, “Unsupervised learning of visual features by contrasting cluster assignments,” in NeurIPS , 2020
2020
Cited alongside, same era.
V. Sharma, M. Tapaswi, M. S. Sarfraz, and R. Stiefelhagen, “Clustering based contrastive learning for improving face representations,” in FG . IEEE, 2020, pp. 109–116
2020
Cited alongside, same era.
T. Gao, X. Yao, and D. Chen, “Simcse: Simple contrastive learning of sentence embeddings,” in EMNLP (1) . Association for Computational Linguistics, 2021, pp. 6894–6910
2021
Later among the works it cites.
B. Sun, B. Li, S. Cai, Y. Yuan, and C. Zhang, “FSCE: few-shot object detection via contrastive proposal encoding,” in CVPR . Computer Vision Foundation / IEEE, 2021, pp. 7352–7362
2021
Later among the works it cites.
C. Liu, Y. Fu, C. Xu, S. Yang, J. Li, C. Wang, and L. Zhang, “Learning a few-shot embedding model with contrastive learning,” in AAAI . AAAI Press, 2021, pp. 8635–8643
2021
Later among the works it cites.
A. Sgueglia, A. D. Sorbo, C. A. Visaggio, and G. Canfora, “A systematic literature review of iot time series anomaly detection solutions,” Future Gener. Comput. Syst. , vol. 134, pp. 170–186, 2022
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Song, L. Liu, M. Liu, W. Wang, X. Wang, and Y. Song, “Representation learning with deconvolution for multivariate time series classification and visualization,” in ICPCSEE (1) , ser. Communications in Computer and Information Science, vol. 1257. Springer, 2020, pp. 310–326
2020
Cited alongside, same era.
S. Shin, K. Song, and I. Moon, “Hierarchically clustered representation learning,” in AAAI . AAAI Press, 2020, pp. 5776–5783
2020
Cited alongside, same era.
C. Zhang, H. Fu, J. Wang, W. Li, X. Cao, and Q. Hu, “Tensorized multi-view subspace representation learning,” Int. J. Comput. Vis. , vol. 128, no. 8, pp. 2344–2361, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2020
Cited alongside, same era.
Y. Tian, C. Sun, B. Poole, D. Krishnan, C. Schmid, and P. Isola, “What makes for good views for contrastive learning?” in NeurIPS , 2020
2020
Cited alongside, same era.
H. I. Fawaz, B. Lucas, G. Forestier, C. Pelletier, D. F. Schmidt, J. Weber, G. I. Webb, L. Idoumghar, P. Muller, and F. Petitjean, “Inceptiontime: Finding alexnet for time series classification,” Data Min. Knowl. Discov. , vol. 34, no. 6, pp. 1936–1962, 2020
2020
Cited alongside, same era.
Y. Jiao and C. Wang, “A blockchain-based trusted upload scheme for the internet of things nodes,” International Journal of Crowd Science , vol. 6, no. 2, pp. 92–97, 2022
2022
Later among the works it cites.
H. Wang, Y. Li, and H. V. Zhao, “Caseload prediction using graphical evolutionary game theory and time series analysis,” International Journal of Crowd Science , vol. 6, no. 3, pp. 142–149, 2022
2022
Later among the works it cites.
S. Rambhatla, Z. Che, and Y. Liu, “I-SEA: importance sampling and expected alignment-based deep distance metric learning for time series analysis and embedding,” in AAAI . AAAI Press, 2022, pp. 8045–8053
2022
Later among the works it cites.
J. Tang, S. Wu, L. Wei, W. Liu, T. Qin, Z. Zhou, and J. Gu, “Energy-efficient sensory data collection based on spatiotemporal correlation in iot networks,” International Journal of Crowd Science , vol. 6, no. 1, pp. 34–43, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
Y. Li, Z. Chen, D. Zha, M. Du, J. Ni, D. Zhang, H. Chen, and X. Hu, “Towards learning disentangled representations for time series,” in KDD . ACM, 2022, pp. 3270–3278
2022
Later among the works it cites.
S. Albelwi, “Survey on self-supervised learning: Auxiliary pretext tasks and contrastive learning methods in imaging,” Entropy , vol. 24, no. 4, p. 551, 2022
2022
Later among the works it cites.
A. Khan, S. AlBarri, and M. A. Manzoor, “Contrastive self-supervised learning: A survey on different architectures,” in ICAI . IEEE, 2022, pp. 1–6
2022
Later among the works it cites.
H. Qian, T. Tian, and C. Miao, “What makes good contrastive learning on small-scale wearable-based tasks?” in KDD . ACM, 2022, pp. 3761–3771
2022
Later among the works it cites.
T. Huynh, S. Kornblith, M. R. Walter, M. Maire, and M. Khademi, “Boosting contrastive self-supervised learning with false negative cancellation,” in WACV . IEEE, 2022, pp. 986–996
2022
Later among the works it cites.
I. R. Dave, R. Gupta, M. N. Rizve, and M. Shah, “TCLR: temporal contrastive learning for video representation,” Comput. Vis. Image Underst. , vol. 219, p. 103406, 2022
2022
Later among the works it cites.
Z. Yue, Y. Wang, J. Duan, T. Yang, C. Huang, Y. Tong, and B. Xu, “Ts2vec: Towards universal representation of time series,” in AAAI . AAAI Press, 2022, pp. 8980–8987
2022
Later among the works it cites.
2022
Later among the works it cites.
Y. Wang, Q. Zhang, Y. Wang, J. Yang, and Z. Lin, “Chaos is a ladder: A new theoretical understanding of contrastive learning via augmentation overlap,” in ICLR . OpenReview.net, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
S. H. Khorasgani, Y. Chen, and F. Shkurti, “SLIC: self-supervised learning with iterative clustering for human action videos,” in CVPR . IEEE, 2022, pp. 16 070–16 080
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
R. Zhang, F. Cheng, and A. Pandey, “Representation learning using a multi-branch transformer for industrial time series anomaly detection,” in KDD 2022 Workshop on Mining and Learning from Time Series – Deep Forecasting: Models, Interpretability, and Applications , 2022
2022
Later among the works it cites.
Y. Chen, X. Zhou, Z. Xing, Z. Liu, and M. Xu, “Cass: A channel-aware self-supervised representation learning framework for multivariate time series classification,” in DASFAA (2) , ser. Lecture Notes in Computer Science, vol. 13246. Springer, 2022, pp. 375–390
2022
Later among the works it cites.
X. Yang, Z. Zhang, and R. Cui, “Timeclr: A self-supervised contrastive learning framework for univariate time series representation,” Knowl. Based Syst. , vol. 245, p. 108606, 2022
2022
Later among the works it cites.
K. Wickstrøm, M. Kampffmeyer, K. Ø. Mikalsen, and R. Jenssen, “Mixing up contrastive learning: Self-supervised representation learning for time series,” Pattern Recognit. Lett. , vol. 155, pp. 54–61, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
A. Pokle, J. Tian, Y. Li, and A. Risteski, “Contrasting the landscape of contrastive and non-contrastive learning,” in AISTATS , ser. Proceedings of Machine Learning Research, vol. 151. PMLR, 2022, pp. 8592–8618
2022
Later among the works it cites.
L. Yang and S. Hong, “Unsupervised time-series representation learning with iterative bilinear temporal-spectral fusion,” in ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 25 038–25 054
2022
Later among the works it cites.
G. Woo, C. Liu, D. Sahoo, A. Kumar, and S. C. H. Hoi, “Cost: Contrastive learning of disentangled seasonal-trend representations for time series forecasting,” in ICLR . OpenReview.net, 2022
2022
Later among the works it cites.
M. T. Nonnenmacher, L. Oldenburg, I. Steinwart, and D. Reeb, “Utilizing expert features for contrastive learning of time-series representations,” in ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 16 969–16 989
2022
Later among the works it cites.
C. Chuang, R. D. Hjelm, X. Wang, V. Vineet, N. Joshi, A. Torralba, S. Jegelka, and Y. Song, “Robust contrastive learning against noisy views,” in CVPR . IEEE, 2022, pp. 16 649–16 660
2022
Later among the works it cites.
H. Wang, X. Guo, Z. Deng, and Y. Lu, “Rethinking minimal sufficient representation in contrastive learning,” in CVPR . IEEE, 2022, pp. 16 020–16 029
2022
Later among the works it cites.
J. T. Ash, S. Goel, A. Krishnamurthy, and D. Misra, “Investigating the role of negatives in contrastive representation learning,” in AISTATS , ser. Proceedings of Machine Learning Research, vol. 151. PMLR, 2022, pp. 7187–7209
2022
Later among the works it cites.
P. Awasthi, N. Dikkala, and P. Kamath, “Do more negative samples necessarily hurt in contrastive learning?” in ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 1101–1116
2022
Later among the works it cites.
Z. Yang, J. Wang, and Y. Zhu, “Few-shot classification with contrastive learning,” in ECCV (20) , ser. Lecture Notes in Computer Science, vol. 13680. Springer, 2022, pp. 293–309
2022
Later among the works it cites.
Z. Wang and W. Liu, “Robustness verification for contrastive learning,” in ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 22 865–22 883
2022
Later among the works it cites.
Y. Xue, K. Whitecross, and B. Mirzasoleiman, “Investigating why contrastive learning benefits robustness against label noise,” in ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 24 851–24 871
2022
Later among the works it cites.
H. Wu, T. Hu, Y. Liu, H. Zhou, J. Wang, and M. Long, “Timesnet: Temporal 2d-variation modeling for general time series analysis,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
W. Huang, M. Yi, X. Zhao, and Z. Jiang, “Towards the generalization of contrastive self-supervised learning,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
2023
Closest in time.
W. Lu, J. Wang, X. Sun, Y. Chen, and X. Xie, “Out-of-distribution representation learning for time series classification,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
X. Zhao, T. Du, Y. Wang, J. Yao, and W. Huang, “Arcl: Enhancing contrastive learning with augmentation-robust representations,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
H. Ling, Z. Jiang, Y. Luo, S. Ji, and N. Zou, “Learning fair graph representations via automated data augmentations,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
X. Wang and G. Qi, “Contrastive learning with stronger augmentations,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 45, no. 5, pp. 5549–5560, 2023
2023
Closest in time.
M. Bosnjak, P. H. Richemond, N. Tomasev, F. Strub, J. C. Walker, F. Hill, L. H. Buesing, R. Pascanu, C. Blundell, and J. Mitrovic, “Semppl: Predicting pseudo-labels for better contrastive representations,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
C. Ge, J. Wang, Z. Tong, S. Chen, Y. Song, and P. Luo, “Soft neighbors are positive supporters in contrastive visual representation learning,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
2023
Closest in time.
Z. Shi, J. Chen, K. Li, J. Raghuram, X. Wu, Y. Liang, and S. Jha, “The trade-off between universality and label efficiency of representations from contrastive learning,” in ICLR . OpenReview.net, 2023
2023
Closest in time.