Sciweavers

873 search results - page 19 / 175
» Rates of convergence for Quicksort
Sort
View
SIAMIS
2011
13 years 3 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
TNN
1998
94views more  TNN 1998»
13 years 8 months ago
Global convergence of Oja's subspace algorithm for principal component extraction
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
Tianping Chen, Yingbo Hua, Wei-Yong Yan
COMBINATORICS
2004
81views more  COMBINATORICS 2004»
13 years 8 months ago
A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
Jason E. Fulman
NIPS
2008
13 years 9 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
IJCNN
2006
IEEE
14 years 2 months ago
Improving the Convergence of Backpropagation by Opposite Transfer Functions
—The backpropagation algorithm is a very popular approach to learning in feed-forward multi-layer perceptron networks. However, in many scenarios the time required to adequately ...
Mario Ventresca, Hamid R. Tizhoosh