Pith. sign in

REVIEW 1 cited by

Convex Analysis and Optimization with Submodular Functions: a Tutorial

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1010.4207 v2 pith:46QFWFVY submitted 2010-10-20 cs.LG math.OCstat.ML

Francis Bach (INRIA Rocquencourt , LIENS) This is my paper · ORCID
classification cs.LGmath.OCstat.ML
keywords functionsconvexsubmodularanalysiscomputerset-functionstutorialappear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Partitioning and Observability in Linear Systems via Submodular Optimization

    eess.SY 2025-05 reject novelty 6.0 of 10

    A framework that partitions linear systems to maximize observability Gramian metrics, then places sensors under partition-matroid constraints via a continuous greedy algorithm.

Pith tools