Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for group parity

This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.

problem Ensuring fair Bayes-optimal classifiers under predictive parity, especially when group performance levels vary widely.
method Proving the limitations of fair Bayes-optimal classifiers under predictive parity and proposing a new adaptive thresholding algorithm, FairBayes-DPP.
result Fair Bayes-optimal classifiers under predictive parity may not hold if group performance levels vary widely, leading to within-group unfairness.

In \cite {FrKn,Sbornik} it was shown that in some knot theories the crucial role is played by {\em parity}, i.e.\ a function on crossings valued in {0,1}\{0,1\} and behaving nicely with respect to Reidemeister moves. Any parity allows one to construct functorial mappings from knots to knots, to refine many invariants and …

2011-02-24abs ↗pdf ↗

We mathematically compare four competing definitions of group-level nondiscrimination: demographic parity, equalized odds, predictive parity, and calibration. Using the theoretical framework of Friedler et al., we study the properties of each definition under various worldviews, which are assumptions about how, if at a…

2018-08-26abs ↗pdf ↗

New method controls bias in training data for fair outcomes.

problem Ensuring equal treatment between different groups in machine learning.
method Contrastive information estimation to control mutual information between representations and protected attributes.
result Our method provides strong theoretical guarantees on the parity of any downstream algorithm.

New framework tackles fairness in link prediction beyond demographic parity.

problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.

The adoption of automated, data-driven decision making in an ever expanding range of applications has raised concerns about its potential unfairness towards certain social groups. In this context, a number of recent studies have focused on defining, detecting, and removing unfairness from data-driven decision systems. …

2017-06-30abs ↗pdf ↗

A non-trivial predictor satisfies demographic parity and equalizes group risks in regression.

problem Achieving fairness in regression models while maintaining equal risks across groups.
method Provided an explicit example of a non-constant predictor satisfying Demographic Parity and Equal Group-Wise Risks.
result First explicit construction of a non-constant predictor satisfying both fairness notions.

Following related work in law and policy, two notions of disparity have come to shape the study of fairness in algorithmic decision-making. Algorithms exhibit treatment disparity if they formally treat members of protected subgroups differently; algorithms exhibit impact disparity when outcomes differ across subgroups,…

2017-11-19abs ↗pdf ↗

In \cite{Manturov} the second author defined the kk-free braid group with nn strands GnkG_{n}^{k}. These groups appear naturally as groups describing dynamical systems of nn particles in some "general position". Moreover, in \cite{ManturovNikonov} the second author and I.M.Nikonov showed that GnkG_{n}^{k} is closely r…

2016-06-11abs ↗pdf ↗

We relax demographic parity in regression by enforcing parity at quantile levels and score thresholds.

problem Enforcing full distributional fairness in regression can lead to substantial accuracy loss.
method Introduce (\ell, Z)-fair predictor, derive closed-form solutions, and develop post-processing algorithm.
result The risk gap to the continuous optimum vanishes as the grid is refined, and we enable targeted fairness corrections.

Given a finitely presented group G and an epimorphism G to the group of integers Cochran and Harvey defined a sequence of integral invariants, which can be viewed as the degrees of higher--order Alexander polynomials. Cochran and Harvey showed that (up to a minor modification) this is a never decreasing sequence of num…

2005-10-21abs ↗pdf ↗

In~\cite{Ma} Manturov studied groups GnkG_{n}^{k} for fixed integers nn and kk such that k<nk<n. In particular, Gn2G_{n}^{2} is isomorphic to the group of free braids of nn-stands. In~\cite{KiMa} Manturov and the author studied an invariant valued in free groups not only for free braids but also for free tangles, which…

2016-04-30abs ↗pdf ↗

We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads to a possibility of constructing new invariants and proving minimality and non-t…

2009-12-29abs ↗pdf ↗

The study analyzes the conflict between group fairness and individual fairness in machine learning.

problem The conflict between group fairness (optimal statistical parity) and individual fairness in machine learning.
method Established sufficient conditions for the compatibility between optimal statistical parity and individual fairness requirements.
result Identified regions along the Pareto frontier that satisfy individual fairness requirements.

Extends Demographic Parity for fairer wage predictions with expert knowledge.

problem Inadequate fairness metrics limit user domain knowledge and ignore intersectional fairness.
method Develops a parametric method to incorporate expert knowledge in fair predictions.
result Offers a robust solution for real-life applications with limited data and spending constraints.

In the present paper, we introduce Z2\mathbb{Z}_2-braids and, more generally, GG-braids for an arbitrary group GG. They form a natural group-theoretic counterpart of GG-knots, see \cite{reidmoves}. The underlying idea, used in the construction of these objects --- decoration of crossings with some additional informa…

2015-07-09abs ↗pdf ↗

