On approximating weighted sums with exponentially many terms
type: Item
instance of: scholarly article
title: On approximating weighted sums with exponentially many terms
zbMATH Open document ID: 1074.68050
author: Deepak Chawla
author: Lin Li
author: Stephen D. Scott
published in: Journal of Computer and System Sciences
publication date: 2004-10-01T00:00:00Z
full work available at URL: https://digitalcommons.unl.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 2104535
zbMATH Keywords: Markov chain Monte Carlo approximation
zbMATH Keywords: Winnow
zbMATH Keywords: Weighted Majority
zbMATH Keywords: Multiplicative weight updates
zbMATH Keywords: Perceptron
zbMATH Keywords: DNF learning
zbMATH Keywords: Boosting
describes a project that uses: C4.5
describes a project that uses: UCI-ml
describes a project that uses: AdaBoost.MH
MaRDI profile type: Publication
OpenAlex ID: W2137361561
cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis
cites work: Simple learning algorithms using divide and conquer
cites work: More efficient PAC-learning of DNF with membership queries under the uniform distribution
cites work: How to use expert advice
cites work: Q3148800
cites work: Solving the multiple instance problem with axis-parallel rectangles.
cites work: A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Agnostic learning of geometric patterns
cites work: Multiple-instance learning of real-valued geometric patterns
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Optimization by Simulated Annealing
cites work: The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
cites work: Q4013545
cites work: The weighted majority algorithm
cites work: Efficient learning with virtual threshold gates
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
cites work: An efficient extension to mixture techniques for prediction and decision trees
cites work: Boosting the margin: a new explanation for the effectiveness of voting methods
cites work: Improved boosting algorithms using confidence-rated predictions
cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
cites work: Predicting nearly as well as the best pruning of a planar decision graph.
DOI: 10.1016/J.JCSS.2004.01.006
Recommended article: Q3148800
Recommended article: Approximation by exponential sums revisited
Recommended article: On the weighted exponential approximations
Recommended article: A uniform asymptotic expansion for weighted sums of exponentials
Recommended article: On approximation of functions by exponential sums
Recommended article: Weighted exponential sums and discrepancy
Recommended article: Multilinear exponential sums with a general class of weights
Recommended article: Approximation of exponential sums by shorter ones
Recommended article: Estimate for exponential sums and its applications
Recommended article: On the estimation of certain exponential sums
description: scientific article; zbMATH DE number 2104535