Regularized Submodular Maximization at Scale
Authors: Ehsan Kazemi, Shervin Minaee, Moran Feldman, Amin Karbasi
ICML 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We also empirically study the performance of our scalable methods on real-life applications, including finding the mode of negatively correlated distributions, vertex cover of social networks, and several data summarization tasks. |
| Researcher Affiliation | Collaboration | 1Google, Zürich, Switzerland 2Snap Inc 3Department of Computer Science, University of Haifa, Israel 4Yale Institute for Network Science, Yale University. Correspondence to: Ehsan Kazemi <ehsankazemi@google.com>. |
| Pseudocode | Yes | Algorithm 1: THRESHOLD-STREAMING |
| Open Source Code | No | The paper does not provide a direct link to open-source code for the described methodology or explicitly state its release. |
| Open Datasets | Yes | In our experiment, we used real-world graphs from (Leskovec & Krevl, 2014) and "We summarized the frames of videos 13 and 15 from the VSUMM dataset (De Avila et al., 2011),7 and compared the above-mentioned algorithms based on their objective values and number of oracle values for varying cardinality constraint k. 7https://sites.google.com/site/vsummsite/ |
| Dataset Splits | No | The paper mentions using datasets but does not provide specific details on training, validation, or test data splits. |
| Hardware Specification | No | The paper does not provide specific details about the hardware used for running the experiments. |
| Software Dependencies | No | The paper mentions using a 'pre-trained Res Net-18 model' but does not specify any software dependencies with version numbers used for the experiments. |
| Experiment Setup | Yes | In our experiment, we used real-world graphs from (Leskovec & Krevl, 2014), set q = 6, and ran the algorithms for varying cardinality constraint k." and "For both algorithms, we set the number of computational rounds to 10." and "For the sake of fairness of experiments, we used these three algorithms to maximize the submodular function g under 50 different knapsack capacities c in the interval 0.1 c 100" and "The objective function is f(S) g(S) λ ℓ(S) for λ {0, 0.5, 1.0}. In this experiment, we set the cardinality constraint to k = 6." |