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 22 for “"Submodularity"”.
-
Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity
Search is an essential technology for various robotic applications and it is also central to human daily activities. Searching for targets efficiently consists of NP-hard problems, but young children can search for targets very efficiently . How humans search for targets efficiently is still a …
-
Flows, Submodularity, Sparsity, and Beyond: Continuous Optimization Insights for Discrete Problems
In this thesis we build on connections between discrete and continuous optimization. In the first part of the thesis we propose faster second-order convex optimization algorithms for classical graph algorithmic problems. Our main contribution is to show that the runtime of interior point methods is …
-
Optimal transport in structured domains : algorithms and applications
… generalization of the cost objective based on submodularity is proposed.
-
Efficient and robust resource allocation for network function virtualization
… theory and utilize the property of sequence submodularity along with the primal-dual technique to design two approximation algorithms. Finally, we perform extensive trace-driven simulations to show the effectiveness of the proposed algorithms. While the NFV paradigm offers great flexibility …
-
A reformulated approach to attribute-aware sampling on large networks
… of a previous work and take advantage of the submodularity property to reduce the computation that needs to be done when selecting a node and make some arguments about the efficiency and effectiveness of such a strategy. We test our algorithm on some real world data sets and found that our …
-
M♮-convexity, S-convexity, and their applications in operations
… of the optimal solutions or preservation of submodularity under the optimization operations. Yet, this task is challenging because the classical and commonly used results in lattice programming, applicable to optimization models with supermodular objective function maximization, does not …
-
The Sum-Product Theorem and its Applications
… Third, I combine decomposability with submodularity to define submodular field grammars (SFGs), a novel class of probabilistic models that extends both sum-product networks and submodular Markov random fields. SFGs define a novel stochastic image grammar in which each object in the …
-
Focused active inference
… a technical diminishing returns condition called submodularity, which is typically used to bound the performance of greedy selection. This thesis introduces the concept of submodular relaxations, which can be used to generate online-computable performance bounds, and analyzes the class of optimal …
-
Assortment and inventory optimization : from predictive choice models to near-optimal algorithms
… structural properties, such as weak notions of submodularity. Building on these findings, we develop efficient and yet conceptually-simple approximation algorithms for common parametric and nonparametric choice models. Among notable results, we provide best-possible approximations under general …
-
Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution
… necessary optimality conditions, prove the submodularity of the profit function, develop polynomial-time approximation algorithms, and show their performance guarantees. Our numerical investigation demonstrates the effectiveness of the proposed algorithms and, furthermore, reveals several …
-
Finding Interesting Subgraphs with Guarantees
… complexity, convex optimization, and submodularity optimization. These techniques are well-known in the algorithm design literature, but they lead to slow and impractical algorithms. One unifying theme in the problems that we study is that our methods are scalable without sacrificing …
-
Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system
… Our approach proceeds by investigating the submodularity of the complement of the idle time function. We thereby show that the set defined by the timely-throughput constraints is a polymatroid, from which the optimality within the class of periodwise static priority poli- cies follows. The …
-
Submodular Optimization in Multi-Robot Teams: Robustness, Resilience, and Decentralization
… constraints. By utilizing the properties of submodularity, we aim to develop a solution with performance guarantees. This motivating example demonstrates how to use a submodular function and matroids to model and solve decision-making problems in multi-robot systems. Based on this framework, …
-
Statistical models and decision making for robotic scientific information gathering
… periodic secretary algorithm by leveraging the submodularity of the information-theoretic reward function. Finally, we demonstrate the robustness of the proposed approach by employing the periodic secretary algorithm to select samples irrevocably from a seven-year oceanographic data stream …
-
Statistical models and decision making for robotic scientific information gathering
… periodic secretary algorithm by leveraging the submodularity of the information-theoretic reward function. Finally, we demonstrate the robustness of the proposed approach by employing the periodic secretary algorithm to select samples irrevocably from a seven-year oceanographic data stream …
-
Stochastic singular control: existence, characterization and approximation of solutions in cost minimization problems and games
… relation on the state and measure space. The submodularity assumption allows us to prove existence of solutions via an application of Tarski's fixed point theorem, covering cases with discontinuous dependence on the measure variable. Also, it ensures that the set of solutions enjoys a lattice …
-
Choice modeling and recommendation optimization in presence of context effects
… verifiable conditions for the monotonicity and submodularity of the assortment optimization objective in order to provide some approximation guarantees. Second, we propose a utility based listwise logistic regression model, which is applicable in estimating the context effects in dense data sets …
-
Parsimonious, Risk-Aware, and Resilient Multi-Robot Coordination
… by means of submodular function optimization. Submodularity encodes the diminishing returns property that arises in multi-robot coordination. For example, the marginal gain of assigning an additional robot to track the same target diminishes as the number of robots assigned increases. The …
-
LOG-SUPERMODULARITY OF WEIGHT FUNCTIONS AND THE LOADING MONOTONICITY OF WEIGHTED INSURANCE PREMIUMS
The thesis is motivated by a problem concerning the monotonicity of insurance premiums with respect to their loading parameter: the larger the parameter, the larger the insurance premium is expected to be. This property, usually called loading monotonicity, is satisfied by premiums that appear in …
-
Algorithms for interactive, distributed and networked systems
In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation requirements. For example, data center facilities -- workhorses of today's internet -- have evolved to house upward of several …
Page 1 of 2