default search action
Shion Takeno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Ryota Ozaki, Kazuki Ishikawa, Youhei Kanzaki, Shion Takeno, Ichiro Takeuchi, Masayuki Karasuyama:
Multi-Objective Bayesian Optimization with Active Preference Learning. AAAI 2024: 14490-14498 - [c11]Shogo Iwazaki, Tomohiko Tanabe, Mitsuru Irie, Shion Takeno, Yu Inatsu:
Risk Seeking Bayesian Optimization under Uncertainty for Obtaining Extremum. AISTATS 2024: 1252-1260 - [c10]Yu Inatsu, Shion Takeno, Hiroyuki Hanada, Kazuki Iwata, Ichiro Takeuchi:
Bounding Box-based Multi-objective Bayesian Optimization of Risk Measures under Input Uncertainty. AISTATS 2024: 4564-4572 - [c9]Shion Takeno
, Masahiro Nomura
Hot off the Press: Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes. GECCO Companion 2024: 59-60 - [c8]Shion Takeno, Yu Inatsu, Masayuki Karasuyama, Ichiro Takeuchi:
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds. ICML 2024 - [i14]Hiroyuki Hanada, Tatsuya Aoyama, Satoshi Akahane, Tomonari Tanaka, Yoshito Okura, Yu Inatsu, Noriaki Hashimoto, Shion Takeno, Taro Murayama, Lee Hanju, Shinya Kojima, Ichiro Takeuchi:
Distributionally Robust Safe Sample Screening. CoRR abs/2406.05964 (2024) - [i13]Yu Inatsu, Shion Takeno, Kentaro Kutsukake, Ichiro Takeuchi:
Active Learning for Level Set Estimation Using Randomized Straddle Algorithms. CoRR abs/2408.03144 (2024) - [i12]Shion Takeno, Yu Inatsu, Masayuki Karasuyama:
Regret Analysis for Randomized Gaussian Process Upper Confidence Bound. CoRR abs/2409.00979 (2024) - [i11]Shogo Iwazaki, Shion Takeno:
Near-Optimal Algorithm for Non-Stationary Kernelized Bandits. CoRR abs/2410.16052 (2024) - 2023
- [c7]Shion Takeno, Yu Inatsu, Masayuki Karasuyama:
Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds. ICML 2023: 33490-33515 - [c6]Shion Takeno, Masahiro Nomura, Masayuki Karasuyama:
Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes. ICML 2023: 33516-33533 - [c5]Shogo Iwazaki, Shion Takeno, Tomohiko Tanabe, Mitsuru Irie:
Failure-Aware Gaussian Process Optimization with Regret Bounds. NeurIPS 2023 - [i10]Shion Takeno, Yu Inatsu, Masayuki Karasuyama:
Randomized Gaussian Process Upper Confidence Bound with Tight Bayesian Regret Bounds. CoRR abs/2302.01511 (2023) - [i9]Shion Takeno, Masahiro Nomura, Masayuki Karasuyama:
Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes. CoRR abs/2302.01513 (2023) - [i8]Shion Takeno, Yu Inatsu, Masayuki Karasuyama, Ichiro Takeuchi:
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds. CoRR abs/2311.03760 (2023) - [i7]Ryota Ozaki, Kazuki Ishikawa, Youhei Kanzaki, Shinya Suzuki, Shion Takeno, Ichiro Takeuchi, Masayuki Karasuyama:
Multi-Objective Bayesian Optimization with Active Preference Learning. CoRR abs/2311.13460 (2023) - 2022
- [j2]Shion Takeno, Hitoshi Fukuoka, Yuhki Tsukada
A Generalized Framework of Multifidelity Max-Value Entropy Search Through Joint Entropy. Neural Comput. 34(10): 2145-2203 (2022) - [j1]Shunya Kusakawa, Shion Takeno, Yu Inatsu, Kentaro Kutsukake, Shogo Iwazaki, Takashi Nakano, Toru Ujihara, Masayuki Karasuyama, Ichiro Takeuchi:
Bayesian Optimization for Cascade-Type Multistage Processes. Neural Comput. 34(12): 2408-2431 (2022) - [c4]Yu Inatsu, Shion Takeno, Masayuki Karasuyama, Ichiro Takeuchi:
Bayesian Optimization for Distributionally Robust Chance-constrained Problem. ICML 2022: 9602-9621 - [c3]Shion Takeno, Tomoyuki Tamura, Kazuki Shitara, Masayuki Karasuyama:
Sequential and Parallel Constrained Max-value Entropy Search via Information Lower Bound. ICML 2022: 20960-20986 - [i6]Yu Inatsu, Shion Takeno, Masayuki Karasuyama, Ichiro Takeuchi:
Bayesian Optimization for Distributionally Robust Chance-constrained Problem. CoRR abs/2201.13112 (2022) - 2021
- [i5]Shion Takeno, Tomoyuki Tamura, Kazuki Shitara, Masayuki Karasuyama:
Sequential- and Parallel- Constrained Max-value Entropy Search via Information Lower Bound. CoRR abs/2102.09788 (2021) - [i4]Shunya Kusakawa, Shion Takeno, Yu Inatsu, Kentaro Kutsukake, Shogo Iwazaki, Takashi Nakano, Toru Ujihara, Masayuki Karasuyama, Ichiro Takeuchi:
Bayesian Optimization for Cascade-type Multi-stage Processes. CoRR abs/2111.08330 (2021) - 2020
- [c2]Shinya Suzuki, Shion Takeno, Tomoyuki Tamura, Kazuki Shitara, Masayuki Karasuyama:
Multi-objective Bayesian Optimization using Pareto-frontier Entropy. ICML 2020: 9279-9288 - [c1]Shion Takeno, Hitoshi Fukuoka, Yuhki Tsukada, Toshiyuki Koyama, Motoki Shiga, Ichiro Takeuchi, Masayuki Karasuyama:
Multi-fidelity Bayesian Optimization with Max-value Entropy Search and its Parallelization. ICML 2020: 9334-9345 - [i3]Shion Takeno, Yuhki Tsukada, Hitoshi Fukuoka, Toshiyuki Koyama, Motoki Shiga, Masayuki Karasuyama:
Cost-effective search for lower-error region in material parameter space using multifidelity Gaussian process modeling. CoRR abs/2003.13428 (2020)
2010 – 2019
- 2019
- [i2]Shion Takeno, Hitoshi Fukuoka, Yuhki Tsukada, Toshiyuki Koyama, Motoki Shiga, Ichiro Takeuchi, Masayuki Karasuyama:
Multi-fidelity Bayesian Optimization with Max-value Entropy Search. CoRR abs/1901.08275 (2019) - [i1]Shinya Suzuki, Shion Takeno, Tomoyuki Tamura, Kazuki Shitara, Masayuki Karasuyama:
Multi-objective Bayesian Optimization using Pareto-frontier Entropy. CoRR abs/1906.00127 (2019)
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-11-27 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: