betaFeedback

WorksComputer Science

Practical Estimation of the Bayes Optimal Fairness-Accuracy Tradeoff with Soft Labels

Abstract

There is a fundamental limit to the best prediction error of any model for a given data distribution. In classification, the Bayes error quantifies this limit and serves as both a benchmark for trained models and a criterion to detect overfitting. The state-of-the-art Bayes error estimation techniques for binary classification use only soft labels (positive class probabilities) and require no input features or auxiliary training. We extend such notions to constrained classification problems, such as fairness. Fair classification is an important case of constrained or multi-objective classification. It requires a model not only to be accurate but also to yield fair outcomes (equal or near-equal true positive rates) across different demographic groups (e.g., race and gender). This leads to an inherent fairness-accuracy tradeoff or a Pareto frontier that is used to compare fair classifiers against each other. The focus of our work is to estimate the fundamental limit for this fairness-accuracy tradeoff. We derive an explicit expression for the fair Bayes error rate (i.e., best achievable error rate subject to given fairness constraints), and construct consistent, instance-free estimators for it using only soft labels and group information. We provably bound the bias and the sample complexity of our estimators. Empirically, our method produces a robust, low-variance estimate of the optimal fairness-accuracy tradeoff curve, even when the soft labels are noisy and derived from a classification model on hard labels.

Introduction

The notion of Bayes optimality in machine learning defines the best achievable performance, given a data distribution, with respect to the 0-1 loss [1, 2, 3, 4]. For binary classification, an observation consist of features X∈X⊆RdX \in\mathcal{X} \subseteq\mathbb{R}^{d}, a label Y∈Y={0,1}Y \in\mathcal{Y} = \{0, 1\}, and a sensitive attribute A∈A={0,1}A \in\mathcal{A} = \{0, 1\}, governed by an underlying distribution (X,Y,A)∼D(X, Y, A) \sim\mathcal{D}. A group-aware classifier g:X×A→{0,1}g : \mathcal{X} \times\mathcal{A} \to\{0, 1\} predicts labels using both features and sensitive attributes. A well-known result states that the Bayes optimal classifier g∗g^{*} can be expressed as the following decision rule: g∗(x,a)=I(η(x,a)≥1/2)g^{*}(x, a) = \mathbb{I}(\eta(x, a) \ge1/2) [4, 5]. Here, I(⋅)\mathbb{I}(\cdot) denotes the indicator function and η(x,a):=Pr⁡(Y=1∣X=x,A=a)\eta(x, a) := \Pr(Y = 1 \mid X = x, A = a) defines the posterior, which assigns a soft label ci:=η(xi,ai)c_i := \eta(x_i, a_i) to each instance. This rule also allows us to estimate the Bayes error, the best achievable performance for a given distribution, without access to any instances [4, 6]: β=EX,A[min⁡{C,1−C}]\beta= \mathbb{E}_{X,A}[\min\{C, 1 - C\}], where C:=η(X,A)C := \eta(X, A) is the random variable corresponding to the soft labels.

This notion can also be extended to multi-objective classification problems, such as those that enforce fairness constraints [7]. With the widespread deployment of machine learning models, it is essential that models are fair and do not produce disproportionate errors and harm to certain sensitive groups in the data [7, 8, 9]. However, applying fairness constraints generally introduces a tradeoff with accuracy, since common fairness constraints are incompatible with the standard notion of accuracy [10, 11]. This tradeoff depends sharply on (i) the underlying data distribution, (ii) the fairness metric (equality of positives or true positives), and (iii) the degree of allowed unfairness tolerance.

Bayes optimal fair classifiers can often be characterized as adjustments of the classification thresholds: gfair∗(x,a)=I(η(x,a)≥1/2+ta(δ))g_{\mathrm{fair}}^{*}(x, a) = \mathbb{I}\left(\eta(x, a) \ge1/2 + t_a(\delta)\right) where ta(δ)>0t_a(\delta) > 0 is a group-dependent adjustment that depends on the fairness metric, the underlying data distribution and the tolerance for unfairness δ\delta. This is precisely where existing works on estimating the Bayes error do not generalize [6, 13, 14]. While Bayes error estimators solely rely on posterior probabilities (soft scores), resulting in a constant threshold of 1/21/2, this is not the case for cost-sensitive thresholds, such as fairness. The error estimators for these cost-sensitive thresholds also require an estimator for the underlying thresholds.

Therefore, to estimate the optimal fairness-accuracy tradeoff, we first show how we can disentangle the unfairness level δ\delta and the corresponding threshold adjustment ta(δ)t_a(\delta) by studying when the classifiers become trivial (Lemma 3.8). Using this, we can estimate the threshold and, eventually, the unfairness and error rate at several points along the tradeoff curve by leveraging its monotonicity properties (Lemma C.1). We show that fair classification can be reduced to cost-sensitive thresholding with appropriate λ\lambda-dependent thresholds (Lemma C.5), where λ∈R\lambda\in\mathbb{R} is a parameter that directly controls the correction to the classification threshold and depends on δ\delta. We then derive consistent estimators for the fair classification thresholds, only using soft labels, at any fixed λ\lambda (Theorem 4.1).

Once we have consistent estimates of thresholds, we then, as an independent result, generalize the Bayes error estimators in prior works [6, 13, 14] to work with any cost-sensitive risk (Theorem 4.3). Since our thresholds and estimators are both constructed using finite soft labels, we move beyond the scope of prior art to study consistency, bias, and sample complexity of the estimation of the cost-sensitive Bayes risk (Theorem 4.4). These results and rates apply to many cost-sensitive learning scenarios [15, 16] that require distribution-dependent classification thresholds.

We then focus on estimating the optimal fairness-accuracy tradeoff using only soft labels. We first derive the estimated risk at any threshold and show its consistency properties (Theorem 4.5). We then also provide estimators for the expected unfairness under demographic parity and equal opportunity, and derive their consistency and sample complexity properties (Theorem 4.6). All of them culminate in a bisection-search driven algorithm with our estimators (Algorithm 1), inspired by a similar algorithm for the Bayes optimal fair classifiers [5], but only with soft labels and without instances. An example of this bisection algorithm in action is presented in Figure 1 (green curve).

Unfairness-error tradeoffs on synthetic data for Demographic Parity and Equal Opportunity constraints

Figure 1. Unfairness-error tradeoffs on synthetic data [12] for Demographic Parity (DP) and Equal Opportunity (EOP) constraints. The proposed estimate (green) establishes a lower bound against competing algorithms. Dotted lines denote the unconstrained Bayes Optimal classifier at λ=0\lambda= 0.

Finally, we estimate the fairness-accuracy tradeoff on real-world datasets. We compare our estimated tradeoff against several recent works on estimating the fairness-accuracy tradeoff [17, 18] and differentiable objectives for fair classification [19], in Figure 1 and Figure 2. We show that our estimated tradeoff lower bounds the tradeoff estimated by these methods. Whenever it does not (for example, in the case of the algorithm proposed in [18]), it is explained by the algorithm’s optimization of a completely different lower bound on the Pareto frontier. We also perform experiments with noisy soft scores generated by a Logistic Regression model on the Adult dataset [20] and find that our method still lower-bounds all other fairness tradeoff algorithms.

Unfairness-error tradeoffs on Cifar-10H and the Adult Dataset

Figure 2. Unfairness-error tradeoffs on Cifar-10H and the Adult Dataset, for Demographic Parity (DP) and Equal Opportunity (EOP) constraints. The proposed estimate (green) establishes a lower bound against competing algorithms, except MIFPO (red), which computes a high-variance data-dependent lower bound different from the Bayes optimal. Dotted lines denote the unconstrained Bayes Optimal classifier at λ=0\lambda= 0.

Overall, in a similar spirit to prior work [6, 13, 14], where the authors use the Bayes error as a tool to validate performance and check for overfitting, our estimated tradeoff with soft labels establishes a similar precedent: Any current or future methods aiming to compare fair algorithms should always close the gap between their estimated tradeoff and the theoretically best, that we estimate.

Related Work: Our work is inspired by the prior results [6, 13, 14] that characterize the performance limitations in terms of accuracy using the threshold characterization of the Bayes optimal classifier. There are several other works on Bayes error estimation that aim to estimate the Bayes error indirectly [21, 22, 23, 24]. But since most of these methods estimate the Bayes error indirectly, without leveraging soft labels or thresholding rules, generalizing them to constrained optimization settings, such as fairness constraints and cost-sensitive risk, is future work beyond the scope of this work. A major theme of this paper centers around fair machine learning, which has received rightful attention in recent years [7]. Several fairness metrics, such as demographic parity [25] and equal opportunity [26], have been proposed, and corresponding fair Bayes optimal classifiers have been extensively studied in the literature [27, 11]. We make extensive use of threshold characterizations of fair Bayes optimal classifiers [11, 28, 5]. Finally, a major part of our work also concerns deriving consistency and sample-complexity properties of the thresholds and risk and unfairness estimators. Some related estimators have also been studied in prior work [29, 13].

Notations and Assumptions

Let πa=Pr⁡(A=a)\pi_a = \Pr(A = a), πya=Pr⁡(Y=y,A=a)\pi_{ya} = \Pr(Y = y, A = a), πy∣a=Pr⁡(Y=y∣A=a)\pi_{y|a} = \Pr(Y = y|A = a), π=Pr⁡(Y=1)\pi= \Pr(Y = 1), and Pr⁡(Y=y)=∑a∈Aπya\Pr(Y = y) = \sum_{a \in\mathcal{A}} \pi_{ya}. We assume the existence of all groups and classes, i.e., πa>0\pi_a > 0, πy∣a>0\pi_{y|a} > 0 for all y∈Yy \in\mathcal{Y} and for all a∈Aa \in\mathcal{A}. Finally, we let p→p \to denote convergence in probability. All probabilities and expectations are taken with respect to the underlying distribution D\mathcal{D}.

Whenever we work with a finite sample, we assume that we are given access to NN i.i.d. soft labels of the form (ci,ai)(c_i, a_i), and we will denote our dataset with D={(ci,ai)}i=1N\mathcal{D} = \{(c_i, a_i)\}_{i=1}^{N}. Since our approach is model-free, we do not require access to features xix_i. We will also partition our dataset D\mathcal{D} into two parts: D=Dα∪Dβ\mathcal{D} = \mathcal{D}_{\alpha} \cup\mathcal{D}_{\beta}, with Dα∩Dβ=∅\mathcal{D}_{\alpha} \cap\mathcal{D}_{\beta} = \varnothing, where Dα\mathcal{D}_{\alpha} (with NαN_{\alpha} samples) will be the data used to estimate the thresholds that we will put on η(x,a)\eta(x,a), and Dβ\mathcal{D}_{\beta} (with NβN_{\beta} samples) will be used to construct the estimators of classification risk and unfairness, with N=Nα+NβN = N_{\alpha} + N_{\beta}. The splits are chosen independently of the sample values. Furthermore, we will denote with Nα,aN_{\alpha,a} (or Nβ,aN_{\beta,a}) the number of samples from group A=aA = a. Lastly, i∈[D]i \in[D] denotes drawing an index from the dataset DD. We need two independent sample sets because we estimate the required quantities in two steps. First, using Dα\mathcal{D}_{\alpha}, we estimate the distribution priors and group-dependent thresholds (Theorem 4.1), and next using Dβ\mathcal{D}_{\beta}, we estimate the cost-sensitive Bayes risk, the expected error, and unfairness (Theorems 4.4, 4.5, and 4.6 respectively). We now assume the following about our soft labels:

Assumption 2.1. (No interior atoms / Continuity of the Cumulative Distribution function of η\eta) The mapping t↦Fa(t)=Pr⁡(η(X,a)≤t∣A=a)t \mapsto F_a(t) = \Pr(\eta(X,a) \leq t|A = a), ∀a∈A\forall a \in\mathcal{A} is continuous in (0,1)(0,1). Moreover, Pr⁡(η(X,a)≥1/2∣A=a)>0\Pr(\eta(X,a) \geq1/2|A = a) > 0 for all a∈Aa \in\mathcal{A}.

Assumption 2.2. (Lipschitz continuous group CDF) For each a∈Aa \in\mathcal{A}, the group-conditional distribution of C=η(X,a)∣A=aC = \eta(X,a)|A = a admits a density faf_a on (0,1)(0,1) such that sup⁡t∈(0,1)fa(t)≤La<∞\sup_{t \in(0,1)} f_a(t) \leq L_a < \infty. In particular, FaF_a is LaL_a-Lipschitz: ∣Fa(u)−Fa(v)∣≤La⋅∣u−v∣|F_a(u) - F_a(v)| \leq L_a \cdot|u - v| for all u,v∈(0,1)u,v \in(0,1).

Let π^a=1Nα∑i∈[Dα]I(ai=a)\hat{\pi}_a = \frac{1}{N_{\alpha}} \sum_{i \in[D_{\alpha}]} \mathbb{I}(a_i = a) denote our estimator for πa\pi_a. By the Weak Law of Large Numbers, π^a→pπa\hat{\pi}_a \xrightarrow{p} \pi_a. Furthermore, the bias of the estimator π^a\hat{\pi}_a is zero, which is easy to see via the linearity of expectation. We can derive a similar unbiased estimator for π=Pr⁡(Y=1)\pi= \Pr(Y = 1) as π^=1Nα∑i∈[Dα]ci\hat{\pi} = \frac{1}{N_{\alpha}} \sum_{i \in[D_{\alpha}]} c_i.

