41 1 0 0 OA 情報幾何学

著者
甘利 俊一
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.2, no.1, pp.37-56, 1992-03-16 (Released:2017-04-08)
参考文献数
26

Information geometry is a new theoretical method to elucidate intrinsic geometrical structures underlying information systems. It is applicable to wide areas of information sciences including statistics, information theory, systems theory, etc. More concretely, information geometry studies the intrinsic geometrical structure of the manifold of probability distributions. It is found that the manifold of probability distributions leads us to a new and rich differential geometrical theory. Since most of information sciences are closely related to probability distributions, it gives a powerful method to study their intrinsic structures. A manifold consisting of a smooth family of probability distributions has a unique invariant Riemannian metric given by the Fisher information. It admits a one-parameter family of invariant affine connections, called the α-connection, where α and-α-connections are dually coupled with the Riemannian metric. The duality in affine connections is a new concept in differential geometry. When a manifold is dually flat, it admits an invariant divergence measure for which a generalized Pythagorian theorem and a projection theorem hold. The dual structure of such manifolds can be applied to statistical inference, multiterminal information theory, control systems theory, neural networks manifolds, etc. It has potential ability to be applied to general disciplines including physical and engineering sciences.
著者
大野 泰生 後藤 丈志
出版者
一般社団法人 日本応用数理学会
雑誌
日本応用数理学会論文誌 (ISSN:24240982)
巻号頁・発行日
vol.16, no.3, pp.187-195, 2006-09-25 (Released:2017-04-08)
参考文献数
20

Jenkins recently showed that an odd perfect number must be divisible by a prime greater than 10^7. The aim of this article is to give a new algorithm to obtain such a lower bound. The theory of cyclotomic numbers plays an important role in the algorithm. We also discuss some relation between cyclotomic numbers and ABC conjecture.
著者
佐藤 寛之
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.27, no.1, pp.21-30, 2017 (Released:2017-06-30)
参考文献数
29

This paper deals with Riemannian optimization, that is, optimization on Riemannian manifolds. Theories of Euclidean optimization and Riemannian manifolds are first briefly reviewed together with some simple and motivating examples, followed by the Riemannian optimization theory. Retractions and vector transports on Riemannian manifolds are introduced according to the literature to describe a general Riemannian optimization algorithm. Recent convergence analysis results of several types of Riemannian conjugate gradient methods, such as Fletcher-Reeves and Dai-Yuan-types, are then given and discussed in detail. Some applications of Riemannian optimization to problems of current interest, such as 1)singular value decomposition in numerical linear algebra; 2)canonical correlation analysis and topographic independent component analysis as statistical methods; 3)low-rank tensor completion for machine learning; 4)optimal model reduction in control theory; and 5)doubly stochastic inverse eigenvalue problem, are also introduced.
著者
石井 晃 太田 奨
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.25, no.2, pp.50-58, 2015-06-25 (Released:2017-04-08)

We apply a mathematical theory for hit phenomenon for prediction of the "general election" of AKB48 which is very popular girls group in Japan.
著者
斉藤 一哉
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.26, no.1, pp.9-14, 2016 (Released:2016-07-27)
参考文献数
18

This study presents a new method for designing self-deploying origami using the geometrically misaligned creases. In this method, some facets are replaced by “holes” such that the systems become a 1-DOF mechanism. These perforated origami models can be folded and unfolded similar to rigidfoldable(without misalignment) models because of their DOF despite the existence of the misalignment. Focusing on the removed facets, the holes will deform according to the motion of the frame of the remaining parts. In the proposed method, these holes are filled with elastic parts and store elastic energy for self-deployment. First, a new extended rigid-folding simulation technique is proposed to estimate the deformation of the holes. Next by using the above technique, the proposed method is applied on arbitrary-size quadrilateral mesh origami. Finally, by using the finite-element method, the authors conduct numerical simulations and confirm the deployment capabilities of the models.
著者
鈴木 崇文 岩見 真吾 竹内 康博
出版者
一般社団法人 日本応用数理学会
雑誌
日本応用数理学会論文誌 (ISSN:09172246)
巻号頁・発行日
vol.18, no.3, pp.473-486, 2008
参考文献数
18

2005年9月中国で実施された家禽の鳥インフルエンザウイルスに対するワクチン接種政策を例に数理モデルを考える.解析の結果,大変興味深いことに,家禽へのワクチン接種率を上げることが,総感染個体数を増加させうることを発見した.つまり,感染個体数を減少させるための家禽に対するワクチン政策が,感染個体数の増加を引き起こしている.本論文では,こういった「ワクチン政策のパラドックス」について詳しく報告する.
著者
今野 浩
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.1, no.1, pp.36-50, 1991-03-15 (Released:2017-04-08)

