default search action
Ken Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Keisuke Mizutani, Ayaka Ueta, Ryota Ueda, Ray Oishi, Tomofumi Hara, Yuki Hoshino, Ken Kobayashi, Kazuhide Nakata:
Zero-Inflated Poisson Tensor Factorization for Sparse Purchase Data in E-Commerce Markets. ICIEA-EU 2024: 158-171 - [c15]Haruka Kiyohara, Ren Kishimoto, Kosuke Kawakami, Ken Kobayashi, Kazuhide Nakata, Yuta Saito:
Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluation. ICLR 2024 - [c14]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Learning Decision Trees and Forests with Algorithmic Recourse. ICML 2024 - [c13]Shoki Yamao, Ken Kobayashi, Kentaro Kanamori, Takuya Takagi, Yuichi Ike, Kazuhide Nakata:
Distribution-Aligned Sequential Counterfactual Explanation with Local Outlier Factor. PRICAI (1) 2024: 243-256 - [c12]Naoki Nishimura, Ken Kobayashi, Kazuhide Nakata:
Balancing Immediate Revenue and Future Off-Policy Evaluation in Coupon Allocation. PRICAI (4) 2024: 422-428 - [i13]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Learning Decision Trees and Forests with Algorithmic Recourse. CoRR abs/2406.01098 (2024) - [i12]Naoki Nishimura, Ken Kobayashi, Kazuhide Nakata:
Balancing Immediate Revenue and Future Off-Policy Evaluation in Coupon Allocation. CoRR abs/2407.11039 (2024) - 2023
- [j7]Ken Kobayashi, Yuichi Takano, Kazuhide Nakata:
Cardinality-constrained distributionally robust portfolio optimization. Eur. J. Oper. Res. 309(3): 1173-1182 (2023) - [c11]Masaki Higashi, Minje Sung, Daiki Yamane, Kenta Inamuro, Shota Nagai, Ken Kobayashi, Kazuhide Nakata:
Decision Tree Clustering for Time Series Data: An Approach for Enhanced Interpretability and Efficiency. PRICAI (2) 2023: 457-468 - [i11]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Counterfactual Explanation with Missing Values. CoRR abs/2304.14606 (2023) - [i10]Keisho Oh, Naoki Nishimura, Minje Sung, Ken Kobayashi, Kazuhide Nakata:
An IPW-based Unbiased Ranking Metric in Two-sided Markets. CoRR abs/2307.10204 (2023) - [i9]Haruka Kiyohara, Ren Kishimoto, Kosuke Kawakami, Ken Kobayashi, Kazuhide Nakata, Yuta Saito:
SCOPE-RL: A Python Library for Offline Reinforcement Learning and Off-Policy Evaluation. CoRR abs/2311.18206 (2023) - [i8]Haruka Kiyohara, Ren Kishimoto, Kosuke Kawakami, Ken Kobayashi, Kazuhide Nakata, Yuta Saito:
Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluation. CoRR abs/2311.18207 (2023) - 2022
- [c10]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Counterfactual Explanation Trees: Transparent and Consistent Actionable Recourse with Decision Trees. AISTATS 2022: 1846-1870 - [c9]Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi, Hiroshi Umeki, Shinichi Shirakawa, Naoki Hamada:
A two-phase framework with a bézier simplex-based interpolation method for computationally expensive multi-objective optimization. GECCO 2022: 601-610 - [i7]Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi, Hiroshi Umeki, Shinichi Shirakawa, Naoki Hamada:
A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization. CoRR abs/2203.15292 (2022) - [i6]Akiyoshi Sannai, Yasunari Hikima, Ken Kobayashi, Akinori Tanaka, Naoki Hamada:
Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization. CoRR abs/2205.11099 (2022) - 2021
- [j6]Ken Kobayashi, Yuichi Takano, Kazuhide Nakata:
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization. J. Glob. Optim. 81(2): 493-528 (2021) - [c8]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. AAAI 2021: 11564-11574 - [c7]Hayato Kobayashi, Hiroaki Taguchi, Yoshimune Tabuchi, Chahine Koleejan, Ken Kobayashi, Soichiro Fujita, Kazuma Murao, Takeshi Masuyama, Taichi Yatsuka, Manabu Okumura, Satoshi Sekine:
A Case Study of In-House Competition for Ranking Constructive Comments in a News Service. SocialNLP@NAACL 2021: 24-35 - [c6]Kei Tsukamoto, Akira Ebisui, Tetsuro Goto, Yoshiaki Sakakura, Ken Kobayashi, Satoshi Sato, Takahiro Kamei, Yutaka Imai, Kazumasa Nomoto:
Soft-Material-Based Highly Reliable Tri-Axis Tactile Thin-Film Sensors for Robotic Manipulation Tasks. IEEE SENSORS 2021: 1-4 - [i5]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Approximate Bayesian Computation of Bézier Simplices. CoRR abs/2104.04679 (2021) - [i4]Ken Kobayashi, Yuichi Takano, Kazuhide Nakata:
Cardinality-constrained Distributionally Robust Portfolio Optimization. CoRR abs/2112.12454 (2021) - 2020
- [j5]Ken Kobayashi, Yuichi Takano:
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems. Comput. Optim. Appl. 75(2): 493-513 (2020) - [c5]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Asymptotic Risk of Bézier Simplex Fitting. AAAI 2020: 2416-2424 - [c4]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura:
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. IJCAI 2020: 2855-2862 - [i3]Tomokaze Shiratori, Ken Kobayashi, Yuichi Takano:
Prediction of hierarchical time series using structured regularization and its application to artificial neural networks. CoRR abs/2007.15159 (2020) - [i2]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. CoRR abs/2012.11782 (2020)
2010 – 2019
- 2019
- [j4]Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui:
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. J. Glob. Optim. 73(2): 431-446 (2019) - [c3]Ken Kobayashi, Naoki Hamada, Akiyoshi Sannai, Akinori Tanaka, Kenichi Bannai, Masashi Sugiyama:
Bézier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-Objective Optimization. AAAI 2019: 2304-2313 - [c2]Li Sun, Xiaoyi Yu, Liuan Wang, Jun Sun, Hiroya Inakoshi, Ken Kobayashi, Hiromichi Kobashi:
Automatic Neural Network Search Method for Open Set Recognition. ICIP 2019: 4090-4094 - [c1]Kazuma Murao, Ken Kobayashi, Hayato Kobayashi, Taichi Yatsuka, Takeshi Masuyama, Tatsuru Higurashi, Yoshimune Tabuchi:
A Case Study on Neural Headline Generation for Editing Support. NAACL-HLT (2) 2019: 73-82 - [i1]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Asymptotic Risk of Bezier Simplex Fitting. CoRR abs/1906.06924 (2019)
2000 – 2009
- 2008
- [j3]Yuichi Kurita, Roland Kempf, Yoshichika Iida, Jumpei Okude, Makoto Kaneko, Hiromu K. Mishima, Hidetoshi Tsukamoto, Eiichiro Sugimoto, Seiki Katakura, Ken Kobayashi, Yoshiaki Kiuchi:
Contact-Based Stiffness Sensing of Human Eye. IEEE Trans. Biomed. Eng. 55(2): 739-745 (2008) - 2005
- [j2]Naomi Hidaka, Ken Kobayashi, Hideaki Sugama, Ryo Usui, Yoshihiro Tanabe, Osamu Hashimoto:
Log-Periodic Dipole Antenna Array-Type Optical Electric Field Sensor. IEICE Trans. Electron. 88-C(1): 98-104 (2005)
1990 – 1999
- 1999
- [j1]Ken Kobayashi, Masato Suzuki, Sadao Sasaya:
Grafting Robot. J. Robotics Mechatronics 11(3): 213-219 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint