A survey of submodular functions maximization. Yao Zhang 03/19/2015
|
|
- Baldwin Hart
- 6 years ago
- Views:
Transcription
1 A survey of submodular functions maximization Yao Zhang 03/19/2015
2 Example Deploy sensors in the water distribution network to detect contamination F(S): the performance of the detection when a set S of places is selected 2
3 Definition of submodular functions finite ground set V={1,2,...n} set function f(s): Marginal gain: Submodular: diminishing return 3
4 Definition of submodular functions Modular function: Supermodular 4
5 Examples of submodular function Deploy sensors in the water distribution network to detect contamination 5 From Krause s survey
6 Examples of submodular function From Krause s survey Weighted coverage functions Entropy Mutual information Cut capacity functions Influence function (Kempe 03) f(s): the expected number of infected nodes when nodes in S are infected at the start Propagation model Linear threshold Independent Cascade 6
7 Properties of submodular function Linear combination if set functions F 1,...,F m are submodular functions, and a 1,...,a m >0 then Concavity is submodular 7
8 Submodularity optimization Except for the submodularity, we assume: 1. Monotonically non-decreasing 2. 8
9 Summary of submodularity optimization For more details, see 9 Focus on this part
10 Maximization of submodular functions Problem: Simplest constraint cardinality constraints for a given k, we require that Greedy algorithm 10
11 11 Greedy Algorithm
12 Matroid constraints Greedy algorithm is an ½-approximation algorithm 12
13 Knapsack constraint Knapsack constraint: Greedy Algorithms: Analysis: Scb: the solution provided by the cost-benefit greedy algorithm Suc: the solution returned by returned by the uniform cost 13 [Leskovec et al. KDD 2007]
14 Speeding up the greedy algorithm Lazy evaluation [Leskovec et al. KDD 2007] First iteration as usual Keep an order list of marginal gain Δi from the previous iteration Re-evaluate the marginal gain only for top element i if Δi stays on top, user it, otherwise re-sort Sorted list in the descending order: t, s at i-th iteration In the (i+1)-th iteration: 14
15 Fast algorithms Summary: Randomized Greedy w is the threshold 15 Badanidiyuru, Ashwinkumar, and Jan Vondrák. "Fast algorithms for maximizing submodular functions." SODA2014.
16 Lazier Than Lazy Greedy Random Sampling Cardinality Constraint Analysis: (1-1/e-ε) approximation 16 Mirzasoleiman, Baharan, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause. "Lazier Than Lazy Greedy." AAAI 2015.
17 Complex constraints Submodular maximization using the multilinear extension Submodular optimization over graphs the set S forms a path, or a tree on G of weight at most B Robust submodular optimization Consider adversaries (Game theory) Nonmonotone submodular functions E.g., a monotone submodular function f, and a modular cost function c We want to max. non-monotone function 17 All have good approximations using Greedy based algorithm (See Krause s survey for details)
18 Online maximization of submodular functions The objective may not be known in advance Objectives functions {f 1,,f T } drawn from some distribution At each round, select certain element Two settings: no-regret setting the choices in any round are not constrained by what one did in previous rounds and the goal is to perform well on average competitive setting a sequence of irrevocable decisions Previous round choices may affect the decision of the current round 18
19 Adaptive submodularity We wish to adaptively select a set, observing and taking into account feedback after selecting any particular element. E.g., when placing the next sensor, adaptively taking into account measurements provided by the sensors selected so far Active learning Daniel Golovin and Andreas Krause,. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. Journal of Artificial Intelligence Research (JAIR),
20 Recent Progress
21 Recent Progress Submodular Welfare problem Submodular function over integer lattice Distributed Submodular Maximization Streaming Submodular Maximization Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints 21
22 Submodular Welfare problem Problem: Algorithm: Continuous Greedy Algorithm provides (1-1/e-o(1))- appriximation 22 Jan Vondrák. "Optimal approximation for the submodular welfare problem in the value oracle model." STOC 2008.
23 Submodular Welfare problem 23 Jan Vondrák. "Optimal approximation for the submodular welfare problem in the value oracle model." STOC 2008.
24 Submodular function over integer lattice Integer lattice: vector Submodular function satisfies: Greedy algorithm provides (1-1/e)-approx. for the cardinality constraint (ICML 2014) Recent paper: Consider cardinality, matriod and knapsack constraint Soma, Tasuku, and Yuichi Yoshida. "Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice." arxiv preprint arxiv: (2015) 2. Soma, Tasuku, Naonori Kakimura, Kazuhiro Inaba, and Ken-ichi Kawarabayashi. "Optimal budget allocation: Theoretical guarantee and efficient algorithm." ICML 2014.
25 Distributed Submodular Maximization I Greedy Algorithm for the submodular function 25 Mirzasoleiman, Baharan, Amin Karbasi, Rik Sarkar, and Andreas Krause. "Distributed submodular maximization: Identifying representative elements in massive data." NIPS 2013.
26 Distributed Submodular Maximization II Summary of Greedy Algorithm in MapReduce SPAA 2013 best paper Kumar, Ravi, Benjamin Moseley, Sergei Vassilvitskii, and Andrea Vattani. "Fast greedy algorithms in mapreduce and streaming." SPAA
27 Streaming Submodular Maximization Assume elements set V is ordered any streaming algorithm must process V in the given order At each iteration t the algorithm maintains a memory of subset of elements Mt points; and must be ready to output a candidate feasible solution St When a new point arrives, the algorithm may select to remember it, and discard previous elements Badanidiyuru, Ashwinkumar, Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause. "Streaming submodular maximization: Massive data summarization on the fly." KDD
28 Streaming Submodular Maximization Simple example our memory can only store one element Algorithm: Badanidiyuru, Ashwinkumar, Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause. "Streaming submodular maximization: Massive data summarization on the fly." KDD
29 Submodular knapsack constraint Two types of problem Submodular Cost Submodular Cover (SCSC) Submodular Cost Submodular Knapsack (SCSK) Both f and g are submodular function 29 Iyer, Rishabh K., and Jeff A. Bilmes. "Submodular optimization with submodular cover and submodular knapsack constraints." NIPS 2013.
30 30 References Krause, Andreas, and Daniel Golovin. "Submodular function maximization." Tractability: Practical Approaches to Hard Problems 3 (2012): Mirzasoleiman, Baharan, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause. "Lazier Than Lazy Greedy." AAAI Badanidiyuru, Ashwinkumar, and Jan Vondrák. "Fast algorithms for maximizing submodular functions." SODA Jan Vondrák. "Optimal approximation for the submodular welfare problem in the value oracle model." STOC Soma, Tasuku, and Yuichi Yoshida. "Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice." arxiv preprint arxiv: (2015) 7. Soma, Tasuku, Naonori Kakimura, Kazuhiro Inaba, and Ken-ichi Kawarabayashi. "Optimal budget allocation: Theoretical guarantee and efficient algorithm." ICML 2014.
31 References 8. Mirzasoleiman, Baharan, Amin Karbasi, Rik Sarkar, and Andreas Krause. "Distributed submodular maximization: Identifying representative elements in massive data." NIPS Kumar, Ravi, Benjamin Moseley, Sergei Vassilvitskii, and Andrea Vattani. "Fast greedy algorithms in mapreduce and streaming." SPAA Badanidiyuru, Ashwinkumar, Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause. "Streaming submodular maximization: Massive data summarization on the fly." KDD Iyer, Rishabh K., and Jeff A. Bilmes. "Submodular optimization with submodular cover and submodular knapsack constraints." NIPS
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization Eric Balkanski Harvard University Andreas Krause ETH Zurich Baharan Mirzasoleiman ETH Zurich Yaron Singer Harvard University
More informationDistributed Submodular Maximization in Massive Datasets. Alina Ene. Joint work with Rafael Barbosa, Huy L. Nguyen, Justin Ward
Distributed Submodular Maximization in Massive Datasets Alina Ene Joint work with Rafael Barbosa, Huy L. Nguyen, Justin Ward Combinatorial Optimization Given A set of objects V A function f on subsets
More informationViral Marketing and Outbreak Detection. Fang Jin Yao Zhang
Viral Marketing and Outbreak Detection Fang Jin Yao Zhang Paper 1: Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, Éva Tardos KDD 2003 Outline Problem Statement
More informationRandomized Composable Core-sets for Distributed Optimization Vahab Mirrokni
Randomized Composable Core-sets for Distributed Optimization Vahab Mirrokni Mainly based on joint work with: Algorithms Research Group, Google Research, New York Hossein Bateni, Aditya Bhaskara, Hossein
More informationDeletion-Robust Submodular Maximization: Data Summarization with the Right to be Forgotten
: Data Summarization with the Right to be Forgotten Baharan Mirzasoleiman Amin Karbasi 2 Andreas Krause Abstract How can we summarize a dynamic data stream when elements selected for the summary can be
More informationFast Constrained Submodular Maximization: Personalized Data Summarization
Fast Constrained Submodular Maximization: Personalized Data Summarization Baharan Mirzasoleiman ETH Zurich Ashwinkumar Badanidiyuru Google Amin Karbasi Yale University BAHARANM@INF.ETHZ.CH ASHWINKUMARBV@GOOGLE.COM
More informationStochastic Submodular Maximization: The Case of Coverage Functions
Stochastic Submodular Maximization: The Case of Coverage Functions Mohammad Reza Karimi Department of Computer Science ETH Zurich mkarimi@ethz.ch Mario Lucic Department of Computer Science ETH Zurich lucic@inf.ethz.ch
More informationSubmodular Optimization
Submodular Optimization Nathaniel Grammel N. Grammel Submodular Optimization 1 / 28 Submodularity Captures the notion of Diminishing Returns Definition Suppose U is a set. A set function f :2 U! R is submodular
More informationStreaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly
Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly Baharan Mirzasoleiman ETH Zurich, Switzerland baharanm@ethz.ch Stefanie Jegelka MIT, United States stefje@mit.edu
More informationOn Distributed Submodular Maximization with Limited Information
On Distributed Submodular Maximization with Limited Information Bahman Gharesifard Stephen L. Smith Abstract This paper considers a class of distributed submodular maximization problems in which each agent
More informationSubmodular Optimization in Computational Sustainability. Andreas Krause
Submodular Optimization in Computational Sustainability Andreas Krause Master Class at CompSust 2012 Combinatorial optimization in computational sustainability Many applications in computational sustainability
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
HW2 Q1.1 parts (b) and (c) cancelled. HW3 released. It is long. Start early. CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/26/17 Jure Leskovec, Stanford
More informationNoisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization Adish Singla ETH Zurich adish.singla@inf.ethz.ch Sebastian Tschiatschek ETH Zurich sebastian.tschiatschek@inf.ethz.ch
More informationarxiv: v1 [cs.lg] 5 Oct 2018
Scaling Submodular Optimization Approaches for Control Applications in Networked Systems Arun V Sathanur arxiv:1810.02837v1 [cs.lg] 5 Oct 2018 Abstract Often times, in many design problems, there is a
More informationBeyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams Ashan Norouzi-Fard * 1 Jaub Tarnawsi * 1 Slobodan Mitrović * 1 Amir Zandieh * 1 Aidasadat Mousavifar 1 Ola Svensson 1 Abstract
More informationPart I Part II Part III Part IV Part V. Influence Maximization
Part I Part II Part III Part IV Part V Influence Maximization 1 Word-of-mouth (WoM) effect in social networks xphone is good xphone is good xphone is good xphone is good xphone is good xphone is good xphone
More informationStreaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-knapsack Constraint
Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-knapsack Constraint Qilian Yu, Student Member, IEEE, Easton Li Xu, Member, IEEE, and Shuguang Cui,
More informationDistributed Submodular Maximization: Identifying Representative Elements in Massive Data
Distributed Submodular imization: Identifying Representative Elements in Massive Data Baharan Mirzasoleiman ETH Zurich Rik Sarkar University of Edinburgh Amin Karbasi ETH Zurich Andreas Krause ETH Zurich
More informationarxiv: v3 [cs.ds] 26 Dec 2017
Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly Baharan Mirzasoleiman ETH Zurich, Switzerland baharanm@ethz.ch Stefanie Jegelka MIT, United States stefje@mit.edu
More informationA Class of Submodular Functions for Document Summarization
A Class of Submodular Functions for Document Summarization Hui Lin, Jeff Bilmes University of Washington, Seattle Dept. of Electrical Engineering June 20, 2011 Lin and Bilmes Submodular Summarization June
More informationOptimization of submodular functions
Optimization of submodular functions Law Of Diminishing Returns According to the Law of Diminishing Returns (also known as Diminishing Returns Phenomenon), the value or enjoyment we get from something
More informationApproximation Guarantees for Adaptive Sampling
Eric Balkanski Yaron Singer Abstract In this paper we analyze an adaptive sampling approach for submodular maximization. Adaptive sampling is a technique that has recently been shown to achieve a constant
More informationSolving Coverage Problems on Massive Data: Extended Abstract of Recent Results
Solving Coverage Problems on Massive Data: Extended Abstract of Recent Results MohammadHossein Bateni Google Research Hossein Esfandiari Harvard University Vahab Mirrokni Google Research Abstract We study
More informationLagrangian Decomposition Algorithm for Allocating Marketing Channels
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Lagrangian Decomposition Algorithm for Allocating Marketing Channels Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi
More informationCS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri
CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture
More informationarxiv: v2 [cs.ai] 1 Dec 2015
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization Adish Singla ETH Zurich adish.singla@inf.ethz.ch Sebastian Tschiatschek ETH Zurich sebastian.tschiatschek@inf.ethz.ch
More informationOnline Learning of Assignments
Online Learning of Assignments Matthew Streeter Google, Inc. Pittsburgh, PA 15213 mstreeter@google.com Daniel Golovin Carnegie Mellon University Pittsburgh, PA 15213 dgolovin@cs.cmu.edu Andreas Krause
More informationarxiv: v1 [cs.ds] 12 Jun 2017
Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly arxiv:76.3583v [cs.ds] 2 Jun 27 Baharan Mirzasoleiman ETH Zurich Stefanie Jegelka MIT Abstract Andreas Krause
More informationSubmodularity on Hypergraphs: From Sets to Sequences
Marko Mitrovic Moran Feldman Andreas Krause Amin Karbasi Yale University Open University of Israel ETH Zurich Yale University Abstract In a nutshell, submodular functions encode an intuitive notion of
More informationSubmodularity in Speech/NLP
Submodularity in Speech/NLP Jeffrey A. Bilmes Professor Departments of Electrical Engineering & Computer Science and Engineering University of Washington, Seattle http://melodi.ee.washington.edu/~bilmes
More informationMaximizing the Spread of Influence through a Social Network
Maximizing the Spread of Influence through a Social Network By David Kempe, Jon Kleinberg, Eva Tardos Report by Joe Abrams Social Networks Infectious disease networks Viral Marketing Viral Marketing Example:
More informationMapReduce ML & Clustering Algorithms
MapReduce ML & Clustering Algorithms Reminder MapReduce: A trade-off between ease of use & possible parallelism Graph Algorithms Approaches: Reduce input size (filtering) Graph specific optimizations (Pregel
More informationMaximizing the Spread of Influence through a Social Network. David Kempe, Jon Kleinberg and Eva Tardos
Maximizing the Spread of Influence through a Social Network David Kempe, Jon Kleinberg and Eva Tardos Group 9 Lauren Thomas, Ryan Lieblein, Joshua Hammock and Mary Hanvey Introduction In a social network,
More informationLecture 25 November 26, 2013
CS 229r: Algorithms for Big Data Fall 2013 Prof. Jelani Nelson Lecture 25 November 26, 2013 Scribe: Thomas Steinke 1 Overview Tody is the last lecture. We will finish our discussion of MapReduce by covering
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin September 20, 2012 1 / 1 Lecture 2 We continue where we left off last lecture, namely we are considering a PTAS for the the knapsack
More informationLeveraging Sparsity for Efficient Submodular Data Summarization
Leveraging Sparsity for Efficient Submodular Data Summarization Erik M. Lindgren, Shanshan Wu, Alexandros G. Dimakis The University of Texas at Austin Department of Electrical and Computer Engineering
More informationOnline Ad Allocation: Theory and Practice
Online Ad Allocation: Theory and Practice Vahab Mirrokni December 19, 2014 Based on recent papers in collaboration with my colleagues at Google, Columbia Univ., Cornell, MIT, and Stanford. [S. Balseiro,
More informationParallel Algorithms for Geometric Graph Problems Grigory Yaroslavtsev
Parallel Algorithms for Geometric Graph Problems Grigory Yaroslavtsev http://grigory.us Appeared in STOC 2014, joint work with Alexandr Andoni, Krzysztof Onak and Aleksandar Nikolov. The Big Data Theory
More informationJure Leskovec Machine Learning Department Carnegie Mellon University
Jure Leskovec Machine Learning Department Carnegie Mellon University Currently: Soon: Today: Large on line systems have detailed records of human activity On line communities: Facebook (64 million users,
More informationSubmodular Optimization with Submodular Cover and Submodular Knapsack Constraints
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints Rishabh Iyer Department of Electrical Engineering University of Washington rkiyer@u.washington.edu Jeff Bilmes Department
More informationMonotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and Maximization
Monotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and Maximization Rishabh Iyer Dept. of Electrical Engineering University of Washington Seattle, WA-98195,
More informationDecentralized Submodular Maximization: Bridging Discrete and Continuous Settings
Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings Aryan Mokhtari 1 Hamed Hassani 2 Amin Karbasi 3 Abstract In this paper, we showcase the interplay between discrete and continuous
More informationGreedy and Local Ratio Algorithms in the MapReduce Model
Greedy and Local Ratio Algorithms in the MapReduce Model Nick Harvey 1 Chris Liaw 1 Paul Liu 2 1 University of British Columbia 2 Stanford University Greedy and Local Ratio Algorithms in the MapReduce
More informationWord Alignment via Submodular Maximization over Matroids
Word Alignment via Submodular Maximization over Matroids Hui Lin Dept. of Electrical Engineering University of Washington Seattle, WA 98195, USA hlin@ee.washington.edu Jeff Bilmes Dept. of Electrical Engineering
More informationInfluence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report
Influence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report Abstract The goal of influence maximization has led to research into different
More informationSecretary Problems and Incentives via Linear Programming
Secretary Problems and Incentives via Linear Programming Niv Buchbinder Microsoft Research, New England and Kamal Jain Microsoft Research, Redmond and Mohit Singh Microsoft Research, New England In the
More informationInfluence Maximization in the Independent Cascade Model
Influence Maximization in the Independent Cascade Model Gianlorenzo D Angelo, Lorenzo Severini, and Yllka Velaj Gran Sasso Science Institute (GSSI), Viale F. Crispi, 7, 67100, L Aquila, Italy. {gianlorenzo.dangelo,lorenzo.severini,yllka.velaj}@gssi.infn.it
More informationNear-Optimal MAP Inference for Determinantal Point Processes
ear-optimal MAP Inference for Determinantal Point Processes Jennifer Gillenwater Alex Kulesza Ben Taskar Computer and Information Science University of Pennsylvania {jengi,kulesza,taskar}@cis.upenn.edu
More informationIRIE: Scalable and Robust Influence Maximization in Social Networks
IRIE: Scalable and Robust Influence Maximization in Social Networks Kyomin Jung KAIST Republic of Korea kyomin@kaist.edu Wooram Heo KAIST Republic of Korea modesty83@kaist.ac.kr Wei Chen Microsoft Research
More informationarxiv: v1 [cs.gt] 21 Nov 2013
Submodular welfare maximization arxiv:1311.5603v1 [cs.gt] 21 Nov 2013 1 Introduction Samira Samadi We study different variants of the welfare maximization problem in combinatorial auctions. Assume there
More informationLarge-scale Graph Google NY
Large-scale Graph Mining @ Google NY Vahab Mirrokni Google Research New York, NY DIMACS Workshop Large-scale graph mining Many applications Friend suggestions Recommendation systems Security Advertising
More informationFast Clustering using MapReduce
Fast Clustering using MapReduce Alina Ene, Sungjin Im, Benjamin Moseley UIUC KDD 2011 Clustering Massive Data Group web pages based on their content Group users based on their online behavior Finding communities
More informationMaxCover in MapReduce Flavio Chierichetti, Ravi Kumar, Andrew Tomkins
MaxCover in MapReduce Flavio Chierichetti, Ravi Kumar, Andrew Tomkins Advisor Klaus Berberich Presented By: Isha Khosla Outline Motivation Introduction Classical Approach: Greedy Proposed Algorithm: M
More informationCommunication Complexity of Combinatorial Auctions with Submodular Valuations
Communication Complexity of Combinatorial Auctions with Submodular Valuations Shahar Dobzinski Weizmann Institute of Science Jan Vondrák IBM Almaden Research ACM-SIAM SODA 2013, New Orleans Dobzinski-Vondrák
More informationMelding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization
Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization Bryan Wilder, Bistra Dilkina, Milind Tambe Center for Artificial Intelligence in Society, University of Southern
More informationRandomized Sensing in Adversarial Environments
Randomized Sensing in Adversarial Environments Andreas Krause EH Zürich and Caltech Zürich, Switzerland krausea@ethz.ch Alex Roper University of Michigan Ann Arbor, MI, USA aroper@umich.edu Daniel Golovin
More informationNotes on Minimum Cuts and Modular Functions
Notes on Minimum Cuts and Modular Functions 1 Introduction The following are my notes on Cunningham s paper [1]. Given a submodular function f and a set S, submodular minimisation is the problem of finding
More information4.1 Interval Scheduling
41 Interval Scheduling Interval Scheduling Interval scheduling Job j starts at s j and finishes at f j Two jobs compatible if they don't overlap Goal: find maximum subset of mutually compatible jobs a
More informationScalable Influence Maximization in Social Networks under the Linear Threshold Model
Scalable Influence Maximization in Social Networks under the Linear Threshold Model Wei Chen Microsoft Research Asia Yifei Yuan Li Zhang In collaboration with University of Pennsylvania Microsoft Research
More informationSubmodularity Cuts and Applications
Submodularity Cuts and Applications Yoshinobu Kawahara The Inst. of Scientific and Industrial Res. (ISIR), Osaka Univ., Japan kawahara@ar.sanken.osaka-u.ac.jp Koji Tsuda Comp. Bio. Research Center, AIST,
More informationarxiv: v1 [cs.ds] 19 Nov 2018
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint Alina Ene Huy L. Nguy ên arxiv:1811.07464v1 [cs.ds] 19 Nov 2018 Abstract We consider fast algorithms for monotone
More informationAn Optimal Allocation Approach to Influence Maximization Problem on Modular Social Network. Tianyu Cao, Xindong Wu, Song Wang, Xiaohua Hu
An Optimal Allocation Approach to Influence Maximization Problem on Modular Social Network Tianyu Cao, Xindong Wu, Song Wang, Xiaohua Hu ACM SAC 2010 outline Social network Definition and properties Social
More informationA Simple Augmentation Method for Matchings with Applications to Streaming Algorithms
A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms MFCS 2018 Christian Konrad 27.08.2018 Streaming Algorithms sequential access random access Streaming (1996 -) Objective:
More informationCombinatorial Selection and Least Absolute Shrinkage via The CLASH Operator
Combinatorial Selection and Least Absolute Shrinkage via The CLASH Operator Volkan Cevher Laboratory for Information and Inference Systems LIONS / EPFL http://lions.epfl.ch & Idiap Research Institute joint
More informationMatt Weinberg. Princeton University
Matt Weinberg Princeton University Online Selection Problems: Secretary Problems Offline: Every secretary i has a weight w i (chosen by adversary, unknown to you). Secretaries permuted randomly. Online:
More informationRough Set Methods and Submodular Functions
Rough Set Methods and Submodular Functions Hung Son Nguyen and Wojciech Świeboda Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097, Warsaw Poland Abstract. In this article we discuss
More informationSubmodular Function Optimization for Motion Clustering and Image Segmentation
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 1 Submodular Function Optimization for Motion Clustering and Image Segmentation Jianbing Shen, Senior Member, IEEE, Xingping Dong, Jianteng Peng,
More informationOptimisation While Streaming
Optimisation While Streaming Amit Chakrabarti Dartmouth College Joint work with S. Kale, A. Wirth DIMACS Workshop on Big Data Through the Lens of Sublinear Algorithms, Aug 2015 Combinatorial Optimisation
More informationOn Streaming and Communication Complexity of the Set Cover Problem
On Streaming and Communication Complexity of the Set Cover Problem Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, and Ali Vakilian Massachusetts Instittute of Technology (MIT) {edemaine,indyk,mahabadi,vakilian}@mit.edu
More informationOnline Distributed Sensor Selection
Online Distributed Sensor Selection Daniel Golovin Caltech Matthew Faulkner Caltech Andreas Krause Caltech ABSTRACT A key problem in sensor networks is to decide which sensors to query when, in order to
More informationFeature Selection. Department Biosysteme Karsten Borgwardt Data Mining Course Basel Fall Semester / 262
Feature Selection Department Biosysteme Karsten Borgwardt Data Mining Course Basel Fall Semester 2016 239 / 262 What is Feature Selection? Department Biosysteme Karsten Borgwardt Data Mining Course Basel
More informationJournal of Engineering Science and Technology Review 7 (3) (2014) Research Article
Jestr Journal of Engineering Science and Technology Review 7 (3) (214) 32 38 Research Article JOURNAL OF Engineering Science and Technology Review www.jestr.org Improved Algorithms OF CELF and CELF++ for
More informationCoverage Approximation Algorithms
DATA MINING LECTURE 12 Coverage Approximation Algorithms Example Promotion campaign on a social network We have a social network as a graph. People are more likely to buy a product if they have a friend
More informationThe Maximum Facility Location Problem
The Maximum Facility Location Problem MITCHELL JONES Supervisor: Dr. Julián Mestre This thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Computer Science and
More informationPTAS for Matroid Matching
PTAS for Matroid Matching Jon Lee 1 Maxim Sviridenko 1 Jan Vondrák 2 1 IBM Watson Research Center Yorktown Heights, NY 2 IBM Almaden Research Center San Jose, CA May 6, 2010 Jan Vondrák (IBM Almaden) PTAS
More informationAlgorithms for Evolving Data Sets
Algorithms for Evolving Data Sets Mohammad Mahdian Google Research Based on joint work with Aris Anagnostopoulos, Bahman Bahmani, Ravi Kumar, Eli Upfal, and Fabio Vandin Algorithm Design Paradigms Traditional
More informationUsing Document Summarization Techniques for Speech Data Subset Selection
Using Document Summarization Techniques for Speech Data Subset Selection Kai Wei, Yuzong Liu, Katrin Kirchhoff, Jeff Bilmes Department of Electrical Engineering University of Washington Seattle, WA 98195,
More information1 Overview. 2 Applications of submodular maximization. AM 221: Advanced Optimization Spring 2016
AM : Advanced Optimization Spring 06 Prof. Yaron Singer Lecture 0 April th Overview Last time we saw the problem of Combinatorial Auctions and framed it as a submodular maximization problem under a partition
More informationOnline Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010
Online Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010 Barna Saha, Vahid Liaghat Abstract This summary is mostly based on the work of Saberi et al. [1] on online stochastic matching problem
More informationInformative Census Transform for Ver Resolution Image Representation. Author(s)Jeong, Sungmoon; Lee, Hosun; Chong,
JAIST Reposi https://dspace.j Title Informative Census Transform for Ver Resolution Image Representation Author(s)Jeong, Sungmoon; Lee, Hosun; Chong, Citation IEEE International Symposium on Robo Interactive
More informationCSC2420: Algorithm Design, Analysis and Theory Fall 2017
CSC2420: Algorithm Design, Analysis and Theory Fall 2017 Allan Borodin and Nisarg Shah September 13, 2017 1 / 1 Lecture 1 Course Organization: 1 Sources: No one text; lots of sources including specialized
More informationExtracting Influential Nodes for Information Diffusion on a Social Network
Extracting Influential Nodes for Information Diffusion on a Social Network Masahiro Kimura Dept. of Electronics and Informatics Ryukoku University Otsu 520-2194, Japan kimura@rins.ryukoku.ac.jp Kazumi
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationPhD Thesis Defense Performance Improvements in Software-defined and Virtualized Wireless Networks
PhD Thesis Defense Performance Improvements in Software-defined and Virtualized Wireless Networks Chengchao Liang Supervisor: Prof. F. Richard Yu Department of Systems and Computer Engineering Carleton
More informationConnectivity and Tiling Algorithms
Connectivity and Tiling Algorithms Department of Mathematics Louisiana State University Phylanx Kick-off meeting Baton Rouge, August 24, 2017 2/29 Part I My research area: matroid theory 3/29 Matroids
More informationIntroduction to Optimization
Introduction to Optimization Greedy Algorithms October 5, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe Course Overview 2 Date Topic Mon, 21.9.2015 Introduction
More informationIncremental Sensor Placement Optimization on Water Network
Incremental Sensor Placement Optimization on Water Network Xiaomin Xu 1, Yiqi Lu 1, Yanghua Xiao 1, Sheng Huang 2, and Wei Wang 1 1 Department of Computing and Information Technology, Fudan University,
More informationClustering. (Part 2)
Clustering (Part 2) 1 k-means clustering 2 General Observations on k-means clustering In essence, k-means clustering aims at minimizing cluster variance. It is typically used in Euclidean spaces and works
More informationMarket Pricing for Data Streams
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) Market Pricing for Data Streams Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Hadi
More informationMonotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and Maximization: Extended Version
Monotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and Maximization: Extended Version Rishabh Iyer Dept. of Electrical Engineering University of Washington
More informationLecture 9: Pipage Rounding Method
Recent Advances in Approximation Algorithms Spring 2015 Lecture 9: Pipage Rounding Method Lecturer: Shayan Oveis Gharan April 27th Disclaimer: These notes have not been subjected to the usual scrutiny
More informationWelcome to the course Algorithm Design
Welcome to the course Algorithm Design Summer Term 2011 Friedhelm Meyer auf der Heide Lecture 13, 15.7.2011 Friedhelm Meyer auf der Heide 1 Topics - Divide & conquer - Dynamic programming - Greedy Algorithms
More informationExample 3: Viral Marketing and the vaccination policy problem
Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture 2: Jan 19, 2012 Scribes: Preethi Ambati and Azar Aliyev Example 3: Viral Marketing and the vaccination policy problem Diffusion
More informationOptimal Bidding Strategy for Brand Advertising
Optimal Bidding Strategy for Brand Advertising Takanori Maehara 1,2, Atsuhiro Narita 2, Jun Baba 2, Takayuki Kawabata 2 1 RIKEN Center for Advanced Intelligence Project 2 CyberAgent Inc. takanori.maehara@riken.jp,
More information(Due to rounding, values below may be only approximate estimates.) We will supply these numbers as they become available.
Below, for each problem on this Midterm Exam, Perfect is the percentage of students who received full credit, Partial is the percentage who received partial credit, and Zero is the percentage who received
More informationJure Leskovec Computer Science Department Cornell University / Stanford University
Jure Leskovec Computer Science Department Cornell University / Stanford University Large on line systems have detailed records of human activity On line communities: Facebook (64 million users, billion
More informationSUBMODULAR FEATURE SELECTION FOR HIGH-DIMENSIONAL ACOUSTIC SCORE SPACES. Yuzong Liu, Kai Wei, Katrin Kirchhoff, Yisong Song, Jeff Bilmes
SUBMODULAR FEATURE SELECTION FOR HIGH-DIMENSIONAL ACOUSTIC SCORE SPACES Yuzong Liu, Kai Wei, Katrin Kirchhoff, Yisong Song, Jeff Bilmes Department of Electrical Engineering, University of Washington Seattle,
More informationTowards more efficient infection and fire fighting
Towards more efficient infection and fire fighting Peter Floderus Andrzej Lingas Mia Persson The Centre for Mathematical Sciences, Lund University, 00 Lund, Sweden. Email: pflo@maths.lth.se Department
More informationMixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications
Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications Kai Wei 1 Rishabh Iyer 1 Shengjie Wang 2 Wenruo Bai 1 Jeff Bilmes 1 1 Department of Electrical Engineering, University
More informationRetaining Data from Streams of Social Platforms with Minimal Regret
Retaining Data from Streams of Social Platforms with Minimal Regret Nguyen Thanh Tam 1, Matthias Weidlich 2, Duong Chi Thang 1, Hongzhi Yin 3, Nguyen Quoc Viet Hung 4 1 École Polytechnique Fédérale de
More information