28 citations · 127 across the 46 of their papers we have counts for
6 papers · 1 filter
Tree of Attacks: Jailbreaking Black-Box LLMs Automatically
Anay Mehrotra, Manolis Zampetakis, Paul Kassianik +4
While Large Language Models (LLMs) display versatile functionality, they continue to generate harmful, biased, and toxic content, as demonstrated by the prevalence of human-designe…
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm +1
Characterizing the performance of no-regret dynamics in multi-player games is a foundational problem at the interface of online learning and game theory. Recent results have reveal…
Sorting from Crowdsourced Comparisons using Expert Verifications
Ellen Vitercik, Manolis Zampetakis, David Zhang
We introduce a novel noisy sorting model motivated by the Just Noticeable Difference (JND) model from experimental psychology. The goal of our model is to capture the low quality o…
Algorithmic Contract Design for Crowdsourced Ranking
Kiriaki Frangias, Andrew Lin, Ellen Vitercik +1
Ranking is fundamental to many areas, such as search engine optimization, human feedback for language models, as well as peer grading. Crowdsourcing, which is often used for these…
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
Alexandros Hollender, Manolis Zampetakis
Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions over unrestricted -dimensional dom…
Deterministic Nonsmooth Nonconvex Optimization
Michael I. Jordan, Guy Kornowski, Tianyi Lin +2
We study the complexity of optimizing nonsmooth nonconvex Lipschitz functions by producing -stationary points. Several recent works have presented randomized algorithms that…