Sciweavers

Share
JMLR
2012
8 years 1 months ago
Adaptive MCMC with Bayesian Optimization
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
Nimalan Mahendran, Ziyu Wang, Firas Hamze, Nando d...
CORR
2010
Springer
175views Education» more  CORR 2010»
9 years 5 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
TCBB
2010
137views more  TCBB 2010»
9 years 5 months ago
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
István Miklós, Bence Melykuti, Krist...
CORR
2010
Springer
171views Education» more  CORR 2010»
9 years 5 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
PE
2011
Springer
214views Optimization» more  PE 2011»
9 years 5 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
CORR
2011
Springer
210views Education» more  CORR 2011»
9 years 5 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
9 years 5 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
SIAMSC
2010
114views more  SIAMSC 2010»
9 years 9 months ago
Smoothed Aggregation Multigrid for Markov Chains
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
SIAMSC
2010
165views more  SIAMSC 2010»
9 years 9 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
PPSN
2010
Springer
9 years 9 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
books