Copertina

Decomposable Submodular Maximization in Federated Setting

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Rafiey, Akbar
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Artificial Intelligence Distributed, Parallel, and Cluster Computing Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
di: Gopal, Shivaram, et al.
Pubblicazione: (2024)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
di: Chen, Yixin, et al.
Pubblicazione: (2022)

Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates
di: Ma, Chenyang, et al.
Pubblicazione: (2023)

Parallel Batch-Dynamic Maximal Independent Set
di: Blelloch, Guy, et al.
Pubblicazione: (2026)

SPILDL: A Scalable and Parallel Inductive Learner in Description Logic
di: Algahtani, Eyad
Pubblicazione: (2024)

HT-HEDL: High-Throughput Hypothesis Evaluation in Description Logic
di: Algahtani, Eyad
Pubblicazione: (2024)

MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
di: Macko, Vladimír, et al.
Pubblicazione: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
di: Banasik, Dominick, et al.
Pubblicazione: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2025)

TC-MIS: Maximal Independent Set on Tensor-cores
di: Nijhara, Prajjwal, et al.
Pubblicazione: (2026)

Parallel Dynamic Maximal Matching
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Dynamic Maximal Matching in Clique Networks
di: Li, Minming, et al.
Pubblicazione: (2024)

Efficient Enumeration of Large Maximal k-Plexes
di: Cheng, Qihao, et al.
Pubblicazione: (2024)

Decoupling Generation and Evaluation for Parallel Greedy Best-First Search(extended version)
di: Shimoda, Takumi, et al.
Pubblicazione: (2024)

Theoretical Lower Bounds for the Oven Scheduling Problem
di: Da Ros, Francesca, et al.
Pubblicazione: (2024)

When MIS and Maximal Matching are Easy in the Congested Clique
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
di: Wang, Letong, et al.
Pubblicazione: (2023)

RobustFSM: Submodular Maximization in Federated Setting with Malicious Clients
di: Tran, Duc A., et al.
Pubblicazione: (2025)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
di: Wu, Hanjiang, et al.
Pubblicazione: (2024)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
di: Blelloch, Guy E., et al.
Pubblicazione: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
di: Khoury, Seri, et al.
Pubblicazione: (2025)

Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
di: Lechowicz, Adam, et al.
Pubblicazione: (2024)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
di: Yu, Shangdi, et al.
Pubblicazione: (2023)

Distributed clustering in partially overlapping feature spaces
di: Maritan, Alessio, et al.
Pubblicazione: (2025)

Simple Opinion Dynamics for No-Regret Learning
di: Lazarsfeld, John, et al.
Pubblicazione: (2023)

Massively Parallel Ruling Set Made Deterministic
di: Giliberti, Jeff, et al.
Pubblicazione: (2024)

An Implementation and Experimental Comparison of Dynamic Ordered Sets
di: Malek, Jordan
Pubblicazione: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
di: Borowitz, Jannick, et al.
Pubblicazione: (2025)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
di: Augustine, John, et al.
Pubblicazione: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
di: Baumecker, Malte, et al.
Pubblicazione: (2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
di: Bonamy, Marthe, et al.
Pubblicazione: (2025)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
di: Gil, Yuval
Pubblicazione: (2024)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
di: Manor, Daniel, et al.
Pubblicazione: (2025)

Vertical Federated Learning with Missing Features During Training and Inference
di: Valdeira, Pedro, et al.
Pubblicazione: (2024)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
di: Valdeira, Pedro, et al.
Pubblicazione: (2024)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
di: Valdeira, Pedro, et al.
Pubblicazione: (2023)

Parallel Sampling via Autospeculation
di: Anari, Nima, et al.
Pubblicazione: (2025)

Composable Coresets for Constrained Determinant Maximization and Beyond
di: Mahabadi, Sepideh, et al.
Pubblicazione: (2022)