conftrace_

cardinality constraint

71 papers

Explore in graph

Co-occurring keywords

submodular maximization (143) approximation algorithm (630) submodular optimization (261) greedy algorithm (242) combinatorial optimization (1039) approximation guarantee (65) submodular function (121) streaming algorithm (131) query complexity (183) data summarization (37)

Papers

DCC: Differentiable Cardinality Constraints for Partial Index Tracking AAAI 2025
The Impact of Literal Sorting on Cardinality Constraint Encodings AAAI 2025
The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective AAAI 2025
Sparse SVM with Hard-Margin Loss: a Newton-Augmented Lagrangian Method in Reduced Dimensions JMLR 2025
Data Summarization via Bilevel Optimization JMLR 2024
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint NIPS 2024
Fairness in Submodular Maximization over a Matroid Constraint AISTATS 2024
Learning-Augmented Dynamic Submodular Maximization NIPS 2024
Pursuit of the Cluster Structure of Network Lasso: Recovery Condition and Non-convex Extension JMLR 2024
Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies ALT 2024
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization AAAI 2023
Dynamic Non-monotone Submodular Maximization NIPS 2023
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time ICML 2023
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints ICML 2022
Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula AAAI 2022
Efficient Submodular Optimization under Noise: Local Search is Robust NIPS 2022
Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions AAAI 2022
Submodular Maximization in Clean Linear Time NIPS 2022
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel NIPS 2021
Instance Specific Approximations for Submodular Maximization ICML 2021
Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design JMLR 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021
Cardinality constrained submodular maximization for random streams NIPS 2021
Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications AISTATS 2021
Principal Component Hierarchy for Sparse Quadratic Programs ICML 2021