Image de couverture de livre

Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rostami, Mohammadreza, Kia, Solmaz S.
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

FedMPDD: Communication-Efficient Federated Learning with Privacy Preservation Attributes via Projected Directional Derivative
par: Rostami, Mohammadreza, et autres
Publié: (2025)

Scalar Federated Learning for Linear Quadratic Regulator
par: Rostami, Mohammadreza, et autres
Publié: (2026)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
par: Gallart, Joan Vendrell, et autres
Publié: (2025)

Time-Varying Convex Optimization with $O(n)$ Computational Complexity
par: Rostami, M., et autres
Publié: (2024)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
par: Zhou, Julien, et autres
Publié: (2024)

FedScalar: Federated Learning with Scalar Communication for Bandwidth-Constrained Networks
par: Rostami, M., et autres
Publié: (2024)

Complement Submodular Information Measures for Balanced and Robust Data Selection
par: Iyer, Rishabh
Publié: (2026)

Lower Bounds for Greedy Teaching Set Constructions
par: Compton, Spencer, et autres
Publié: (2025)

Projected Forward Gradient-Guided Frank-Wolfe Algorithm via Variance Reduction
par: Rostami, M., et autres
Publié: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
par: Fahrbach, Matthew, et autres
Publié: (2024)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
par: Kia, Solmaz S.
Publié: (2025)

Scalable Structure Learning for Sparse Context-Specific Systems
par: Rios, Felix Leopoldo, et autres
Publié: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

Optimality Gap of Decentralized Submodular Maximization under Probabilistic Communication
par: Vendrell, Joan, et autres
Publié: (2024)

Scalable Submodular Policy Optimization via Pruned Submodularity Graph
par: Anand, Aditi, et autres
Publié: (2025)

CSGO: Constrained-Softassign Gradient Optimization For Large Graph Matching
par: Shen, Binrui, et autres
Publié: (2022)

Towards a General Framework for Predicting and Explaining the Hardness of Graph-based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining
par: Sharman, Bharat, et autres
Publié: (2025)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

Efficient Combinatorial Optimization via Heat Diffusion
par: Ma, Hengyuan, et autres
Publié: (2024)

Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
par: Alston, Brandon, et autres
Publié: (2024)

Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms
par: Welikala, Shirantha, et autres
Publié: (2024)

A Pragmatic Method for Comparing Clusterings with Overlaps and Outliers
par: DeWolfe, Ryan, et autres
Publié: (2026)

Generating Hadamard matrices with transformers
par: Williamson, Geordie, et autres
Publié: (2026)

Invariant-Based Diagnostics for Graph Benchmarks
par: von Moos, Richard, et autres
Publié: (2026)

An Optimal Sauer Lemma Over $k$-ary Alphabets
par: Hanneke, Steve, et autres
Publié: (2026)

Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
par: Hordan, Snir, et autres
Publié: (2026)

Neural Algorithmic Reasoning for Approximate $k$-Coloring with Recursive Warm Starts
par: Vanderbush, Knut, et autres
Publié: (2026)

Complex non-backtracking matrix for directed graphs
par: Sando, Keishi, et autres
Publié: (2025)

Theoretical Insights into Line Graph Transformation on Graph Learning
par: Yang, Fan, et autres
Publié: (2024)

A classification model based on a population of hypergraphs
par: Barton, Samuel, et autres
Publié: (2024)

Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?
par: Mundinger, Konrad, et autres
Publié: (2025)

Reinforcement learning for graph theory, Parallelizing Wagner's approach
par: Bouffard, Alix, et autres
Publié: (2025)

Optimal Mistake Bounds for Transductive Online Learning
par: Chase, Zachary, et autres
Publié: (2025)

A Multi-Level Framework for Multi-Objective Hypergraph Partitioning: Combining Minimum Spanning Tree and Proximal Gradient
par: Li, Yingying, et autres
Publié: (2025)

Mildly Overparameterized ReLU Networks Have a Favorable Loss Landscape
par: Karhadkar, Kedar, et autres
Publié: (2023)

Heating Up Quasi-Monte Carlo Graph Random Features: A Diffusion Kernel Perspective
par: Feinberg, Brooke, et autres
Publié: (2024)

Estimating the stability number of a random graph using convolutional neural networks
par: Davila, Randy
Publié: (2024)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
par: Gopal, Shivaram, et autres
Publié: (2024)

Greedy Gossiping
par: Williams, Kada
Publié: (2025)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
par: Pavlov, Gorgi
Publié: (2026)