MIT Open Access Articles: Recent submissions

Now showing items 13-15 of 53644

    • Apparent algorithmic discrimination and real-time algorithmic learning in digital search advertising 

      Lambrecht, Anja; Tucker, Catherine (Springer US, 2024-07-25)
      Digital algorithms try to display content that engages consumers. To do this, algorithms need to overcome a ‘cold-start problem’ by swiftly learning whether content engages users. This requires feedback from users. The ...

    • Ordering Candidates via Vantage Points 

      Alon, Noga; Defant, Colin; Kravitz, Noah; Zhu, Daniel G. (Springer Berlin Heidelberg, 2025-04-08)
      Given an n-element set C ⊆ R d and a (sufficiently generic) k-element multiset V ⊆ R d , we can order the points in C by ranking each point c ∈ C according to the sum of the distances from c to the points of V. Let Ψ k ( ...

    • Perseus: a simple and optimal high-order method for variational inequalities 

      Lin, Tianyi; Jordan, Michael I. (Springer Berlin Heidelberg, 2024-03-13)
      This paper settles an open and challenging question pertaining to the design of simple and optimal high-order methods for solving smooth and monotone variational inequalities (VIs). A VI involves finding x ⋆ ∈ X such that ...