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

Yilin Xie

dblp:217/3263 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved

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

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
Transfer learning and domain adaptation · 77% Efficient and distributed learning · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.912025
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning · NeurIPS 2025
Computational science and engineering
chemistry
0.912025
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning · NeurIPS 2025
Machine learning › Efficient and distributed learning
active learning
0.312025
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning · NeurIPS 2025

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

transfer learning · 1.7regression · 1.7feature engineering · 1.7active learning · 1.7
YearPublicationVenuePosition
2025 Global Optimization of Gaussian Process Acquisition Functions Using a Piecewise-Linear Kernel Approximation
abstract
Bayesian optimization relies on iteratively constructing and optimizing an acquisition function. The latter turns out to be a challenging, non-convex optimization problem itself. Despite the relative importance of this step, most algorithms employ sampling- or gradient-based methods, which do not provably converge to global optima. This work investigates mixed-integer programming (MIP) as a paradigm for \emph{global} acquisition function optimization. Specifically, our Piecewise-linear Kernel Mixed Integer Quadratic Programming (PK-MIQP) formulation introduces a piecewise-linear approximation for Gaussian process kernels and admits a corresponding MIQP representation for acquisition functions. The proposed method is applicable to uncertainty-based acquisition functions for any stationary or dot-product kernel. We analyze the theoretical regret bounds of the proposed approximation, and empirically demonstrate the framework on synthetic functions, constrained benchmarks, and a hyperparameter tuning task.
Yilin Xie, Shiqiang Zhang, Joel A. Paulson, Calvin Tsay
AISTATS1
2025 The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning
abstract
Machine learning has promised to change the landscape of laboratory chemistry, with impressive results in molecular property prediction and reaction retro-synthesis. However, chemical datasets are often inaccessible to the machine learning community as they tend to require cleaning, thorough understanding of the chemistry, or are simply not available. In this paper, we introduce a novel dataset for yield prediction, providing the first-ever transient flow dataset for machine learning benchmarking, covering over 1200 process conditions. While previous datasets focus on discrete parameters, our experimental set-up allow us to sample a large number of continuous process conditions, generating new challenges for machine learning models. We focus on solvent selection, a task that is particularly difficult to model theoretically and therefore ripe for machine learning applications. We showcase benchmarking for regression algorithms, transfer-learning approaches, feature engineering, and active learning, with important applications towards solvent replacement and sustainable manufacturing.
Toby Boyne, Juan S. Campos, Rebecca D. Langdon, Jixiang Qing, Yilin Xie, Shiqiang Zhang, Calvin Tsay, Ruth Misener, Daniel W. Davies, Kim E. Jelfs, Sarah Boyall, Thomas M. Dixon, Linden Schrecker, Jose Pablo Folch
NeurIPS5
2018 Particle Pollution Estimation from Images Using Convolutional Neural Network and Weather Features
abstract
Airborne particulate matter with a diameter less than 2.5 micrometers (PM2.5) is one of the most harmful air pollutants, because PM2.5 can be inhaled into human body and cause serious health problems by transmitting hazardous chemicals deeply into lung and bloodstream. A reliable, easily accessible, and low-cost PM2.5 monitoring system can greatly help people raise public awareness of PM2.5 and reduce health hazards of air pollution. In this paper, we combine image and weather information to estimate PM2.5 indices of outdoor images using deep learning and support vector regression (SVR) techniques. The proposed method first uses a convolutional neural network (CNN) to predict the PM2.5 index based on image information, and then the PM2.5 predicted by CNN and two weather features, humidity and wind speed, are combined to yield final estimated PM2.5 index using a created SVR model. We assessed our method using two datasets collected from Shanghai City and Beijing City in China and experimental results demonstrated the effectiveness of the proposed method for PM2.5 estimation.
Qirong Bo, Nabin Rijal, Yilin Xie, Jun Feng 0003
ICIP4