Demo Data from EDBT 2026 / reviewers in the wild / expert
Haeun Jeon
dblp:371/8905
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Optimization for machine learning · 44% Learning theory · 44% Deep learning architectures and training · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
decision-focused learning |
0.9 | 1 | 2025 | Locally Convex Global Loss Network for Decision-Focused Learning · AAAI 2025 |
Machine learning › Learning theory › loss function
surrogate loss |
0.9 | 1 | 2025 | Locally Convex Global Loss Network for Decision-Focused Learning · AAAI 2025 |
Machine learning › Deep learning architectures and training › feedforward neural network
convex neural network |
0.3 | 1 | 2025 | Locally Convex Global Loss Network for Decision-Focused Learning · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
surrogate loss · 0.9partial input convex neural network · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Locally Convex Global Loss Network for Decision-Focused LearningabstractIn decision-making problems under uncertainty, predicting unknown parameters is often considered independent of the optimization part. Decision-focused learning (DFL) is a task-oriented framework that integrates prediction and optimization by adapting the predictive model to give better decisions for the corresponding task. Here, an inevitable challenge arises when computing the gradients of the optimal decision with respect to the parameters. Existing research copes with this issue by smoothly reforming surrogate optimization or constructing surrogate loss functions that mimic task loss. However, they are applied to restricted optimization domains. In this paper, we propose Locally Convex Global Loss Network (LCGLN), a global surrogate loss model that can be implemented in a general DFL paradigm. LCGLN learns task loss via a partial input convex neural network which is guaranteed to be convex for chosen inputs while keeping the non-convex global structure for the other inputs. This enables LCGLN to admit general DFL through only a single surrogate loss without any sense for choosing appropriate parametric forms. We confirm the effectiveness and flexibility of LCGLN by evaluating our proposed model with three stochastic decision-making problems. Haeun Jeon, Hyunglip Bae, Chanyeong Kim, Woo Chang Kim |
AAAI | 1 |