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

Yeonwoo Cha

dblp:391/6246 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 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
Generative modeling · 67% Deep learning architectures and training · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
flow matching
0.812024
Simulation-Free Training of Neural ODEs on Paired Data · NeurIPS 2024
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.812024
Simulation-Free Training of Neural ODEs on Paired Data · NeurIPS 2024
Machine learning › Generative modeling › diffusion model › diffusion model training
simulation-free training
0.812024
Simulation-Free Training of Neural ODEs on Paired Data · NeurIPS 2024

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

neural ODE · 0.8flow matching · 0.8
YearPublicationVenuePosition
2024 Simulation-Free Training of Neural ODEs on Paired Data
abstract
In this work, we investigate a method for simulation-free training of Neural Ordinary Differential Equations (NODEs) for learning deterministic mappings between paired data. Despite the analogy of NODEs as continuous-depth residual networks, their application in typical supervised learning tasks has not been popular, mainly due to the large number of function evaluations required by ODE solvers and numerical instability in gradient estimation. To alleviate this problem, we employ the flow matching framework for simulation-free training of NODEs, which directly regresses the parameterized dynamics function to a predefined target velocity field. Contrary to generative tasks, however, we show that applying flow matching directly between paired data can often lead to an ill-defined flow that breaks the coupling of the data pairs (e.g., due to crossing trajectories). We propose a simple extension that applies flow matching in the embedding space of data pairs, where the embeddings are learned jointly with the dynamic function to ensure the validity of the flow which is also easier to learn. We demonstrate the effectiveness of our method on both regression and classification tasks, where our method outperforms existing NODEs with a significantly lower number of function evaluations. The code is available at https://github.com/seminkim/simulation-free-node.
Semin Kim 0002, Jaehoon Yoo, Yeonwoo Cha, Saehoon Kim, Seunghoon Hong
NeurIPS4