On approximating weighted sums with exponentially many terms (Q1880781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Stephen D. Scott / rank
Normal rank
 
Property / author
 
Property / author: Stephen D. Scott / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: C4.5 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AdaBoost.MH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137361561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple learning algorithms using divide and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient PAC-learning of DNF with membership queries under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use expert advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multiple instance problem with axis-parallel rectangles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic generalization of on-line learning and an application to boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostic learning of geometric patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-instance learning of real-valued geometric patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning with virtual threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient extension to mixture techniques for prediction and decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting the margin: a new explanation for the effectiveness of voting methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved boosting algorithms using confidence-rated predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nearly as well as the best pruning of a planar decision graph. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:01, 7 June 2024

scientific article
Language Label Description Also known as
English
On approximating weighted sums with exponentially many terms
scientific article

    Statements

    On approximating weighted sums with exponentially many terms (English)
    0 references
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    Markov chain Monte Carlo approximation
    0 references
    Winnow
    0 references
    Weighted Majority
    0 references
    Multiplicative weight updates
    0 references
    Perceptron
    0 references
    DNF learning
    0 references
    Boosting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers