Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive search and intelligent optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Regret With Label Efficient Prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning: ECML 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Survival Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning dynamic algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonparametric Estimation from Incomplete Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survival analysis. Techniques for censored and truncated data. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning parallel portfolios of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of the sequential design of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Multiple Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank

Latest revision as of 01:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithm portfolio selection as a bandit problem with unbounded losses
scientific article

    Statements

    Algorithm portfolio selection as a bandit problem with unbounded losses (English)
    0 references
    0 references
    0 references
    12 April 2012
    0 references
    algorithm selection
    0 references
    algorithm portfolios
    0 references
    meta learning
    0 references
    online learning
    0 references
    multi-armed bandit problem
    0 references
    survival analysis
    0 references
    Las Vegas algorithms
    0 references
    computational complexity
    0 references
    combinatorial optimization
    0 references
    constraint programming
    0 references
    satisfiability
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references