Sciweavers

231 search results - page 20 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
COLT
2010
Springer
13 years 5 months ago
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
Junya Honda, Akimichi Takemura
TSP
2011
170views more  TSP 2011»
13 years 2 months ago
Joint TDOA and FDOA Estimation: A Conditional Bound and Its Use for Optimally Weighted Localization
—Modern passive emitter-location systems are often based on joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown sig...
Arie Yeredor, Eyal Angel
ECAI
2010
Springer
13 years 8 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
INFOCOM
2010
IEEE
13 years 6 months ago
Delay-Based Network Utility Maximization
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...
Michael J. Neely