:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Park, Yesom, Park, Imseong, Hahn, Jooyoung, Kang, Myungjoo
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2502.06047
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Beyond Derivative Pathology of PINNs: Variable Splitting Strategy with Convergence Analysis
by: Park, Yesom, et al.
Published: (2024)

Localized Estimation of Condition Numbers for MILU Preconditioners on a Graph
by: Hwang, Geonho, et al.
Published: (2024)

FLEUR: An Explainable Reference-Free Evaluation Metric for Image Captioning Using a Large Multimodal Model
by: Lee, Yebin, et al.
Published: (2024)

Neural Implicit Solution Formula for Efficiently Solving Hamilton-Jacobi Equations
by: Park, Yesom, et al.
Published: (2025)

Fixed-Point Neural Optimal Transport without Implicit Differentiation
by: Park, Yesom, et al.
Published: (2026)

Neural Hamilton--Jacobi Characteristic Flows for Optimal Transport
by: Park, Yesom, et al.
Published: (2025)

Approximating Numerical Fluxes Using Fourier Neural Operators for Hyperbolic Conservation Laws
by: Kim, Taeyoung, et al.
Published: (2024)

MoDEx: Mixture of Depth-specific Experts for Multivariate Long-term Time Series Forecasting
by: Yoon, Hyekyung, et al.
Published: (2026)

Feature-aligned N-BEATS with Sinkhorn divergence
by: Lee, Joonhun, et al.
Published: (2023)

Dynamical Implicit Neural Representations
by: Park, Yesom, et al.
Published: (2025)

Why Rectified Power Unit Networks Fail and How to Improve It: An Effective Field Theory Perspective
by: Kim, Taeyoung, et al.
Published: (2024)

MINR: Implicit Neural Representations with Masked Image Modelling
by: Lee, Sua, et al.
Published: (2025)

Scalable Fixed-Point Framework for High-Dimensional Hamilton-Jacobi Equations
by: Park, Yesom, et al.
Published: (2026)

On Expressive Power of Quantized Neural Networks under Fixed-Point Arithmetic
by: Park, Yeachan, et al.
Published: (2024)

Analyzing and Improving Optimal-Transport-based Adversarial Networks
by: Choi, Jaemoo, et al.
Published: (2023)

Spatial-and-Frequency-aware Restoration method for Images based on Diffusion Models
by: Lee, Kyungsung, et al.
Published: (2024)

Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transport
by: Choi, Jaemoo, et al.
Published: (2023)

Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transport
by: Choi, Jaemoo, et al.
Published: (2024)

SymPlex: A Structure-Aware Transformer for Symbolic PDE Solving
by: Park, Yesom, et al.
Published: (2026)

D-Score: A Synapse-Inspired Approach for Filter Pruning
by: Park, Doyoung, et al.
Published: (2023)

Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)

Unsupervised Learning for the Elementary Shortest Path Problem
by: Chen, Jingyi, et al.
Published: (2025)

Learning Shortest Paths When Data is Scarce
by: Matsypura, Dmytro, et al.
Published: (2026)

Revealing and Utilizing In-group Favoritism for Graph-based Collaborative Filtering
by: Jung, Hoin, et al.
Published: (2024)

Skeleton-Guided Learning for Shortest Path Search
by: Liu, Tiantian, et al.
Published: (2025)

Regret Guarantees for Linear Contextual Stochastic Shortest Path
by: Polikar, Dor, et al.
Published: (2025)

Spectral Journey: How Transformers Predict the Shortest Path
by: Cohen, Andrew, et al.
Published: (2025)

Decision-Path Patterns as Tree Reliability Signals: Path-based Adaptive Weighting for Random Forest Classification
by: Park, Youngjoon
Published: (2026)

Expressive Power of Floating-Point Neural Networks with Arbitrary Reduction Orders and Inexact Activation Implementations
by: Park, Yeachan, et al.
Published: (2026)

Learning Shortest Paths with Generative Flow Networks
by: Morozov, Nikita, et al.
Published: (2026)

Point-DeepONet: Predicting Nonlinear Fields on Non-Parametric Geometries under Variable Load Conditions
by: Park, Jangseop, et al.
Published: (2024)

Convergent Reinforcement Learning Algorithms for Stochastic Shortest Path Problem
by: Guin, Soumyajit, et al.
Published: (2025)

Generalization in LLM Problem Solving: The Case of the Shortest Path
by: Tong, Yao, et al.
Published: (2026)

Floating-Point Networks with Automatic Differentiation Can Represent Almost All Floating-Point Functions and Their Gradients
by: Park, Sejun, et al.
Published: (2026)

On the Expressive Power of Floating-Point Transformers
by: Park, Sejun, et al.
Published: (2026)

Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)

Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
by: Shen, Cencheng, et al.
Published: (2014)

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
by: Tarbouriech, Jean, et al.
Published: (2026)

Floating-Point Neural Networks Are Provably Robust Universal Approximators
by: Hwang, Geonho, et al.
Published: (2025)

Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphs
by: Le, My, et al.
Published: (2025)