Rchr
J-GLOBAL ID：202001015560374368
Update date: Jul. 16, 2024
Nishino Masaaki
ニシノ マサアキ | Nishino Masaaki
Affiliation and department：
Job title：
特別研究員
Research theme for competitive and other funds (4)：
- 2022 - 2028 Machine Learning That Connects to Symbolic Reasoning
- 2020 - 2025 社会を志向した革新的アルゴリズムの実装
- 2020 - 2023 誤りがないことを保証する検証器つき機械学習の研究
- 2017 - 2021 Construction of mathematical optimization methods for discrete data useful in machine learning algorithms.
Papers (58)：
-
INOUE Takeru, YASUDA Norihito, NABESHIMA Hidetomo, NISHINO Masaaki, DENZUMI Shuhei, MINATO Shin-ichi. International Competition on Graph Counting Algorithms 2023. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2024. advpub
-
Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato. CompDP: A Framework for Simultaneous Subgraph Counting under Connectivity Constraints. 21st Symposium on Experimental Algorithms (SEA 2023). 2023. 11-20
-
Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato. Exact and Efficient Network Reliability Evaluation per Outage Scale. IEEE International Conference on Communication. 2023
-
Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato. A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure. IEEE International Conference on Computer Communications. 2023
-
Ryoma Onaka, Kengo Nakamura 0001, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shinsaku Sakaue. Exact and Scalable Network Reliability Evaluation for Probabilistic Correlated Failures. GLOBECOM. 2022. 5547-5552
ｍore...
MISC (12)：
-
Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi. Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up. 2024
-
Ryosuke Sugiura, Masaaki Nishino, Norihito Yasuda, Yutaka Kamamoto, Takehiro Moriya. Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes. 2023
-
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato. International Competition on Graph Counting Algorithms 2023. 2023
-
中村健吾, 中村健吾, 西野正彬, 安田宜仁, 湊真一. CompDP: A Framework for Concurrent Subgraph Counting under Connectivity Constraints. 人工知能学会全国大会論文集(Web). 2023. 37th
-
Masaaki Nishino, Kengo Nakamura, Norihito Yasuda. Generalization Analysis on Learning with a Concurrent Verifier. CoRR. 2022. abs/2210.05331
ｍore...
Lectures and oral presentations (8)：
-
検証器つき機械学習モデル
(人工知能学会 第125回人工知能基本問題研究会(SIG-FPAI) 2023)
-
CompDP: A Framework for Concurrent Subgraph Counting under Connectivity Constraints
(人工知能学会全国大会論文集(Web) 2023)
-
A Fast Algorithm for Optimal k-Set Selection Problems on a Decision Diagram
(人工知能学会全国大会論文集(Web) 2023)
-
検証器つきモデルの汎化性能解析
(第25回情報論的学習理論ワークショップ(IBIS2022) 2022)
-
Solving Rep-tile by Computers: Performances of Solvers and Analyses of Solutions
(人工知能学会人工知能基本問題研究会資料 2022)
ｍore...
Return to Previous Page
