首页/论文/2102.09704

arXiv 2102.097042021-02cs.LG

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

Purdue University（普渡大学）

Adarsh Barik, Jean Honorio

发表信息：: Neural Information Processing Systems (NeurIPS), 2021

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

In this paper, we study the problem of fair sparse regression on a biased dataset where bias depends upon a hidden binary attribute. The presence of a hidden attribute adds an extra layer of complexity to the problem by combining sparse regression and clustering with unknown binary labels. The corresponding optimization problem is combinatorial, but we propose a novel relaxation of it as an \emph{invex} optimization problem. To the best of our knowledge, this is the first invex relaxation for a combinatorial problem. We show that the inclusion of the debiasing/fairness constraint in our model has no adverse effect on the performance. Rather, it enables the recovery of the hidden attribute. The support of our recovered regression parameter vector matches exactly with the true parameter vector. Moreover, we simultaneously solve the clustering problem by recovering the exact value of the hidden attribute for each sample. Our method uses carefully constructed primal dual witnesses to provide theoretical guarantees for the combinatorial problem. To that end, we show that the sample complexity of our method is logarithmic in terms of the dimension of the regression parameter vector.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

利用不变凸性对稀疏线性模型进行鲁棒离群点估计

Outlier-robust Estimation of a Sparse Linear Model Using Invexity

Purdue University（普渡大学）

本文针对含离群样本的稀疏回归问题，提出一种组合式鲁棒lasso方法，通过识别干净样本进行估计，并利用不变凸松弛提供理论保证，实验验证其优于标准lasso。

2023-06-22cs.LG

论组合多臂老虎机公平学习的低复杂度特性

On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit

Pennsylvania State University（宾夕法尼亚州立大学）；Virginia Tech（弗吉尼亚理工大学）；Nokia Corporation（诺基亚公司）

针对带公平约束的组合多臂老虎机中悲观-乐观算法因超级臂指数增长导致计算复杂度过高的问题，提出基于pick-and-compare方法的低复杂度算法，将比较步数降为常数，仅轻微牺牲公平性和遗憾值性能，并通过仿真验证。

2025-01-10cs.LG

Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints

University of Victoria（维多利亚大学）；Southeast University（东南大学）；Harbin Institute of Technology（哈尔滨工业大学）

We study the combinatorial sleeping multi-armed semi-bandit problem with long-term fairness constraints~(CSMAB-F). To address the problem, we adopt Thompson Sampling~(TS) to maximize the total rewards and use virtual queue techniques to handle the fairness constraints, and design an algorithm called \emph{TS with beta priors and Bernoulli likelihoods for CSMAB-F~(TSCSF-B)}. Further, we prove TSCSF-B can satisfy the fairness constraints, and the time-averaged regret is upper bounded by $\frac{N}{2η} + O\left(\frac{\sqrt{mNT\ln T}}{T}\right)$, where $N$ is the total number of arms, $m$ is the ma…

2020-05-14cs.LGstat.ML

基于功绩的具有无限制反馈延迟的公平组合半老虎机问题

Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays

Sun Yat-sen University（中山大学）；The Chinese University of Hong Kong（香港中文大学）

本文研究了在无限制反馈延迟和基于功绩公平性约束下的随机组合半老虎机问题，提出了能实现次线性奖励遗憾与公平性遗憾的新算法，并通过实验验证了其有效性。

2024-07-29cs.LGstat.ML

Combinatorial Sleeping Bandits with Fairness Constraints

Temple University（天普大学）；Iowa State University（爱荷华州立大学）

The multi-armed bandit (MAB) model has been widely adopted for studying many practical optimization problems (network resource allocation, ad placement, crowdsourcing, etc.) with unknown parameters. The goal of the player here is to maximize the cumulative reward in the face of uncertainty. However, the basic MAB model neglects several important factors of the system in many real-world applications, where multiple arms can be simultaneously played and an arm could sometimes be "sleeping". Besides, ensuring fairness is also a key design concern in practice. To that end, we propose a new Combina…

2019-11-20cs.LGcs.PFstat.ML

Combinatorial Multi-Objective Multi-Armed Bandit Problem

Bilkent University（比尔肯特大学）；The Ohio State University（俄亥俄州立大学）

In this paper, we introduce the COmbinatorial Multi-Objective Multi-Armed Bandit (COMO-MAB) problem that captures the challenges of combinatorial and multi-objective online learning simultaneously. In this setting, the goal of the learner is to choose an action at each time, whose reward vector is a linear combination of the reward vectors of the arms in the action, to learn the set of super Pareto optimal actions, which includes the Pareto optimal actions and actions that become Pareto optimal after adding an arbitrary small positive number to their expected reward vectors. We define the Pare…

2018-03-11cs.LG

