O n Tuesday, researchers at Stanford and Yale revealed something that AI companies would prefer to keep hidden. Four popular ...

In this paper, we give the first robust algorithms for Packing Integer Programs, specifically in the recently proposed Byzantine Secretary framework. Our techniques are based on a two-level use of ...

Abstract: This paper focuses on a distributed nonsmooth composite optimization problem over a multiagent networked system, in which each agent is equipped with a local Lipschitz-differentiable ...

ABSTRACT: Quantum technologies, mainly quantum computing and quantum sensing are emerging as new applications of quantum mechanics for practical use. Two notable advancements in quantum computing and ...

Abstract: A two-phase Boolean matrix factorization algorithm was recently developed by other authors. In the first phase of their algorithm, a nonnegative optimization problem is solved using an ...