default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShota Saito
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j18]Koshi Shimada, Shota Saito
, Toshiyasu Matsushima:
An Efficient Bayes Coding Algorithm for Changing Context Tree Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 448-457 (2024)- [j17]Shota Saito:
Meta-Bound on Lower Bounds of Bayes Risk in Parameter Estimation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 503-509 (2024) - [j16]Takuya Matsuda, Kento Uchida, Shota Saito, Shinichi Shirakawa:
HACNet: End-to-end learning of interpretable table-to-image converter and convolutional neural network. Knowl. Based Syst. 284: 111293 (2024) - [j15]Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
Marginal Probability-Based Integer Handling for CMA-ES Tackling Single- and Multi-Objective Mixed-Integer Black-Box Optimization. ACM Trans. Evol. Learn. Optim. 4(2): 10 (2024) - [c40]Ryoki Hamano, Shota Saito, Masahiro Nomura, Kento Uchida, Shinichi Shirakawa:
CatCMA : Stochastic Optimization for Mixed-Category Problems. GECCO 2024 - [c39]Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shota Saito, Shinichi Shirakawa:
CMA-ES for Safe Optimization. GECCO 2024 - [c38]Shota Saito:
Soft Guessing Under Log-Loss Distortion Allowing Errors. ISIT 2024: 2957-2962 - [c37]Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shota Saito, Shinichi Shirakawa:
CMA-ES for Discrete and Mixed-Variable Optimization on Sets of Points. PPSN (2) 2024: 236-251 - [i25]Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster:
Bandits with Abstention under Expert Advice. CoRR abs/2402.14585 (2024) - [i24]Ryoki Hamano, Shota Saito, Masahiro Nomura, Kento Uchida, Shinichi Shirakawa:
CatCMA : Stochastic Optimization for Mixed-Category Problems. CoRR abs/2405.09962 (2024) - [i23]Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shota Saito, Shinichi Shirakawa:
CMA-ES for Safe Optimization. CoRR abs/2405.10534 (2024) - [i22]Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shota Saito, Shinichi Shirakawa:
CMA-ES for Discrete and Mixed-Variable Optimization on Sets of Points. CoRR abs/2408.13046 (2024) - 2023
- [j14]Shota Saito, Mark Herbster:
Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm. Mach. Learn. 112(1): 241-280 (2023) - [j13]Shota Saito, Toshiyasu Matsushima:
Non-Asymptotic Bounds of Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression. IEEE Trans. Inf. Theory 69(4): 2113-2119 (2023) - [c36]Kaoru Shimada, Shogo Matsuno, Shota Saito:
Discovery of Contrast Itemset with Statistical Background Between Two Continuous Variables. DaWaK 2023: 114-119 - [c35]Yutaro Yamada, Kento Uchida, Shota Saito, Shinichi Shirakawa:
Surrogate-Assisted (1+1)-CMA-ES with Switching Mechanism of Utility Functions. EvoApplications@EvoStar 2023: 798-814 - [c34]Yohei Watanabe, Kento Uchida, Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
(1+1)-CMA-ES with Margin for Discrete and Mixed-Integer Problems. GECCO 2023: 882-890 - [c33]Shota Saito, Mark Herbster:
Multi-class Graph Clustering via Approximated Effective p-Resistance. ICML 2023: 29697-29733 - [c32]Yuta Nakahara, Shota Saito, Koshi Shimada, Toshiyasu Matsushima:
Hyperparameter Learning of Bayesian Context Tree Models. ISIT 2023: 537-542 - [i21]Yohei Watanabe, Kento Uchida, Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
(1+1)-CMA-ES with Margin for Discrete and Mixed-Integer Problems. CoRR abs/2305.00849 (2023) - [i20]Yuta Nakahara, Shota Saito, Naoki Ichijo, Koki Kazama, Toshiyasu Matsushima:
Prediction Algorithms Achieving Bayesian Decision Theoretical Optimality Based on Decision Trees as Data Observation Processes. CoRR abs/2306.07060 (2023) - [i19]Shota Saito, Mark Herbster:
Multi-class Graph Clustering via Approximated Effective p-Resistance. CoRR abs/2306.08617 (2023) - [i18]Shota Saito:
Soft Guessing Under Log-Loss Distortion Allowing Errors. CoRR abs/2307.11306 (2023) - 2022
- [j12]Yuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima:
Probability Distribution on Full Rooted Trees. Entropy 24(3): 328 (2022) - [j11]Shota Saito, Toshiyasu Matsushima:
Upper Bound on Privacy-Utility Tradeoff Allowing Positive Excess Distortion Probability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 425-427 (2022) - [c31]Shota Saito:
Hypergraph Modeling via Spectral Embedding Connection: Hypergraph Cut, Weighted Kernel k-Means, and Heat Kernel. AAAI 2022: 8141-8149 - [c30]Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
CMA-ES with margin: lower-bounding marginal probability for mixed-integer black-box optimization. GECCO 2022: 639-647 - [c29]Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
Benchmarking CMA-ES with margin on the bbob-mixint testbed. GECCO Companion 2022: 1708-1716 - [c28]Shoma Shimizu, Takayuki Nishio, Shota Saito, Yoichi Hirose, Yen-Hsiu Chen, Shinichi Shirakawa:
Neural Architecture Search for Improving Latency-Accuracy Trade-off in Split Computing. GLOBECOM (Workshops) 2022: 1864-1870 - [c27]Yuhei Noda, Shota Saito, Shinichi Shirakawa:
Efficient Search of Multiple Neural Architectures with Different Complexities via Importance Sampling. ICANN (4) 2022: 607-619 - [c26]Yuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima:
Probability Distribution on Rooted Trees. ISIT 2022: 174-179 - [c25]Shota Saito:
On Meta-Bound for Lower Bounds of Bayes Risk. ISIT 2022: 3162-3167 - [c24]Taisuke Ishiwatari, Shota Saito, Yuta Nakahara, Yuji Iikubo, Toshiyasu Matsushima:
Bayes Optimal Estimation and Its Approximation Algorithm for Difference with and without Treatment under URLC Model. ISITA 2022: 144-148 - [i17]Yuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima:
Probability Distribution on Rooted Trees. CoRR abs/2201.09460 (2022) - [i16]Shota Saito:
Hypergraph Modeling via Spectral Embedding Connection: Hypergraph Cut, Weighted Kernel k-means, and Heat Kernel. CoRR abs/2203.09888 (2022) - [i15]Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
CMA-ES with Margin: Lower-Bounding Marginal Probability for Mixed-Integer Black-Box Optimization. CoRR abs/2205.13482 (2022) - [i14]Yuhei Noda, Shota Saito, Shinichi Shirakawa:
Efficient Search of Multiple Neural Architectures with Different Complexities via Importance Sampling. CoRR abs/2207.10334 (2022) - [i13]Shoma Shimizu, Takayuki Nishio, Shota Saito, Yoichi Hirose, Yen-Hsiu Chen, Shinichi Shirakawa:
Neural Architecture Search for Improving Latency-Accuracy Trade-off in Split Computing. CoRR abs/2208.13968 (2022) - [i12]Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa:
CMA-ES with Margin for Single-and Multi-Objective Mixed-Integer Black-Box Optimization. CoRR abs/2212.09260 (2022) - 2021
- [j10]Nao Dobashi, Shota Saito, Yuta Nakahara, Toshiyasu Matsushima:
Meta-Tree Random Forest: Probabilistic Data-Generative Model and Bayes Optimal Prediction. Entropy 23(6): 768 (2021) - [c23]Shota Saito, Toshiyasu Matsushima:
Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code: Extension and Example. ISIT 2021: 1445-1450 - [c22]Koshi Shimada, Shota Saito, Toshiyasu Matsushima:
An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval. ITW 2021: 1-6 - [i11]Koshi Shimada, Shota Saito, Toshiyasu Matsushima:
An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval. CoRR abs/2105.05163 (2021) - [i10]Yuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima:
Probability Distribution on Full Rooted Trees. CoRR abs/2109.12825 (2021) - 2020
- [c21]Shota Saito, Toshiyasu Matsushima:
Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code. ISIT 2020: 2510-2514 - [c20]Shota Saito, Toshiyasu Matsushima:
On Two Information Quantities Relating Two Distortion Balls. ISITA 2020: 16-20
2010 – 2019
- 2019
- [j9]Jun Yoshizawa, Shota Saito, Toshiyasu Matsushima:
Variable-Length Intrinsic Randomness on Two Performance Criteria Based on Variational Distance. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1642-1650 (2019) - [c19]Shota Saito, Shinichi Shirakawa:
Controlling Model Complexity in Probabilistic Model-Based Dynamic Optimization of Neural Network Structures. ICANN (2) 2019: 393-405 - [c18]Youhei Akimoto, Shinichi Shirakawa, Nozomu Yoshinari, Kento Uchida, Shota Saito, Kouhei Nishida:
Adaptive Stochastic Natural Gradient Method for One-Shot Neural Architecture Search. ICML 2019: 171-180 - [c17]Shota Saito, Toshiyasu Matsushima:
Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion. ISIT 2019: 652-656 - [c16]Kento Uchida, Shota Saito, Panca Dewi Pamungkasari, Yusei Kawai, Ita Fauzia Hanoum, Filbert H. Juwono, Shinichi Shirakawa:
Joint Optimization of Convolutional Neural Network and Image Preprocessing Selection for Embryo Grade Prediction in In Vitro Fertilization. ISVC (2) 2019: 14-24 - [c15]Ryotaro Abe, Taichi Takeda, Ryo Shiratori, Shinichi Shirakawa, Shota Saito, Toshihiko Baba:
Optimization of H0 Photonic Crystal Nanocavity using Neural Network. OECC/PSC 2019: 1-3 - [i9]Youhei Akimoto, Shinichi Shirakawa, Nozomu Yoshinari, Kento Uchida, Shota Saito, Kouhei Nishida:
Adaptive Stochastic Natural Gradient Method for One-Shot Neural Architecture Search. CoRR abs/1905.08537 (2019) - [i8]Shota Saito, Shinichi Shirakawa:
Controlling Model Complexity in Probabilistic Model-Based Dynamic Optimization of Neural Network Structures. CoRR abs/1907.06341 (2019) - [i7]Shota Saito, Toshiyasu Matsushima:
Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code. CoRR abs/1910.03257 (2019) - 2018
- [c14]Shota Saito, Danilo P. Mandic, Hideyuki Suzuki:
Hypergraph p-Laplacian: A Differential Geometry View. AAAI 2018: 3984-3991 - [c13]Kai Asaba, Shota Saito, Shunsuke Horii, Toshiyasu Matsushima:
Bayesian Independent Component Analysis under Hierarchical Model on Independent Components. APSIPA 2018: 959-962 - [c12]Shota Saito, Shinichi Shirakawa, Youhei Akimoto:
Embedded feature selection using probabilistic model-based optimization. GECCO (Companion) 2018: 1922-1925 - [c11]Shota Saito, Toshiyasu Matsushima:
Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion Probability. ISIT 2018: 881-885 - [c10]Jun Yoshizawa, Shota Saito, Toshiyasu Matsushima:
Variable-Length Intrinsic Randomness Allowing Positive Value of the Average Variational Distance. ISITA 2018: 354-358 - [c9]Shota Saito, Hideki Yagi, Toshiyasu Matsushima:
New Results on Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion Probabilities. ISITA 2018: 359-363 - [i6]Jun Yoshizawa, Shota Saito, Toshiyasu Matsushima:
Variable-Length Intrinsic Randomness Allowing Positive Value of the Average Variational Distance. CoRR abs/1801.01699 (2018) - [i5]Shota Saito, Toshiyasu Matsushima:
Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion Probability. CoRR abs/1801.02496 (2018) - [i4]Shota Saito, Toshiyasu Matsushima:
Non-Asymptotic and Asymptotic Fundamental Limits of Guessing Subject to Distortion. CoRR abs/1808.06190 (2018) - [i3]Kouhei Nishida, Hernán E. Aguirre, Shota Saito, Shinichi Shirakawa, Youhei Akimoto:
Parameterless Stochastic Natural Gradient Method for Discrete Optimization and its Application to Hyper-Parameter Optimization for Neural Network. CoRR abs/1809.06517 (2018) - 2017
- [j8]Isao Nambu, Takahiro Imai, Shota Saito, Takanori Sato, Yasuhiro Wada:
Detecting Motor Learning-Related fNIRS Activity by Applying Removal of Systemic Interferences. IEICE Trans. Inf. Syst. 100-D(1): 242-245 (2017) - [j7]Yuta Nakahara, Shota Saito, Toshiyasu Matsushima:
Spatially "Mt. Fuji" Coupled LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2594-2606 (2017) - [j6]Shota Saito, Toshiyasu Matsushima:
Evaluation of Overflow Probability of Bayes Code in Moderate Deviation Regime. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2728-2731 (2017) - [j5]Shota Saito, Yoichi Tomioka, Hitoshi Kitazawa:
A Theoretical Framework for Estimating False Acceptance Rate of PRNU-Based Camera Identification. IEEE Trans. Inf. Forensics Secur. 12(9): 2026-2035 (2017) - [c8]Shota Saito, Hideki Yagi, Toshiyasu Matsushima:
Variable-length lossy compression allowing positive overflow and excess distortion probabilities. ISIT 2017: 1568-1572 - [i2]Shota Saito, Hideki Yagi, Toshiyasu Matsushima:
Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion Probabilities. CoRR abs/1701.01800 (2017) - [i1]Shota Saito, Danilo P. Mandic, Hideyuki Suzuki:
Hypergraph p-Laplacian: A Differential Geometry View. CoRR abs/1711.08171 (2017) - 2016
- [j4]Shota Saito, Toshiyasu Matsushima:
Second-Order Achievable Rate Region of Slepian-Wolf Coding Problem in terms of Smooth Max-Entropy for General Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2275-2280 (2016) - [j3]Shota Saito, Toshiyasu Matsushima:
Threshold of Overflow Probability Using Smooth Max-Entropy in Lossless Fixed-to-Variable Length Source Coding for General Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2286-2290 (2016) - [c7]Shota Saito, Toshiyasu Matsushima:
Evaluation of overflow probability of Bayes code in moderate deviation regime. ISITA 2016: 1-5 - [c6]Shota Saito, Toshiyasu Matsushima:
Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. ISITA 2016: 21-25 - [c5]Yuta Nakahara, Shota Saito, Toshiyasu Matsushima:
Spatially "Mt. Fuji" coupled LDPC codes. ISITA 2016: 201-205 - 2015
- [j2]Shota Saito, Nozomi Miya, Toshiyasu Matsushima:
Evaluation of the Bayes Code from Viewpoints of the Distribution of Its Codeword Lengths. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2407-2414 (2015) - [j1]Shota Saito, Ryota Tomioka, Kenji Yamanishi:
Early detection of persistent topics in social networks. Soc. Netw. Anal. Min. 5(1): 19:1-19:15 (2015) - [c4]Shota Saito, Nozomi Miya, Toshiyasu Matsushima:
Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. ISIT 2015: 1986-1990 - 2014
- [c3]Shota Saito, Ryota Tomioka, Kenji Yamanishi:
Early detection of persistent topics in social networks. ASONAM 2014: 417-424 - [c2]Shota Saito, Nozomi Miya, Toshiyasu Matsushima:
Evaluation of the minimum overflow threshold of bayes codes for a Markov source. ISITA 2014: 211-215 - 2012
- [c1]Kimihiro Nishio, Yasushi Arimune, Shota Saito:
Simple analog motion detection circuit using CCD camera based on the biological vision system. ISCIT 2012: 114-117
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-10-17 20:31 CEST 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:
