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,695 papers · 148 categories

Trend · papers per month

1122 · Apr 201619922001200920172026
48 results for prejudice freeness

New welfare-based fairness notions align with existing error rate balance and predictive parity.

problem Aligning fairness notions with welfare-based criteria.
method Discussing and establishing conditions for envy freeness and prejudice freeness.
result Envy freeness and prejudice freeness are equivalent to error rate balance and predictive parity.

This work proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

problem Proving the asymptotic freeness of layerwise Jacobians in multilayer perceptrons (MLPs).
method Replacing each layer's parameter matrix with itself multiplied by a Haar orthogonal matrix, and using the invariance of the MLP.
result Proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

Proposes auditing for envy-freeness in recommender systems to assess individual preferences.

problem Auditing fairness in recommender systems for individual preferences.
method Formulates a pure exploration problem in multi-armed bandits, proposing a sample-efficient algorithm with theoretical guarantees.
result Algorithm ensures fairness without deteriorating user experience on real-world datasets.

Random representations of surface groups approach asymptotic freeness in large nn limit.

problem Asymptotic freeness of Haar unitary matrices for surface groups.
method Interplay between Dehn's work and classical invariant theory.
result Expected value of trace of a fixed non-identity element is bounded as non o\infty.

New proof links initial class bias to DNN trainability, challenging traditional understanding.

problem Understanding the initial class bias in DNNs and its impact on trainability.
method Theoretical proof linking initial class bias to mean field theories of DNNs.
result Efficient learning is connected to a network's prejudice towards a specific class, contradicting traditional understanding.

The action of a Lie pseudogroup GG on a smooth manifold MM induces a prolonged pseudogroup action on the jet spaces JnJ^n of submanifolds of MM. We prove in this paper that both the local and global freeness of the action of GG on JnJ^n persist under prolongation in the jet order nn. Our results underlie the const…

2009-12-22abs ↗pdf ↗

Article explores non-freeness of groups generated by two specific matrices, providing counterexamples and sequences.

problem Tackles the non-freeness of groups generated by two parabolic matrices with rational parameters.
method Uses the orbit test and modulo homomorphisms to provide sufficient conditions and counterexamples.
result Constructs explicit counterexamples and sequences converging to 3, demonstrating non-freeness.

In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the gen…

2018-09-23abs ↗pdf ↗

Study of affine transformations on topological manifolds, focusing on local freeness and solvability.

problem Understanding the action of affine transformations on topological manifolds.
method Analyzing the subgroup of homeomorphisms that lift to affine transformations and studying the resulting foliation.
result The connected component of the subgroup acts locally freely and is solvable, with additional properties for polynomial manifolds.

Paper proposes a method to identify and treat latent discriminating features in machine learning models.

problem Fairness issues in machine learning models trained on historical data containing sensitive attributes.
method A novel algorithm that identifies and treats latent discriminating features, agnostic of the learning algorithm.
result Experimental results show near-ideal fairness measurement compared to other methods.

The paper studies fundamental groups of orbit configuration spaces and proves their torsion-freeness.

problem Understanding fundamental groups of orbit configuration spaces for discrete group actions.
method Introducing k-almost-quasifibrations and proving properties of their fundamental groups.
result The fundamental group of the orbit configuration space is torsion-free and has a specific structure.

Method trains a debiased model from a biased one by focusing on samples that contradict the bias.

problem Training neural networks can lead to biased predictions due to spurious correlations.
method Train a pair of neural networks, intentionally biasing one and debiasing the other by focusing on contradictory samples.
result Our method significantly improves training against various types of biases, sometimes outperforming explicit supervision methods.

Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…

2016-10-25abs ↗pdf ↗

In this article we propose a generalisation of the recent work of Gatheral and Jacquier on explicit arbitrage-free parameterisations of implied volatility surfaces. We also discuss extensively the notion of arbitrage freeness and Roger Lee's moment formula using the recent analysis by Roper. We further exhibit an arbit…

2012-10-26abs ↗pdf ↗

A new method to derive presentations of skein modules is developed. For the case of homotopy skein modules it will be shown how the topology of a 3-manifold is reflected in the structure of the module. The freeness problem for q-homotopy skein modules is solved, and a natural skein module related to linking numbers is …

2000-07-06abs ↗pdf ↗

An embedding of a graph into R3\mathbb{R}^3 is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding ff of a graph GG into R3\mathbb{R}^3 is free, if π1(R3f(G))π_1(\mathbb{R}^3-f(G)) is a free group. It was known that for any complete graph its linear embedding is always free.…

2014-09-24abs ↗pdf ↗

New method improves bounds on hyperbolic 3-manifold volumes and homology dimensions.

problem Bounding the volume and homology dimensions of hyperbolic 3-manifolds.
method New method for obtaining lower bounds on the volume of hyperbolic 3-manifolds with specific fundamental groups.
result Improved bounds on homology dimensions and volumes of hyperbolic 3-manifolds.

We prove a freeness theorem for low-rank subgroups of one-relator groups. Let FF be a free group, and let wFw\in F be a non-primitive element. The primitivity rank of ww, π(w)π(w), is the smallest rank of a subgroup of FF containing ww as an imprimitive element. Then any subgroup of the one-relator group $G=F/\langle…

2018-03-07abs ↗pdf ↗

Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult estimation problems along the path of learning. We develop algorithms for contextual …

2018-12-15abs ↗pdf ↗

We prove a theorem relating the automorphism group of a Cartan geometry to the group on which the geometry is modeled: a component of the adjoint representation of the first embeds in the adjoint representation of the second. Consequences of the theorem include general bounds on the rank and nilpotence degree of an aut…

2007-09-24abs ↗pdf ↗

We compute the equivariant KK-homology of the classifying space for proper actions, for compact 3-dimensional hyperbolic reflection groups. This coincides with the topological KK-theory of the reduced CC^\ast-algebra associated to the group, via the Baum-Connes conjecture. We show that, for any such reflection group…

2017-07-17abs ↗pdf ↗

Algorithmic fairness is a field of study that addresses the systematic disadvantage of marginalized groups in machine learning systems.

problem Modern machine learning systems increasingly determine access to economic and social opportunities, leading to structural inequalities and prejudices.
method Statistical and structural approaches to algorithmic fairness.
result The field of algorithmic fairness emerged to address the systematic disadvantage of marginalized groups in machine learning systems.

Examines predictability and complexity of economic time series using symbolic dynamics and entropy.

problem Understanding the predictability and complexity of economic time series.
method Symbolic dynamics and Information theory (entropy and uncertainty).
result Economic time series are complex and can be expressed in terms of information production.

BGG-sequences offer a uniform construction for invariant differential operators for a large class of geometric structures called parabolic geometries. For locally flat geometries, the resulting sequences are complexes, but in general the compositions of the operators in such a sequence are nonzero. In this paper, we sh…

2005-08-26abs ↗pdf ↗

Formal models of learning from teachers need to respect certain criteria to avoid collusion. The most commonly accepted notion of collusion-freeness was proposed by Goldman and Mathias (1996), and various teaching models obeying their criterion have been studied. For each model MM and each concept class C\mathcal{C},…

2019-03-10abs ↗pdf ↗

We consider the braid groups Bn(X)\mathbf{B}_n(X) on finite simplicial complexes XX, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between geometric decompositions for XX and their effects on braid groups, and provide an al…

2015-08-15abs ↗pdf ↗

We study notions of fairness in decision-making systems when individuals have diverse preferences over the possible outcomes of the decisions. Our starting point is the seminal work of Dwork et al. which introduced a notion of individual fairness (IF): given a task-specific similarity metric, every pair of individuals …

2019-04-03abs ↗pdf ↗

Let GG be a finite group. Noncommutative geometry of unital GG-algebras is studied. A geometric structure is determined by a spectral triple on the crossed product algebra associated with the group action. This structure is to be viewed as a representative of a noncommutative orbifold. Based on a study of classical o…

2015-04-18abs ↗pdf ↗