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

Yeachan Park

dblp:256/5189 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
6since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
2 papers
Learning theory · 40% Graph learning · 20% Reinforcement learning · 20%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
expressive power
0.912025
Floating-Point Neural Networks Can Represent Almost All Floating-Point Functions · ICML 2025
Machine learning › Reinforcement learning
function approximation
0.912025
Floating-Point Neural Networks Can Represent Almost All Floating-Point Functions · ICML 2025
Machine learning › Learning theory › neural network theory
representational capacity
0.912025
Floating-Point Neural Networks Can Represent Almost All Floating-Point Functions · ICML 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Floating-Point Neural Networks are Provably Robust Universal Approximators · CAV (2) 2025
Machine learning › Learning theory › approximation theory › neural network approximation
universal approximation
0.912025
Floating-Point Neural Networks are Provably Robust Universal Approximators · CAV (2) 2025
Program analysis › static analysis
abstract interpretation
0.912025
Floating-Point Neural Networks are Provably Robust Universal Approximators · CAV (2) 2025

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

floating-point arithmetic · 2.6interval universal approximation · 1.7activation function analysis · 0.9
YearPublicationVenuePosition
2025 Floating-Point Neural Networks are Provably Robust Universal Approximators
abstract
Abstract The classical universal approximation (UA) theorem for neural networks establishes mild conditions under which a feedforward neural network can approximate a continuous function f with arbitrary accuracy. A recent result shows that neural networks also enjoy a more general interval universal approximation (IUA) theorem, in the sense that the abstract interpretation semantics of the network using the interval domain can approximate the direct image map of f (i.e., the result of applying f to a set of inputs) with arbitrary accuracy. These theorems, however, rest on the unrealistic assumption that the neural network computes over infinitely precise real numbers, whereas their software implementations in practice compute over finite-precision floating-point numbers. An open question is whether the IUA theorem still holds in the floating-point setting. This paper introduces the first IUA theorem for floating-point neural networks that proves their remarkable ability to perfectly capture the direct image map of any rounded target function f , showing no limits exist on their expressiveness. Our IUA theorem in the floating-point setting exhibits material differences from the real-valued setting, which reflects the fundamental distinctions between these two computational models. This theorem also implies surprising corollaries, which include (i) the existence of provably robust floating-point neural networks; and (ii) the computational completeness of the class of straight-line programs that use only floating-point additions and multiplications for the class of all floating-point programs that halt.
Geonho Hwang, Wonyeol Lee 0001, Yeachan Park, Feras Saad
CAV (2)3
2025 Floating-Point Neural Networks Can Represent Almost All Floating-Point Functions
abstract
Existing works on the expressive power of neural networks typically assume real-valued parameters and exact mathematical operations during the evaluation of networks. However, neural networks run on actual computers can take parameters only from a small subset of the reals and perform inexact mathematical operations with round-off errors and overflows. In this work, we study the expressive power of floating-point neural networks, i.e., networks with floating-point parameters and operations. We first observe that for floating-point neural networks to represent all functions from floating-point vectors to floating-point vectors, it is necessary to distinguish different inputs: the first layer of a network should be able to generate different outputs for different inputs. We also prove that such distinguishability is sufficient, along with mild conditions on activation functions. Our result shows that with practical activation functions, floating-point neural networks can represent floating-point functions from a wide domain to all finite or infinite floats. For example, the domain is all finite floats for Sigmoid and tanh, and it is all finite floats of magnitude less than 1/8 times the largest float for ReLU, ELU, SeLU, GELU, Swish, Mish, and sin.
Geonho Hwang, Yeachan Park, Wonyeol Lee 0001
ICML2
2025 Acceleration of grokking in learning arithmetic operations via Kolmogorov-Arnold representation
Yeachan Park, Yeoneung Kim
Neurocomputing1
2024 Expressive power of ReLU and step networks under floating-point operations
Yeachan Park, Geonho Hwang, Wonyeol Lee 0001
Neural Networks1
2023 Self-knowledge distillation via dropout
Hyoje Lee, Yeachan Park, Hyun Seo, Myungjoo Kang
Comput. Vis. Image Underst.2
2022 MCW-Net: Single image deraining with multi-level connections and wide regional non-local blocks
Yeachan Park, Myeongho Jeon, Myungjoo Kang
Signal Process. Image Commun.1
2019 Coding Locations Relative to One or Many Landmarks in Childhood
abstract
Cognitive development studies how information processing in the brain changes over the course of development. A key part of this question is how information is represented and stored in memory. This study examined allocentric (world-based) spatial memory, an important cognitive tool for planning routes and interacting with the space around us. This is typically theorized to use multiple landmarks all at once whenever it operates. In contrast, here we show that allocentric spatial memory frequently operates over a limited spatial window, much less than the full proximal scene, for children between 3.5 and 8.5 years old. The use of multiple landmarks increases gradually with age. Participants were asked to point to a remembered target location after a change of view in immersive virtual reality. A k-fold cross-validation model-comparison selected a model where young children usually use the target location's vector to the single nearest landmark and rarely take advantage of the vectors to other nearby landmarks. The comparison models, which attempt to explain the errors as generic forms of noise rather than encoding to a single spatial cue, did not capture the distribution of responses as well. Parameter fits of this new single- versus multi-cue model are also easily interpretable and related to other variables of interest in development (age, executive function). Based on this, we theorize that spatial memory in humans develops through three advancing levels (but not strict stages): most likely to encode locations egocentrically (relative to the self), then allocentrically (relative to the world) but using only one landmark, and finally, most likely to encode locations relative to multiple parts of the scene.
James Negen, Linda Bou Ali, Brittney Chere, Hannah E. Roome, Yeachan Park, Marko Nardini
PLoS Comput. Biol.5