1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.LG2021★ 1 cited
Beyond Nyströmformer -- Approximation of self-attention by Spectral Shifting
Madhusudan Verma
Transformer is a powerful tool for many natural language tasks which is based on self-attention, a mechanism that encodes the dependence of other tokens on each specific token, but…
cs.LG2020★ 1 cited
Revisiting Linformer with a modified self-attention with linear complexity
Madhusudan Verma
Although Transformer models such as Google's BERT and OpenAI's GPT-3 are successful in many natural language processing tasks, training and deploying these models are costly and in…
cs.DS2019
5/4 approximation for Symmetric TSP
Alok Chauhan, Madhusudan Verma
Travelling Salesman Problem (TSP) is one of the unsolved problems in computer science. TSP is NP Hard. Till now the best approximation ratio found for symmetric TSP is three by two…