Co-occurring keywords · papers mentioning both
Papers
Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models
ICML 2025
The Adaptive Complexity of Finding a Stationary Point
COLT 2025
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
IJCAI 2024
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization
AAAI 2023
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
AISTATS 2021
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
NeurIPS 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
NeurIPS 2020
Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets
ICLR 2020