120 citations · 213 across the 7 of their papers we have counts for
9 papers
Constitutional Classifiers: Defending against Universal Jailbreaks across Thousands of Hours of Red Teaming
Mrinank Sharma, Meg Tong, Jesse Mu +40
Large language models (LLMs) are vulnerable to universal jailbreaks-prompting strategies that systematically bypass model safeguards and enable users to carry out harmful processes…
Approximate Personalized PageRank on Dynamic Graphs
Hongyang Zhang, Peter Lofgren, Ashish Goel
We propose and analyze two algorithms for maintaining approximate Personalized PageRank (PPR) vectors on a dynamic graph, where edges are added or deleted. Our algorithms are natur…
Efficient Algorithms for Personalized PageRank
Peter Lofgren
We present new, more efficient algorithms for estimating random walk scores such as Personalized PageRank from a given source node to one or several target nodes. These scores are…
Bidirectional PageRank Estimation: From Average-Case to Worst-Case
Peter Lofgren, Siddhartha Banerjee, Ashish Goel
We present a new algorithm for estimating the Personalized PageRank (PPR) between a source and target node on undirected graphs, with sublinear running-time guarantees over the wor…
Personalized PageRank Estimation and Search: A Bidirectional Approach
Peter Lofgren, Siddhartha Banerjee, Ashish Goel
We present new algorithms for Personalized PageRank estimation and Personalized PageRank search. First, for the problem of estimating Personalized PageRank (PPR) from a source dist…
Fast Bidirectional Probability Estimation in Markov Models
Siddhartha Banerjee, Peter Lofgren
We develop a new bidirectional algorithm for estimating Markov chain multi-step transition probabilities: given a Markov chain, we want to estimate the probability of hitting a giv…