Monotonic convergence of a general algorithm for computing optimal designs
- Yaming Yu
- Mathematics, Computer Science
- 18 May 2009
Monotonic convergence is established for a general class of multiplicative algorithms introduced by Silvey, Titterington and Torsney for computing optimal designs.
To Center or Not to Center: That Is Not the Question—An Ancillarity–Sufficiency Interweaving Strategy (ASIS) for Boosting MCMC Efficiency
- Yaming Yu, Xiao-Li Meng
- Computer Science
- 1 January 2011
This article introduces an alternative strategy for boosting MCMC efficiency via simply interweaving—but not alternating—the two parameterizations, and applies it to fit a Cox process model for detecting changes in source intensity of photon counts observed by the Chandra X-ray telescope from a (candidate) neutron/quark star.
Stochastic Ordering of Exponential Family Distributions and Their Mixturesxk
- Yaming Yu
- MathematicsJournal of Applied Probability
- 1 March 2009
We investigate stochastic comparisons between exponential family distributions and their mixtures with respect to the usual stochastic order, the hazard rate order, the reversed hazard rate order,…
Concavity of entropy under thinning
- Yaming Yu, O. Johnson
- MathematicsIEEE International Symposium on Information…
- 8 April 2009
It is proved that entropy is a concave function with respect to the thinning operation T<inf>α</inf>, and a special case of a conjecture of Shepp and Olkin (1981) is established.
D-optimal designs via a cocktail algorithm
- Yaming Yu
- Computer ScienceStatistics and computing
- 31 October 2009
A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs that extends the well-known vertex direction method and the multiplicative algorithm, and shares their simplicity and monotonic convergence properties.
Monotonicity, Thinning, and Discrete Versions of the Entropy Power Inequality
- O. Johnson, Yaming Yu
- Computer ScienceIEEE Transactions on Information Theory
- 3 September 2009
A stronger version of concavity of entropy is proved, which implies a strengthened form of Shannon's discrete EPI, which gives a sharp bound on how the entropy of ultra log-concave random variables behaves on thinning.
On the Maximum Entropy Properties of the Binomial Distribution
- Yaming Yu
- MathematicsIEEE Transactions on Information Theory
- 1 July 2008
It is shown that the Binomial(n,p) distribution maximizes the entropy in the class of ultra-log-concave distributions of order n with fixed mean np to show that the entropy never decreases along the iterations of this Markov chain.
On Normal Variance-Mean Mixtures
- Yaming Yu
- Mathematics
- 12 June 2011
High dispersion of platinum-ruthenium nanoparticles on the 3,4,9,10-perylene tetracarboxylic acid-functionalized carbon nanotubes for methanol electro-oxidation.
- Bohua Wu, Dan Hu, Y. Kuang, Yaming Yu, Xiaohua Zhang, Jinhua Chen
- Chemistry, Materials ScienceChemical Communications
- 19 April 2011
Due to lots of carboxyl groups introduced uniformly on the carbon nanotube (CNT) surface, platinum-ruthenium nanoparticles were highly dispersed on the 3,4,9,10-perylene tetracarboxylic…
Squeezing the Arimoto–Blahut Algorithm for Faster Convergence
- Yaming Yu
- Computer ScienceIEEE Transactions on Information Theory
- 21 June 2009
The Arimoto-Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called “squeezing” strategy is used to design algorithms that preserve its simplicity and…
...
...