Publications

• 1
  Testing $k$-submodularity

  Haris, Palit

  RANDOM 2026 arXiv
• 2
  Efficient Algorithms for Influence Maximization in General Models and Observed Cascades

  Spaeh, Haris, Nguyen, Ene

  IJCAI 2026 arXiv
• 3
  Layerwise Dynamics for In-Context Classification in Transformers

  Lutz, Haris, Chandra, Gangrade, Saligrama

  We show how Transformers geometrically separate classes layer-by-layer during in-context learning.

  ICML 2026 ★ Spotlight arXiv
• 4
  Noise Stability of Transformer Models

  Haris, Zhang, Yoshida

  We introduce noise stability to measure model simplicity and accelerate Transformer training and grokking.

  ICLR 2026 arXiv
• 5
  Fast-MWEM: Private Data Release in Sublinear Time

  Haris, Choi, Laksanawisit

  TPDP 2026 arXiv
• 6
  Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search

  Andoni, Haris, Kelman, Onak

  NeurIPS 2025 Workshop arXiv

  • NeurIPS 2025 Workshop: Reliable ML from Unreliable Data
  • WoLA 2026 Poster
• 7
  Estimating Hitting Times Locally At Scale

  Haris, Spaeh, Dragazis, Tsourakakis

  NeurIPS 2025 arXiv
• 8
  Compression Barriers for Autoregressive Transformers

  Haris, Onak

  We prove fundamental limits on KV cache compression, showing when sublinear memory is impossible.

  COLT 2025 arXiv
• 9
  $k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers

  Haris

  We provide the first theoretical guarantees and fast sub-quadratic algorithms for $k$NN attention.

  ICLR 2025 arXiv
• 10
  Counting Simplices in Hypergraph Streams

  Chakrabarti, Haris

  ESA 2022 arXiv
• 11
  Teaching American Sign Language in Mixed Reality

  Shao, Sniffen, Blanchet, Hillis, Shi, Haris, Liu, Lamberton, Malzkuhn, Quandt, Mahoney, Kraemer, Zhou, Balcom

  IMWUT / UbiComp Paper