Back to Results
First PageMeta Content
Submodular set function / Combinatorial optimization / Linear programming / Mathematical optimization / Optimization problem / Vector space / A* search algorithm / Limited-memory BFGS / Greedy algorithm / Mathematics / Algebra / Operations research


Near-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
Add to Reading List

Document Date: 2013-04-28 17:52:02


Open Document

File Size: 274,30 KB

Share Result on Facebook

Company

DPPs / Huntsman / /

Country

United States / /

/

Facility

Information Science University of Pennsylvania / /

IndustryTerm

continuous algorithms / integral solutions / symmetric greedy algorithm / constant-factor algorithms / greedy algorithms / then round fractional solutions / greedy algorithm / local search / approximate solution / final solution / online training / dot product / simulated annealing algorithms / healthcare / image search / submodular maximization algorithm / conditional gradient algorithm / valid integral solution / pre-processing / /

Organization

National Science Foundation / University of Pennsylvania / DPP MAP / /

Person

Alex Kulesza Ben Taskar / U. Feige / V / /

PoliticalEvent

Republican primary / /

Position

same author / politician / representative / Secretary / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

constant-factor algorithms / log-submodular / greedy algorithms / proposed algorithm / 4 Algorithm / Accelerated Sequential Algorithm / simulated annealing algorithms / Continuous Greedy Algorithm / Secretary Algorithms / existing algorithms / machine learning / symmetric greedy algorithm / viral marketing / FrankWolfe algorithm / conditional gradient algorithm / submodular maximization algorithm / hence greedy algorithms / /

URL

http /

SocialTag