MIT Open Access Articles: Recent submissions

Now showing items 25-27 of 55096

    • Oblivious Defense in ML Models: Backdoor Removal without Detection 

      Goldwasser, Shafi; Shafer, Jonathan; Vafa, Neekon; Vaikuntanathan, Vinod (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
      As society grows more reliant on machine learning, ensuring the security of machine learning systems against sophisticated attacks becomes a pressing concern. A recent result of Goldwasser, Kim, Vaikuntanathan, and Zamir ...

    • Faster Rates for No-Regret Learning in General Games via Cautious Optimism 

      Soleymani, Ashkan; Piliouras, Georgios; Farina, Gabriele (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
      We establish the first uncoupled learning algorithm that attains O(n log2 d logT) per-player regret in multi-player general-sum games, where n is the number of players, d is the number of actions available to each player, ...

    • Explicit Two-Sided Vertex Expanders beyond the Spectral Barrier 

      Hsieh, Jun-Ting; Lin, Ting-Chun; Mohanty, Sidhanth; O'Donnell, Ryan; Zhang, Rachel Yun (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
      We construct the first explicit two-sided vertex expanders that bypass the spectral barrier. Previously, the strongest known explicit vertex expanders were given by d-regular Ramanujan graphs, whose spectral properties ...