Sciweavers

2694 search results - page 7 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
UAI
2008
14 years 11 months ago
Convex Point Estimation using Undirected Bayesian Transfer Hierarchies
When related learning tasks are naturally arranged in a hierarchy, an appealing approach for coping with scarcity of instances is that of transfer learning using a hierarchical Ba...
Gal Elidan, Benjamin Packer, Geremy Heitz, Daphne ...
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 4 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
ATAL
2010
Springer
14 years 10 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
GLOBECOM
2008
IEEE
15 years 4 months ago
A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems
—This paper considers distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. T...
Pablo Soldati, Mikael Johansson
97
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...