We find the optimal error for a constrained regression model under a linear model.

problem Minimizing error while adhering to demographic parity constraints.
method Proposed a minimax optimal error analysis for a demographic parity-constrained regression problem within a linear model.
result The minimax optimal error is characterized by $Θ( rac{dM}{n})$.

Study of origamis in minimal stratum with single cylinders, calculating spin parities and monodromy groups.

problem Understanding the structure and properties of origamis in the minimal stratum of moduli space.
method Construction and analysis of minimal [1,1][1,1]-origamis, calculation of spin parities, and investigation of monodromy groups.
result All minimal [1,1][1,1]-origamis have monodromy groups that are almost always finite simple groups.

The study of fairness in intelligent decision systems has mostly ignored long-term influence on the underlying population. Yet fairness considerations (e.g. affirmative action) have often the implicit goal of achieving balance among groups within the population. The most basic notion of balance is eventual equality bet…

2018-12-07abs ↗pdf ↗

The paper explores the tradeoff between fairness and accuracy in regression models.

problem Characterizing the tradeoff between fairness and accuracy in regression models.
method Provided a lower bound on the error of any fair regressor and extended the result to joint error using Wasserstein distance.
result Lower bounds on the error of fair regressors and their connection to Wasserstein distance.

The paper introduces return parity for fairness in MDPs, addressing delayed and adverse effects.

problem Fairness in MDPs for dynamic domains with delayed and adverse effects.
method Proposes return parity, decomposes return disparity, and develops algorithms for state visitation distributional alignment.
result The proposed algorithms can successfully close the disparity gap while maintaining policy performance.

We introduce the 2-colour parity. It is a theory of parity for a large class of virtual links, defined using the interaction between orientations of the link components and a certain type of colouring. The 2-colour parity is an extension of the Gaussian parity, to which it reduces on virtual knots. We show that the 2-c…

2019-01-22abs ↗pdf ↗

In the present paper, we develop the parity theory invented in \cite{ManSb}; we construct new parities for two-component (virtual and free) links. New parities significantly depend on geometrical properties of diagrams; in particular, they are mutation-sensitive. New parities can be used practically in all problems, wh…

2015-08-23abs ↗pdf ↗

The paper explores the tradeoffs between fairness measures in machine learning.

problem The challenge of achieving all three fairness notions simultaneously in machine learning models.
method The approach uses partial information decomposition (PID) to analyze the relationships between fairness measures.
result Identifies the regions where fairness measures overlap and disagree, revealing potential tradeoffs.

Real-world applications of machine learning tools in high-stakes domains are often regulated to be fair, in the sense that the predicted target should satisfy some quantitative notion of parity with respect to a protected attribute. However, the exact tradeoff between fairness and accuracy is not entirely clear, even f…

2019-06-19abs ↗pdf ↗

In the present paper, we construct an invariant for virtual knots in the thickened sphere with g handles; this invariant is a Laurent polynomial in 2g+3 variables. To this end, we use a modification of the Wirtinger presentation of the knot group and the concept of parity introduced by V.O.Manturov. The section 4 of th…

2013-05-09abs ↗pdf ↗

There are eight possible Pin groups that can be used to describe the transformation behaviour of fermions under parity and time reversal. We show that only two of these are compatible with general relativity, in the sense that the configuration space of fermions coupled to gravity transforms appropriately under the spa…

2017-09-08abs ↗pdf ↗

We construct a gerbe over a complex reductive Lie group G attached to an invariant bilinear form on a maximal diagonalizable subalgebra which is Weyl group invariant and satisfies a parity condition. By restriction to a maximal compact subgroup K, one then gets a gerbe over K. For a simply-connected group, the parity c…

2000-02-19abs ↗pdf ↗

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we find all Parity Biquandles arising from the Alexander Biquandle and Quaternionic …

2011-03-15abs ↗pdf ↗

Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.

problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.

The spectral eta-invariant of a self-adjoint elliptic differential operator on a closed manifold is rigid, provided that the parity of the order is opposite to the parity of dimension of the manifold. The paper deals with the calculation of the fractional part of the eta-invariant in this case. The method used to obtai…

1999-07-08abs ↗pdf ↗

Functorial maps and weak parities are equivalent descriptions of rules of substitution virtual crossings for classical in diagrams of a knot in a way compatible with Reidemeister moves. We introduce the notion of maximal weak parity and describe it for knots in a given closed oriented surface. This weak parity defines …

2012-11-02abs ↗pdf ↗

Paper solves k-sparse parity problem with sign SGD, matching SQ lower bound.

problem Solving k-sparse parity problems efficiently.
method Sign stochastic gradient descent on neural networks.
result Matches Statistical Query lower bound for solving k-sparse parity problems.