We prove that the consumption functions in optimal savings problems are asymptotically linear if marginal utility is regularly varying, or loosely speaking, behaves like a power function for wealthy agents. also analytically characterize asymptotic propensities to consume (MPCs) out of wealth. Our results useful obtaining good initial guesses when numerically computing functions, and provide th...

Reservoir formations exhibit a wide range of heterogeneity from micro to macro scales. A simulation that involves all of these data is highly time consuming or almost impossible; hence, a new method is needed to meet the computational cost. Moreover, the deformations of the reservoir are important not only to protect the uppermost equipment but also to simulate fluid pattern and petroleum produ...

There are two methods of set prediction that are provably valid under the assumption of randomness: transductive conformal prediction and inductive conformal prediction. The former method is informationally efficient but often lacks computational efficiency. The latter method is, vice versa, computationally efficient but less efficient informationally. This talk discusses a new method, which we...

We propose an efficient algorithm for colorization of greyscale images. As in prior work, colorization is posed as an optimization problem: a user specifies the color for a few scribbles drawn on the greyscale image and the color image is obtained by propagating color information from the scribbles to surrounding regions, while maximizing the local smoothness of colors. In this formulation, col...

This thesis presents new positive and negative results concerning the learnability of several well-studied function classes in the Probably Approximately Correct (PAC) model of learning. Learning Disjunctive Normal Form (DNF) expressions in the PAC model is widely considered to be the main open problem in Computational Learning Theory. We prove that PAC learning of DNF expressions by an algorit...

This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does not depend on identifying common points. It uses the method of algebraic invariants to provide a common set of coordinates to images using chains of line segments formally described as polylines with possible gaps bet...

Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and co...

We propose to study market efficiency from a computational viewpoint. Borrowing from theoretical computer science, we define a market to be efficient with respect to resources S (e.g., time, memory) if no strategy using resources S can make a profit. As a first step, we consider memory-m strategies whose action at time t depends only on the m previous observations at times t − m, . . . , t − 1....