activity
20112026
most citedPAC-Learning for Strategic Classification

4 citations · 10 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CC2026

The Head Complexity of Boolean Functions in Single-Layer Attention

Rajmohan Rajaraman, Ravi Sundaram, Amanuel Tesfaye

What can a single layer of self-attention compute? We study head complexity: the minimum number of attention heads required to compute a function in a one-layer attention-only mode…

cs.DS2022★ 3 cited

Online Paging with Heterogeneous Cache Slots

Marek Chrobak, Samuel Haney, Mehraneh Liaee +4

It is natural to generalize the online -Server problem by allowing each request to specify not only a point , but also a subset of servers that may serve it. For uniform…

cs.LG2020★ 4 cited

PAC-Learning for Strategic Classification

Ravi Sundaram, Anil Vullikanti, Haifeng Xu +1

The study of strategic or adversarial manipulation of testing data to fool a classifier has attracted much recent attention. Most previous works have focused on two extreme situati…

cs.LG2020★ 2 cited

Attention improves concentration when learning node embeddings

Matthew Dippel, Adam Kiezun, Tanay Mehta +3

We consider the problem of predicting edges in a graph from node attributes in an e-commerce setting. Specifically, given nodes labelled with search query text, we want to predict…

cs.SI2011★ 1 cited

Prediction Of Arrival Of Nodes In A Scale Free Network

S. M. Vijay Mahantesh, Sudarshan Iyengar, M. Vijesh +2

Most of the networks observed in real life obey power-law degree distribution. It is hypothesized that the emergence of such a degree distribution is due to preferential attachment…