References

  1. [1]Thomas Cover and Peter Hart. Nearest neighbor pattern classification. IEEE transactions on information theory, 13(1):21–27, 1967.DOI
  2. [2]Keinosuke Fukunaga. Introduction to statistical pattern recognition. Elsevier, 2013.
  3. [3]Luc Devroye, László Györfi, and Gábor Lugosi. A probabilistic theory of pattern recognition, volume 31. Springer Science & Business Media, 2013.
  4. [4]M Mohri, A Rostamizadeh, and A Talwalkar. Foundations of machine learning second edition. In Google Books. MIT Press, 2018.
  5. [5]Xianli Zeng, Guang Cheng, and Edgar Dobriban. Bayes-optimal fair classification with linear disparity constraints via pre-, in-, and post-processing. arXiv preprint arXiv:2402.02817, 2024.arxiv.org/abs/2402.02817
  6. [6]Takashi Ishida, Ikko Yamane, Nontawat Charoenphakdee, Gang Niu, and Masashi Sugiyama. Is the performance of my deep network too good to be true? a direct approach to estimating the bayes error in binary classification. In The Eleventh International Conference on Learning Representations.
  7. [7]Solon Barocas, Moritz Hardt, and Arvind Narayanan. Fairness and machine learning: Limitations and opportunities. MIT press, 2023.
  8. [8]Julia Angwin, Jeff Larson, Surya Mattu, and Lauren Kirchner. Machine bias. ProPublica, May, 23(2016):139–159, 2016.
  9. [9]Joy Buolamwini and Timnit Gebru. Gender shades: Intersectional accuracy disparities in commercial gender classification. In Conference on fairness, accountability and transparency, pages 77–91. PMLR, 2018.
  10. [10]Geoff Pleiss, Manish Raghavan, Felix Wu, Jon Kleinberg, and Kilian Q Weinberger. On fairness and calibration. Advances in neural information processing systems, 30, 2017.arxiv.org/abs/1709.02012
  11. [11]Aditya Krishna Menon and Robert C Williamson. The cost of fairness in binary classification. In Conference on Fairness, accountability and transparency, pages 107–118. PMLR, 2018.
  12. [12]Xianli Zeng, Edgar Dobriban, and Guang Cheng. Bayes-optimal classifiers under group fairness. arXiv preprint arXiv:2202.09724, 2022.arxiv.org/abs/2202.09724
  13. [13]Minoh Jeong, Martina Cardone, and Alex Dytso. Data-driven estimation of the false positive rate of the bayes binary classifier via soft labels. In 2024 IEEE International Symposium on Information Theory (ISIT), pages 368–373. IEEE, 2024.arxiv.org/abs/2401.15500
  14. [14]R. Ushio, T. Ishida, and M. Sugiyama. Practical estimation of the optimal classification error with soft labels and calibration. In Proceedings of Fourteenth International Conference on Learning Representations (ICLR2026), page to appear, Rio de Janeiro, Brazil, Apr. 23–27 2026.arxiv.org/abs/2505.20761
  15. [15]Oluwasanmi O Koyejo, Nagarajan Natarajan, Pradeep K Ravikumar, and Inderjit S Dhillon. Consistent binary classification with generalized performance metrics. Advances in neural information processing systems, 27, 2014.
  16. [16]Shashank Singh and Justin Khim. Optimal binary classification beyond accuracy. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022.arxiv.org/abs/2107.01777
  17. [17]Eoin Delaney, Zihao Fu, Sandra Wachter, Brent Mittelstadt, and Chris Russell. Oxonfair: A flexible toolkit for algorithmic fairness. Advances in Neural Information Processing Systems, 37:94209–94245, 2024.
  18. [18]Mark Kozdoba, Binyamin Perets, and Shie Mannor. Efficient fairness-performance pareto front computation. arXiv preprint arXiv:2409.17643, 2024.arxiv.org/abs/2409.17643
  19. [19]Maarten Buyl, MaryBeth Defrance, and Tijl De Bie. Fairret: a framework for differentiable fairness regularization terms. arXiv preprint arXiv:2310.17256, 2023.arxiv.org/abs/2310.17256
  20. [20]Moshe Lichman et al. Uci machine learning repository, 2013.
  21. [21]Visar Berisha, Alan Wisler, Alfred O Hero, and Andreas Spanias. Empirically estimable classification bounds based on a nonparametric divergence measure. IEEE Transactions on Signal Processing, 64(3):580–591, 2015.pubmed.ncbi.nlm.nih.gov/26807014
  22. [22]Morteza Noshad, Li Xu, and Alfred Hero. Learning to benchmark: Determining best achievable misclassification error from training data. arXiv preprint arXiv:1909.07192, 2019.arxiv.org/abs/1909.07192
  23. [23]Ryan Theisen, Huan Wang, Lav R Varshney, Caiming Xiong, and Richard Socher. Evaluating state-of-the-art classification models against bayes optimality. Advances in Neural Information Processing Systems, 34:9367–9377, 2021.arxiv.org/abs/2106.03357
  24. [24]Cedric Renggli, Luka Rimanic, Nora Hollenstein, and Ce Zhang. Evaluating bayes error estimators on real-world datasets with feebee. arXiv preprint arXiv:2108.13034, 2021.arxiv.org/abs/2108.13034
  25. [25]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. Fairness through awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science (ITCS) Conference, page 214–226. Association for Computing Machinery, 2012.
  26. [26]Moritz Hardt, Eric Price, and Nati Srebro. Equality of opportunity in supervised learning. Advances in neural information processing systems, 29:3315–3323, 2016.arxiv.org/abs/1610.02413
  27. [27]Blake Woodworth, Suriya Gunasekar, Mesrob I Ohannessian, and Nathan Srebro. Learning non-discriminatory predictors. In Conference on Learning Theory, pages 1920–1953. PMLR, 2017.arxiv.org/abs/1702.06081
  28. [28]Evgenii Chzhen, Christophe Denis, Mohamed Hebiri, Luca Oneto, and Massimiliano Pontil. Leveraging labeled and unlabeled data for consistent fair binary classification. Advances in Neural Information Processing Systems, 32, 2019.
  29. [29]Drona Khurana, Srinivasan Ravichandran, Sparsh Jain, and Narayanan Unny Edakunni. Statistical guarantees for fairness aware plug-in algorithms. arXiv preprint arXiv:2107.12783, 2021.arxiv.org/abs/2107.12783
  30. [30]L Elisa Celis, Lingxiao Huang, Vijay Keswani, and Nisheet K Vishnoi. Classification with fairness constraints: A meta-algorithm with provable guarantees. In Proceedings of the conference on fairness, accountability, and transparency, pages 319–328, 2019.
  31. [31]Minoh Jeong, Martina Cardone, and Alex Dytso. Demystifying the optimal performance of multi-class classification. Advances in Neural Information Processing Systems, 36:31638–31664, 2023.DOI
  32. [32]Joshua C Peterson, Ruairidh M Battleday, Thomas L Griffiths, and Olga Russakovsky. Human uncertainty makes classification more robust. In Proceedings of the IEEE/CVF international conference on computer vision, pages 9617–9626, 2019.arxiv.org/abs/1908.07086
  33. [33]Alekh Agarwal, Alina Beygelzimer, Miroslav Dudík, John Langford, and Hanna Wallach. A reductions approach to fair classification. In International Conference on Machine Learning, pages 60–69. PMLR, 2018.arxiv.org/abs/1803.02453
  34. [34]Mohit Sharma, Amit Deshpande, and Rajiv Ratn Shah. On comparing fair classifiers under data bias. arXiv preprint arXiv:2302.05906, 2023.arxiv.org/abs/2302.05906
  35. [35]Avijit Ghosh, Pablo Kvitcha, and Christo Wilson. When fair classification meets noisy protected attributes. In Proceedings of the 2023 AAAI/ACM Conference on AI, Ethics, and Society, pages 679–690, 2023.DOI
  36. [36]Takashi Ishida, Gang Niu, and Masashi Sugiyama. Binary classification from positive-confidence data. Advances in neural information processing systems, 31, 2018.arxiv.org/abs/1710.07138
  37. [37]Marthinus C Du Plessis, Gang Niu, and Masashi Sugiyama. Analysis of learning from positive and unlabeled data. Advances in neural information processing systems, 27, 2014.
  38. [38]Ziwei Wu and Jingrui He. Fairness-aware model-agnostic positive and unlabeled learning. In Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, pages 1698–1708, 2022.DOI
  39. [39]Emily Diana, Wesley Gill, Michael Kearns, Krishnaram Kenthapadi, Aaron Roth, and Saeed Sharifi-Malvajerdi. Multicaccurate proxies for downstream fairness. In Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, pages 1207–1239, 2022.arxiv.org/abs/2107.04423
  40. [40]Flavien Prost, Pranjal Awasthi, Nick Blumm, Aditee Kumthekar, Trevor Potter, Li Wei, Xuezhi Wang, Ed H Chi, Jilin Chen, and Alex Beutel. Measuring model fairness under noisy covariates: A theoretical perspective. In Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, pages 873–883, 2021.arxiv.org/abs/2105.09985
  41. [41]Beepul Bharti, Paul Yi, and Jeremias Sulam. Estimating and controlling for equalized odds via sensitive attribute predictors. Advances in neural information processing systems, 36:37173–37192, 2023.pubmed.ncbi.nlm.nih.gov/38867889
  42. [42]Beepul Bharti, Mary Versa Clemens-Sewall, Paul H Yi, and Jeremias Sulam. Multicaccuracy and multicalibration via proxy groups. arXiv preprint arXiv:2503.02870, 2025.arxiv.org/abs/2503.02870
  43. [43]Andrew Cotter, Heinrich Jiang, Maya Gupta, Serena Wang, Taman Narayan, Seungil You, and Karthik Sridharan. Optimization with non-differentiable constraints with applications to fairness, recall, churn, and other goals. Journal of Machine Learning Research, 20(172):1–59, 2019.arxiv.org/abs/1809.04198
  44. [44]Peter Súkeník and Christoph Lampert. Generalization in multi-objective machine learning. Neural Computing and Applications, 37(30):24669–24683, 2025.arxiv.org/abs/2208.13499
  45. [45]Tobias Wegel, Geelon So, Junhyung Park, and Fanny Yang. On the sample complexity of semi-supervised multi-objective learning. Advances in Neural Information Processing Systems, 38:128421–128476, 2026.
  46. [46]Hal R. Varian. Two problems in the theory of fairness. Journal of Public Economics, 5(3-4):249–260, None 1976.
  47. [47]Charles Elkan. The foundations of cost-sensitive learning. In International joint conference on artificial intelligence, volume 17, pages 973–978. Lawrence Erlbaum Associates Ltd, 2001.
  48. [48]Clayton Scott, Gilles Blanchard, and Gregory Handy. Classification with asymmetric label noise: Consistency and maximal denoising. In Conference on learning theory, pages 489–511. PMLR, 2013.arxiv.org/abs/1303.1208
  49. [49]Felix Petersen, Debarghya Mukherjee, Yuekai Sun, and Mikhail Yurochkin. Post-processing for individual fairness. Advances in Neural Information Processing Systems, 34, 2021.arxiv.org/abs/2110.13796

Paper details

vlnc:W_95f5y5dt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 4

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents