paper-with-me

Papers

Max-Sum Diversification, Monotone Submodular Functions and Semi-metric Spaces

2015-11-07 · Sepehr Abbasi Zadeh, Mehrdad Ghadiri

In many applications such as web-based search, document summarization, facility location and other applications, the results are preferable to be both representative and diversified subsets of documents. The goal of this study is to select a good "quality", bounded-size subset of a given set of items, while maintaining their diversity relative to a semi-metric distance function. This problem was first studied by Borodin et al\cite{borodin}, but a crucial property used throughout their proof is the triangle inequality. In this modified proof, we want to relax the triangle inequality and relate the approximation ratio of max-sum diversification problem to the parameter of the relaxed triangle inequality in the normal form of the problem (i.e., a uniform matroid) and also in an arbitrary matroid.

📄 PDF Abstract BibTeX arXiv:1511.02402

Code (0)

등록된 구현이 없습니다.

Tasks

DiversityDocument Summarization

Similar Papers 제목 키워드 기반

Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates

2016-11-25 · Borodin Allan, Jain Aadhar, Lee Hyun Chul, Ye Yuli

Result diversification is an important aspect in web-based search, document summarization, facility location, portfolio management and other applications. Given a set of ranked results for a set of objects (e.g. web docu…

Document SummarizationManagement

A Parameterized Family of Meta-Submodular Functions

2020-06-23 · Mehrdad Ghadiri, Richard Santiago, Bruce Shepherd

Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of …

Diversity

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization

2024-03-15 · Mohammad Pedramfar, Yididiya Y. Nadew, Christopher J. Quinn, Vaneet Aggarwal

This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-mo…

Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences

2021-04-20 · Chao Qian, Dan-Xuan Liu, Chao Feng, Ke Tang

Evolutionary algorithms (EAs) are general-purpose optimization algorithms, inspired by natural evolution. Recent theoretical studies have shown that EAs can achieve good approximation guarantees for solving the problem c…

Document SummarizationEvolutionary AlgorithmsRecommendation Systems

Stochastic $k$-Submodular Bandits with Full Bandit Feedback

2024-12-14 · Guanyu Nie, Vaneet Aggarwal, Christopher John Quinn

In this paper, we present the first sublinear $\alpha$-regret bounds for online $k$-submodular optimization problems with full-bandit feedback, where $\alpha$ is a corresponding offline approximation ratio. Specifically,…