Suboptimal Solution Path Algorithm for Support Vector Machine

We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimization problems in machine learning. The path of the solutions provided by this algorithm are very accurate and they satisfy the optimality conditions more strictly than other SVM optimization algorithms. In many machine learning application, however, this strict optimality is often unnecessary, and it adversely affects the computational efficiency. Our algorithm can generate the path of suboptimal solutions within an arbitrary user-specified tolerance level. It allows us to control the trade-off between the accuracy of the solution and the computational cost. Moreover, We also show that our suboptimal solutions can be interpreted as the solution of a \emph{perturbed optimization problem} from the original one. We provide some theoretical analyses of our algorithm based on this novel interpretation. The experimental results also demonstrate the effectiveness of our algorithm.Comment: A shorter version of this paper is submitted to ICML 201

A new formulation of asset trading games in continuous time with essential forcing of variation exponent

We introduce a new formulation of asset trading games in continuous time in the framework of the game-theoretic probability established by Shafer and Vovk (Probability and Finance: It's Only a Game! (2001) Wiley). In our formulation, the market moves continuously, but an investor trades in discrete times, which can depend on the past path of the market. We prove that an investor can essentially force that the asset price path behaves with the variation exponent exactly equal to two. Our proof is based on embedding high-frequency discrete-time games into the continuous-time game and the use of the Bayesian strategy of Kumon, Takemura and Takeuchi (Stoch. Anal. Appl. 26 (2008) 1161--1180) for discrete-time coin-tossing games. We also show that the main growth part of the investor's capital processes is clearly described by the information quantities, which are derived from the Kullback--Leibler information with respect to the empirical fluctuation of the asset price.Comment: Published in at http://dx.doi.org/10.3150/08-BEJ188 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm

Conformal Geometry of Sequential Test in Multidimensional Curved Exponential Family

This article presents a differential geometrical method for analyzing sequential test procedures. It is based on the primal result on the conformal geometry of statistical manifold developed in Kumon, Takemura and Takeuchi (2011). By introducing curvature-type random variables, the condition is first clarified for a statistical manifold to be an exponential family under an appropriate sequential test procedure. This result is further elaborated for investigating the efficient sequential test in a multidimensional curved exponential family. The theoretical results are numerically examined by using von Mises-Fisher and hyperboloid models