Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Akira Kitaoka

dblp:347/1744 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-3867-759XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
maximum likelihood estimation
0.912025
Learning from Two-Sample-Averaged Data · ICDM 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
nonlinear regression
0.912025
Learning from Two-Sample-Averaged Data · ICDM 2025
Privacy and data protection
privacy-preserving machine learning
0.312025
Learning from Two-Sample-Averaged Data · ICDM 2025

Methods — techniques the papers use, named apart from their topics

taylor approximation · 1.7fourier transformation · 1.7eigenvalue decomposition · 1.7
YearPublicationVenuePosition
2025 Learning from Two-Sample-Averaged Data
abstract
This paper presents a novel method for training nonlinear regression models using two-sample-averaged data, where each sample is the average of input-output pairs from two i.i.d. samples. Our method leverages maximum likelihood estimation under the additive Gaussian noise and normally distributed inputs assumptions. For theoretical analysis on the likelihood, we utilize Taylor approximation and eigenvalue decomposition. We then apply Fourier transformation for better numerical calculation of the approximated likelihood. Experiments on synthetic datasets demonstrate that our method outperforms the baselines, reducing the test MSE by up to 97.07 %, which is even comparable with that of models trained with original data. Furthermore, on real-world datasets using neural networks, we confirm that our method achieves an average rank of 1.6, confirming its overall superiority. This paper establishes the foundation of averaged-data learning, which is promising for privacy-preserving machine learning.
Ryuta Matsuno, Akira Kitaoka
ICDM2