Demo Data from EDBT 2026 / reviewers in the wild / expert
Thanh Lam
dblp:280/1674
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 2 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
3 papers |
Reinforcement learning · 29% Trustworthy machine learning · 29% Efficient and distributed learning · 19% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
convergence analysis |
0.7 | 1 | 2023 | Risk-Aware Reinforcement Learning with Coherent Risk Measures and Non-linear Function Approximation · ICLR 2023 |
Machine learning › Trustworthy machine learning
interpretability |
0.7 | 1 | 2023 | Model Shapley: Equitable Model Valuation with Black-box Access · NeurIPS 2023 |
Machine learning › Reinforcement learning
reinforcement learning theory |
0.7 | 1 | 2023 | Risk-Aware Reinforcement Learning with Coherent Risk Measures and Non-linear Function Approximation · ICLR 2023 |
Machine learning › Reinforcement learning › safe reinforcement learning
risk-sensitive reinforcement learning |
0.7 | 1 | 2023 | Risk-Aware Reinforcement Learning with Coherent Risk Measures and Non-linear Function Approximation · ICLR 2023 |
Machine learning › Trustworthy machine learning › interpretability
shapley value |
0.7 | 1 | 2023 | Model Shapley: Equitable Model Valuation with Black-box Access · NeurIPS 2023 |
Machine learning and data management
data valuation |
0.7 | 1 | 2023 | Model Shapley: Equitable Model Valuation with Black-box Access · NeurIPS 2023 |
Machine learning › Efficient and distributed learning
model merging |
0.4 | 1 | 2020 | Learning Task-Agnostic Embedding of Multiple Black-Box Experts for Multi-Task Model Fusion · ICML 2020 |
Machine learning › Efficient and distributed learning › model merging
multi-task model merging |
0.4 | 1 | 2020 | Learning Task-Agnostic Embedding of Multiple Black-Box Experts for Multi-Task Model Fusion · ICML 2020 |
Machine learning › Representation and self-supervised learning › transferable representation
task-agnostic representation |
0.4 | 1 | 2020 | Learning Task-Agnostic Embedding of Multiple Black-Box Experts for Multi-Task Model Fusion · ICML 2020 |
Methods — techniques the papers use, named apart from their topics
lipschitz continuity · 2.0dirichlet abstraction · 2.0nonlinear function approximation · 0.7coherent risk measures · 0.7prototype distribution · 0.4knowledge distillation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Risk-Aware Reinforcement Learning with Coherent Risk Measures and Non-linear Function Approximation
Thanh Lam, Arun Verma, Kian Hsiang Low, Patrick Jaillet |
ICLR | 1 |
| 2023 | Model Shapley: Equitable Model Valuation with Black-box AccessabstractValuation methods of data and machine learning (ML) models are essential to the establishment of AI marketplaces. Importantly, certain practical considerations (e.g., operational constraints, legal restrictions) favor the use of model valuation over data valuation. Also, existing marketplaces that involve trading of pre-trained ML models call for an equitable model valuation method to price them. In particular, we investigate the black-box access setting which allows querying a model (to observe predictions) without disclosing model-specific information (e.g., architecture and parameters). By exploiting a Dirichlet abstraction of a model’s predictions, we propose a novel and equitable model valuation method called model Shapley. We also leverage a Lipschitz continuity of model Shapley to design a learning approach for predicting the model Shapley values (MSVs) of many vendors’ models (e.g., 150) in a large-scale marketplace. We perform extensive empirical validation on the effectiveness of model Shapley using various real-world datasets and heterogeneous model types. Thanh Lam, Chuan-Sheng Foo, Kian Hsiang Low |
NeurIPS | 2 |
| 2020 | Learning Task-Agnostic Embedding of Multiple Black-Box Experts for Multi-Task Model FusionabstractModel fusion is an emerging study in collective learning where heterogeneous experts with private data and learning architectures need to combine their black-box knowledge for better performance. Existing literature achieves this via a local knowledge distillation scheme that transfuses the predictive patterns of each pre-trained expert onto a white-box imitator model, which can be incorporated efficiently into a global model. This scheme however does not extend to multi-task scenarios where different experts were trained to solve different tasks and only part of their distilled knowledge is relevant to a new task. To address this multi-task challenge, we develop a new fusion paradigm that represents each expert as a distribution over a spectrum of predictive prototypes, which are isolated from task-specific information encoded within the prototype distribution. The task-agnostic prototypes can then be reintegrated to generate a new model that solves a new task encoded with a different prototype distribution. The fusion and adaptation performance of the proposed framework is demonstrated empirically on several real-world benchmark datasets. Trong Nghia Hoang, Thanh Lam, Kian Hsiang Low, Patrick Jaillet |
ICML | 2 |