202 search results - page 14 / 41 » Privacy-preservation for gradient descent methods |
117
click to vote
SIAMIS
2010
14 years 6 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
100
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— In this paper, we propose a linear precoding and decoding scheme maximizing the sum rate of K-user interference channel systems where each node has multiple antennas. With an i...
SIAMCO
2002
14 years 11 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
123
Voted
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
The best recent supervised sequence learning methods use gradient descent to train networks of miniature nets called memory cells. The most popular cell structure seems somewhat ar...