Ambiguous Strategic Classification

• URL: http://arxiv.org/abs/2606.10137v1
• Date: Mon, 08 Jun 2026 20:10:26 GMT
• Title: Ambiguous Strategic Classification
• Abstract summary: We study a setting in which regulation requires the system to disclose some, but not all, of the information.<n>This induces a learning task in which the learner must jointly optimize the classifier and the uncertainty surrounding it.<n>We investigate how ambiguity affects the learning task, develop efficient algorithms for computing best-responses and training, and empirically explore strategic learning and its outcomes in this novel setting and using our approach.
• Score: 19.50869817974852
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A common assumption in strategic classification is that the classifier is public knowledge. However, it remains unclear whether, and why, a system would choose to commit to full disclosure. We study a setting in which regulation requires the system to disclose some, but not all, of the information. This induces a learning task in which the learner must jointly optimize the classifier and the uncertainty surrounding it. To this end, we adopt from robust mechanism design the notion of ambiguity, which in our setting allows the learner to reveal a set or range of possible classifiers, while privately choosing which of them to ultimately realize. We investigate how ambiguity affects the learning task, develop efficient algorithms for computing best-responses and training, and empirically explore strategic learning and its outcomes in this novel setting and using our approach.

Related papers

• Strategic Feature Selection [62.74494413516484]
  We study strategic classification through feature selection and its interaction with ridge regularization.<n>We provide a fine-grained characterization of the performance of a feature subset under optimal regularization.<n>Motivated by this characterization, we develop a practical algorithm for jointly choosing the feature set and the level of ridge regularization.
  arXiv  Detail & Related papers  (2026-06-17T09:47:15Z)
• Interpretable Clustering: A Survey [3.051350251198343]
  Clustering algorithms are increasingly being applied in high-stakes domains such as healthcare, finance, and autonomous systems.<n>The need for transparent and interpretable clustering outcomes has become a critical concern.<n>This paper provides a comprehensive and structured review of the current state of explainable clustering algorithms.
  arXiv  Detail & Related papers  (2024-09-01T15:09:51Z)
• Unveiling Entity-Level Unlearning for Large Language Models: A Comprehensive Analysis [32.455702022397666]
  Large language model unlearning has garnered increasing attention due to its potential to address security and privacy concerns.<n>Much of this research has concentrated on instance-level unlearning, specifically targeting the removal of predefined instances containing sensitive content.<n>We propose a novel task of entity-level unlearning, which aims to erase entity-related knowledge from the target model completely.
  arXiv  Detail & Related papers  (2024-06-22T09:40:07Z)
• Informed Decision-Making through Advancements in Open Set Recognition and Unknown Sample Detection [0.0]
  Open set recognition (OSR) aims to bring classification tasks in a situation that is more like reality. This study provides an algorithm exploring a new representation of feature space to improve classification in OSR tasks.
  arXiv  Detail & Related papers  (2024-05-09T15:15:34Z)
• Learnability Gaps of Strategic Classification [68.726857356532]
  We focus on addressing a fundamental question: the learnability gaps between strategic classification and standard learning. We provide nearly tight sample complexity and regret bounds, offering significant improvements over prior results. Notably, our algorithm in this setting is of independent interest and can be applied to other problems such as multi-label learning.
  arXiv  Detail & Related papers  (2024-02-29T16:09:19Z)
• Classification Under Strategic Self-Selection [13.168262355330299]
  We study the effects of self-selection on learning and the implications of learning on the composition of the self-selected population. We propose a differentiable framework for learning under self-selective behavior, which can be optimized effectively.
  arXiv  Detail & Related papers  (2024-02-23T11:37:56Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Anomaly Detection using Ensemble Classification and Evidence Theory [62.997667081978825]
  We present a novel approach for novel detection using ensemble classification and evidence theory. A pool selection strategy is presented to build a solid ensemble classifier. We use uncertainty for the anomaly detection approach.
  arXiv  Detail & Related papers  (2022-12-23T00:50:41Z)
• Leveraging Ensembles and Self-Supervised Learning for Fully-Unsupervised Person Re-Identification and Text Authorship Attribution [77.85461690214551]
  Learning from fully-unlabeled data is challenging in Multimedia Forensics problems, such as Person Re-Identification and Text Authorship Attribution. Recent self-supervised learning methods have shown to be effective when dealing with fully-unlabeled data in cases where the underlying classes have significant semantic differences. We propose a strategy to tackle Person Re-Identification and Text Authorship Attribution by enabling learning from unlabeled data even when samples from different classes are not prominently diverse.
  arXiv  Detail & Related papers  (2022-02-07T13:08:11Z)
• Bayesian Embeddings for Few-Shot Open World Recognition [60.39866770427436]
  We extend embedding-based few-shot learning algorithms to the open-world recognition setting. We benchmark our framework on open-world extensions of the common MiniImageNet and TieredImageNet few-shot learning datasets.
  arXiv  Detail & Related papers  (2021-07-29T00:38:47Z)
• Fair Hierarchical Clustering [92.03780518164108]
  We define a notion of fairness that mitigates over-representation in traditional clustering. We show that our algorithms can find a fair hierarchical clustering, with only a negligible loss in the objective.
  arXiv  Detail & Related papers  (2020-06-18T01:05:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.