Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Weak Submodularity"”.

  1. Graph analytics and subset selection problems in machine learning

    … maximization. We extend an earlier concept of weak submodularity from the setting of sparse linear regression to a broad class of objective functions, including generalized linear model likelihoods. We then show that three greedy algorithms (Oblivous, Forward Stepwise, and Orthogonal Matching …

    texas Repository record for Graph analytics and subset selection problems in machine learning (opens in a new tab)

  2. Submodular Optimization for Power System Control and Stability

    … problems which are NP-hard to solve. Submodularity is a diminishing-return property of set functions which is analogous to the convexity of continuous functions. A combinatorial optimization problem that possesses submodularity can often be solved by greedy algorithms effectively with …

    washington Repository record for Submodular Optimization for Power System Control and Stability (opens in a new tab)