Akira Tanimoto
Research Subjects
Akira Tanimoto has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Hisashi Kashima
Kyoto University, Kyoto, Japan
2 shared publications Takashi Takenouchi
2 shared publications- Fuyuto Terui
Graduate School of Engineering, Kanagawa Institute of Technology, Atsugi 243-0292, Japan
1 shared publication Hisashi Kashima
1 shared publication- Jun-Ichi Shimoyama
Department of Applied Chemistry, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
1 shared publication K. Yamazaki
Sumitomo Electric Industries, Ltd., 1-1-3 Shimaya, Konohana-ku, Osaka 554-0024, Japan
1 shared publication
Latest Publications
- 16 November 2025
- Published by Springer Nature
- p. 271-285
A Distributionally Robust Framework for Nuisance in Causal Effect Estimation
- 16 November 2025
- Published by Springer Nature
- p. 271-285
A Distributionally Robust Framework for Nuisance in Causal Effect Estimation
- Open Access
- 10 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 201
Improving imbalanced classification using near-miss instances
- 10 April 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 201
Open AccessImproving imbalanced classification using near-miss instances
- 8 May 2021
- Published by Springer Nature
- p. 498-509
Causal Combinatorial Factorization Machines for Set-Wise Recommendation
- 8 May 2021
- Published by Springer Nature
- p. 498-509
Causal Combinatorial Factorization Machines for Set-Wise Recommendation
- Open Access
- 15 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 46788-46799
Combinatorial Q-Learning for Condition-Based Infrastructure Maintenance
Infrastructure maintenance planning is a large-scale optimization problem of planning when and on which components to carry out maintenance so as to keep the whole infrastructure in good condition with minimal maintenance cost. Recent advances in condition monitoring techniques have enabled timely maintenance in response to the condition of each part regardless of age. In addition to the condition, the spatial structure is also important for cost-efficiency in infrastructure maintenance since traveling costs and/or setup costs can be saved by simultaneous maintenance of neighboring components, which is called economic dependency. This optimization problem naively has a high computational complexity of O(2nH), where n is the number of components and H is the planning horizon, and the predictive modeling of degradation is also a big issue. To solve this problem efficiently at scale, our proposed method utilizes two kinds of dynamic programming for temporal and spatial scalability and consequently enjoys O(n) complexity at each time step. For temporal scalability, we utilize a direct modeling approach for the action value of maintenance instead of modeling degradation, namely, Q-learning. For spatial scalability, we exploit locality in economic dependency by means of a reasonable approximation of the Q-function. A typical baseline approach is to divide the whole infrastructure into fixed groups of neighboring components beforehand and determine if maintenance should be performed for all the components in each group at each time step. In contrast, our scalable method enables fully combinatorial optimization for each component at each time step. We demonstrate the advantage of our method in a simulated environment, and the resulting maintenance history intuitively illustrates the benefit of our dynamic grouping approach. We also show that our method has a kind of interpretability in the optimization at each time step.
- 15 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 46788-46799
Open AccessCombinatorial Q-Learning for Condition-Based Infrastructure Maintenance
Infrastructure maintenance planning is a large-scale optimization problem of planning when and on which components to carry out maintenance so as to keep the whole infrastructure in good condition with minimal maintenance cost. Recent advances in condition monitoring techniques have enabled timely maintenance in response to the condition of each part regardless of age. In addition to the condition, the spatial structure is also important for cost-efficiency in infrastructure maintenance since traveling costs and/or setup costs can be saved by simultaneous maintenance of neighboring components, which is called economic dependency. This optimization problem naively has a high computational complexity of O(2nH), where n is the number of components and H is the planning horizon, and the predictive modeling of degradation is also a big issue. To solve this problem efficiently at scale, our proposed method utilizes two kinds of dynamic programming for temporal and spatial scalability and consequently enjoys O(n) complexity at each time step. For temporal scalability, we utilize a direct modeling approach for the action value of maintenance instead of modeling degradation, namely, Q-learning. For spatial scalability, we exploit locality in economic dependency by means of a reasonable approximation of the Q-function. A typical baseline approach is to divide the whole infrastructure into fixed groups of neighboring components beforehand and determine if maintenance should be performed for all the components in each group at each time step. In contrast, our scalable method enables fully combinatorial optimization for each component at each time step. We demonstrate the advantage of our method in a simulated environment, and the resulting maintenance history intuitively illustrates the benefit of our dynamic grouping approach. We also show that our method has a kind of interpretability in the optimization at each time step.
- Open Access
Regret Minimization for Causal Inference on Large Treatment Space
Predicting which action (treatment) will lead to a better outcome is a central task in decision support systems. To build a prediction model in real situations, learning from biased observational data is a critical issue due to the lack of randomized controlled trial (RCT) data. To handle such biased observational data, recent efforts in causal inference and counterfactual machine learning have focused on debiased estimation of the potential outcomes on a binary action space and the difference between them, namely, the individual treatment effect. When it comes to a large action space (e.g., selecting an appropriate combination of medicines for a patient), however, the regression accuracy of the potential outcomes is no longer sufficient in practical terms to achieve a good decision-making performance. This is because the mean accuracy on the large action space does not guarantee the nonexistence of a single potential outcome misestimation that might mislead the whole decision. Our proposed loss minimizes a classification error of whether or not the action is relatively good for the individual target among all feasible actions, which further improves the decision-making performance, as we prove. We also propose a network architecture and a regularizer that extracts a debiased representation not only from the individual feature but also from the biased action for better generalization in large action spaces. Extensive experiments on synthetic and semi-synthetic datasets demonstrate the superiority of our method for large combinatorial action spaces.
Open AccessRegret Minimization for Causal Inference on Large Treatment Space
Predicting which action (treatment) will lead to a better outcome is a central task in decision support systems. To build a prediction model in real situations, learning from biased observational data is a critical issue due to the lack of randomized controlled trial (RCT) data. To handle such biased observational data, recent efforts in causal inference and counterfactual machine learning have focused on debiased estimation of the potential outcomes on a binary action space and the difference between them, namely, the individual treatment effect. When it comes to a large action space (e.g., selecting an appropriate combination of medicines for a patient), however, the regression accuracy of the potential outcomes is no longer sufficient in practical terms to achieve a good decision-making performance. This is because the mean accuracy on the large action space does not guarantee the nonexistence of a single potential outcome misestimation that might mislead the whole decision. Our proposed loss minimizes a classification error of whether or not the action is relatively good for the individual target among all feasible actions, which further improves the decision-making performance, as we prove. We also propose a network architecture and a regularizer that extracts a debiased representation not only from the individual feature but also from the biased action for better generalization in large action spaces. Extensive experiments on synthetic and semi-synthetic datasets demonstrate the superiority of our method for large combinatorial action spaces.
- Open Access
- 1 January 2015
- Published by Japan Society for Aeronautical and Space Sciences in TRANSACTIONS OF THE JAPAN SOCIETY FOR AERONAUTICAL AND SPACE SCIENCES
- Vol. 58 (1) , 45-53
Evaluation of Interest-region Detectors and Descriptors for Automatic Landmark Tracking on Asteroids
- 1 January 2015
- Published by Japan Society for Aeronautical and Space Sciences in TRANSACTIONS OF THE JAPAN SOCIETY FOR AERONAUTICAL AND SPACE SCIENCES
- Vol. 58 (1) , 45-53
Open AccessEvaluation of Interest-region Detectors and Descriptors for Automatic Landmark Tracking on Asteroids
- 14 April 2007
- Published by Elsevier in Physica C: Superconductivity and its Applications
- Vol. 460-462, 1405-1406
Possibilities of Tc enhancement for already known HTSC compounds
- 14 April 2007
- Published by Elsevier in Physica C: Superconductivity and its Applications
- Vol. 460-462, 1405-1406
Possibilities of Tc enhancement for already known HTSC compounds