Results 1  10
of
604,952
The tradeoffs of large scale learning
 IN: ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 20
, 2008
"... This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of smallscale and largescale learning problems. Smallscale learning problems are subject to the usual approx ..."
Abstract

Cited by 270 (4 self)
 Add to MetaCart
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of smallscale and largescale learning problems. Smallscale learning problems are subject to the usual
A HeteroskedasticityConsistent Covariance Matrix Estimator And A Direct Test For Heteroskedasticity
, 1980
"... This paper presents a parameter covariance matrix estimator which is consistent even when the disturbances of a linear regression model are heteroskedastic. This estimator does not depend on a formal model of the structure of the heteroskedasticity. By comparing the elements of the new estimator ..."
Abstract

Cited by 3211 (5 self)
 Add to MetaCart
to those of the usual covariance estimator, one obtains a direct test for heteroskedasticity, since in the absence of heteroskedasticity, the two estimators will be approximately equal, but will generally diverge otherwise. The test has an appealing least squares interpretation
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually approximately known. From this initial estimate, our algorithm computes observer motion with very good precision
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 636 (0 self)
 Add to MetaCart
Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
that the gradient can be written in a form suitable for estimation from experience aided by an approximate actionvalue or advantage function. Using this result, we prove for the first time that a version of policy iteration with arbitrary differentiable function approximation is convergent to a locally optimal
Complex wavelets for shift invariant analysis and filtering of signals
 J. Applied and Computational Harmonic Analysis
, 2001
"... This paper describes a form of discrete wavelet transform, which generates complex coefficients by using a dual tree of wavelet filters to obtain their real and imaginary parts. This introduces limited redundancy (2m: 1 for mdimensional signals) and allows the transform to provide approximate shift ..."
Abstract

Cited by 384 (40 self)
 Add to MetaCart
to be shift invariant and describe how to estimate the accuracy of this approximation and design suitable filters to achieve this. We discuss two different variants of the new transform, based on odd/even and quartersample shift (Qshift) filters, respectively. We then describe briefly how the dual tree may
Tradeoffs
"... and thresholds in the effects of nitrogen addition on biodiversity and ecosystem functioning: evidence from inner Mongolia Grasslands ..."
Abstract
 Add to MetaCart
and thresholds in the effects of nitrogen addition on biodiversity and ecosystem functioning: evidence from inner Mongolia Grasslands
The Value of a Statistical Life: A Critical Review of Market Estimates Throughout the World
 Journal of Risk and Uncertainty
, 2003
"... A substantial literature over the past thirty years has evaluated tradeoffs between money and fatality risks. These values in turn serve as estimates of the value of a statistical life. This article reviews more than 60 studies of mortality risk premiums from ten countries and approximately 40 studi ..."
Abstract

Cited by 284 (28 self)
 Add to MetaCart
A substantial literature over the past thirty years has evaluated tradeoffs between money and fatality risks. These values in turn serve as estimates of the value of a statistical life. This article reviews more than 60 studies of mortality risk premiums from ten countries and approximately 40
The Computation of Optical Flow
, 1995
"... Twodimensional image motion is the projection of the threedimensional motion of objects, relative to a visual sensor, onto its image plane. Sequences of timeordered images allow the estimation of projected twodimensional image motion as either instantaneous image velocities or discrete image dis ..."
Abstract

Cited by 295 (10 self)
 Add to MetaCart
displacements. These are usually called the optical flow field or the image velocity field. Provided that optical flow is a reliable approximation to twodimensional image motion, it may then be used to recover the threedimensional motion of the visual sensor (to within a scale factor) and the three
CoreStateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
, 1998
"... Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complex ..."
Abstract

Cited by 251 (11 self)
 Add to MetaCart
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis
Results 1  10
of
604,952