No article text was recorded for this version.
Lovász extension
Version 2 of 293 papers128 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Learning with Submodular Functions: A Convex Optimization Perspective
- Blog: Learning with Submodular Functions: A Convex Optimization Perspective
- Blog: Submodular Functions: from Discrete to Continous Domains
- Blog: Continuous limits of discrete perimeters
- Blog: Structured sparsity-inducing norms through submodular functions
- Blog: From MAP to Marginals: Variational Inference in Bayesian Submodular Models
- Blog: Optimization of the Jaccard index for image segmentation with the Lovász hinge
- Blog: Learning Submodular Losses with the Lovasz Hinge
- Blog: Local Centrality Minimization with Quality Guarantees
- Blog: Local Centrality Minimization with Quality Guarantees
- Blog: Continuous limits of discrete perimeters
- Blog: Exploring the Subgraph Density-Size Trade-off via the Lovaśz Extension
- Blog: Online $\textrm{L}^{\natural }$-Convex Minimization
- Blog: Differentially Private Online Submodular Minimization
- Blog: Convex Analysis and Optimization with Submodular Functions: a Tutorial
- Blog: Submodular Function Minimization with Noisy Evaluation Oracle
- Blog: Learning with Submodular Functions: A Convex Optimization Perspective
- Blog: Multicommodity Flows and Cuts in Polymatroidal Networks
- Blog: The Lovász-Softmax Loss: A Tractable Surrogate for the Optimization of the Intersection-Over-Union Measure in Neural Networks
- Blog: Influence-based Community Partition with Sandwich Method for Social Networks
- Blog: Gradient-Based Algorithms for Convex Discrete Optimization via Simulation
- Blog: Online Submodular Minimization for Combinatorial Structures
- Blog: Submodular Function Minimization with Dueling Oracle
- Blog: Differentially Private Online Submodular Optimization
- Blog: Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
- Blog: IoU is not submodular
- Blog: Shaping Level Sets with Submodular Functions
- Blog: Superhuman Fairness
- Blog: Safe Element Screening for Submodular Function Minimization
- Blog: Smoothing Binary Optimization: A Primal-Dual Perspective
- Blog: Constrained Submodular Minimization for Missing Labels and Class Imbalance in Multi-label Learning
- Blog: Cheeger Inequalities for Submodular Transformations
- Blog: Polynomial-Time Algorithms for Submodular Laplacian Systems
- Blog: Submodularity Cuts and Applications
- Blog: Approximation Algorithms for Submodular Multiway Partition
- Blog: Sublabel-Accurate Relaxation of Nonconvex Energies
- Blog: Disciplined quasiconvex programming
- Blog: Prismatic Algorithm for Discrete D.C. Programming Problem
- Blog: Contracts with Inspections
- Blog: Difference of submodular minimization via DC programming
- Blog: Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
- Blog: Sparsification of Decomposable Submodular Functions
- Blog: Safe Element Screening for Submodular Function Minimization
- Blog: Difference of submodular minimization via DC programming
- Blog: Optimal Submodular Extensions for Marginal Estimation
- Blog: Nonlinear Eigenproblems in Data Analysis - Balanced Graph Cuts and the RatioDCA-Prox
- Blog: Size-constrained Submodular Minimization through Minimum Norm Base
- Blog: Robust Submodular Minimization with Applications to Cooperative Modeling
- Blog: Efficient Transductive Online Learning via Randomized Rounding
- Blog: Sum-max Submodular Bandits
- Blog: The Online Submodular Assignment Problem
- Blog: Submodularity In Machine Learning and Artificial Intelligence
- Blog: Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism
- Blog: Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
- Blog: Structured Optimal Transport
- Blog: Efficient Minimization of Decomposable Submodular Functions
- Blog: Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness
- Blog: Submodular Cost Allocation Problem and Applications
- Blog: Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives
- Blog: A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation
Showing 60 of 93 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_lovasz_extension_d793c336,
title = {Lovász extension},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lovasz-extension/rdr_d793c336a28c4e31909f17f3b26533bb},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_lovasz_extension_d793c336_v2,
title = {Lovász extension},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lovasz-extension/rdr_d793c336a28c4e31909f17f3b26533bb/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}