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 46 for “"Submodular Functions"”.

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

  2. SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA

    This thesis is a study of the faces of certain combinatorially ­defined polyhedra. In particular, we examine the vertices and facets of these polyhedra. Chapter 2 contains the essential mathematical background in polyhedral theory, linear programming and graph theory. We also discuss the existence …

    waterloo Repository record for SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA (opens in a new tab)

  3. Towards Unsupervised Learning of Submodular Functions for Summarization

    … way to extract this information. In the past, submodular functions have been successfully used for summarizing data. These functions can be defined based on domain knowledge or can be learned from the data itself. However, supervised learning of submodular functions faces an obstacle as there …

    washington Repository record for Towards Unsupervised Learning of Submodular Functions for Summarization (opens in a new tab)

  4. On Fine-Tuning Submodular Functions for Data Subset Selection

    We demonstrate that submodular functions, with fine-tuned hyperparameters, serve as extremely effectivedata subset (i.e., summary) selectors, better than the current state-of-the-art, for training machine learning systems on data subsets. To search and reduce the hyperparameter space, we introduce …

    washington Repository record for On Fine-Tuning Submodular Functions for Data Subset Selection (opens in a new tab)

  5. Optimization and separation for structured submodular functions with constraints

    … 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 structural …

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

  6. Higher-order inference in conditional random fields using submodular functions

    … of pixels. In this thesis, we look at how submodular functions can help us designing efficient inference methods for higher-order and dense CRFs. Submodular functions are special discrete functions that have important properties from an optimisation perspective, and are closely related to …

    oxford Repository record for Higher-order inference in conditional random fields using submodular functions (opens in a new tab)

  7. DRAG: Diversity in Retrieval Augmented Generation through the Application of Submodular Functions

    This thesis applies a submodular approach to the reranking stage of Retrieval Augmented Generation to balance the relevance and diversity of the retrieved documents. After initial retrieval using Contriever, we experiment with submodular functions and a baseline of Maximal Marginal Relevance (MMR), …

    washington Repository record for DRAG: Diversity in Retrieval Augmented Generation through the Application of Submodular Functions (opens in a new tab)

  8. The complexity and expressive power of valued constraints

    … of valued constraints and the associated cost functions with respect to the question of which of these classes can be expressed using only cost functions of bounded arities. We identify the first known example of an infinite chain of classes of constraints with strictly increasing expressive …

    oxford Repository record for The complexity and expressive power of valued constraints (opens in a new tab)

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

  10. Submodularity in Natural Language Processing: Algorithms and Applications

    … problems challenge to solve. On the other hand, submodularity, also known as the discrete analogous of convexity, makes many combinatorial optimization problems either tractable or approximable where otherwise neither would be possible. Whether submodularity is applicable to natural language …

    washington Repository record for Submodularity in Natural Language Processing: Algorithms and Applications (opens in a new tab)

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

    … tasks in machine learning involve objective functions that exhibit a Diminishing Returns (DR) property, i.e., the marginal gain of increasing the input gets smaller as the input gets larger. For instance, in document summarization, the goal is to select a small subset of sentences that …

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

  12. Arithmetic Combinations of Submodular and Supermodular Optimization and Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry

    Submodular functions have recently shown utility for a number of machine learning applications such as information gathering, document summarization, image segmentation, and string alignment, since they are natural for modeling concepts such as diversity, information, and representativeness. …

    washington Repository record for Arithmetic Combinations of Submodular and Supermodular Optimization and Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry (opens in a new tab)

  13. Combinatorial Algorithms for Submodular Function Minimization and Related Problems

    Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a number of other combinatorial optimization …

    waterloo Repository record for Combinatorial Algorithms for Submodular Function Minimization and Related Problems (opens in a new tab)

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

  15. Text summarization using transfer learnin: Extractive and abstractive summarization using BERT and GPT-2 on news and podcast data

    … and abstractive. The former approach utilizes submodular functions and the language representation model BERT, while the latter uses the language model GPT-2. We operate on two types of datasets: CNN/DailyMail, a benchmarked news article dataset and Podcast, a dataset comprised of podcast …

    chalmers Repository record for Text summarization using transfer learnin: Extractive and abstractive summarization using BERT and GPT-2 on news and podcast data (opens in a new tab)

  16. LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING

    … a sum-max function, a rich subclass of monotone submodular functions. We design an algorithm for this bandit problem, and prove it achieves significant improvement in regret with respect to standard algorithms for monotone submodular functions. Finally, we consider the Stochastic Shortest Path …

    milano Repository record for LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING (opens in a new tab)

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

  18. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization

    … bipartite matching problem and the constrained submodular function maximization problem. In the first part of this thesis, we consider novel polyhedral approaches for the i.i.d. online variant of the classical bipartite matching problem defined as follows: one side of the bipartition is fixed …

    gatech Repository record for Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization (opens in a new tab)

  19. Allocation problems with partial information

    … multiple agents having complex non-linear cost functions. This presents an additional obstacle since the support for the cost functions may be extremely large entailing oracle access. We show tight information theoretic lower bounds for the general class of submodular functions and also extend …

    gatech Repository record for Allocation problems with partial information (opens in a new tab)

Page 1 of 3