更多相关论文收起更多论文

Individually Fair Learning with One-Sided Feedback

The Hebrew University（希伯来大学）；University of Pennsylvania（宾夕法尼亚大学）

We consider an online learning problem with one-sided feedback, in which the learner is able to observe the true label only for positively predicted instances. On each round, $k$ instances arrive and receive classification outcomes according to a randomized policy deployed by the learner, whose goal is to maximize accuracy while deploying individually fair policies. We first extend the framework of Bechavod et al. (2020), which relies on the existence of a human fairness auditor for detecting fairness violations, to instead incorporate feedback from dynamically-selected panels of multiple, pos…

2022-06-09cs.LGstat.ML

Fair Disaster Containment via Graph-Cut Problems

Johns Hopkins University（约翰斯·霍普金斯大学）；University of Maryland, College Park（马里兰大学帕克分校）；University of Virginia（弗吉尼亚大学）

Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algorithmic Design and Machine Learning has recently received significant attention, with many different notions proposed and analyzed for a variety of contexts. In this paper we initiate the study of fairness for graph cut problems by giving the first fair definitions for them, and subsequently we demonstrate appropriate algorithmic techniques that yield a rigorous theoretical analysis. Specifically, we incorporate two di…

2022-02-16cs.DScs.LG

SHaSaM：子模函数硬样本挖掘用于公平面部属性识别

SHaSaM: Submodular Hard Sample Mining for Fair Facial Attribute Recognition

The University of Texas at Dallas（德克萨斯大学达拉斯分校）

SHaSaM通过子模函数硬样本挖掘方法，有效提升面部属性识别的公平性，同时提高模型准确性。

2026-02-05cs.CVcs.LG

Fair Correlation Clustering

Google Research（谷歌研究院）

In this paper, we study correlation clustering under fairness constraints. Fair variants of $k$-median and $k$-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering under several important types of fairness constraints. Our results hinge on obtaining a fairlet decomposition for correlation clustering by introducing a novel combinatorial optimization problem. We define a fairlet decomposition with cost similar to the $k$-median cost and this all…

2020-03-02cs.AIcs.DScs.LG

Variational Fair Clustering

Xidian University（西安电子科技大学）

We propose a general variational framework of fair clustering, which integrates an original Kullback-Leibler (KL) fairness term with a large class of clustering objectives, including prototype or graph based. Fundamentally different from the existing combinatorial and spectral solutions, our variational multi-term approach enables to control the trade-off levels between the fairness and clustering objectives. We derive a general tight upper bound based on a concave-convex decomposition of our fairness term, its Lipschitz-gradient property and the Pinsker's inequality. Our tight upper bound can…

2020-12-04cs.LGstat.ML

组合老虎机中高效交换后悔最小化

Efficient Swap Regret Minimization in Combinatorial Bandits

National Technical University of Athens（雅典国立技术大学）；National and Kapodistrian University of Athens（雅典国立卡波季斯特里安大学）；Archimedes, Athena Research Center（雅典娜研究中心阿基米德部）；Univ. Grenoble Alpes（格勒诺布尔阿尔卑斯大学）；CNRS（法国国家科学研究中心）；Inria（法国国家信息与自动化研究所）；Grenoble INP（格勒诺布尔国立高等物理、数学与信息学院）；University of California, Irvine（加州大学尔湾分校）

本文提出一种在组合老虎机中具有多项对数依赖于N的高效无交换后悔算法，解决了该领域长期存在的挑战。

2026-02-02cs.LGstat.ML

How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem

Ecole Polytechnique de Montréal（蒙特利尔综合理工学院）；Ecole des Ponts Paristech（巴黎高科桥路学校）；Element AI（元素人工智能公司）

Combinatorial optimization is the field devoted to the study and practice of algorithms that solve NP-hard problems. As Machine Learning (ML) and deep learning have popularized, several research groups have started to use ML to solve combinatorial optimization problems, such as the well-known Travelling Salesman Problem (TSP). Based on deep (reinforcement) learning, new models and architecture for the TSP have been successively developed and have gained increasing performances. At the time of writing, state-of-the-art models provide solutions to TSP instances of 100 cities that are roughly 1.3…

2019-09-28cs.AIcs.LG

无神经元的智能交通——基于表格强化学习的公平地铁网络扩展

Smart Transportation Without Neurons -- Fair Metro Network Expansion with Tabular Reinforcement Learning

Socially Intelligent Artificial Systems University of Amsterdam（社会智能人工智能系统大学阿姆斯特丹）

针对地铁网络扩展问题，提出将非马尔可夫奖励决策过程与表格强化学习相结合的方法，在保证性能的同时大幅降低训练轮次和碳排放，并融入社会公平性指标。

2026-06-02cs.AIcs.LG