Learning with Submodular Functions: A Convex Optimization Perspective
From MaRDI portal
Publication:5396766
DOI10.1561/2200000039zbMath1280.68001arXiv1111.6453OpenAlexW2952019053MaRDI QIDQ5396766
Publication date: 3 February 2014
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.6453
optimizationclusteringcomputer visioninformation theorysignal processingcomputational learningoperations researchclassification and prediction
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Total positivity in exponential families with application to binary variables, An overview of structural systems theory, Submodular Maximization Subject to a Knapsack Constraint Under Noise Models, On a general framework for network representability in discrete optimization, Structured Sparsity: Discrete and Convex Approaches, Unnamed Item, Unnamed Item, A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure, On a Reduction for a Class of Resource Allocation Problems, Estimating piecewise monotone signals, Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid, Constrained Optimization on Hierarchies and Braids of Partitions, Submodular functions: from discrete to continuous domains, On additive approximate submodularity, Polynomial-time algorithms for multimarginal optimal transport problems with structure, A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS, Toward a sparsity theory on weighted lattices, A note on the implications of approximate submodularity in discrete optimization, An update-and-stabilize framework for the minimum-norm-point problem, Efficient Optimization of Partition Scan Statistics via the Consecutive Partitions Property, A Fast and Scalable Computational Framework for Large-Scale High-Dimensional Bayesian Optimal Experimental Design, Constrained Submodular Maximization via a Nonsymmetric Technique, THE ACTUATION SPECTRUM OF SPATIOTEMPORAL NETWORKS WITH POWER-LAW TIME DEPENDENCIES, Invariant $\varphi$-Minimal Sets and Total Variation Denoising on Graphs, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Rough set methods in feature selection via submodular function, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Mass Customization and “Forecasting Options’ Penetration Rates Problem”, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences, Unnamed Item, Restricted strong convexity implies weak submodularity, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Community Detection in Networks via Nonlinear Modularity Eigenvectors, A note on submodular function minimization with covering type linear constraints, Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs, Structured sparsity through convex optimization, Geometric Rescaling Algorithms for Submodular Function Minimization, Degrees of freedom in submodular regularization: a computational perspective of Stein's unbiased risk estimate, On the convergence of a class of inertial dynamical systems with Tikhonov regularization, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Modular proximal optimization for multidimensional total-variation regularization, Finding Submodularity Hidden in Symmetric Difference, Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations, Efficient search for informational cores in complex systems: application to brain networks, Sparse approximate solutions to max-plus equations, Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods, Hardness results for multimarginal optimal transport problems, Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent, On a General Framework for Network Representability in Discrete Optimization, A new look at Popoviciu's concept of convexity for functions of two variables, Active-set Methods for Submodular Minimization Problems, Private non-monotone submodular maximization
Uses Software
