← Search

Pengyi Shi

6 accepted papers

2026

Enhancing Predictive Model Learning via Domain-Knowledge Augmented Latent Feature Mining

AAAI 2026technical

Predictive modeling in high-stakes domains often suffers from limited observed features due to ethical and practical constraints. To address this challenge, we propose a novel approach that formulates latent feature mining as a text-to-text propositional logic reasoning task, facilitating domain kno

Cited by 0SourcePDFScholar
2024

Achieving Fairness through Separability: A Unified Framework for Fair Representation Learning

AISTATS 2024poster

Fairness is a growing concern in machine learning as state-of-the-art models may amplify social prejudice by making biased predictions against specific demographics such as race and gender. Such discrimination raises issues in various fields such as employment, criminal justice, and trust score eval…

2024

Combining Machine Learning and Queueing Theory for Data-Driven Incarceration-Diversion Program Management

AAAI 2024technical

Incarceration-diversion programs have proven effective in reducing recidivism. Accurate prediction of the number of individuals with different characteristics in the program and their program outcomes based on given eligibility criteria is crucial for successful implementation, because this predicti…

Cited by 4SourcePDFScholar
2024

Cumulative Difference Learning VAE for Time-Series with Temporally Correlated Inflow-Outflow

AAAI 2024technical

Time-series generation has crucial practical significance for decision-making under uncertainty. Existing methods have various limitations like accumulating errors over time, significantly impacting downstream tasks. We develop a novel generation method, DT-VAE, that incorporates generalizable domai…

2021

An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints

NeurIPS 2021poster

This paper considers stochastic linear bandits with general nonlinear constraints. The objective is to maximize the expected cumulative reward over horizon $T$ subject to a set of constraints in each round $\tau\leq T$. We propose a pessimistic-optimistic algorithm for this problem, which is efficie…

Cited by 53SourcePDFScholar