IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 10 of 10  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
MBE, NC 2022-12-03
15:25		 Osaka Osaka Electro-Communication University Stabilization and Acceleration of Gradient Descent Based on Eigenvalue Decomposition of the Fisher Information Matrix
Jun'ichi Takeuchi, Yoshinari Takeishi, Masazumi Iida (Kyushu Univ.), Noboru Murata (Waseda Univ.), Kazushi Mimura (Hiroshima City Univ.), Hiroshi Nagaoka (Univ. of Electro Communication) MBE2022-39 NC2022-61		 We propose a method to stabilize the gradient decent method without decreasing learning rate for two-layer neural networ... [more] MBE2022-39 NC2022-61
pp.80-85
IBISML 2022-09-15
14:40		 Kanagawa Keio Univ. (Yagami Campus)
(Primary: On-site, Secondary: Online)		 On Analysis of Generalization Error of Neural Networks
Jun'ichi Takeuchi (Kyushu Univ.), Noboru Murata (Waseda Univ.), Kazushi Mimura (Hiroshima City Univ.), Yoshinari Takeishi, Masazumi Iida (Kyushu Univ.), Hiroshi Nagaoka (Univ. of Electro Communication) IBISML2022-37		  [more] IBISML2022-37
pp.31-38
IT, EMM 2018-05-17
14:25		 Tokyo Ookayama Campus, Tokyo Institute of Technology A Two-Step Source Code Using the Parsing Count of LZ78 Code as the First Step
Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2018-2 EMM2018-2		 The redundancy of a two-step source code has been analyzed using the shape of the parsing tree of the Lempel-Ziv-Yokoo c... [more] IT2018-2 EMM2018-2
pp.7-12
WBS, IT, ISEC 2018-03-08
10:15		 Tokyo Katsusika Campas, Tokyo University of Science Evaluation of the Worst-Case Redundancy of Strongly Universal FV Source Codes Using the Source Approximation and the Asymptotically Sufficient Statistic
Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Comm.) IT2017-106 ISEC2017-94 WBS2017-87		 The universality of some variations of two-step lossless source codes using asymptotically sufficient statistics were pr... [more] IT2017-106 ISEC2017-94 WBS2017-87
pp.19-24
IBISML 2018-03-05
14:15		 Fukuoka Nishijin Plaza, Kyushu University Exponential Family of Markov Kernels and Asymptotic Exponential Family of Markov Sources
Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IBISML2017-93		 For parametric models of Markov sources, we prove that the notion of asymptotic exponential family is equivalent to the ... [more] IBISML2017-93
pp.21-25
IT 2017-07-14
15:10		 Chiba Chiba University On Information Geometry of Tree Models
Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IT2017-35		 We discuss information geometrical properties of the familes of Markov sources defined based on context trees. [more] IT2017-35
pp.109-113
IT 2017-07-14
15:35		 Chiba Chiba University Asymptotic Exponential Family of Markov Sources is Equivalent to Exponential Family of Markov Kernels
Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IT2017-36		 For familes of Markov models, we prove that the notion of asymptotic exponential familly is equivalent to the notion of ... [more] IT2017-36
pp.115-119
IT, EMM 2016-05-20
11:05		 Hokkaido Otaru Economic Center Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code
Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2016-13 EMM2016-13		 In this paper, some theorems which give relationships between a sufficient statistic and the universality of a VV source... [more] IT2016-13 EMM2016-13
pp.75-80
IT, ISEC, WBS 2016-03-10
10:15		 Tokyo The University of Electro-Communications Acceleration of the Arimoto algorithm for computation of random coding exponent function
Hiroki Watanabe, Hiroshi Nagaoka (UEC) IT2015-102 ISEC2015-61 WBS2015-85		 The Arimoto algorithm(AA) for computation of random coding exponent function is an alternating maximixation algorithm si... [more] IT2015-102 ISEC2015-61 WBS2015-85
pp.7-12
QIT
(2nd)		 2011-11-21
14:40		 Osaka Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) [Poster Presentation] Lower bounds of the error probability in estimating classical and quantum states
Takuya Kubo, Hiroshi Nagaoka (UEC) 		In classical/quantum system, estimating a hidden true state is a fundamental part of plentiful problems. The error pro... [more]
 Results 1 - 10 of 10  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan