4 citations · 4 across the 8 of their papers we have counts for
10 papers
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…
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.…
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…
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…
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…
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…
The Longest-Chain Protocol Under Random Delays
Suryanarayana Sankagiri, Shreyas Gandlur, Bruce Hajek
In the field of distributed consensus and blockchains, the synchronous communication model assumes that all messages between honest parties are delayed at most by a known constant…
Blockchain CAP Theorem Allows User-Dependent Adaptivity and Finality
Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan +1
Longest-chain blockchain protocols, such as Bitcoin, guarantee liveness even when the number of actively participating users is variable, i.e., they are adaptive. However, they are…
Preferential Attachment Graphs with Planted Communities
Bruce Hajek, Suryanarayana Sankagiri
A variation of the preferential attachment random graph model of Barabási and Albert is defined that incorporates planted communities. The graph is built progressively, with new ve…
Community Recovery in a Preferential Attachment Graph
Bruce Hajek, Suryanarayana Sankagiri
A message passing algorithm is derived for recovering communities within a graph generated by a variation of the Barabási-Albert preferential attachment model. The estimator is ass…