Unconstrained Submodular Maximization with Constant Adaptive Complexity

In this paper, we consider the unconstrained submodular maximization problem. We propose the first algorithm for this problem that achieves a tight $(1/2-\varepsilon)$-approximation guarantee using $\tilde{O}(\varepsilon^{-1})$ adaptive rounds and a linear number of function evaluations. No previously known algorithm for this problem achieves an approximation ratio better than $1/3$ using less than $\Omega(n)$ rounds of adaptivity, where $n$ is the size of the ground set. Moreover, our algorithm easily extends to the maximization of a non-negative continuous DR-submodular function subject to a box constraint and achieves a tight $(1/2-\varepsilon)$-approximation guarantee for this problem while keeping the same adaptive and query complexities.Comment: Authors are listed in alphabetical orde

Determining the Minimum Number of Virtual Networks for Different Coherence Protocols

<p>This is the docker of the artifact for the paper: Determining the Minimum Number of Virtual Networks for Different Coherence Protocols, which is conditionally accpeted by ISCA 2024.</p> <p>Since the paper still in the conditional acceptance stage, we keep the authors' names blind. This document is only used for the artifact volunteer to access the docker.</p> <p>This artifact includes Python code for determining the minimum number of VNs for a given protocol, as well as generating mappings from message types to VNs. </p> <p>It also includes all evaluated protocols in Murphi, corresponding to Experiments (2), (4), (5), and (6) in Table 1. (Note: Protocols in categories (1) and (3) of Table 1 do not need to be evaluated)</p> <p>We provide scripts to run the algorithm and the model checking for all protocols, either individually or all together.</p&gt

A Pleasant Homeomorphism

Suppose that there are n states, each denoted by i2f1; 2; : : : ng. This paper shows that the function [p ijE ] i2E 7! [ j 6=i p ijfi;jg ] i is a homeomorphism from the set of conditional probability systems onto the convex hull of all permutations of the n- dimensional vector (0; 1; 2; : : : n 1)