#### Filter Results:

- Full text PDF available (150)

#### Publication Year

2002

2017

- This year (41)
- Last 5 years (283)
- Last 10 years (408)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Lin Xiao, Stephen P. Boyd
- Systems & Control Letters
- 2004

We consider the problem of ÿnding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of ÿnding the fastest converging linear iteration can be cast as a semideÿnite program, and therefore… (More)

- Lin Xiao, Stephen P. Boyd, Sanjay Lall
- IPSN 2005. Fourth International Symposium on…
- 2005

We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters. This scheme doesn't involve… (More)

- Lin Xiao
- Journal of Machine Learning Research
- 2010

We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning task, and the other is a simple regularization term such as 1-norm for promoting sparsity. We develop extensions of Nesterov's dual averaging method, that can exploit the… (More)

- Lin Xiao, Tong Zhang
- SIAM Journal on Optimization
- 2014

We consider the problem of minimizing the sum of two convex functions: one is the average of a large number of smooth component functions, and the other is a general convex function that admits a simple proximal mapping. We assume the whole objective function is strongly convex. Such problems often arise in machine learning, known as regularized empirical… (More)

Energy consumption in hosting Internet services is becoming a pressing issue as these services scale up. Dynamic server provisioning techniques are effective in turning off unnecessary servers to save energy. Such techniques, mostly studied for request-response services, face challenges in the context of connection servers that host a large number of… (More)

- Sung Chan Kim, Robert Sprung, +11 authors Yingming Zhao
- Molecular cell
- 2006

Acetylation of proteins on lysine residues is a dynamic posttranslational modification that is known to play a key role in regulating transcription and other DNA-dependent nuclear processes. However, the extent of this modification in diverse cellular proteins remains largely unknown, presenting a major bottleneck for lysine-acetylation biology. Here we… (More)

- Alekh Agarwal, Ofer Dekel, Lin Xiao
- COLT
- 2010

Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially generated convex loss functions, while only observing the value of each function at a single point. In some cases, the minimax regret of these problems is known to be strictly worse… (More)

- Lin Xiao, Mikael Johansson, Stephen P. Boyd
- IEEE Trans. Communications
- 2004

In wireless networks, the optimal routing and resource allocation problems are coupled together through link capacities, which influence data routing and are determined by resource (e.g., power and bandwidth) allocation. We formulate the problem of simultaneous routing and resource allocation for wireless data networks as a convex optimization problem and… (More)

- Stephen P. Boyd, Persi Diaconis, Lin Xiao
- SIAM Review
- 2004

Author names in alphabetical order. Abstract We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equilibrium distribution; the rate of convergence to this distribution, i.e., the mixing rate of the Markov chain, is… (More)

- Lin Xiao, Tong Zhang
- SIAM Journal on Optimization
- 2013

We consider solving the 1-regularized least-squares (1-LS) problem in the context of sparse recovery for applications such as compressed sensing. The standard proximal gradient method, also known as iterative soft-thresholding when applied to this problem, has low computational cost per iteration but a rather slow convergence rate. Nevertheless, when the… (More)