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

Takahiro Omi

dblp:48/10525 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 2 first-author · 3 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 · 75% Deep learning architectures and training · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
intensity function estimation
0.412019
Fully Neural Network based Model for General Temporal Point Processes · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
neural point process
0.412019
Fully Neural Network based Model for General Temporal Point Processes · NeurIPS 2019
Machine learning › Deep learning architectures and training
recurrent neural network
0.412019
Fully Neural Network based Model for General Temporal Point Processes · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
temporal point process
0.412019
Fully Neural Network based Model for General Temporal Point Processes · NeurIPS 2019

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

recurrent neural network · 0.4maximum likelihood · 0.4feedforward neural network · 0.4
YearPublicationVenuePosition
2025 Exploring the Design of Multi-Agent LLM Dialogues for Research Ideation
abstract
Large language models (LLMs) are increasingly used to support creative tasks such as research idea generation. While recent work has shown that structured dialogues between LLMs can improve the novelty and feasibility of generated ideas, the optimal design of such interactions remains unclear. In this study, we conduct a comprehensive analysis of multi-agent LLM dialogues for scientific ideation. We compare different configurations of agent roles, number of agents, and dialogue depth to understand how these factors influence the novelty and feasibility of generated ideas. Our experimental setup includes settings where one agent generates ideas and another critiques them, enabling iterative improvement. Our results show that enlarging the agent cohort, deepening the interaction depth, and broadening agent persona heterogeneity each enrich the diversity of generated ideas. Moreover, specifically increasing critic-side diversity within the ideation–critique–revision loop further boosts the feasibility of the final proposals. Our findings offer practical guidelines for building effective multi-agent LLM systems for scientific ideation.
Keisuke Ueda, Wataru Hirota, Kosuke Takahashi, Takahiro Omi, Kosuke Arima, Tatsuya Ishigaki
SIGDIAL4
2024 Pretraining and Updates of Domain-Specific LLM: A Case Study in the Japanese Business Domain
Kosuke Takahashi, Takahiro Omi, Kosuke Arima, Tatsuya Ishigaki
PACLIC2
2023 Training Generative Question-Answering on Synthetic Data Obtained from an Instruct-tuned Model
Kosuke Takahashi, Takahiro Omi, Kosuke Arima, Tatsuya Ishigaki
PACLIC2
2019 Fully Neural Network based Model for General Temporal Point Processes
abstract
A temporal point process is a mathematical model for a time series of discrete events, which covers various applications. Recently, recurrent neural network (RNN) based models have been developed for point processes and have been found effective. RNN based models usually assume a specific functional form for the time course of the intensity function of a point process (e.g., exponentially decreasing or increasing with the time since the most recent event). However, such an assumption can restrict the expressive power of the model. We herein propose a novel RNN based model in which the time course of the intensity function is represented in a general manner. In our approach, we first model the integral of the intensity function using a feedforward neural network and then obtain the intensity function as its derivative. This approach enables us to both obtain a flexible model of the intensity function and exactly evaluate the log-likelihood function, which contains the integral of the intensity function, without any numerical approximations. Our model achieves competitive or superior performances compared to the previous state-of-the-art methods for both synthetic and real datasets.
Takahiro Omi, Naonori Ueda, Kazuyuki Aihara
NeurIPS1
2013 Information Transmission Using Non-Poisson Regular Firing
abstract
In many cortical areas, neural spike trains do not follow a Poisson process. In this study, we investigate a possible benefit of non-Poisson spiking for information transmission by studying the minimal rate fluctuation that can be detected by a Bayesian estimator. The idea is that an inhomogeneous Poisson process may make it difficult for downstream decoders to resolve subtle changes in rate fluctuation, but by using a more regular non-Poisson process, the nervous system can make rate fluctuations easier to detect. We evaluate the degree to which regular firing reduces the rate fluctuation detection threshold. We find that the threshold for detection is reduced in proportion to the coefficient of variation of interspike intervals.
Shinsuke Koyama, Takahiro Omi, Robert E. Kass, Shigeru Shinomoto
Neural Comput.2
2011 Optimizing Time Histograms for Non-Poissonian Spike Trains
abstract
The time histogram is a fundamental tool for representing the inhomogeneous density of event occurrences such as neuronal firings. The shape of a histogram critically depends on the size of the bins that partition the time axis. In most neurophysiological studies, however, researchers have arbitrarily selected the bin size when analyzing fluctuations in neuronal activity. A rigorous method for selecting the appropriate bin size was recently derived so that the mean integrated squared error between the time histogram and the unknown underlying rate is minimized (Shimazaki & Shinomoto, 2007 ). This derivation assumes that spikes are independently drawn from a given rate. However, in practice, biological neurons express non-Poissonian features in their firing patterns, such that the spike occurrence depends on the preceding spikes, which inevitably deteriorate the optimization. In this letter, we revise the method for selecting the bin size by considering the possible non-Poissonian features. Improvement in the goodness of fit of the time histogram is assessed and confirmed by numerically simulated non-Poissonian spike trains derived from the given fluctuating rate. For some experimental data, the revised algorithm transforms the shape of the time histogram from the Poissonian optimization method.
Takahiro Omi, Shigeru Shinomoto
Neural Comput.1