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.

169,051 papers · 148 categories

Trend · papers per month

1.2%2.4%3.6%4.8% · Sep 199619922001200920172026
48 results for Freeness Criteria

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 ↗

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.

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 ↗

Deep neural networks' Jacobian spectrum becomes well-conditioned with orthogonal weights.

problem Understanding and handling the Jacobian spectrum of deep neural networks.
method Applying free probability theory to show almost sure asymptotic freeness of Jacobians in the wide limit.
result Layer-wise Jacobians of deep neural networks with orthogonal weights are almost surely asymptotically free.

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.

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.

The paper explores curvatures on graphs and their implications for Ricci flatness.

problem Comparing and understanding different curvature notions on graphs and their implications for Ricci flatness.
method Analyzing Ollivier Ricci curvature and Bakry-Émery curvature on combinatorial graphs, investigating graph products, and proving curvature properties.
result Non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under specific conditions.

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 ↗

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 ↗

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 ↗

We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.

2015-04-05abs ↗pdf ↗

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

Improved recommendations using latent embeddings from user reviews.

problem Lack of consideration for latent embeddings in multi-criteria recommender systems.
method Utilized variational autoencoders to map user reviews into latent embeddings, which are then compressed into discrete vectors for multi-criteria recommendation.
result The proposed method significantly outperforms baselines across various datasets and evaluation measures.

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 ↗

New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.

problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.

Develops scenario theory for multi-criteria decision making.

problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.

We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …

2011-10-17abs ↗pdf ↗

The paper evaluates criteria for selecting cryptocurrencies based on historical data.

problem High risk of cryptocurrencies due to volatility.
method Characterized returns and risks using historical data in short time windows (7 and 15 days). Analyzed the importance of criteria using various methods.
result Importance of criteria for selecting cryptocurrencies is analyzed and evaluated.