VLDB 2026 Research / reviewers in the wild / expert
Kentaro Minami
dblp:191/6744
· DBLP profile ↗
6ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0002-0071-0673ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Generative modeling · 51% Learning theory · 34% Probabilistic and Bayesian machine learning · 15% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational finance and economics › portfolio management
portfolio optimization |
0.5 | 1 | 2021 | Deep Portfolio Optimization via Distributional Prediction of Residual Factors · AAAI 2021 |
Machine learning › Generative modeling › generative adversarial network › GAN training
GAN training stability |
0.4 | 1 | 2020 | Smoothness and Stability in GANs · ICLR 2020 |
Machine learning › Generative modeling
generative adversarial network |
0.4 | 1 | 2020 | Smoothness and Stability in GANs · ICLR 2020 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › posterior inference
gibbs posterior |
0.2 | 1 | 2016 | Differential Privacy without Sensitivity · NIPS 2016 |
Privacy and data protection
differential privacy |
0.2 | 1 | 2016 | Differential Privacy without Sensitivity · NIPS 2016 |
Machine learning › Learning theory
inductive bias |
0.1 | 1 | 2021 | Deep Portfolio Optimization via Distributional Prediction of Residual Factors · AAAI 2021 |
Methods — techniques the papers use, named apart from their topics
neural network architecture · 1.0distributional prediction · 1.0ablation study · 1.0exponential mechanism · 0.5convex lipschitz loss · 0.5bayesian posterior · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Multi-agent Market Model Can Explain the Impact of AI Traders in Financial Markets-A New Microfoundations of GARCH Model
Kei Nakagawa, Masanori Hirano 0001, Kentaro Minami, Takanobu Mizuta |
PRIMA | 3 |
| 2023 | Unified Perspective on Probability Divergence via the Density-Ratio Likelihood: Bridging KL-Divergence and Integral Probability MetricsabstractThis paper provides a unified perspective for the Kullback-Leibler (KL)-divergence and the integral probability metrics (IPMs) from the perspective of maximum likelihood density-ratio estimation (DRE). Both the KL-divergence and the IPMs are widely used in various fields in applications such as generative modeling. However, a unified understanding of these concepts has still been unexplored. In this paper, we show that the KL-divergence and the IPMs can be represented as maximal likelihoods differing only by sampling schemes, and use this result to derive a unified form of the IPMs and a relaxed estimation method. To develop the estimation problem, we construct an unconstrained maximum likelihood estimator to perform DRE with a stratified sampling scheme. We further propose a novel class of probability divergences, called the Density Ratio Metrics (DRMs), that interpolates the KL-divergence and the IPMs. In addition to these findings, we also introduce some applications of the DRMs, such as DRE and generative adversarial networks. In experiments, we validate the effectiveness of our proposed methods. Masahiro Kato, Masaaki Imaizumi, Kentaro Minami |
AISTATS | 3 |
| 2022 | Uncertainty Aware Trader-Company Method: Interpretable Stock Price Prediction Capturing UncertaintyabstractMachine learning is an increasingly popular tool with some success in predicting stock prices. One promising method is the Trader-Company (TC) method, which takes into account the dynamism of the stock market and has both high predictive power and interpretability. Machine learning-based stock prediction methods, including the TC method, have been concentrating on point prediction. However, point prediction in the absence of uncertainty estimates lacks credibility quantification and raises concerns about safety. The challenge in this paper is to make an investment strategy that combines high predictive power and the ability to quantify uncertainty. We propose a novel approach called Uncertainty Aware Trader-Company Method (UTC) method. The core idea of this approach is to combine the strengths of both frameworks by merging the TC method with the probabilistic modeling, which provides probabilistic predictions and uncertainty estimations. We expect this to retain the predictive power and interpretability of the TC method while capturing the uncertainty. We theoretically prove that the proposed method estimates the posterior variance and does not introduce additional biases from the original TC method. We conduct a comprehensive evaluation of our approach based on the synthetic and real market datasets. We confirm with synthetic data that the UTC method can detect situations where the uncertainty increases and the prediction is difficult. We also confirmed that the UTC method could detect abrupt changes in data-generating distributions. We demonstrate with real market data that the UTC method can achieve higher returns and lower risks than baselines. Yugo Fujimoto, Kei Nakagawa, Kentaro Imajo, Kentaro Minami |
IEEE Big Data | 4 |
| 2021 | Deep Portfolio Optimization via Distributional Prediction of Residual FactorsabstractRecent developments in deep learning techniques have motivated intensive research in machine learning-aided stock trading strategies. However, since the financial market has a highly non-stationary nature hindering the application of typical data-hungry machine learning methods, leveraging financial inductive biases is important to ensure better sample efficiency and robustness. In this study, we propose a novel method of constructing a portfolio based on predicting the distribution of a financial quantity called residual factors, which is known to be generally useful for hedging the risk exposure to common market factors. The key technical ingredients are twofold. First, we introduce a computationally efficient extraction method for the residual information, which can be easily combined with various prediction algorithms. Second, we propose a novel neural network architecture that allows us to incorporate widely acknowledged financial inductive biases such as amplitude invariance and time-scale invariance. We demonstrate the efficacy of our method on U.S. and Japanese stock market data. Through ablation experiments, we also verify that each individual technique contributes to improving the performance of trading strategies. We anticipate our techniques may have wide applications in various financial problems. Kentaro Imajo, Kentaro Minami, Katsuya Ito, Kei Nakagawa |
AAAI | 2 |
| 2020 | Smoothness and Stability in GANs
Casey Chu, Kentaro Minami, Kenji Fukumizu |
ICLR | 2 |
| 2016 | Differential Privacy without SensitivityabstractThe exponential mechanism is a general method to construct a randomized estimator that satisfies $(\varepsilon, 0)$-differential privacy. Recently, Wang et al. showed that the Gibbs posterior, which is a data-dependent probability distribution that contains the Bayesian posterior, is essentially equivalent to the exponential mechanism under certain boundedness conditions on the loss function. While the exponential mechanism provides a way to build an $(\varepsilon, 0)$-differential private algorithm, it requires boundedness of the loss function, which is quite stringent for some learning problems. In this paper, we focus on $(\varepsilon, \delta)$-differential privacy of Gibbs posteriors with convex and Lipschitz loss functions. Our result extends the classical exponential mechanism, allowing the loss functions to have an unbounded sensitivity. Kentaro Minami, Hiromi Arai, Issei Sato, Hiroshi Nakagawa |
NIPS | 1 |