Pages that link to "Item:Q5396766"

The following pages link to Learning with Submodular Functions: A Convex Optimization Perspective (Q5396766):

Displaying 50 items.

• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• Total positivity in exponential families with application to binary variables (Q820806) (← links)
• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• Rough set methods in feature selection via submodular function (Q1701849) (← links)
• Restricted strong convexity implies weak submodularity (Q1990594) (← links)
• On the convergence of a class of inertial dynamical systems with Tikhonov regularization (Q2047197) (← links)
• Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations (Q2057377) (← links)
• Efficient search for informational cores in complex systems: application to brain networks (Q2057764) (← links)
• Sparse approximate solutions to max-plus equations (Q2061850) (← links)
• Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
• Private non-monotone submodular maximization (Q2091093) (← links)
• An overview of structural systems theory (Q2125521) (← links)
• Estimating piecewise monotone signals (Q2180071) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences (Q2241652) (← links)
• Degrees of freedom in submodular regularization: a computational perspective of Stein's unbiased risk estimate (Q2293382) (← links)
• A new look at Popoviciu's concept of convexity for functions of two variables (Q2320113) (← links)
• Submodular functions: from discrete to continuous domains (Q2414912) (← links)
• Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid (Q2670444) (← links)
• On additive approximate submodularity (Q2672599) (← links)
• Toward a sparsity theory on weighted lattices (Q2678919) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
• Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent (Q2832112) (← links)
• On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
• Constrained Optimization on Hierarchies and Braids of Partitions (Q2946806) (← links)
• A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS (Q3224947) (← links)
• Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
• Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
• Active-set Methods for Submodular Minimization Problems (Q4637060) (← links)
• Community Detection in Networks via Nonlinear Modularity Eigenvectors (Q4683908) (← links)
• Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs (Q4689639) (← links)
• Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
• (Q4969175) (← links)
• (Q4969210) (← links)
• (Q5053276) (← links)
• A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
• Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
• Invariant $\varphi$-Minimal Sets and Total Variation Denoising on Graphs (Q5109267) (← links)
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach (Q5113808) (← links)
• Active Set Complexity of the Away-Step Frank--Wolfe Algorithm (Q5124005) (← links)
• Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
• Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
• Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
• Sublinear optimization for machine learning (Q5395692) (← links)
• Learning submodular functions (Q5419150) (← links)
• Learning Pseudo-Boolean <i>k</i>-DNF and Submodular Functions (Q5741807) (← links)
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)