activity
20192025
most citedBeyond Submodularity: A Unified Framework of Randomized Set Selection with Group Fairness Constraints

2 citations · 8 across the 20 of their papers we have counts for

collaborators
Showing cs.LGShow all

15 papers · 1 filter

cs.LG2025

Can Federated Learning Safeguard Private Data in LLM Training? Vulnerabilities, Attacks, and Defense Evaluation

Wenkai Guo, Xuefeng Liu, Haolin Wang +3

Fine-tuning large language models (LLMs) with local data is a widely adopted approach for organizations seeking to adapt LLMs to their specific domains. Given the shared characteri…

cs.LG2024

Learning Submodular Sequencing from Samples

Jing Yuan, Shaojie Tang

This paper addresses the problem of sequential submodular maximization: selecting and ranking items in a sequence to optimize some composite submodular function. In contrast to mos…

cs.LG2024

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates

Jing Yuan, Shaojie Tang

Most of existing studies on submodular maximization focus on selecting a subset of items that maximizes a \emph{single} submodular function. However, in many real-world scenarios,…

cs.LG2024

Tackling Feature-Classifier Mismatch in Federated Learning via Prompt-Driven Feature Transformation

Xinghao Wu, Jianwei Niu, Xuefeng Liu +4

Federated Learning (FL) faces challenges due to data heterogeneity, which limits the global model's performance across diverse client distributions. Personalized Federated Learning…

cs.LG2023★ 1 cited

Non-monotone Sequential Submodular Maximization

Shaojie Tang, Jing Yuan

In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of …

cs.LG2023★ 2 cited

Beyond Submodularity: A Unified Framework of Randomized Set Selection with Group Fairness Constraints

Shaojie Tang, Jing Yuan

Machine learning algorithms play an important role in a variety of important decision-making processes, including targeted advertisement displays, home loan approvals, and criminal…

cs.LG2023

Group Fairness in Non-monotone Submodular Maximization

Jing Yuan, Shaojie Tang

Maximizing a submodular function has a wide range of applications in machine learning and data mining. One such application is data summarization whose goal is to select a small se…

cs.LG2022

Partial-Monotone Adaptive Submodular Maximization

Shaojie Tang, Jing Yuan

Many sequential decision making problems, including pool-based active learning and adaptive viral marketing, can be formulated as an adaptive submodular maximization problem. Most…

cs.LG2022

Group Equality in Adaptive Submodular Maximization

Shaojie Tang, Jing Yuan

In this paper, we study the classic submodular maximization problem subject to a group equality constraint under both non-adaptive and adaptive settings. It has been shown that the…

cs.LG2021

Partial-Adaptive Submodular Maximization

Shaojie Tang, Jing Yuan

The goal of a typical adaptive sequential decision making problem is to design an interactive policy that selects a group of items sequentially, based on some partial observations,…

cs.LG2021★ 2 cited

Optimal Sampling Gaps for Adaptive Submodular Maximization

Shaojie Tang, Jing Yuan

Running machine learning algorithms on large and rapidly growing volumes of data is often computationally expensive, one common trick to reduce the size of a data set, and thus red…

cs.LG2021

Adaptive Regularized Submodular Maximization

Shaojie Tang, Jing Yuan

In this paper, we study the problem of maximizing the difference between an adaptive submodular (revenue) function and an non-negative modular (cost) function under the adaptive se…

cs.LG2020

Adaptive Submodular Meta-Learning

Shaojie Tang, Jing Yuan

Meta-Learning has gained increasing attention in the machine learning and artificial intelligence communities. In this paper, we introduce and study an adaptive submodular meta-lea…

cs.LG2020★ 1 cited

Adaptive Cascade Submodular Maximization

Shaojie Tang, Jing Yuan

In this paper, we propose and study the cascade submodular maximization problem under the adaptive setting. The input of our problem is a set of items, each item is in a particular…

cs.LG2019★ 1 cited

Adaptive Robust Optimization with Nearly Submodular Structure

Shaojie Tang, Jing Yuan

Constrained submodular maximization has been extensively studied in the recent years. In this paper, we study adaptive robust optimization with nearly submodular structure (ARONSS)…