搜索结果: 1-15 共查到“理论统计学 Algorithms”相关记录26条 . 查询时间(0.14 秒)
Proximal Algorithms
Proximal Algorithms
font style='font-size:12px;'>
2015/7/9
This monograph is about a class of optimization algorithms called proximal algorithms. Much like Newton's method is a standard tool for solving unconstrained smooth optimization problems of modest siz...
Complexity of Non-Adaptive Optimization Algorithms for a Class of Diffusions
Global optimization average-case complexity diffusion processes
font style='font-size:12px;'>
2015/7/8
This paper is concerned with the analysis of the average error in approximating the global minimum of a 1-dimensional, time-homogeneous diffusion by non-adaptive methods. We derive the limiting distri...
Complementary Algorithms for Tableaux
Familiar with process column inserts rules to compute growth chart the theoretical equation of double
font style='font-size:12px;'>
2014/12/29
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopsc...
Efficient Algorithms for Multivariate Linear Mixed Models in Genome-wide Association Studies
Efficient Algorithms Multivariate Linear Mixed Models Genome-wide Association Studies
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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 ...
Non-parametric change-point detection using string matching algorithms
School of Mathematics, University of Bristol, University Walk, Bristol, BS8 1TW, UK
font style='font-size:12px;'>
2011/7/7
Given the output of a data source taking values in a finite alphabet, we wish to detect change-points, that is times when the statistical properties of the source change.
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Submodular meets Spectral Greedy Algorithms for Subset Selection Sparse Approximation Dictionary Selection
font style='font-size:12px;'>
2011/3/23
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the cont...
Randomized algorithms for statistical image analysis and site percolation on square lattices
Image analysis signal detection percolation image reconstruction noisy image
font style='font-size:12px;'>
2011/3/24
We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algorithm that allows to detect obje...
Computationally efficient algorithms for statistical image processing. Implementation in R
Image analysis signal detection image recon-struction percolation noisy image unsupervised machine learning spatial statistics
font style='font-size:12px;'>
2011/3/24
In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory ...
Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference
Machine Learning (stat.ML)
font style='font-size:12px;'>
2010/12/17
We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is prov...
Interacting Multiple Try Algorithms with Different Proposal Distributions
Interacting Multiple Different Proposal Distributions
font style='font-size:12px;'>
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.