Recently, a remarkable progress has been made in the field of the global minimization of nonconvex functions over a polytope. The purpose of this article is to survey one of the most successful approaches in this field, namely parametric programming approaches to quasilinear nonconvex minimization problems. The problems to be discussed are: linear multiplicative programming problems, i. e., the minimization of the product of two affine functions; minimization of the sum of two linear fractional functions; minimization of concave quadratic functions and bilinear programming problems. It will be shown that a global minimum of a fairly large scale problems can be obtained efficiently by applying parametric simplex algorithms. Further, it will be shown that a convex multiplicative programming problems, i. e., the minimization of the product of two convex functions, can be solved by parametrizatioh and branch and bound techniques.
著者
鈴木 増雄
出版者
一般社団法人 日本応用数理学会
雑誌
日本応用数理学会論文誌 (ISSN:24240982)
巻号頁・発行日
vol.7, no.3, pp.257-264, 1997-09-15 (Released:2017-04-08)
参考文献数
7

The purpose of the present paper is to formulate the quantum analysis of multivariate operator functions f({A_j}) by introducing auxiliary operators {H_j} satisfying the conditions that [H_j, H_κ]=0 , [H_j, A_κ ]=0 for j≠κ, and [H_j, [H_κ, A_κ]]=0. Then we have d^nf=Σ_<j1>...<jn> δ_H_<J1>・・・δ_H_<jn>f using the inner derivation δ_A : δ_AQ=[A, Q]=AQ-QA. The operator Taylor expansion formula is given in the form : f({A_j+x_jdA_j})=e^Σ_j^x_j^d_jf({A_j})=exp(Σ_jx_jδ_H_j)f({A_j})=Σ_nΣ_<j1>...<jn>x_<j1>・・・x_<jn>δ<j1>..., _<jn>f≡Σ_nΣ_<j1>..., _<jn>x_<j1>・・・x_<jn>f^<(n)>_<j1>..., _<jn> : dA_<J1>・・・dA_jn with dA_j≡[H_j, A_j]=δ_H_jA_j, and with the partial derivatives {d_j} with respect to {A_j}. Here, δ_<j1>..., _<jn> denotes an ordered partial inner derivation, and n!f^<(n)>_<j1>...<jn> denotes the n th derivative of f({A_j}).
著者
石原 辰雄
出版者
一般社団法人 日本応用数理学会
雑誌
日本応用数理学会論文誌 (ISSN:09172246)
巻号頁・発行日
vol.12, no.3, pp.197-207, 2002
参考文献数
6
被引用文献数
1

In this paper, I derive expressions for the probability density function and the cumulative distribution function of a random variable composed of the sum and the product of n-independent uniform random variables distributed at different intervals. The numerical examples are shown to derive the probability density function in the case of three uniform random variables.
著者
冨岡 亮太
出版者
一般社団法人 日本応用数理学会
雑誌
日本応用数理学会論文誌 (ISSN:09172246)
巻号頁・発行日
vol.23, no.3, pp.485-515, 2013

本サーベイ論文では機械学習を中心とした分野で近年注目されているスパース性を導く様々な正則化法を加法的なスパース正則化と構造的なスパース正則化に分類し,それぞれに対する最適化法を議論する.前者は,条件数の悪化に対して頑健な手法が重要であり,相対拡張ラグランジュ法を紹介する.一方,後者に対しては,線形演算で表現される構造とスパース正則化項を分離することを可能にする手法として交互方向乗数法を紹介する.
著者
Jeff Irion Naoki Saito
出版者
一般社団法人 日本応用数理学会
雑誌
JSIAM Letters (ISSN:18830609)
巻号頁・発行日
vol.6, pp.21-24, 2014 (Released:2014-05-16)
参考文献数
16
被引用文献数
4

We describe a new transform that generates a dictionary of bases for handling data on a graph by combining recursive partitioning of the graph and the Laplacian eigenvectors of each subgraph. Similar to the wavelet packet and local cosine dictionaries for regularly sampled signals, this dictionary of bases on the graph allows one to select an orthonormal basis that is most suitable to one's task at hand using a best-basis type algorithm. We also describe a few related transforms including a version of the Haar wavelet transform on a graph, each of which may be useful in its own right.