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 37 for “"submodular maximization"”.

  1. Submodular Maximization Subject to Information Constraints

    In general, submodular maximization is relevant in many problems in controls, robotics and machine learning, because it models many computationally difficult problems. A simple greedy strategy can provide strong approximation guarantees for many of these problems. We wish to expand the set of …

    waterloo Repository record for Submodular Maximization Subject to Information Constraints (opens in a new tab)

  2. Resilient Submodular Maximization For Control And Sensing

    … traditional approaches to matroid-constrained maximization have met great success in machine learning and facility location, they are unable to meet the aforementioned problem of actuator placement. In addition, although traditional approaches to sensor selection enable Kalman filtering …

    penn Repository record for Resilient Submodular Maximization For Control And Sensing (opens in a new tab)

  3. Beyond submodular maximization : one-sided smoothness and meta-submodularity

    … there are well-developed tools for maximizing a submodular function f(S) subject to a matroid constraint S ∈ ℳ, there is much less work on the corresponding supermodular maximization problems. We develop new techniques for attacking these problems inspired by the continuous greedy method applied …

    ubc Repository record for Beyond submodular maximization : one-sided smoothness and meta-submodularity (opens in a new tab) Download PDF for Beyond submodular maximization : one-sided smoothness and meta-submodularity (opens in a new tab)

  4. Efficient algorithms for online resource allocation and submodular maximization

    … optimization problems in online allocation and submodular maximization. We focus on algorithms that obtain strong theoretical guarantees without sacrificing practicality. We design algorithms with improved approximation guarantees and fast end-to-end running time. Our algorithms for the online …

    bu Repository record for Efficient algorithms for online resource allocation and submodular maximization (opens in a new tab)

  5. Bandit learning with non-linear rewards: Submodularity and beyond

    … to solve the CMAB problem with stochastic submodular rewards and full-bandit feedback; presenting a general framework for adapting offline algorithms to CMAB problems, applying them to ($k$-)submodular maximization problems under multiple settings by analyzing the robustness of the …

    iastate Repository record for Bandit learning with non-linear rewards: Submodularity and beyond (opens in a new tab)

  6. 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)

  7. 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)

  8. Online Decision Making: DR-Submodular Objectives and Stochastic Linear Constraints

    In this thesis, we consider online continuous DR-submodular maximization with linear stochastic long-term constraints. Compared to the prior work on online submodular maximization \cite{chenOnlineContinuousSubmodular2018}, our setting introduces the extra complication of stochastic linear …

    washington Repository record for Online Decision Making: DR-Submodular Objectives and Stochastic Linear Constraints (opens in a new tab)

  9. Discrete and Continuous Optimization for Collaborative and Multi-task Learning

    … learning, specifically addressing convex-submodular problems in mixed continuous-discrete domains. The seventh chapter tackles the challenge of limited information access in collaborative problems with distributed constraints, developing optimal algorithms for submodular maximization under …

    penn Repository record for Discrete and Continuous Optimization for Collaborative and Multi-task Learning (opens in a new tab)

  10. Data collection for robust machine learning in multi-agent systems

    … and curation in multi-robot systems, grounded in submodular optimization, active learning, and game-theoretic coordination. First, it introduces a game-theoretic framework for decentralized data selection, where robots are modeled as independent players that compute upload strategies that …

    texas Repository record for Data collection for robust machine learning in multi-agent systems (opens in a new tab)

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

    … diagnosis. Among discrete optimization problems, submodular optimization stands out as particularly important, arising in numerous real-world applications including influence maximization in recommendation systems, data summarization, and neural network pruning. The study of submodular …

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

  12. 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)

  13. 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)

  14. 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)

  15. Submodularity in Dynamics and Control of Networked Systems

    … intractable in general. This thesis presents a submodular optimization framework to selecting leader nodes for control of networked systems. We investigate the problem of selecting a subset of leader nodes in order to minimize node state errors due to noise in the communication links between …

    washington Repository record for Submodularity in Dynamics and Control of Networked Systems (opens in a new tab)

  16. The Diminishing Returns (DR) Property and Its Applications in Machine Learning

    … the DR property. These functions are called submodular set functions and continuous DR-submodular functions respectively. This dissertation presents several contributions to various online and offline maximization problems in machine learning where the utility functions satisfy the DR …

    washington Repository record for The Diminishing Returns (DR) Property and Its Applications in Machine Learning (opens in a new tab)

  17. Using Neural Networks to Maximize a Submodular Function

    … exploring. The most appealing point we see in a submodular set function has to be its natural diminishing returns property. This property makes the group of submodular functions fit in some of the real world machine learning optimization problems, where the problem objective functions are sharing …

    tamu Repository record for Using Neural Networks to Maximize a Submodular Function (opens in a new tab)

  18. Algorithmic, game theoretic and learning theoretic aspects of distributed optimization

    … of coresets. Finally we consider a problem of submodular maximization where the objective function has been distributed among agents. We adapt a centralised approximation algorithm to the distributed setting with efficient communication between the agents.

    gatech Repository record for Algorithmic, game theoretic and learning theoretic aspects of distributed optimization (opens in a new tab)

  19. Submodular optimization problems in the context of social influence

    … this model, we formulate and study the attitude maximization problem. We prove that the function for computing attitude is monotonic and sub-modular, and the attitude maximization problem is NP-Hard. We present a greedy algorithm for maximization with an approximation guarantee of $(1-1/e)$. In …

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

Page 1 of 2