搜索结果: 1-8 共查到“统计核算理论 Algorithms”相关记录8条 . 查询时间(0.265 秒)
Efficient Algorithms for Multivariate Linear Mixed Models in Genome-wide Association Studies
Efficient Algorithms Multivariate Linear Mixed Models Genome-wide Association Studies
2013/6/17
Multivariate linear mixed models (mvLMMs) have been widely used in many areas of genetics, and have attracted considerable recent interest in genome-wide association studies (GWASs). However, existing...
On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions
Generalization Ability Online Learning Algorithms Pairwise Loss Functions
2013/6/14
In this paper, we study the generalization properties of online learning based stochastic methods for supervised learning problems where the loss function is dependent on more than one training sample...
A framework to characterize performance of LASSO algorithms
Noisy linear systems of equations LASSO SOCP ℓ 1 -optimization compressed sensing
2013/5/2
In this paper we consider solving \emph{noisy} under-determined systems of linear equations with sparse solutions. A noiseless equivalent attracted enormous attention in recent years, above all, due t...
Sparse approximation and recovery by greedy algorithms in Banach spaces
Sparse approximation recovery greedy algorithms Banach spaces
2013/4/28
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to ...
Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels
Two-dimensional channels constrained channels partition function Gibbs sampling importance sampling factor graphs sum-product message passing capacity information rate
2011/6/21
The paper proposes Monte Carlo algorithms for
the computation of the information rate of two-dimensional
source / channel models. The focus of the paper is on binary-input
channels with constraints...
Generalized Boosting Algorithms for Convex Optimization
Generalized Boosting Algorithms Convex Optimization
2011/6/21
Boosting is a popular way to derive power-
ful learners from simpler hypothesis classes.
Following previous work (Mason et al., 1999;
Friedman, 2000) on general boosting frame-
works, we analyze g...
Interacting Multiple Try Algorithms with Different Proposal Distributions
Interacting Multiple Different Proposal Distributions
2010/11/9
We propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm.
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivati...