Outer Diversity of Structured Domains

• URL: http://arxiv.org/abs/2602.15708v1
• Date: Tue, 17 Feb 2026 16:42:05 GMT
• Title: Outer Diversity of Structured Domains
• Abstract summary: An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election.<n>We introduce and study the notion of outer diversity of a domain and evaluate its value for a number of well-known structured domains.
• Score: 13.671577050006421
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election. We introduce and study the notion of outer diversity of a domain and evaluate its value for a number of well-known structured domains, such as the single-peaked, single-crossing, group-separable, and Euclidean ones.

Related papers

• Diversity of Structured Domains via k-Kemeny Scores [13.671577050006421]
  We study the k-Kemeny problem for a number of structured domains, including the single-peaked, single-crossing, group-separable, and Euclidean ones.<n>We show that k-Kemeny remains intractable under most of these domains, even for k=2, and we use k-Kemeny to rank these domains in terms of their diversity.
  arXiv  Detail & Related papers  (2025-09-19T09:40:39Z)
• Retrievable Domain-Sensitive Feature Memory for Multi-Domain Recommendation [29.044218200986695]
  This paper focuses on features with significant differences across various domains in both distributions and effects on model predictions.<n>We propose a domain-sensitive feature attribution method to identify features that best reflect domain distinctions from the feature set.<n>We design a memory architecture that extracts domain-specific information from domain-sensitive features for the model to retrieve and integrate.
  arXiv  Detail & Related papers  (2024-05-21T16:02:06Z)
• DAOT: Domain-Agnostically Aligned Optimal Transport for Domain-Adaptive Crowd Counting [35.83485358725357]
  Domain adaptation is commonly employed in crowd counting to bridge the domain gaps between different datasets. Existing domain adaptation methods tend to focus on inter-dataset differences while overlooking the intra-differences within the same dataset. We propose a Domain-agnostically Aligned Optimal Transport (DAOT) strategy that aligns domain-agnostic factors between domains.
  arXiv  Detail & Related papers  (2023-08-10T02:59:40Z)
• Discriminative Radial Domain Adaptation [62.22362756424971]
  We propose Discriminative Radial Domain Adaptation (DRDR) which bridges source and target domains via a shared radial structure. We show that transferring such an inherently discriminative structure would enable to enhance feature transferability and discriminability simultaneously. Our method is shown to consistently outperforms state-of-the-art approaches on varied tasks.
  arXiv  Detail & Related papers  (2023-01-01T10:56:31Z)
• Vector-Decomposed Disentanglement for Domain-Invariant Object Detection [75.64299762397268]
  We try to disentangle domain-invariant representations from domain-specific representations. In the experiment, we evaluate our method on the single- and compound-target case.
  arXiv  Detail & Related papers  (2021-08-15T07:58:59Z)
• Self-Adversarial Disentangling for Specific Domain Adaptation [52.1935168534351]
  Domain adaptation aims to bridge the domain shifts between the source and target domains. Recent methods typically do not consider explicit prior knowledge on a specific dimension.
  arXiv  Detail & Related papers  (2021-08-08T02:36:45Z)
• Core-Stable Committees under Restricted Domains [27.621521330479208]
  We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections, participatory budgeting, and facility-location.
  arXiv  Detail & Related papers  (2021-08-04T12:04:29Z)
• Domain Consistency Regularization for Unsupervised Multi-source Domain Adaptive Classification [57.92800886719651]
  Deep learning-based multi-source unsupervised domain adaptation (MUDA) has been actively studied in recent years. domain shift in MUDA exists not only between the source and target domains but also among multiple source domains. We propose an end-to-end trainable network that exploits domain Consistency Regularization for unsupervised Multi-source domain Adaptive classification.
  arXiv  Detail & Related papers  (2021-06-16T07:29:27Z)
• Adversarial Dual Distinct Classifiers for Unsupervised Domain Adaptation [67.83872616307008]
  Unversarial Domain adaptation (UDA) attempts to recognize the unlabeled target samples by building a learning model from a differently-distributed labeled source domain. In this paper, we propose a novel Adrial Dual Distincts Network (AD$2$CN) to align the source and target domain data distribution simultaneously with matching task-specific category boundaries. To be specific, a domain-invariant feature generator is exploited to embed the source and target data into a latent common space with the guidance of discriminative cross-domain alignment.
  arXiv  Detail & Related papers  (2020-08-27T01:29:10Z)
• Adversarial Network with Multiple Classifiers for Open Set Domain Adaptation [9.251407403582501]
  This paper focuses on the type of open set domain adaptation setting where the target domain has both private ('unknown classes') label space and the shared ('known classes') label space. Prevalent distribution-matching domain adaptation methods are inadequate in such a setting. We propose a novel adversarial domain adaptation model with multiple auxiliary classifiers.
  arXiv  Detail & Related papers  (2020-07-01T11:23:07Z)
• Improving Domain-Adapted Sentiment Classification by Deep Adversarial Mutual Learning [51.742040588834996]
  Domain-adapted sentiment classification refers to training on a labeled source domain to well infer document-level sentiment on an unlabeled target domain. We propose a novel deep adversarial mutual learning approach involving two groups of feature extractors, domain discriminators, sentiment classifiers, and label probers.
  arXiv  Detail & Related papers  (2020-02-01T01:22:44Z)

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.