English
Related papers

Related papers: Balancing Utility and Fairness in Submodular Maxim…

200 papers

The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a…

Data Structures and Algorithms · Computer Science 2018-05-21 Alan Kuhnle , J. David Smith , Victoria G. Crawford , My T. Thai

Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of…

Computer Science and Game Theory · Computer Science 2015-03-10 Abhinav Sinha , Achilleas Anastasopoulos

In this work, we treat the problem of multi-task submodular optimization from the perspective of local distributional robustness within the neighborhood of a reference distribution which assigns an importance score to each task. We…

Machine Learning · Computer Science 2026-03-06 Ege C. Kaya , Abolfazl Hashemi

The discovery of utility-driven patterns is a useful and difficult research topic. It can extract significant and interesting information from specific and varied databases, increasing the value of the services provided. In practice, the…

Databases · Computer Science 2022-12-21 Gengsen Huang , Wensheng Gan , Philip S. Yu

In the problem of Submodular Max-Min Allocation, we are given a set of items, a set of players, and monotone submodular valuation functions that represent the satisfaction of a player with a certain subset of items. The goal is to find an…

Data Structures and Algorithms · Computer Science 2026-04-15 Kimon Boehmer

Monotonicity constraints are powerful regularizers in statistical modelling. They can support fairness in computer-aided decision making and increase plausibility in data-driven scientific models. The seminal min-max (MM) neural network…

Machine Learning · Computer Science 2024-05-28 Christian Igel

In this work, we consider a nonsmooth minimisation problem in which the objective function can be represented as the maximum of finitely many smooth ``subfunctions''. First, we study a smooth min-max reformulation of the problem. Due to…

Optimization and Control · Mathematics 2024-04-17 Charl Ras , Matthew Tam , Daniel Uteda

Given a collection of monotone submodular functions, the goal of Two-Stage Submodular Maximization (2SSM) [Balkanski et al., 2016] is to restrict the ground set so an objective selected u.a.r. from the collection attains a high maximal…

Data Structures and Algorithms · Computer Science 2025-10-23 Iasonas Nikolaou , Miltiadis Stouras , Stratis Ioannidis , Evimaria Terzi

Resilient submodular maximization refers to the combinatorial problems studied by Nemhauser and Fisher and asks how to maximize an objective given a number of adversarial removals. For example, one application of this problem is multi-robot…

Systems and Control · Electrical Eng. & Systems 2021-05-12 Micah Corah

Driven by green communications, energy efficiency (EE) has become a new important criterion for designing wireless communication systems. However, high EE often leads to low spectral efficiency (SE), which spurs the research on EE-SE…

Networking and Internet Architecture · Computer Science 2016-05-10 Lei Deng , Wenjie Zhang , Yun Rui , Yeo Chai Kiat

Recent studies showed that datasets used in fairness-aware machine learning for multiple protected attributes (referred to as multi-discrimination hereafter) are often imbalanced. The class-imbalance problem is more severe for the often…

Machine Learning · Computer Science 2022-06-22 Arjun Roy , Vasileios Iosifidis , Eirini Ntoutsi

Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fairness criteria have been taken into account in this setting.…

Social and Information Networks · Computer Science 2023-02-28 Ruben Becker , Gianlorenzo D'Angelo , Sajjad Ghobadi

In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications…

Data Structures and Algorithms · Computer Science 2018-05-25 Rad Niazadeh , Tim Roughgarden , Joshua R. Wang

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…

Data Structures and Algorithms · Computer Science 2016-11-08 Avinatan Hassidim , Yaron Singer

We consider the problem of subset selection where one is given multiple rankings of items and the goal is to select the highest ``quality'' subset. Score functions from the multiwinner voting literature have been used to aggregate rankings…

Computers and Society · Computer Science 2023-06-19 Niclas Boehmer , L. Elisa Celis , Lingxiao Huang , Anay Mehrotra , Nisheeth K. Vishnoi

CMO Council reports that 71\% of internet users in the U.S. were influenced by coupons and discounts when making their purchase decisions. It has also been shown that offering coupons to a small fraction of users (called seed users) may…

Social and Information Networks · Computer Science 2018-02-23 Shaojie Tang

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum…

Computational Complexity · Computer Science 2009-02-03 Jon Lee , Vahab Mirrokni , Viswanath Nagarjan , Maxim Sviridenko

Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we…

Data Structures and Algorithms · Computer Science 2011-01-18 Ariel Kulik , Hadas Shachnai , Tami Tamir

Motivated by practical applications, recent works have considered maximization of sums of a submodular function $g$ and a linear function $\ell$. Almost all such works, to date, studied only the special case of this problem in which $g$ is…

Data Structures and Algorithms · Computer Science 2022-04-08 Kobi Bodek , Moran Feldman

We study the problem of extracting a small subset of representative items from a large data stream. In many data mining and machine learning applications such as social network analysis and recommender systems, this problem can be…

Data Structures and Algorithms · Computer Science 2021-02-15 Yanhao Wang , Francesco Fabbri , Michael Mathioudakis
‹ Prev 1 8 9 10 Next ›