Research graph
References from Learning with Submodular Functions: A Convex Optimization Perspective. Local targets link to admitted publications; unresolved targets remain external evidence.
Maximizing a class of submodular utility functions
10.1007/s10107-009-0298-1 · 2011 · External reference
Unresolved reference
1993 · External reference
Concavity of certain maps on positive definite matrices and applications to Hadamard products
10.1016/0024-3795(79)90179-4 · 1979 · External reference
Experimental evaluation of parametric max-flow algorithms
10.1007/978-3-540-72845-0_20 · 2007 · External reference
Consistency of the group Lasso and multiple kernel learning
2008 · External reference
Exploring large feature spaces with hierarchical multiple kernel learning
2008 · External reference
Structured sparsity-inducing norms through submodular functions
2010 · External reference
Shaping level sets with submodular functions
2011 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
Optimization with sparsity-inducing penalties
2011 · External reference
Structured sparsity through convex optimization
10.1214/12-sts394 · 2012 · External reference
Learning submodular functions
10.1145/1993636.1993741 · 2011 · External reference
Clustering with Bregman divergences
2005 · External reference
Model-based compressive sensing
10.1109/tit.2010.2040894 · 2010 · External reference
Fast Newton-type methods for total variation regularization
2011 · External reference
Unresolved reference
1972 · External reference
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
10.1016/j.jat.2004.02.006 · 2004 · External reference
A conditional gradient method with linear rate of convergence for solving convex linear systems
10.1007/s001860300327 · 2004 · External reference
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
10.1137/080716542 · 2009 · External reference
NESTA: A fast and accurate first-order method for sparse recovery
10.1137/090756855 · 2011 · External reference
Unresolved reference
1995 · External reference
A unifying polyhedral approximation framework for convex optimization
10.1137/090772204 · 2011 · External reference
Unresolved reference
1997 · External reference
Active set algorithms for isotonic regression: a unifying framework
10.1007/bf01580873 · 1990 · External reference
10.1007/978-3-662-05078-1
10.1007/978-3-662-05078-1 · 2003 · External reference
Pseudo-Boolean optimization
10.1016/s0166-218x(01)00341-9 · 2002 · External reference
10.1007/978-0-387-31256-9
10.1007/978-0-387-31256-9 · 2006 · External reference
Submodularity and randomized rounding techniques for optimal experimental design
10.1016/j.endm.2010.05.086 · 2010 · External reference
10.1017/cbo9780511804441
10.1017/cbo9780511804441 · 2004 · External reference
Fast approximate energy minimization via graph cuts
10.1109/34.969114 · 2001 · External reference
An O(n) algorithm for quadratic knapsack problems
10.1016/0167-6377(84)90010-5 · 1984 · External reference
A tight linear-time (1/2)-approximation for unconstrained submodular maximization
10.1109/focs.2012.73 · 2012 · External reference
Maximizing a monotone submodular function subject to a matroid constraint
10.1137/080733991 · 2011 · External reference
Dependence, correlation and gaussianity in independent component analysis
2003 · External reference
Sparse signal recovery using Markov random fields
2008 · External reference
An algorithm for total variation minimization and applications
10.1023/b:jmiv.0000011325.36760.1e · 2004 · External reference
On total variation minimization and surface evolution using parametric maximum flows
10.1007/s11263-009-0238-9 · 2009 · External reference
Exhaustive family of energies minimizable exactly by a graph cut
10.1109/cvpr.2011.5995567 · 2011 · External reference
Efficient principled learning of thin junction trees
2007 · External reference
Approximation algorithms for submodular multiway partition
10.1109/focs.2011.34 · 2011 · External reference
Submodular function maximization via the multilinear relaxation and contention resolution schemes
10.1145/1993636.1993740 · 2011 · External reference
Atomic decomposition by basis pursuit
10.1137/s1064827596304010 · 1998 · External reference
On implementing the push-relabel method for the maximum flow problem
10.1007/pl00009180 · 1997 · External reference
On the spanning tree polyhedron
10.1016/0167-6377(89)90029-1 · 1989 · External reference
Theory of capacities
10.5802/aif.53 · 1954 · External reference
Unresolved reference
1997 · External reference
Proximal splitting methods in signal processing
2010 · External reference
Unresolved reference
1989 · External reference
Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
10.1287/mnsc.23.8.789 · 1977 · External reference
On the uncapacitated location problem
10.1016/s0167-5060(08)70732-5 · 1977 · External reference
Unresolved reference
1991 · External reference
Testing membership in matroid polyhedra
10.1016/0095-8956(84)90023-6 · 1984 · External reference
Minimum cuts, modular functions, and matroid polyhedra
10.1002/net.3230150206 · 1985 · External reference
Global optimization for first order Markov random fields with submodular priors
10.1007/978-3-540-78275-9_20 · 2008 · External reference
Algorithms for subset selection in linear regression
10.1145/1374376.1374384 · 2008 · External reference
Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection
2011 · External reference
10.1017/cbo9780511809088
10.1017/cbo9780511809088 · 2002 · External reference
Adapting to unknown smoothness via wavelet shrinkage
10.1080/01621459.1995.10476626 · 1995 · External reference
Lifted coordinate descent for learning with trace-norm regularization
2012 · External reference
Convergence rates for conditional gradient sequences generated by implicit step length rules
10.1137/0318035 · 1980 · External reference
Conditional gradient algorithms with open loop step size rules
10.1016/0022-247x(78)90137-3 · 1978 · External reference
Submodular functions, matroids, and certain polyhedra
10.1007/3-540-36478-1_2 · 2003 · External reference
Unresolved reference
1972 · External reference
A threshold of ln(n) for approximating set cover
10.1145/285055.285059 · 1998 · External reference
On maximizing welfare when utility functions are subadditive
10.1145/1132516.1132523 · 2006 · External reference
Maximizing non-monotone submodular functions
10.1137/090779346 · 2011 · External reference
A unified continuous greedy algorithm for submodular maximization
10.1109/focs.2011.46 · 2011 · External reference
Submodularity, supermodularity, and higher-order monotonicities of pseudo-Boolean functions
10.1287/moor.1040.0128 · 2005 · External reference
An algorithm for quadratic programming
10.1002/nav.3800030109 · 1956 · External reference
Unresolved reference
External reference
Unresolved reference
2005 · External reference
A submodular function minimization algorithm based on the minimum-norm base
2011 · External reference
A fast parametric maximum flow algorithm and applications
10.1137/0218003 · 1989 · External reference
Unresolved reference
2004 · External reference
Unresolved reference
External reference
Approximating submodular functions everywhere
10.1137/1.9781611973068.59 · 2009 · External reference
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
10.1007/bf01580602 · 1993 · External reference
A new approach to the maximum-flow problem
10.1145/48014.61051 · 1988 · External reference
The data-correcting algorithm for the minimization of supermodular functions
10.1287/mnsc.45.11.1539 · 1999 · External reference
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
2011 · External reference
Unresolved reference
1996 · External reference
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
10.1016/0377-2217(91)90300-k · 1991 · External reference
The ellipsoid method and its consequences in combinatorial optimization
10.1007/bf02579273 · 1981 · External reference
Projections onto order simplexes
10.1007/bf01449044 · 1984 · External reference
10.1007/978-1-4613-0019-9
10.1007/978-1-4613-0019-9 · 2003 · External reference
Some comments on Wolfe’s “away step”
10.1007/bf01589445 · 1986 · External reference
Online submodular set cover, ranking, and repeated active learning
2011 · External reference
Unresolved reference
External reference
Catching change-points with Lasso
2008 · External reference
10.1007/978-0-387-21606-5
10.1007/978-0-387-21606-5 · 2001 · External reference
Signal reconstruction from noisy random projections
10.1109/tit.2006.880031 · 2006 · External reference
Online submodular minimization
2009 · External reference
The Smooth-Lasso and other ℓ1 + ℓ2-penalized methods
10.1214/11-ejs638 · 2011 · External reference
Learning Bayesian networks: The combination of knowledge and statistical data
10.1023/a:1022623210503 · 1995 · External reference
Unresolved reference
1996 · External reference
An efficient algorithm for image segmentation, Markov random fields and related problems
10.1145/502090.502093 · 2001 · External reference
Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization
2013 · External reference
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
10.1007/bf01585561 · 1995 · External reference
Clusterpath: an algorithm for clustering using convex fusion penalties
2011 · External reference
A path algorithm for the fused Lasso signal approximator
10.1198/jcgs.2010.09208 · 2010 · External reference
Unresolved reference
1990 · External reference
DC programming: overview
10.1023/a:1021765131316 · 1999 · External reference
Learning with structured sparsity
10.1145/1553374.1553429 · 2009 · External reference
A tutorial on MM algorithms
10.1198/0003130042836 · 2004 · External reference
Exact optimization for Markov random fields with convex priors
10.1109/tpami.2003.1233908 · 2003 · External reference
A combinatorial strongly polynomial algorithm for minimizing submodular functions
10.1145/502090.502096 · 2001 · External reference
Group Lasso with overlaps and graph Lasso
10.1145/1553374.1553431 · 2009 · External reference
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
2013 · External reference
Reflection methods for user-friendly submodular optimization
2013 · External reference
Fast approximate submodular minimization
2011 · External reference
Structured variable selection with sparsity-inducing norms
2011 · External reference
Multiscale mining of fMRI data with hierarchical structured sparsity
10.1137/110832380 · 2012 · External reference
Proximal methods for hierarchical sparse coding
2011 · External reference
Structured sparse principal component analysis
2009 · External reference
Learning invariant features through topographic filter maps
10.1109/cvpr.2009.5206545 · 2009 · External reference
Submodularity cuts and applications
2009 · External reference
Maximizing the spread of influence through a social network
10.1145/956750.956769 · 2003 · External reference
Tree-guided group Lasso for multi-task regression with structured sparsity
2010 · External reference
How good is the simplex algorithm?
1972 · External reference
Minimizing a sum of submodular functions
10.1016/j.dam.2012.05.025 · 2012 · External reference
What energy functions can be minimized via graph cuts?
10.1109/tpami.2004.1262177 · 2004 · External reference
MRF energy minimization and beyond via dual decomposition
10.1109/tpami.2010.108 · 2011 · External reference
Submodular dictionary selection for sparse representation
2010 · External reference
Near-optimal nonmyopic value of information in graphical models
2005 · External reference
Submodularity and its applications in optimized information gathering
10.1145/1989734.1989736 · 2011 · External reference
Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
10.1007/bf02289565 · 1964 · External reference
Unresolved reference
External reference
10.1093/oso/9780198522195.001.0001
10.1093/oso/9780198522195.001.0001 · 1996 · External reference
Itakura-Saito nonnegative matrix factorization with group sparsity
10.1109/icassp.2011.5946318 · 2011 · External reference
A class of submodular functions for document summarization
2011 · External reference
Optimal selection of limited vocabulary speech corpora
10.21437/interspeech.2011-312 · 2011 · External reference
Clustering using sum-of-norms regularization: With application to particle filter output computation
10.1109/ssp.2011.5967659 · 2011 · External reference
Submodular functions and convexity
1982 · External reference
Selected topics in column generation
10.1287/opre.1050.0234 · 2005 · External reference
Decomposing isotonic regression for efficiently solving large problems
2010 · External reference
Efficient regularized isotonic regression with application to gene–gene interaction search
10.1214/11-aoas504 · 2012 · External reference
A linear-time median-finding algorithm for projecting a vector on the simplex of Rn
10.1016/0167-6377(89)90064-3 · 1989 · External reference
Online learning for matrix factorization and sparse coding
2010 · External reference
Convex and network flow optimization for structured sparsity
2011 · External reference
Complexity analysis of the Lasso regularization path
2012 · External reference
Some comments on Cp
1973 · External reference
An axiomatic approach of the discrete Choquet integral as a tool to aggregate interacting criteria
10.1109/91.890347 · 2000 · External reference
Portfolio selection
1952 · External reference
Submodular function minimization
10.1016/s0927-0507(05)12007-6 · 2005 · External reference
Optimal flows in networks with multiple sources and sinks
10.1007/bf01585506 · 1974 · External reference
Accelerated greedy algorithms for maximizing submodular set functions
10.1007/bfb0006528 · 1978 · External reference
Fonctions convexes duales et points proximaux dans un espace Hilbertien
1962 · External reference
Unresolved reference
1984 · External reference
Unresolved reference
1987 · External reference
A note on minimizing submodular functions
10.1016/s0020-0190(98)00114-8 · 1998 · External reference
A strongly polynomial algorithm for line search in submodular polyhedra
10.1016/j.disopt.2007.09.002 · 2007 · External reference
Size-constrained submodular minimization through minimum norm base
2011 · External reference
PAC-learning bounded tree-width graphical models
2004 · External reference
A submodular-supermodular procedure with applications to discriminative structure learning
2006 · External reference
Local search for balanced submodular clusterings
2007 · External reference
Q-clustering
2006 · External reference
A rounding technique for the polymatroid membership problem
10.1016/0024-3795(93)00222-l · 1995 · External reference
Unresolved reference
2009 · External reference
Approximate primal solutions and rate analysis for dual subgradient methods
10.1137/070708111 · 2009 · External reference
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
2009 · External reference
Joint support recovery under high-dimensional scaling: Benefits and perils of ℓ1–ℓ∞-regularization
2008 · External reference
An analysis of approximations for maximizing submodular set functions–I
10.1007/bf01588971 · 1978 · External reference
Unresolved reference
External reference
Accuracy certificates for computational problems with convex structure
10.1287/moor.1090.0427 · 2010 · External reference
Unresolved reference
1983 · External reference
Complexity estimates of some cutting plane methods based on the analytic barrier
10.1007/bf01585556 · 1995 · External reference
10.1007/978-1-4419-8853-9
10.1007/978-1-4419-8853-9 · 2004 · External reference
Unresolved reference
External reference
10.1137/1.9781611970791
10.1137/1.9781611970791 · 1994 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
External reference
Consistent probabilistic outputs for protein function prediction
10.1186/gb-2008-9-s1-s6 · 2008 · External reference
A faster strongly polynomial time algorithm for submodular function minimization
10.1007/s10107-007-0189-2 · 2009 · External reference
On the Lasso and its dual
10.1080/10618600.2000.10474883 · 2000 · External reference
Level set methods
10.1007/0-387-21810-6_1 · 2003 · External reference
10.1137/1.9780898719109
10.1137/1.9780898719109 · 2006 · External reference
Minimizing symmetric submodular functions
10.1007/bf01585863 · 1998 · External reference
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
10.1007/3-540-59408-6_60 · 1995 · External reference
Convex approaches to model wavelet sparsity patterns
10.1109/icip.2011.6115845 · 2011 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
1997 · External reference
The reduced monotonic regression method
10.1080/01621459.1997.10473609 · 1997 · External reference
Convex structure learning in log-linear models: Beyond pairwise potentials
2010 · External reference
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
10.1006/jctb.2000.1989 · 2000 · External reference
Unresolved reference
2004 · External reference
Unresolved reference
External reference
Bayesian inference and optimal design for the sparse linear model
2008 · External reference
10.1017/cbo9780511809682
10.1017/cbo9780511809682 · 2004 · External reference
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
10.1145/990308.990310 · 2004 · External reference
Collaborative hierarchical sparse modeling
10.21236/ada519655 · 2010 · External reference
10.1017/cbo9781139058520
10.1017/cbo9781139058520 · 2011 · External reference
Efficient minimization of decomposable submodular functions
2010 · External reference
Learning Fourier sparse set functions
2012 · External reference
An online algorithm for maximizing submodular functions
10.21236/ada476748 · 2007 · External reference
Balancing applied to maximum network flow problems
10.1007/11841036_55 · 2006 · External reference
Bundle methods for regularized risk minimization
2010 · External reference
Regression shrinkage and selection via the Lasso
10.1111/j.2517-6161.1996.tb02080.x · 1996 · External reference
Sparsity and smoothness via the fused Lasso
10.1111/j.1467-9868.2005.00490.x · 2005 · External reference
Unresolved reference
2001 · External reference
Sparse structured dictionary learning for brain resting-state activity modeling
2010 · External reference
10.1561/2200000001 · 2008 · Admitted local publication
Finding the nearest point in a polytope
10.1007/bf01580381 · 1976 · External reference
Maximising real-valued submodular functions: Primal and dual heuristics for location problems
10.1287/moor.7.3.410 · 1982 · External reference
Sparse reconstruction by separable approximation
10.1109/tsp.2009.2016892 · 2009 · External reference
On the non-negative garrotte estimator
10.1111/j.1467-9868.2007.00581.x · 2007 · External reference
The concave–convex procedure
10.1162/08997660360581958 · 2003 · External reference
Accelerated training for matrix-norm regularization: A boosting approach
2012 · External reference
On characterization of entropy function via information inequalities
10.1109/18.681320 · 1998 · External reference
Grouped and hierarchical model selection through composite absolute penalties
10.1214/07-aos584 · 2009 · External reference
On model selection consistency of Lasso
2006 · External reference
The expressive power of binary submodular functions
10.1016/j.dam.2009.07.001 · 2009 · External reference
