Fetching the paper…
Reading the bibliography…
We study semantic compression for text where meanings contained in the text are conveyed to a source decoder, e.g., for classification.
C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal , vol. 27, pp. 379–423, 625–656, July, Oct. 1948
1948
Earlier work this paper cites.
B. J. Frey and D. Dueck, “Clustering by passing messages between data points,” Science , vol. 315, no. 5814, pp. 972–976, 2007
2007
Earlier work this paper cites.
A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts, “Learning word vectors for sentiment analysis,” in Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies . Portland, Oregon, USA: Association for Computational Linguistics, June 2011, pp. 142–150
2011
Earlier work this paper cites.
B. Guler, A. Yener, and P. Basu, “A study of semantic data compression,” in 2013 IEEE Global Conference on Signal and Information Processing , 2013, pp. 887–890
2013
Earlier work this paper cites.
B. Guler and A. Yener, “Semantic index assignment,” in IEEE Int. Conf. on Pervasive Comp. and Comm. Workshops (PerCom) , 2014, pp. 431–436
2014
Earlier work this paper cites.
F. Schroff, D. Kalenichenko, and J. Philbin, “Facenet: A unified embedding for face recognition and clustering,” in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2015, pp. 815–823
2015
Earlier work this paper cites.
X. Zhang, J. Zhao, and Y. LeCun, “Character-level convolutional networks for text classification,” in Advances in Neural Information Processing Systems , C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, Eds., vol. 28. Curran Associates, Inc., 2015
2015
Cited alongside, same era.
B. Guler, A. Yener, P. Basu, and A. Swami, “Two-party zero-error function computation with asymmetric priors,” Entropy , vol. 19, no. 12, 2017
2017
Cited alongside, same era.
T. O’Shea and J. Hoydis, “An introduction to deep learning for the physical layer,” IEEE Transactions on Cognitive Communications and Networking , vol. 3, no. 4, pp. 563–575, 2017
2017
Cited alongside, same era.
B. Güler, A. Yener, and A. Swami, “The semantic communication game,” IEEE Transactions on Cognitive Communications and Networking , vol. 4, no. 4, pp. 787–802, 2018
2018
Cited alongside, same era.
J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova, “BERT: Pre-training of deep bidirectional transformers for language understanding,” in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics . Minneapolis, Minnesota: Association for Computational Linguistics, Jun. 2019, pp. 4171–4186
2019
Later among the works it cites.
2020
Later among the works it cites.
W. Jiang, B. Han, M. A. Habibi, and H. D. Schotten, “The road towards 6g: A comprehensive survey,” IEEE Open Journal of the Communications Society , vol. 2, pp. 334–366, 2021
2021
Later among the works it cites.
H. Xie, Z. Qin, G. Y. Li, and B.-H. Juang, “Deep learning enabled semantic communication systems,” IEEE Transactions on Signal Processing , vol. 69, pp. 2663–2675, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. McInnes, J. Healy, and J. Melville, “UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction,” ArXiv e-prints , Feb. 2018
2018
Cited alongside, same era.
N. Reimers and I. Gurevych, “Sentence-bert: Sentence embeddings using siamese bert-networks,” in Proceedings of the 2019 Conference on Empirical Methods in NLP . Association for Computational Linguistics, 11 2019
2019
Cited alongside, same era.
“6g and beyond.” [Online]. Available: https://6gandbeyond.osu.edu/
Cited in the paper.
D. Gündüz, Z. Qin, I. E. Aguerri, H. S. Dhillon, Z. Yang, A. Yener, K. K. Wong, and C.-B. Chae, “Beyond transmitting bits: Context, semantics, and task-oriented communications,” IEEE Journal on Selected Areas in Communications , vol. 41, no. 1, pp. 5–41, 2023
2023
Closest in time.