← Search

Henry Lam

18 accepted papers

2025

Dissecting the Impact of Model Misspecification in Data-Driven Optimization

AISTATS 2025poster

Data-driven optimization aims to translate a machine learning model into decision-making by optimizing decisions on estimated costs. Such a pipeline can be conducted by fitting a distributional model which is then plugged into the target optimization problem. While this fitting can utilize tradition…

Cited by 0SourceScholar
2025

MallowsPO: Fine-Tune Your LLM with Preference Dispersions

ICLR 2025poster

Direct Preference Optimization (DPO) has recently emerged as a popular approach to improve reinforcement learning from human feedback (RLHF), leading to better techniques to fine-tune large language models (LLM). A weakness of DPO, however, lies in its lack of capability to characterize the diversit…

Cited by 6SourcePDFScholar
2025

Subsampled Ensemble Can Improve Generalization Tail Exponentially

NeurIPS 2025poster

Ensemble learning is a popular technique to improve the accuracy of machine learning models. It traditionally hinges on the rationale that aggregating multiple weak models can lead to better models with lower variance and hence higher stability, especially for discontinuous base learners. In this pa…

Cited by 0SourcecodeScholar
2025

The Bias-Variance Tradeoff in Data-Driven Optimization: A Local Misspecification Perspective

NeurIPS 2025poster

Data-driven stochastic optimization is ubiquitous in machine learning and operational decision-making problems. Sample average approximation (SAA) and model-based approaches such as estimate-then-optimize (ETO) or integrated estimation-optimization (IEO) are all popular, with model-based approaches…

Cited by 0SourceScholar
2024

Is Cross-validation the Gold Standard to Estimate Out-of-sample Model Performance?

NeurIPS 2024poster

Cross-Validation (CV) is the default choice for estimate the out-of-sample performance of machine learning models. Despite its wide usage, their statistical benefits have remained half-understood, especially in challenging nonparametric regimes. In this paper we fill in this gap and show that, in te…

Cited by 0SourcePDFScholar
2024

Learning from Sparse Offline Datasets via Conservative Density Estimation

ICLR 2024poster

Offline reinforcement learning (RL) offers a promising direction for learning policies from pre-collected datasets without requiring further interactions with the environment. However, existing methods struggle to handle out-of-distribution (OOD) extrapolation errors, especially in sparse reward or…

2023

Efficient Uncertainty Quantification and Reduction for Over-Parameterized Neural Networks

NeurIPS 2023poster

Uncertainty quantification (UQ) is important for reliability assessment and enhancement of machine learning models. In deep learning, uncertainties arise not only from data, but also from the training procedure that often injects substantial noises and biases. These hinder the attainment of statisti…

2023

Group Distributionally Robust Reinforcement Learning with Hierarchical Latent Variables

AISTATS 2023poster

One key challenge for multi-task Reinforcement learning (RL) in practice is the absence of task specifications. Robust RL has been applied to deal with task ambiguity but may result in over-conservative policies. To balance the worst-case (robustness) and average performance, we propose Group Distri…

Cited by 13SourcePDFScholar
2023

Hedging against Complexity: Distributionally Robust Optimization with Parametric Approximation

AISTATS 2023poster

Empirical risk minimization (ERM) and distributionally robust optimization (DRO) are popular approaches for solving stochastic optimization problems that appear in operations management and machine learning. Existing generalization error bounds for these methods depend on either the complexity of th…

Cited by 10SourcePDFScholar
2023

Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework

NeurIPS 2023poster

Bayesian bandit algorithms with approximate Bayesian inference have been widely used in real-world applications. However, there is a large discrepancy between the superior practical performance of these approaches and their theoretical justification. Previous research only indicates a negative theor…

2022

Generalization Bounds with Minimal Dependency on Hypothesis Class via Distributionally Robust Optimization

NeurIPS 2022accept

Established approaches to obtain generalization bounds in data-driven optimization and machine learning mostly build on solutions from empirical risk minimization (ERM), which depend crucially on the functional complexity of the hypothesis class. In this paper, we present an alternate route to obtai…

Cited by 15SourcePDFScholar
2022

Scalable Safety-Critical Policy Evaluation with Accelerated Rare Event Sampling

IROS 2022poster

Evaluating rare but high-stakes events is one of the main challenges in obtaining reliable reinforcement learning policies, especially in large or infinite state/action spaces where limited scalability dictates a prohibitively large number of testing iterations. On the other hand, a biased or inaccu…

Cited by 4SourcecodeScholar
2021

Deep Probabilistic Accelerated Evaluation: A Robust Certifiable Rare-Event Simulation Methodology for Black-Box Safety-Critical Systems

AISTATS 2021poster

Evaluating the reliability of intelligent physical systems against rare safety-critical events poses a huge testing burden for real-world applications. Simulation provides a useful platform to evaluate the extremal risks of these systems before their deployments. Importance Sampling (IS), while prov…

2021

Learning Prediction Intervals for Regression: Generalization and Calibration

AISTATS 2021poster

We study the generation of prediction intervals in regression for uncertainty quantification. This task can be formalized as an empirical constrained optimization problem that minimizes the average interval width while maintaining the coverage accuracy across data. We strengthen the existing literat…

Cited by 27SourcePDFScholar
2017

Evaluation of automated vehicles in the frontal cut-in scenario — An enhanced approach using piecewise mixture models

ICRA 2017poster

Evaluation and testing are critical for the development of Automated Vehicles (AVs). Currently, companies test AVs on public roads, which is very time-consuming and inefficient. We proposed the Accelerated Evaluation concept which uses a modified statistics of the surrounding vehicles and the Import…

Cited by 44SourceScholar