#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1976

2002

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The authors use risk-neutral option pricing theory to value the guaranteed minimum death benefit (GMDB) in variable annuities (VAs) and some recently introduced mutual funds. A variety of death benefits, such as returnof-premium, rising floors, and “ratches,” are analyzed. Specifically, the authors compute the fair insurance risk fee, charged to assets,… (More)

- Sanjeev R. Kulkarni, S. E. Posner
- IEEE Trans. Information Theory
- 1995

Rates of convergence for nearest neighbor estimation are established in a general framework in terms of metric covering numbers of the underlying space. Our first result is to find explicit finite sample upper bounds for the classical independent and identically distributed (i.i.d.) random sampling problem in a separable metric space setting. The… (More)

- Peter L. Bartlett, Sanjeev R. Kulkarni, S. E. Posner
- IEEE Trans. Information Theory
- 1997

We nd tight upper and lower bounds on the growth rate for the covering numbers of functions of bounded variation in the L 1 metric in terms of all the relevant constants. We also nd upper and lower bounds on covering numbers for general function classes over the family of L 1 (dP) metrics, in terms of a scale-sensitive combinatorial dimension of the… (More)

- Sanjeev R. Kulkarni, S. E. Posner, Sathyakama Sandilya
- IEEE Trans. Information Theory
- 2002

Let . . . be an arbitrary random process taking values in a totally bounded subset of a separable metric space. Associated with we observe drawn from an unknown conditional distribution ( = ) with continuous regression function ( ) = [ = ]. The problem of interest is to estimate based on and the data ( ) . We construct appropriate data-dependent nearest… (More)

- Sanjeev R. Kulkarni, S. E. Posner
- IEEE Trans. Automat. Contr.
- 1999

The authors construct a class of elementary nonparametric output predictors of an unknown discrete-time nonlinear fading memory system. Their algorithms predict asymptotically well for every bounded input sequence, every disturbance sequence in certain classes, and every linear or nonlinear system that is continuous and asymptotically time-invariant,… (More)

- S. E. Posner, Sanjeev R. Kulkarni
- COLT
- 1993

We consider the problem of learning of an arbitrary function selected from the non-smooth class of functions that are of bounded variation. Bounds on the prediction errors resulting from sequential type algorithms are achieved for various scenarios. It is shown that for any algorithm there exists a sequence of samples and a function that results in a unit… (More)

- P Q Hall, S M Malcom, S E Posner
- Science
- 1976

- S E Posner
- Science
- 1976

- ‹
- 1
- ›