submodular maximization - Robuta Search

https://openreview.net/forum?id=AlJkqMnyjL&referrer=%5Bthe%20profile%20of%20Federico%20Fusco%5D(%2Fprofile%3Fid%3D~Federico_Fusco1) Consistent Submodular Maximization | OpenReview Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine... submodular maximization consistent openreview https://openreview.net/forum?id=nwKXyFvaUm Diverse Client Selection for Federated Learning via Submodular Maximization | OpenReview In every communication round of federated learning, a random subset of clients communicate their model updates back to the server which then aggregates them... federated learning submodular maximization diverse client selection https://research.google/pubs/submodular-maximization-with-nearly-optimal-approximation-adaptivity-and-query-complexity/ Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity submodular maximization nearly optimal approximation adaptivity https://openreview.net/forum?id=low-53sFqn&referrer=%5Bthe%20profile%20of%20Oguzhan%20Akcin%5D(%2Fprofile%3Fid%3D~Oguzhan_Akcin2) Fleet Active Learning: A Submodular Maximization Approach | OpenReview This work introduces a fleet active learning framework for multi-robot systems. active learning submodular maximization fleet approach openreview https://openreview.net/forum?id=MZfoP1FimF Streaming Submodular Maximization with Differential Privacy | OpenReview In this work, we study the problem of privately maximizing a submodular function in the streaming setting. Extensive work has been done on privately maximizing... submodular maximization differential privacy streaming openreview https://deepai.org/publication/nonmonontone-submodular-maximization-under-routing-constraints Nonmonontone submodular maximization under routing constraints | DeepAI Nov 30, 2022 - 11/30/22 - In machine learning and big data, the optimization objectives based on set-cover, entropy, diversity, influence, feature selection... submodular maximization routing constraints deepai https://deepai.org/publication/robust-submodular-maximization-a-non-uniform-partitioning-approach Robust Submodular Maximization: A Non-Uniform Partitioning Approach | DeepAI Jun 15, 2017 - 06/15/17 - We study the problem of maximizing a monotone submodular function subject to a cardinality constraint k, with the added twist that... submodular maximization robust non uniform partitioning https://openreview.net/forum?id=PTxRRUEpHq Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints |... In this paper, we consider the problem of online monotone DR-submodular maximization subject to long-term stochastic constraints. Specifically, at each round... submodular maximization https://arxiv.org/abs/2605.03071v1 [2605.03071v1] A Poisson Process for Submodular Maximization Abstract page for arXiv paper 2605.03071v1: A Poisson Process for Submodular Maximization a poisson process 2605 submodular maximization https://research.google/pubs/randomized-composable-core-sets-for-distributed-submodular-maximization/ Randomized Composable Core-sets for Distributed Submodular Maximization core sets randomized composable distributed submodular https://arxiv.org/abs/1811.12568 [1811.12568] Parallelizing greedy for submodular set function maximization in matroids and beyond Abstract page for arXiv paper 1811.12568: Parallelizing greedy for submodular set function maximization in matroids and beyond submodular set function https://jmlr.org/papers/v22/18-407.html Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks online learning https://deepai.org/publication/robust-maximization-of-non-submodular-objectives Robust Maximization of Non-Submodular Objectives | DeepAI Feb 20, 2018 - 02/20/18 - We study the problem of maximizing a monotone set function subject to a cardinality constraint k in the setting where some number ... robust maximization non submodular objectives https://deepai.org/publication/online-submodular-welfare-maximization-greedy-beats-1-2-in-random-order Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order | DeepAI Dec 14, 2017 - 12/14/17 - In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of n items, each of which must be allocated to o... welfare maximization beats 1 https://research.google/pubs/online-submodular-welfare-maximization-greedy-beats-12-in-random-order/ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order welfare maximization beats 1 2 in online submodular