Results 51 to 60 of about 9,788 (160)
Optimal approximation for submodular and supermodular optimization with bounded curvature [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish to maximize a monotone increasing submodular function or minimize a monotone decreasing supermodular function with a bounded total curvature c ...
Sviridenko, M, Vondrák, J, Ward, J
openaire +4 more sources
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Resilient Monotone Submodular Function Maximization
, 2017 In this paper, we focus on applications in machine learning, optimization, and control that call for the resilient selection of a few elements, e.g. features, sensors, or leaders, against a number of adversarial denial-of-service attacks or failures.
Gatsis, Konstantinos +3 more
core +1 more source
Submodular Optimization under Noise
, 2016 We consider the problem of maximizing a monotone submodular function under noise. There has been a great deal of work on optimization of submodular functions under various constraints, resulting in algorithms that provide desirable approximation guarantees.
Hassidim, Avinatan, Singer, Yaron
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
Symmetric Submodular Function Minimization Under Hereditary Family Constraints
, 2010 We present an efficient algorithm to find non-empty minimizers of a symmetric submodular function over any family of sets closed under inclusion. This for example includes families defined by a cardinality constraint, a knapsack constraint, a matroid ...
Goemans, Michel X., Soto, José A.
core +2 more sources
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
International Economic Review, EarlyView.ABSTRACT We examine a two‐stage selling mechanism design problem, where the buyer makes her report and the seller endogenously decides his effort (hidden investment) to generate a possibly better outside offer. The optimal mechanism shows that the seller's effort depends on the reported value of the buyer; a higher value lowers the seller's incentive ...
Xiaogang Che +3 more
wiley +1 more source
Submodular Optimization for Voltage Control
IEEE Transactions on Power Systems, 2018 Voltage instability occurs when a power system is unable to meet the reactive power demand, and is typically corrected by switching on additional reactive power devices such as capacitor banks. Real-time monitoring and communication technologies can potentially improve voltage stability by enabling the rapid detection of low voltages and the ...
Zhipeng Liu +5 more
openaire +1 more source
Same/Other/All K‐Fold Cross‐Validation for Estimating Similarity of Patterns in Data Subsets
Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 1, February 2026.ABSTRACT In many real‐world applications of machine learning, we are interested to know if it is possible to train on the data that we have gathered so far, and obtain accurate predictions on a new test data subset that is qualitatively different in some respect (time period, geographic region, etc.).
Toby Dylan Hocking +5 more
wiley +1 more source
Optimal Deterministic Polynomial-Time Data Exchange for Omniscience [PDF]
, 2011 We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as side-information.
Gastpar, Michael +4 more
core