Results 1  10
of
58,945
Finitetime analysis of the multiarmed bandit problem
 Machine Learning
, 2002
"... Abstract. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy’s success in addressing ..."
Abstract

Cited by 817 (15 self)
 Add to MetaCart
this dilemma is the regret, that is the loss due to the fact that the globally optimal policy is not followed all the times. One of the simplest examples of the exploration/exploitation dilemma is the multiarmed bandit problem. Lai and Robbins were the first ones to show that the regret for this problem has
The Twin Crises: The Causes of Banking and BalanceofPayments Problems
"... In the wake of the Mexican and Asian currency turmoil, the subject of financial crises has come to the forefront of academic and policy discussions. This paper analyzes the links between banking and currency crises. We find that: problems in the banking sector typically precede a currency crisis—the ..."
Abstract

Cited by 913 (27 self)
 Add to MetaCart
In the wake of the Mexican and Asian currency turmoil, the subject of financial crises has come to the forefront of academic and policy discussions. This paper analyzes the links between banking and currency crises. We find that: problems in the banking sector typically precede a currency crisis
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 961 (11 self)
 Add to MetaCart
In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive
ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
, 1957
"... In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated p ..."
Abstract

Cited by 454 (0 self)
 Add to MetaCart
parenthetically into the statement of the algorithm. Following this appears a discussion of certain theoretical aspects of the problem. In Section 2, the algorithm is generalized to one for the transportation problem. The algorithm of that section is stated as concisely as possible, with theoretical remarks
Monte Carlo Statistical Methods
, 1998
"... This paper is also the originator of the Markov Chain Monte Carlo methods developed in the following chapters. The potential of these two simultaneous innovations has been discovered much latter by statisticians (Hastings 1970; Geman and Geman 1984) than by of physicists (see also Kirkpatrick et al. ..."
Abstract

Cited by 1498 (30 self)
 Add to MetaCart
This paper is also the originator of the Markov Chain Monte Carlo methods developed in the following chapters. The potential of these two simultaneous innovations has been discovered much latter by statisticians (Hastings 1970; Geman and Geman 1984) than by of physicists (see also Kirkpatrick et al
Algorithmic mechanism design
 Games and Economic Behavior
, 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract

Cited by 662 (23 self)
 Add to MetaCart
We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance
Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information
, 2006
"... This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result of this pa ..."
Abstract

Cited by 2632 (50 self)
 Add to MetaCart
of this paper is as follows. Suppose that is a superposition of spikes @ Aa @ A @ A obeying @�� � A I for some constant H. We do not know the locations of the spikes nor their amplitudes. Then with probability at least I @ A, can be reconstructed exactly as the solution to the I minimization problem I aH @ A s
Data Integration: A Theoretical Perspective
 Symposium on Principles of Database Systems
, 2002
"... Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interestin ..."
Abstract

Cited by 965 (45 self)
 Add to MetaCart
Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion
Results 1  10
of
58,945