In Jae Myung

In Jae Myung

Auto-generated profile, based on publicly available information

In Jae Myung

Department of Psychology, Ohio State University 4 , Columbus, Ohio 43210

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 1997 in Psychonomic Bulletin & Review
Verified
Journal Article
Closed access
PDF file
IMIn Jae Myung
In Jae Myung
MPMark A. Pitt
Mark A. Pitt

26 September 2000 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
IMIn Jae Myung
In Jae Myung
VBVijay Balasubramanian
Vijay Balasubramanian
MPMark A. Pitt
Mark A. Pitt
A central problem in science is deciding among competing explanations of data containing random errors. We argue that assessing the “complexity” of explanations is essential to a theoretically well-founded model selection procedure. We formulate model complexity in terms of the geometry of the space of probability distributions. Geometric complexity provides a clear intuitive understanding of several extant notions of model complexity. This approach allows us to reconceptualize the model selection problem as one of counting explanations that lie close to the “truth.” We demonstrate the usefulness of the approach by applying it to the recovery of models in psychophysics.

1 June 2013 in Journal of Mathematical Psychology
Verified
Journal Article
Closed access
JMJay I. Myung
Jay I. Myung
DCDaniel R. Cavagnaro
Daniel R. Cavagnaro
MPMark A. Pitt
Mark A. Pitt

1 July 2009 in Psychological Review
Verified
Journal Article
Closed access
JMJay I. Myung
Jay I. Myung
MPMark A. Pitt
Mark A. Pitt
Models of a psychological process can be difficult to discriminate experimentally because it is not easy to determine the values of the critical design variables (e.g., presentation schedule, stimulus structure) that will be most informative in differentiating them. Recent developments in sampling-based search methods in statistics make it possible to determine these values and thereby identify an optimal experimental design. After describing the method, it is demonstrated in 2 content areas in cognitive psychology in which models are highly competitive: retention (i.e., forgetting) and categorization. The optimal design is compared with the quality of designs used in the literature. The findings demonstrate that design optimization has the potential to increase the informativeness of the experimental method.

1 September 2000 in Memory & Cognition
Verified
Journal Article
Closed access
PDF file
IMIn Jae Myung
In Jae Myung
CKCheongtag Kim
Cheongtag Kim
MPMark A. Pitt
Mark A. Pitt

3 June 2020 in Scientific Reports
Verified
Journal Article
Open access
PDF file
JCJorge Chang
Jorge Chang
PNPavel Nikolaev
Pavel Nikolaev
JCJennifer Carpena-Núñez
Jennifer Carpena-Núñez
RRRahul Rao
Rahul Rao
KDKevin Decker
Kevin Decker
BMBenji Maruyama
Benji Maruyama
A major technological challenge in materials research is the large and complex parameter space, which hinders experimental throughput and ultimately slows down development and implementation. In single-walled carbon nanotube (CNT) synthesis, for instance, the poor yield obtained from conventional catalysts is a result of limited understanding of input-to-output correlations. Autonomous closed-loop experimentation combined with advances in machine learning (ML) is uniquely suited for high-throughput research. Among the ML algorithms available, Bayesian optimization (BO) is especially apt for exploration and optimization within such high-dimensional and complex parameter space. BO is an adaptive sequential design algorithm for finding the global optimum of a black-box objective function with the fewest possible measurements. Here, we demonstrate a promising application of BO in CNT synthesis as an efficient and robust algorithm which can (1) improve the growth rate of CNT in the BO-planner experiments over the seed experiments up to a factor 8; (2) rapidly improve its predictive power (or learning); (3) Consistently achieve good performance regardless of the number or origin of seed experiments; (4) exploit a high-dimensional, complex parameter space, and (5) achieve the former 4 tasks in just over 100 hundred experiments (~8 experimental hours) – a factor of 5× faster than our previously reported results.