Download presentation

Presentation is loading. Please wait.

Published byTerrance Caine Modified over 4 years ago

1
Learning and Testing Submodular Functions Grigory Yaroslavtsev Columbia University October 26, 2012 With Sofya Raskhodnikova (SODA’13) + Work in progress with Rocco Servedio

2
Submodularity

3
Exact learning

4
Approximate learning

5
Goemans, Harvey, Iwata, Mirrokni Balcan, Harvey Gupta, Hardt, Roth, Ullman Cheraghchi, Klivans, Kothari, Lee Our result with Sofya Learning TimePoly(|X|) Extra features Under arbitrary distribution Tolerant queries SQ- queries, Agnostic

6
Learning: Bigger picture XOS = Fractionally subadditive Subadditive Submodular Gross substitutes OXS [Badanidiyuru, Dobzinski, Fu, Kleinberg, Nisan, Roughgarden,SODA’12] Additive (linear) Value demand Other positive results: Learning valuation functions [Balcan, Constantin, Iwata, Wang, COLT’12] PMAC-learning (sketching) valuation functions [BDFKNR’12] PMAC learning Lipschitz submodular functions [BH’10] (concentration around average via Talagrand)

7
Discrete convexity

8
Monotone submodular Submodular

9
Discrete monotone submodularity

12
Representation by a formula

13
Discrete submodularity

14
Learning pB-formulas and k-DNF

16
Property testing

17
Testing by implicit learning

18
Previous work on testing submodularity

19
Thanks!

Similar presentations

OK

An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders Speaker: Shahar Dobzinski Joint work with Michael Schapira.

An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders Speaker: Shahar Dobzinski Joint work with Michael Schapira.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google