Discrimination of POVMs with rank-one effects

• URL: http://arxiv.org/abs/2002.05452v1
• Date: Thu, 13 Feb 2020 11:34:50 GMT
• Title: Discrimination of POVMs with rank-one effects
• Authors: Aleksandra Krawiec, {\L}ukasz Pawela, and Zbigniew Pucha{\l}a
• Abstract summary: This work provides an insight into the problem of discrimination of positive operator valued measures with rank-one effects. We compare two possible discrimination schemes: the parallel and adaptive ones. We provide an explicit algorithm which allows us to find this adaptive scheme.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The main goal of this work is to provide an insight into the problem of discrimination of positive operator valued measures with rank-one effects. It is our intention to study multiple shot discrimination of such measurements, that is the case when we are able to use to unknown measurement a given number of times. Furthermore, we are interested in comparing two possible discrimination schemes: the parallel and adaptive ones. To this end we construct a pair of symmetric, information complete positive operator valued measures which can be perfectly discriminated in a two-shot adaptive scheme. On top of this we provide an explicit algorithm which allows us to find this adaptive scheme.

Related papers

• Does Machine Bring in Extra Bias in Learning? Approximating Fairness in Models Promptly [2.002741592555996]
  Existing techniques for assessing the discrimination level of machine learning models include commonly used group and individual fairness measures. We propose a "harmonic fairness measure via manifold (HFM)" based on distances between sets. Empirical results indicate that the proposed fairness measure HFM is valid and that the proposed ApproxDist is effective and efficient.
  arXiv  Detail & Related papers  (2024-05-15T11:07:40Z)
• Evaluating the Fairness of Discriminative Foundation Models in Computer Vision [51.176061115977774]
  We propose a novel taxonomy for bias evaluation of discriminative foundation models, such as Contrastive Language-Pretraining (CLIP) We then systematically evaluate existing methods for mitigating bias in these models with respect to our taxonomy. Specifically, we evaluate OpenAI's CLIP and OpenCLIP models for key applications, such as zero-shot classification, image retrieval and image captioning.
  arXiv  Detail & Related papers  (2023-10-18T10:32:39Z)
• Discriminator-free Unsupervised Domain Adaptation for Multi-label Image Classification [11.825795835537324]
  A discriminator-free adversarial-based Unminator Domain Adaptation (UDA) for Multi-Label Image Classification (MLIC) is proposed. The proposed method is evaluated on several multi-label image datasets covering three different types of domain shift.
  arXiv  Detail & Related papers  (2023-01-25T14:45:13Z)
• Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation [55.27563366506407]
  We introduce a discriminator-free adversarial learning network (DALN) for unsupervised domain adaptation (UDA) DALN achieves explicit domain alignment and category distinguishment through a unified objective. DALN compares favorably against the existing state-of-the-art (SOTA) methods on a variety of public datasets.
  arXiv  Detail & Related papers  (2022-04-08T04:40:18Z)
• Marrying Fairness and Explainability in Supervised Learning [0.0]
  We formalize direct discrimination as a direct causal effect of the protected attributes on the decisions. We find that state-of-the-art fair learning methods can induce discrimination via association or reverse discrimination. We propose to nullify the influence of the protected attribute on the output of the system, while preserving the influence of remaining features.
  arXiv  Detail & Related papers  (2022-04-06T17:26:58Z)
• Concurrent Discrimination and Alignment for Self-Supervised Feature Learning [52.213140525321165]
  Existing self-supervised learning methods learn by means of pretext tasks which are either (1) discriminating that explicitly specify which features should be separated or (2) aligning that precisely indicate which features should be closed together. In this work, we combine the positive aspects of the discriminating and aligning methods, and design a hybrid method that addresses the above issue. Our method explicitly specifies the repulsion and attraction mechanism respectively by discriminative predictive task and concurrently maximizing mutual information between paired views. Our experiments on nine established benchmarks show that the proposed model consistently outperforms the existing state-of-the-art results of self-supervised and transfer
  arXiv  Detail & Related papers  (2021-08-19T09:07:41Z)
• Exploring Dropout Discriminator for Domain Adaptation [27.19677042654432]
  Adaptation of a classifier to new domains is one of the challenging problems in machine learning. We propose a curriculum based dropout discriminator that gradually increases the variance of the sample based distribution. An ensemble of discriminators helps the model to learn the data distribution efficiently.
  arXiv  Detail & Related papers  (2021-07-09T06:11:34Z)
• Scalable Personalised Item Ranking through Parametric Density Estimation [53.44830012414444]
  Learning from implicit feedback is challenging because of the difficult nature of the one-class problem. Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem. We propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart.
  arXiv  Detail & Related papers  (2021-05-11T03:38:16Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)
• The Benefits of Pairwise Discriminators for Adversarial Training [1.7188280334580193]
  We introduce a family of objectives by leveraging pairwise discriminators, and show that only the generator needs to converge. We provide sufficient conditions for local convergence; characterize the capacity balance that should guide the discriminator and generator choices. We show that practical methods derived from our approach can better generate higher-resolution images.
  arXiv  Detail & Related papers  (2020-02-20T08:43:59Z)

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.