activity
20182025
most citedThe Longest-Chain Protocol Under Random Delays

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

collaborators

10 papers

cs.IR2025

Ranking Items from Discrete Ratings: The Cost of Unknown User Thresholds

Oscar Villemaud, Suryanarayana Sankagiri, Matthias Grossglauser

Ranking items is a central task in many information retrieval and recommender systems. User input for the ranking task often comes in the form of ratings on a coarse discrete scale…

cs.LG2025

Recycling History: Efficient Recommendations from Contextual Dueling Bandits

Suryanarayana Sankagiri, Jalal Etesami, Pouria Fatemi +1

The contextual duelling bandit problem models adaptive recommender systems, where the algorithm presents a set of items to the user, and the user's choice reveals their preference.…

cs.LG2025

Measuring IIA Violations in Similarity Choices with Bayesian Models

Hugo Sales Corrêa, Suryanarayana Sankagiri, Daniel Ratton Figueiredo +1

Similarity choice data occur when humans make choices among alternatives based on their similarity to a target, e.g., in the context of information retrieval and in embedding learn…

cs.NI2025

Pricing for Routing and Flow-Control in Payment Channel Networks

Suryanarayana Sankagiri, Bruce Hajek

A payment channel network is a blockchain-based overlay mechanism that allows parties to transact more efficiently than directly using the blockchain. These networks are composed o…

cs.LG2025

Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization

Suryanarayana Sankagiri, Jalal Etesami, Matthias Grossglauser

This paper provides a theoretical analysis of a new learning problem for recommender systems where users provide feedback by comparing pairs of items instead of rating them individ…

cs.CR2022

Blockchain Security when Messages are Lost

Taha Ameen, Suryanarayana Sankagiri, Bruce Hajek

Security analyses for consensus protocols in blockchain research have primarily focused on the synchronous model, where point-to-point communication delays are upper bounded by a k…