REVIEW 2 cited by
Convex Analysis and Optimization with Submodular Functions: a Tutorial
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role, similar to convex functions on vector spaces. In this tutorial, the theory of submodular functions is presented, in a self-contained way, with all results shown from first principles. A good knowledge of convex analysis is assumed.
Forward citations
Cited by 2 Pith papers
-
Partitioning and Observability in Linear Systems via Submodular Optimization
A framework that partitions linear systems to maximize observability Gramian metrics, then places sensors under partition-matroid constraints via a continuous greedy algorithm.
-
V2C-CBM: Building Concept Bottlenecks with Vision-to-Concept Tokenizer
A concept bottleneck model that discovers class concepts directly from images by quantizing them into nearest common words in CLIP space, matching or beating LLM-generated concept bottlenecks without using LLMs.
Discussion (0). Continue with ORCID to comment.