AI RESEARCH
Linear-Time and Constant-Memory Text Embeddings Based on Recurrent Language Models
arXiv CS.CL
•
ArXi:2604.18199v1 Announce Type: new Transformer-based embedding models suffer from quadratic computational and linear memory complexity, limiting their utility for long sequences. We propose recurrent architectures as an efficient alternative,