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 20 of 51 for “"Submodular optimization"”.

  1. SUBMODULAR OPTIMIZATION AND ITS APPLICATIONS

    … concept of supermodularity whose "'twin" concept submodularity was first studied in relation to matriods. Interestingly recent progress has shown that many aspects of submodularity seem to mirror many important properties of convexity in "continuous" optimization. In this sense, we may regard …

    nus Repository record for SUBMODULAR OPTIMIZATION AND ITS APPLICATIONS (opens in a new tab) Download file for SUBMODULAR OPTIMIZATION AND ITS APPLICATIONS (opens in a new tab)

  2. Submodular Optimization and Data Processing

    … this dissertation, we investigate how to apply submodularity to these two data processing paradigms. In the first part of this thesis, we study the connection of submodularity to the data summarization paradigm. First we show that data summarization subsumes a number of applications, including …

    washington Repository record for Submodular Optimization and Data Processing (opens in a new tab)

  3. Submodular Optimization in Location-Based Social Networks

    … As an important research topic in LBSN, submodular optimization in location-based social networks (SO-LBSN) has been considered by many studies, because it is useful in applications such as service location selection, marketing, and tourist trip planning. However, due to the rich …

    unsw Repository record for Submodular Optimization in Location-Based Social Networks (opens in a new tab)

  4. Constrained submodular optimization and applications in information diffusion

    Optimization problems involving submodular functions naturally arise in various application domains such as Information Diffusion, Machine Learning, and Sensor Placement. In this thesis, we study the constrained optimization of submodular functions with an emphasis on applications in Information …

    iastate Repository record for Constrained submodular optimization and applications in information diffusion (opens in a new tab)

  5. Approximation algorithms for submodular optimization and graph problems

    In this thesis, we consider combinatorial optimization problems involving submodular functions and graphs. The problems we study are NP-hard and therefore, assuming that P =/= NP, there do not exist polynomial-time algorithms that always output an optimal solution. In order to cope with the …

    uiuc Repository record for Approximation algorithms for submodular optimization and graph problems (opens in a new tab)

  6. Submodular Optimization for Power System Control and Stability

    … the corrective controls are often combinatorial optimization 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 …

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

  7. Performance bounds for greedy strategies in submodular optimization problems

    To view the abstract, please see the full text of the document.

    colostate Repository record for Performance bounds for greedy strategies in submodular optimization problems (opens in a new tab)

  8. DISTRIBUTED SUBMODULAR OPTIMIZATION FOR A UXV NETWORKED CONTROL SYSTEM

    … prohibitive. In this thesis, we explore using submodularity to solve this problem. This approach gives near-optimality guarantees while reducing the complexity of the problem, allowing solutions to be found in near real-time. A simple, novel distributed submodular approach to NCS control was …

    nps Repository record for DISTRIBUTED SUBMODULAR OPTIMIZATION FOR A UXV NETWORKED CONTROL SYSTEM (opens in a new tab)

  9. Submodular optimization problems in the context of social influence

    … unlike that for computing attitude, is non-submodular and however is \emph{approximately submodular}. We present an approximation algorithm for maximizing actionable attitude in a network. In the second problem, we consider identifying the number of individuals in the network with attitudes …

    iastate Repository record for Submodular optimization problems in the context of social influence (opens in a new tab)

  10. Submodular optimization with constraints and fairness: Algorithmic advances and applications

    Submodular function optimization is a fundamental tool for modeling complex interactions in machine learning and graph mining. In this thesis, we investigate constrained submodular maximization problems, their variants, and $k$-submodular maximization problems with size constraints and fairness …

    iastate Repository record for Submodular optimization with constraints and fairness: Algorithmic advances and applications (opens in a new tab)

  11. Submodular Optimization in Multi-Robot Teams: Robustness, Resilience, and Decentralization

    … those problems are studied in the combinatorial optimization domain with the help of submodular and matroid optimization techniques. As a motivating example, we use a multi-robot environmental monitoring problem to extract the general formulation of a multi-robot decision-making problem. Consider …

    vt Repository record for Submodular Optimization in Multi-Robot Teams: Robustness, Resilience, and Decentralization (opens in a new tab)

  12. Understanding human genome regulation through entropic graph-based regularization and submodular optimization

    … Second, I present new methods from the field of submodular optimization. Due to the high cost of sequencing-based genomics assays such as ChIP-seq and DNase-seq, a panel of at most 3-10 assays is usually performed on each cell type. I present submodular selection of assays (SSA), a method for …

    washington Repository record for Understanding human genome regulation through entropic graph-based regularization and submodular optimization (opens in a new tab)

  13. Distributionally Ambiguous Stackelberg Combinatorial Games for Submodular Optimization and Camera View-Frame Placement

    … defender's recourse is a complex com- binatorial optimization problem and the attacker faces uncertainty and distributional am- biguity. We analyze these games through two complementary frameworks. Distributionally Robust Optimization (DRO) framework provides a risk-averse attacker with robust …

    vt Repository record for Distributionally Ambiguous Stackelberg Combinatorial Games for Submodular Optimization and Camera View-Frame Placement (opens in a new tab)

  14. Submodular Optimization and Machine Learning: Theoretical Results, Unifying and Scalable Algorithms, and Applications

    … unifying and scalable algorithms for a number of submodular optimization problems, and connect them to several machine learning applications. These optimization problems include, 1. Constrained and Unconstrained Submodular Minimization, 2. Constrained and Unconstrained Submodular Maximization, 3. …

    washington Repository record for Submodular Optimization and Machine Learning: Theoretical Results, Unifying and Scalable Algorithms, and Applications (opens in a new tab)

  15. A submodular optimization framework for never-ending learning : semi-supervised, online, and active learning.

    … data. In this work we have developed a unified optimization based learning framework that approaches many of the challenges mentioned earlier. Specifically, we developed a Never-Ending Learning framework which combines incremental/online, semi-supervised, and active learning under a unified …

    louisville Repository record for A submodular optimization framework for never-ending learning : semi-supervised, online, and active learning. (opens in a new tab)

  16. Submodular Cover and Maximization: Approximation Algorithms, Bandit Feedback, and Reinforcement Learning

    … science and artificial intelligence, discrete optimization has become fundamental to applications ranging from high-volume tasks like online advertising, training data selection, and clustering, to high-impact domains such as medical diagnosis. Among discrete optimization problems, submodular …

    tamu Repository record for Submodular Cover and Maximization: Approximation Algorithms, Bandit Feedback, and Reinforcement Learning (opens in a new tab)

  17. Active Learning and Submodular Functions

    … learning algorithm decides what data is labeled. Submodular functions are a class of set functions for which many optimization problems have efficient exact or approximate algorithms. We examine their connections. 1. We propose a new class of interactive submodular optimization problems which …

    washington Repository record for Active Learning and Submodular Functions (opens in a new tab)

  18. Submodular Data Selection and Augmentation for Resource-Efficient Learning

    … MLLMs. We explore two complementary approaches—submodular data selection and data augmentation—to enhance the efficiency of ML systems without compromising model performance. The first approach leverages submodular optimization to model diversity, representativeness, and relevance in selecting …

    washington Repository record for Submodular Data Selection and Augmentation for Resource-Efficient Learning (opens in a new tab)

  19. Differentiable and Robust Optimization Algorithms

    … appropriate structure or constraints onto optimization problems is often the key to deriving guarantees or improving generalization of performance aspects like generalization or interpretability. The main contribution of this dissertation is developing algorithms that can leverage …

    washington Repository record for Differentiable and Robust Optimization Algorithms (opens in a new tab)

  20. Optimization and separation for structured submodular functions with constraints

    Various kinds of optimization problems involve nonlinear functions of binary variables that exhibit a property of diminishing marginal returns. Such a property is known as submodularity. Vast amount of work has been devoted to the problem of submodular optimization. In this thesis, we exploit …

    gatech Repository record for Optimization and separation for structured submodular functions with constraints (opens in a new tab)

Page 1 of 3