Submodular combinatorial information measures with applications in machine learning

MaRDI QIDQ7028620zbMATH OpenFDO

Authors Rishabh Iyer, Ninad Khargonkar, Jeff A. Bilmes, Himanshu Asnani

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v132/iyer21a.html

zbMATH Keywords

combinatorial information measuresinformation theorysubmodular optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information theory (general) (94A15) Measures of information, entropy (94A17)

Cites work

• A Mathematical Theory of Communication
• A non-Shannon-type conditional inequality of information quantities
• A tight linear time (1/2)-approximation for unconstrained submodular maximization
• An analysis of approximations for maximizing submodular set functions—I
• Approximation Algorithms for Submodular Multiway Partition
• Decomposition of submodular functions
• Greedy splitting algorithms for approximating multiway partition problems
• scientific article; zbMATH DE number 5888315 (Why is no real title available?)
• scientific article; zbMATH DE number 5968956 (Why is no real title available?)
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 7051222 (Why is no real title available?)
• Information Theoretical Analysis of Multivariate Correlation
• Non-monotone submodular maximization under matroid and knapsack constraints
• Online submodular welfare maximization: greedy beats 1/2 in random order
• Optimal approximation for the submodular welfare problem in the value oracle model
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Submodular functions and optimization.
• Submodular maximization with cardinality constraints
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• The Online Submodular Cover Problem

Cited in

(2)

• A direct proof of the characterization of the convexity of the discrete Choquet integral
• An efficient model training framework for Green AI

This page was built for publication: Submodular combinatorial information measures with applications in machine learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028620)