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

Heyuan Liu

dblp:299/9412 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Learning theory · 47% 3D vision · 41% Legged, aerial and field robots · 12%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
statistical learning theory
0.512021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method · NeurIPS 2021
Machine learning › Learning theory › loss function
surrogate loss
0.512021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method · NeurIPS 2021
Mathematical optimization › optimization for machine learning
predict-then-optimize
0.512021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method · NeurIPS 2021
Mathematical optimization
stochastic optimization
0.512021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method · NeurIPS 2021
Robotics › Legged, aerial and field robots
aerial robots
0.312025
UAVScenes: A Multi-Modal Dataset for UAVs · ICCV 2025
Computational finance and economics › portfolio construction
asset allocation
0.112021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method · NeurIPS 2021

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

convex surrogate loss · 1.5generalization bounds · 1.0multimodal sensing · 0.9generalization bound · 0.5
YearPublicationVenuePosition
2025 UAVScenes: A Multi-Modal Dataset for UAVs
Shangshu Yu, Shenghai Yuan 0001, Rui She 0001, Quanjiang Guo, Jinxuan Zheng, Ong Kang Howe, Leonrich Chandra, Shrivarshann Srijeyan, Aditya Sivadas, Toshan Aggarwal, Heyuan Liu, Chujie Chen, Junyu Jiang, Lihua Xie 0001, Wee-Peng Tay
ICCV14
2021 Risk Bounds and Calibration for a Smart Predict-then-Optimize Method
abstract
The predict-then-optimize framework is fundamental in practical stochastic decision-making problems: first predict unknown parameters of an optimization model, then solve the problem using the predicted values. A natural loss function in this setting is defined by measuring the decision error induced by the predicted parameters, which was named the Smart Predict-then-Optimize (SPO) loss by Elmachtoub and Grigas [2021]. Since the SPO loss is typically nonconvex and possibly discontinuous, Elmachtoub and Grigas [2021] introduced a convex surrogate, called the SPO+ loss, that importantly accounts for the underlying structure of the optimization model. In this paper, we greatly expand upon the consistency results for the SPO+ loss provided by Elmachtoub and Grigas [2021]. We develop risk bounds and uniform calibration results for the SPO+ loss relative to the SPO loss, which provide a quantitative way to transfer the excess surrogate risk to excess true risk. By combining our risk bounds with generalization bounds, we show that the empirical minimizer of the SPO+ loss achieves low excess true risk with high probability. We first demonstrate these results in the case when the feasible region of the underlying optimization problem is a polyhedron, and then we show that the results can be strengthened substantially when the feasible region is a level set of a strongly convex function. We perform experiments to empirically demonstrate the strength of the SPO+ surrogate, as compared to standard $\ell_1$ and squared $\ell_2$ prediction error losses, on portfolio allocation and cost-sensitive multi-class classification problems.
Heyuan Liu, Paul Grigas
NeurIPS1