ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1512.06238
  4. Cited By
The Limitations of Optimization from Samples

The Limitations of Optimization from Samples

19 December 2015
Eric Balkanski
A. Rubinstein
Yaron Singer
ArXivPDFHTML

Papers citing "The Limitations of Optimization from Samples"

6 / 6 papers shown
Title
On the Complexity of Dynamic Submodular Maximization
On the Complexity of Dynamic Submodular Maximization
Xi Chen
Binghui Peng
11
16
0
05 Nov 2021
Sample Complexity Bounds for Influence Maximization
Sample Complexity Bounds for Influence Maximization
Gal Sadeh
E. Cohen
Haim Kaplan
11
12
0
31 Jul 2019
Parallelization does not Accelerate Convex Optimization: Adaptivity
  Lower Bounds for Non-smooth Convex Minimization
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization
Eric Balkanski
Yaron Singer
22
31
0
12 Aug 2018
Distributionally Robust Submodular Maximization
Distributionally Robust Submodular Maximization
Matthew Staib
Bryan Wilder
Stefanie Jegelka
25
35
0
14 Feb 2018
Robust Influence Maximization
Robust Influence Maximization
Wei Chen
Tian Lin
Zihan Tan
Mingfei Zhao
Xuren Zhou
48
169
0
25 Jan 2016
Learning pseudo-Boolean k-DNF and Submodular Functions
Learning pseudo-Boolean k-DNF and Submodular Functions
Sofya Raskhodnikova
G. Yaroslavtsev
47
26
0
10 Aug 2012
1