Kenji Yamanishi
- 1.J.O. Berger, Statistical Decision Theory and Bayesian Analysis, Springer-Verlag, 1985.Google Scholar
- 2.B.S. Clarke and A.R. Barron, "Informationtheoretic asymptotics of Bayes methods," IEEE Trans. Inform. Theory, IT-36, pp.453-471, 1990.Google ScholarCross Ref
- 3.A.E. Gelfand and A.F.M. Smith, "Sampling-based approach to calculating marginal densities," J. Am. Statist. Assoc., vol. 85, pp.398-409, 1990.Google ScholarCross Ref
- 4.S. Geman and D. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayes restoration of images," IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-6, pp.721-741, 1984.Google ScholarDigital Library
- 5.W.K. Hastings, "Monte Carlo sampling method using Markov chains and their applications," Biometrika, vol. 57, pp.97-109, 1970.Google ScholarCross Ref
- 6.D. Haussler, J. Kivinen, and M. Warmuth, "Tight worst-case loss bounds for predicting with expert advice," Computational Learning Theory: Second European Conference. EuroCOLT'95, Springer, pp.69-83. 1995. Google ScholarDigital Library
- 7.M. Kearns and H.S. Seung, "Learning from a population of hypotheses," Proceedings of the Sixth Annual ACM Conference of Computational Learning Theory, ACM Press, pp.lOl-110, 1993. Google ScholarDigital Library
- 8.A. Nakamura, N. Abe, and J. Takeuchi, "Efficient distribution-free population learning of simple concepts," ALT'96 Algorithmic Learning Theoy, Springer, pp.500-515, 1994. Google ScholarDigital Library
- 9.E. Nummelin, General irreducible Markov chains and non-negative operators, Cambridge University Press, 1984.Google ScholarCross Ref
- 10.J. Rosenthal, "Rates of convergence for Gibbs sampling for variance component models," Technical report No.9322, Univ. of Toronto, Dept. of Statistics, 1993.Google Scholar
- 11.A. Sinclair, Algorithms for Random Generation & Counting: A Markov Chain Approach, Birkhauser, 1993. Google ScholarDigital Library
- 12.M.A. Tanner and H.W. Wong, "The calculation of posterior distributions by data augmentation," Jr. American Statist. Assoc., vol.82, pp.528-550, 1987.Google ScholarCross Ref
- 13.V.G. Vovk. "Aggregating strategies," Proceedings of the Third Annual Workshop on Computational Learning Theory, Morgan Kaufmann, pp.371-386, 1990. Google ScholarDigital Library
- 14.K. Yamanishi, "A decision-theoretic extension of stochastic complexity and its approximation to learning," submitted for publication, 1995. Google ScholarDigital Library
- 15.K. Yamanishi, "A randomized approximation of the MDL for stochastic models with hidden variables," Proceedings of the Ninth Annual Conference on Computational Learning Theory, ACM Press, pp.99-109, 1996. Google ScholarDigital Library
Index Terms
- Distributed cooperative Bayesian learning strategies
Recommendations
Distributed Serially Concatenated Codes for Multi-Source Cooperative Relay Networks
In this paper, we propose a distributed turbo-like coding scheme for a multi-source relay scenario where multiple sources communicate with a destination with the help of a common relay, which uses the decode-and-forward strategy and operates in half-...
Distributed turbo trellis coded modulation for cooperative communications
ICC'09: Proceedings of the 2009 IEEE international conference on CommunicationsIn this contribution, we propose a Distributed Turbo Trellis Coded Modulation (DTTCM) scheme for cooperative communications. The DTTCM scheme is designed based on its decoding convergence with the aid of non-binary Extrinsic Information Transfer (EXIT) ...
Cooperative Strategies for Simultaneous and Broadcast Relay Channels
Consider the simultaneous relay channel (SRC) that consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending ...
Comments