Sciweavers

4372 search results - page 335 / 875
» Algorithmic Theories of Everything
Sort
View
NIPS
2000
15 years 8 months ago
Regularized Winnow Methods
In theory, the Winnow multiplicative update has certain advantages over the Perceptron additive update when there are many irrelevant attributes. Recently, there has been much eff...
Tong Zhang
WSC
1997
15 years 8 months ago
Single Run Optimization Using the Reverse-Simulation Method
An efficient “Simulation Optimization” technique is developed to solve system design problems which can not be expressed in explicit analytical or mathematical models. In part...
Young Hae Lee, Kyoung Jong Park, Yun Bae Kim
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 7 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 6 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
185
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof