Searcharxiv⌕ Search

arXiv subjects

Toshiyuki Tanaka

Publications and source records attributed to Toshiyuki Tanaka.

At least 37 records · Page 2Linked to original sources

Spatially Aggregated Gaussian Processes with Multivariate Areal Outputs

We propose a probabilistic model for inferring the multivariate function from multiple areal data sets with various granularities. Here, the areal data are observed not at location points but at regions. Existing regression-based models can only utilize the sufficiently fine-grained auxiliary data sets on the same domain (e.g., a city). With the proposed model, the functions for respective areal data sets are assumed to be a multivariate dependent Gaussian process (GP) that is modeled as a linear mixing of independent latent GPs. Sharing of latent GPs across multiple areal data sets allows us to effectively estimate the spatial correlation for each areal data set; moreover it can easily be extended to transfer learning across multiple domains. To handle the multivariate areal data, we design an observation model with a spatial aggregation process for each areal data set, which is an integral of the mixed GP over the corresponding region. By deriving the posterior GP, we can predict the data value at any location point by considering the spatial correlations and the dependences between areal data sets, simultaneously. Our experiments on real-world data sets demonstrate that our model can 1) accurately refine coarse-grained areal data, and 2) offer performance improvements by using the areal data sets from multiple domains.

stat.ML↗

Refining Coarse-grained Spatial Data using Auxiliary Spatial Data Sets with Various Granularities

We propose a probabilistic model for refining coarse-grained spatial data by utilizing auxiliary spatial data sets. Existing methods require that the spatial granularities of the auxiliary data sets are the same as the desired granularity of target data. The proposed model can effectively make use of auxiliary data sets with various granularities by hierarchically incorporating Gaussian processes. With the proposed model, a distribution for each auxiliary data set on the continuous space is modeled using a Gaussian process, where the representation of uncertainty considers the levels of granularity. The fine-grained target data are modeled by another Gaussian process that considers both the spatial correlation and the auxiliary data sets with their uncertainty. We integrate the Gaussian process with a spatial aggregation process that transforms the fine-grained target data into the coarse-grained target data, by which we can infer the fine-grained target Gaussian process from the coarse-grained data. Our model is designed such that the inference of model parameters based on the exact marginal likelihood is possible, in which the variables of fine-grained target and auxiliary data are analytically integrated out. Our experiments on real-world spatial data sets demonstrate the effectiveness of the proposed model.

stat.ML↗

A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues

This paper considers the stationary distribution of the age of information (AoI) in information update systems. We first derive a general formula for the stationary distribution of the AoI, which holds for a wide class of information update systems. The formula indicates that the stationary distribution of the AoI is given in terms of the stationary distributions of the system delay and the peak AoI. To demonstrate its applicability and usefulness, we analyze the AoI in single-server queues with four different service disciplines: first-come first-served (FCFS), preemptive last-come first-served (LCFS), and two variants of non-preemptive LCFS service disciplines. For the FCFS and the preemptive LCFS service disciplines, the GI/GI/1, M/GI/1, and GI/M/1 queues are considered, and for the non-preemptive LCFS service disciplines, the M/GI/1 and GI/M/1 queues are considered. With these results, we further show comparison results for the mean AoI's in the M/GI/1 and GI/M/1 queues under those service disciplines.

cs.PF↗

Sunyaev-Zel'dovich anisotropy due to Primordial black holes

We investigate the Sunyaev-Zel'dovich (SZ) effect caused by primordial black holes (PBHs) on the cosmic microwave background (CMB) temperature fluctuations. The gas accreting on a PBH heats up by the release of the gravitational energy. As a result, the heated gas in the vicinity of the PBH emits the UV and X-ray photons. These photons can ionize and heat the intergalactic medium (IGM) around the PBH. Assuming the simple model of these emitting photons, we compute the profiles of the IGM ionization fraction and temperature around a PBH. Using these profiles, we evaluate the Compton $y$-parameter created by the IGM gas around a PBH. Finally, we estimate the CMB temperature angular power spectrum due to the PBH SZ effect in our model. We show that the SZ temperature anisotropy due to the PBHs has the flat angular power spectrum on small scale, $l\leq2000$ and could dominate the primordial temperature spectrum on smaller scales than the Silk scale. This flat spectrum extends to the scale of the ionized region by the PBH emission. We also discuss the impact of the small-scale CMB measurement on the PBH abundance based on our results.

astro-ph.CO↗

Stellar mass dependence of the 21-cm signal around the first star and its impact on the global signal

The 21-cm signal in the vicinity of the first stars is expected to reflect properties of the first stars. In this study we pay special attention to tracing the time evolution of the ionizing photons' escape fraction, which affects the distribution of neutral hydrogen, by performing radiation hydrodynamics (RHD) simulations resolving dense gas in a halo. We find that the radial profile of 21-cm differential brightness temperature is quite sensitive to the stellar and halo masses, which reflects the time evolution of the escape fraction. In the case of a less massive star, ionizing photons hardly escape from its host halo due to the absorption by dense halo gas, thus an deep 21-cm absorption feature at just outside the halo lasts a long time. Whereas photons from a massive star well working to heat the ambient intergalactic medium turn out to cause a spatially extended 21-cm emission signature. Although individual signals are found to be undetectable with the Square Kilometre Array, our analysis using the results from the RHD simulations indicates that the properties of the first stars are imprinted on the 21-cm global signal: its amplitude depends not only on the cosmic star formation rate density, but also on the typical mass of the first stars due to the stellar-mass-dependent heating rate. Thus, we suggest that the initial mass function of the first stars is an essential factor in understanding the global signal.

astro-ph.GA↗

Observation of the "$K^-pp$"-like structure in the $d(π^+, K^+)$ reaction at 1.69 GeV/$c$

We have observed a "$K^-pp$"-like structure in the $d(π^+,K^+)$ reaction at 1.69 GeV/$c$. In this reaction $Λ(1405)$ hyperon resonance is expected to be produced as a doorway to form the $K^-pp$ through the $Λ^*p\rightarrow K^-pp$ process. However, most of the produced $Λ(1405)$'s would escape from deuteron without secondary reactions. Therefore, coincidence of high-momentum ($>$ 250~MeV/$c$) proton(s) in large emission angles ($39^\circ<θ_{lab.}<122^\circ$) was requested to enhance the signal-to-background ratio. A broad enhancement in the proton coincidence spectra are observed around the missing-mass of 2.27 GeV/$c^2$, which corresponds to the $K^-pp$ binding energy of 95 $^{+18}_{-17}$ (stat.) $^{+30}_{-21}$ (syst.) MeV and the width of 162 $^{+87}_{-45}$ (stat.) $^{+66}_{-78}$ (syst.) MeV.

nucl-ex↗

Inclusive spectrum of the $d(π^+, K^+)$ reaction at 1.69 GeV/c

We have measured an inclusive missing-mass spectrum of the $d(π^+, K^+)$ reaction at the pion incident momentum of 1.69 GeV/$c$ at the laboratory scattering angles between 2$^\circ$ and 16$^\circ$ with the missing-mass resolution of 2.7 $\pm$ 0.1 MeV/$c^2$ (FWHM) at the missing mass of 2.27 GeV/$c^{2}$. In this Letter, we first try to understand the spectrum as a simple quasi-free picture based on several known elementary cross sections, considering the neutron/proton Fermi motion in deuteron. While gross spectrum structures are well understood in this picture, we have observed two distinct deviations; one peculiar enhancement at 2.13 GeV/$c^2$ is due to the $ΣN$ cusp, and the other notable feature is a shift of a broad bump structure, mainly originating from hyperon resonance productions of $Λ(1405)$ and $Σ(1385)^{+/0}$, by about 22.4 $\pm$ 0.4 (stat.) $^{+2.7}_{-1.7}$ (syst.) MeV/$c^2$ toward the low-mass side, which is calculated in the kinematics of a proton at rest as the target.

nucl-ex↗

Performance Improvement of Iterative Multiuser Detection for Large Sparsely-Spread CDMA Systems by Spatial Coupling

Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to sparsely-spread code-division multiple-access (CDMA) systems to improve the performance of iterative multiuser detection based on BP. Two iterative receivers based on BP are considered: One receiver is based on exact BP and the other on an approximate BP with Gaussian approximation. The performance of the two BP receivers is evaluated via density evolution (DE) in the dense limit after taking the large-system limit, in which the number of users and the spreading factor tend to infinity while their ratio is kept constant. The two BP receivers are shown to achieve the same performance as each other in these limits. Furthermore, taking a continuum limit for the obtained DE equations implies that the performance of the two BP receivers can be improved up to the performance achieved by the symbol-wise MAP detection, called individually-optimal detection, via spatial coupling. Numerical simulations show that spatial coupling can provide a significant improvement in bit error rate for finite-sized systems especially in the region of high system loads.

cs.IT↗

Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices

Polarization phenomenon over any finite field $\mathbb{F}_{q}$ with size $q$ being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arikan for the binary field, as well as its extension to a prime field by Sasoglu, Telatar, and Arikan. In this paper, a necessary and sufficient condition of a matrix over a finite field $\mathbb{F}_q$ is shown under which any source and channel are polarized. Furthermore, the result of the speed of polarization for the binary alphabet obtained by Arikan and Telatar is generalized to arbitrary finite field. It is also shown that the asymptotic error probability of polar codes is improved by using the Reed-Solomon matrix, which can be regarded as a natural generalization of the $2\times 2$ binary matrix used in the original proposal by Arikan.

cs.IT↗

A Potential Theory of General Spatially-Coupled Systems via a Continuum Approximation

This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling, it is shown that, if the boundary of the SC systems is fixed to the unique stable solution that minimizes the potential over all stationary solutions, the systems can approach the optimal performance as the number of coupled systems tends to infinity.

cs.IT↗

On an Achievable Rate of Large Rayleigh Block-Fading MIMO Channels with No CSI

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable rates of successive decoding (SD) receivers based on the linear minimum mean-squared error (LMMSE) channel estimation are analyzed in the large-system limit, by using the replica method under the assumption of replica symmetry. It is shown that negligible pilot information is best in terms of the achievable rates of the SD receivers in the large-system limit. The obtained analytical formulas of the achievable rates can improve the existing lower bound on the capacity of the MIMO channel with no channel state information (CSI), derived by Hassibi and Hochwald, for all signal-to-noise ratios (SNRs). The comparison between the obtained bound and a high SNR approximation of the channel capacity, derived by Zheng and Tse, implies that the high SNR approximation is unreliable unless quite high SNR is considered. Energy efficiency in the low SNR regime is also investigated in terms of the power per information bit required for reliable communication. The required minimum power is shown to be achieved at a positive rate for the SD receiver with no CSI, whereas it is achieved in the zero-rate limit for the case of perfect CSI available at the receiver. Moreover, numerical simulations imply that the presented large-system analysis can provide a good approximation for not so large systems. The results in this paper imply that SD schemes can provide a significant performance gain in the low-to-moderate SNR regimes, compared to conventional receivers based on one-shot channel estimation.

cs.IT↗

New Generalizations of the Bethe Approximation via Asymptotic Expansion

The Bethe approximation, discovered in statistical physics, gives an efficient algorithm called belief propagation (BP) for approximating a partition function. BP empirically gives an accurate approximation for many problems, e.g., low-density parity-check codes, compressed sensing, etc. Recently, Vontobel gives a novel characterization of the Bethe approximation using graph cover. In this paper, a new approximation based on the Bethe approximation is proposed. The new approximation is derived from Vontobel's characterization using graph cover, and expressed by using the edge zeta function, which is related with the Hessian of the Bethe free energy as shown by Watanabe and Fukumizu. On some conditions, it is proved that the new approximation is asymptotically better than the Bethe approximation.

cs.IT↗

Parametric Return Density Estimation for Reinforcement Learning

Most conventional Reinforcement Learning (RL) algorithms aim to optimize decision-making rules in terms of the expected returns. However, especially for risk management purposes, other risk-sensitive criteria such as the value-at-risk or the expected shortfall are sometimes preferred in real applications. Here, we describe a parametric method for estimating density of the returns, which allows us to handle various criteria in a unified manner. We first extend the Bellman equation for the conditional expected return to cover a conditional probability density of the returns. Then we derive an extension of the TD-learning algorithm for estimating the return densities in an unknown environment. As test instances, several parametric density estimation algorithms are presented for the Gaussian, Laplace, and skewed Laplace distributions. We show that these algorithms lead to risk-sensitive as well as robust RL paradigms through numerical experiments.

cs.LG↗

Central Approximation in Statistical Physics and Information Theory

In statistical physics and information theory, although the exponent of the partition function is often of our primary interest, there are cases where one needs more detailed information. In this paper, we present a general framework to study more precise asymptotic behaviors of the partition function, using the central approximation in conjunction with the method of types.

cs.IT↗

A Phenomenological Study on Threshold Improvement via Spatial Coupling

Kudekar et al. proved an interesting result in low-density parity-check (LDPC) convolutional codes: The belief-propagation (BP) threshold is boosted to the maximum-a-posteriori (MAP) threshold by spatial coupling. Furthermore, the authors showed that the BP threshold for code-division multiple-access (CDMA) systems is improved up to the optimal one via spatial coupling. In this letter, a phenomenological model for elucidating the essence of these phenomenon, called threshold improvement, is proposed. The main result implies that threshold improvement occurs for spatially-coupled general graphical models.

cs.IT↗

Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel

Low-density parity-check (LDPC) codes on symmetric memoryless channels have been analyzed using statistical physics by several authors. In this paper, statistical mechanical analysis of LDPC codes is performed for asymmetric memoryless channels and general Markov channels. It is shown that the saddle point equations of the replica symmetric solution for a Markov channel is equivalent to the density evolution of the belief propagation on the factor graph representing LDPC codes on the Markov channel. The derivation uses the method of types for Markov chain.

cs.IT↗

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

For a binary-input memoryless symmetric channel $W$, we consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over $W$. In particular, we study the asymptotics of the cumulative distribution $\mathbb{P}(Z_n \leq z)$, where $\{Z_n\}$ is the Bhattacharyya process defined from $W$, and its dependence on the rate of transmission. On the basis of this result, we characterize the asymptotic behavior, as well as its dependence on the rate, of the block error probability of polar codes using the successive cancellation decoder. This refines the original bounds by Arıkan and Telatar. Our results apply to general polar codes based on $\ell \times \ell$ kernel matrices. We also provide lower bounds on the block error probability of polar codes using the MAP decoder. The MAP lower bound and the successive cancellation upper bound coincide when $\ell=2$, but there is a gap for $\ell>2$.

cs.IT↗

Capacity and Modulations with Peak Power Constraint

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity under such constraints, it is crucial to take these constraints into consideration properly. In this paper, we propose a direct approach to compare the achievable rates of practical input constellations and the capacity under such constraints. As an example, we study the discrete-time complex-valued additive white Gaussian noise (AWGN) channel and compare the capacity under the peak power constraint with the achievable rates of phase shift keying (PSK) and quadrature amplitude modulation (QAM) input constellations.

cs.IT↗