?????? ?????? ??????????????? ?????? ????????????

Department of Computer Science and EngineeringRecently deep reinforcement learning (DRL) algorithms show super human performances in the simulated game domains. In practical points, the sample efficiency is also one of the most important measures to determine the performance of a model. Especially for the environment of large search spaces (e.g. continuous action space), it is very critical condition to achieve the state-of-the-art performance. In this thesis, we design a model to be applicable to multi-end games in continuous space with high sample efficiency. A multi-end game has several sub-games which are independent each other but affect the result of the game by some rules of its domain. We verify the algorithm in the environment of simulated curling.clos

Constraints on Flows in Horava-Lifshitz Gravity by Classical Solutions

We find exact static stringy solutions of Horava-Lifshitz gravity with the projectability condition but imposing the detailed balance condition near the UV fixed point, and propose a method on constraining the possible pattern of flows in Horava-Lifshitz gravity by using the obtained classical solutions. In the obtained vacuum solutions, the parameters related to the speed of the graviton and the coefficients of quartic spatial derivative terms lead to intriguing effects: the change of graviton speed yields a surplus angle and the quartic derivatives make the square of effective electric charge negative. The result of a few tests based on the geometries of a cone, an excess cone, a black string, and a charged (black) string seems suggestive. For example, the flow of constant graviton speed and variable Newton's coupling can be favored in the vicinity of IR fixed point, but the conclusion is indistinct and far from definite yet. Together with the numerous classical solutions, static or time-dependent, which have already been found, the accumulated data from various future tests will give some hints in constraining the flow patterns more deterministic.Comment: 27 pages, 3 figures, version to appear in PR

Monopole Floer homology for rational homology 3-spheres

We give a new construction of monopole Floer homology for spin-c rational homology 3-spheres. As applications we define two invariants of certain smooth compact 4-manifolds with b_1=1 and b^+=0.Comment: 60 pages, to appear in Duke J. Math. v2: Minor improvements concerning orientations on pages 18-21. v3: Two new sections 4 and 14 have been added

Gamma-Set Domination Graphs. I: Complete Biorientations of \u3cem\u3eq-\u3c/em\u3eExtended Stars and Wounded Spider Graphs

The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integrated in this paper. The γ-set domination graph of the complete biorientation of a graph G, domγ(G) is created. All γ-sets of specific trees T are found, and dom-γ(T) is characterized for those classes

Adaptive Restart of the Optimized Gradient Method for Convex Optimization

First-order methods with momentum such as Nesterov's fast gradient method are very useful for convex optimization problems, but can exhibit undesirable oscillations yielding slow convergence rates for some applications. An adaptive restarting scheme can improve the convergence rate of the fast gradient method, when the parameter of a strongly convex cost function is unknown or when the iterates of the algorithm enter a locally strongly convex region. Recently, we introduced the optimized gradient method, a first-order algorithm that has an inexpensive per-iteration computational cost similar to that of the fast gradient method, yet has a worst-case cost function rate that is twice faster than that of the fast gradient method and that is optimal for large-dimensional smooth convex problems. Building upon the success of accelerating the fast gradient method using adaptive restart, this paper investigates similar heuristic acceleration of the optimized gradient method. We first derive a new first-order method that resembles the optimized gradient method for strongly convex quadratic problems with known function parameters, yielding a linear convergence rate that is faster than that of the analogous version of the fast gradient method. We then provide a heuristic analysis and numerical experiments that illustrate that adaptive restart can accelerate the convergence of the optimized gradient method. Numerical results also illustrate that adaptive restart is helpful for a proximal version of the optimized gradient method for nonsmooth composite convex functions

Coupled oscillators and Feynman's three papers

According to Richard Feynman, the adventure of our science of physics is a perpetual attempt to recognize that the different aspects of nature are really different aspects of the same thing. It is therefore interesting to combine some, if not all, of Feynman's papers into one. The first of his three papers is on the ``rest of the universe'' contained in his 1972 book on statistical mechanics. The second idea is Feynman's parton picture which he presented in 1969 at the Stony Brook conference on high-energy physics. The third idea is contained in the 1971 paper he published with his students, where they show that the hadronic spectra on Regge trajectories are manifestations of harmonic-oscillator degeneracies. In this report, we formulate these three ideas using the mathematics of two coupled oscillators. It is shown that the idea of entanglement is contained in his rest of the universe, and can be extended to a space-time entanglement. It is shown also that his parton model and the static quark model can be combined into one Lorentz-covariant entity. Furthermore, Einstein's special relativity, based on the Lorentz group, can also be formulated within the mathematical framework of two coupled oscillators.Comment: 31 pages, 6 figures, based on the concluding talk at the 3rd Feynman Festival (Collage Park, Maryland, U.S.A., August 2006), minor correction

GPS source solution of the 2004 Parkfield earthquake

We compute a series of finite-source parameter inversions of the fault rupture of the 2004 Parkfield earthquake based on 1 Hz GPS records only. We confirm that some of the co-seismic slip at shallow depth (<5 km) constrained by InSAR data processing results from early post-seismic deformation. We also show 1) that if located very close to the rupture, a GPS receiver can saturate while it remains possible to estimate the ground velocity (~1.2 m/s) near the fault, 2) that GPS waveforms inversions constrain that the slip distribution at depth even when GPS monuments are not located directly above the ruptured areas and 3) the slip distribution at depth from our best models agree with that recovered from strong motion data. The 95th percentile of the slip amplitudes for rupture velocities ranging from 2 to 5 km/s is, 55 +/- 6 cm.Comment: 24 pages including supp. material