The Limitations of Optimization from Samples (Q5889795): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3511018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264490347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical active learning algorithms for noise tolerance and differential privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limitations of optimization from samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adaptive complexity of maximizing a submodular function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matrices and codes for the erasure channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Social Influence in Nearly Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Coverage Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Maximization in Parallel via the Multilinear Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sample complexity of revenue maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3188014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling and Representation Complexity of Revenue Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: From convex optimization to randomized mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2788415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4645666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privately Releasing Conjunctions and the Statistical Query Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Welfare Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:13, 1 August 2024

scientific article; zbMATH DE number 7679917
Language Label Description Also known as
English
The Limitations of Optimization from Samples
scientific article; zbMATH DE number 7679917

    Statements

    The Limitations of Optimization from Samples (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    0 references
    optimization from samples
    0 references
    maximum coverage
    0 references
    PAC-learning
    0 references
    submodular maximization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references