Results 1  10
of
147,420
Practical Issues in Temporal Difference Learning
 Machine Learning
, 1992
"... This paper examines whether temporal difference methods for training connectionist networks, such as Suttons's TD(lambda) algorithm can be successfully applied to complex realworld problems. A number of important practical issues are identified and discussed from a general theoretical perspect ..."
Abstract

Cited by 415 (2 self)
 Add to MetaCart
perspective. These practical issues are then examined in the context of a case study in which TD(lambda) is applied to learning the game of backgammon from the outcome of selfplay. This is apparently the first application of this algorithm to a complex nontrivial task. It is found that, with zero knowledge
Approximating the nondominated front using the Pareto Archived Evolution Strategy
 EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract

Cited by 322 (19 self)
 Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its
FOIL: A Midterm Report
 In Proceedings of the European Conference on Machine Learning
, 1993
"... : FOIL is a learning system that constructs Horn clause programs from examples. This paper summarises the development of FOIL from 1989 up to early 1993 and evaluates its effectiveness on a nontrivial sequence of learning tasks taken from a Prolog programming text. Although many of these tasks ..."
Abstract

Cited by 257 (3 self)
 Add to MetaCart
: FOIL is a learning system that constructs Horn clause programs from examples. This paper summarises the development of FOIL from 1989 up to early 1993 and evaluates its effectiveness on a nontrivial sequence of learning tasks taken from a Prolog programming text. Although many of these tasks
Interactive Deduplication using Active Learning
, 2002
"... Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer to the same entity in spite of various data inconsistencies. Most existing systems use handcoded functions. One way to ov ..."
Abstract

Cited by 241 (5 self)
 Add to MetaCart
Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer to the same entity in spite of various data inconsistencies. Most existing systems use handcoded functions. One way
Nontrivial Galois Module Structure of . . .
, 2002
"... We say a tame Galois field extension L/K with Galois group G has trivial Galois module structure if the rings of integers have the property that OL is a free OK[G]module. The work of Greither, Replogle, Rubin, and Srivastav shows that for each algebraic number field other than the rational numbers ..."
Abstract
 Add to MetaCart
numbers there will exist infinitely many primes l so that for each there is a tame Galois field extension of degree l so that L/K has nontrivial Galois module structure. However, the proof does not directly yield specific primes l for a given algebraic number field K. For K any cyclotomic field we find
Nontrivial tintersection . . .
"... The function lattice, or generalized Boolean algebra, is the set of ℓtuples with the ith coordinate an integer between 0 and a bound ni. Two ℓtuples tintersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of tintersecting ℓtuples. ..."
Abstract
 Add to MetaCart
The function lattice, or generalized Boolean algebra, is the set of ℓtuples with the ith coordinate an integer between 0 and a bound ni. Two ℓtuples tintersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of tintersecting ℓtuples.
Correlators in nontrivial backgrounds
, 2009
"... Operators in N = 4 super YangMills theory with an Rcharge of O(N²) are dual to backgrounds which are asymtotically AdS5×S 5. In this article we develop efficient techniques that allow the computation of correlation functions in these backgrounds. We find that (i) contractions between fields in t ..."
Abstract
 Add to MetaCart
Operators in N = 4 super YangMills theory with an Rcharge of O(N²) are dual to backgrounds which are asymtotically AdS5×S 5. In this article we develop efficient techniques that allow the computation of correlation functions in these backgrounds. We find that (i) contractions between fields in the string words and fields in the operator creating the background are the field theory accounting of the new geometry, (ii) correlation functions of probes in these backgrounds are given by the free field theory contractions but with rescaled propagators and (iii) in these backgrounds there are no open string excitations with their special end point interactions; we have only closed string excitations.
Kernel PCA and DeNoising in Feature Spaces
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 11
, 1999
"... Kernel PCA as a nonlinear feature extractor has proven powerful as a preprocessing step for classification algorithms. But it can also be considered as a natural generalization of linear principal component analysis. This gives rise to the question how to use nonlinear features for data compress ..."
Abstract

Cited by 170 (15 self)
 Add to MetaCart
compression, reconstruction, and denoising, applications common in linear PCA. This is a nontrivial task, as the results provided by kernel PCA live in some high dimensional feature space and need not have preimages in input space. This work presents ideas for finding approximate preimages, focusing
Nontrivial polydispersity exponents in aggregation models
 Phys. Rev. E
, 1997
"... We consider the scaling solutions of Smoluchowski’s equation of irreversible aggregation, for a non gelling collision kernel. The scaling mass distribution f(s) diverges as s−τ when s → 0. τ is non trivial and could, until now, only be computed by numerical simulations. We develop here new general m ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the scaling solutions of Smoluchowski’s equation of irreversible aggregation, for a non gelling collision kernel. The scaling mass distribution f(s) diverges as s−τ when s → 0. τ is non trivial and could, until now, only be computed by numerical simulations. We develop here new general methods to obtain exact bounds and good approximations of τ. For the specific kernel Kd D (x,y) = (x1/D +y1/D) d, describing a meanfield model of particles moving in d dimensions and aggregating with conservation of “mass ” s = RD (R is the particle radius), perturbative and nonperturbative expansions are derived. For a general kernel, we find exact inequalities for τ and develop a variational approximation which is used to carry out the first systematic study of τ(d,D) for Kd D. The agreement is excellent both with the expansions we derived and with existing numerical values. Finally, we discuss a possible application to 2d decaying turbulence.
Classification of designs with nontrivial automorphism groups
 J. Combin. Designs
"... Published online in Wiley InterScience (www.interscience.wiley.com). ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Published online in Wiley InterScience (www.interscience.wiley.com).
Results 1  10
of
147,420