20 results for “submodular functions”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
The paper studies submodular sparsification and provides efficient constructions of size-$O(n k^2 \log n)$ sparsifiers for summations of arbitrary submodular functions under cardinality constraints.
The paper resolves the approximability of the Minimum Linear Ordering Problem for a general submodular function.
This paper proposes an approximation algorithm for the submodular joint replenishment problem with decomposable submodular ordering cost functions, achieving an O(k)-approximation.
Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen +2 more
This paper addresses the challenging problem of multi-objective submodular maximization under a cardinality constraint while ensuring differential privacy, proposing novel algorithms with approximatio…
The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…
This paper presents improved algorithms for an online item-allocation problem with budgets and a submodular objective.
The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…
This paper introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…
This paper studies the expressive power of tree-structured compositions of EML functions for function approximation.
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
The paper proposes SubFit, a novel compression technique that achieves superior LLM compression by replacing non-contiguous, submodule-level components (Attention and FeedForward) with lightweight res…