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

3571106141 · May 202619922001200920172026
48 results for Folk Theorem

Study explores algorithmic collusion in repeated games using various learning dynamics.

problem Understanding algorithmic collusion in repeated games with different learning dynamics.
method Examines QQ-learning, gradient learning, and other dynamics in a general repeated game setting.
result Characterizes the set of payoff vectors achievable by these dynamics, revealing possibilities for collusion.

New evidence refutes old conjectures about knot homology ranks, suggesting new congruences.

problem Determining the rank of knot homology theories modulo 4 for ribbon knots.
method Proved homomorphism of knot concordance group, checked conjectures for 2.4 million knots.
result Revised conjectures about knot homology ranks modulo 4 for ribbon knots hold true.

In this paper we give a characterization of 2-dimensional topological field theories over a space XX as Frobenius bundles with connections over LXLX, the free loop space of XX. This is a generalization of the folk theorem stating that 2-dimensional topological field theories (over a point) are described by finite-dim…

2010-08-29abs ↗pdf ↗

A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution stru…

2010-12-28abs ↗pdf ↗

We evaluate the folk wisdom that algorithmic decision rules trained on data produced by biased human decision-makers necessarily reflect this bias. We consider a setting where training labels are only generated if a biased decision-maker takes a particular action, and so "biased" training data arise due to discriminato…

2019-09-18abs ↗pdf ↗

We consider fundamental questions of arbitrage pricing arising when the uncertainty model is given by a set of possible mutually singular probability measures. With a single probability model, essential equivalence between the absence of arbitrage and the existence of an equivalent martingale measure is a folk theorem,…

2012-02-29abs ↗pdf ↗

The full causal ladder of spacetimes is constructed, and their updated main properties are developed. Old concepts and alternative definitions of each level of the ladder are revisited, with emphasis in minimum hypotheses. The implications of the recently solved ``folk questions on smoothability'', and alternative prop…

2006-09-26abs ↗pdf ↗

A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type was established by the authors in the context of manifolds with corners; the canonical construction induces fibrations on the boundary faces of the resolution…

2010-12-28abs ↗pdf ↗

The `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution tower' which projects …

2009-07-20abs ↗pdf ↗

The folk result in Kyle-Back models states that the value function of the insider remains unchanged when her admissible strategies are restricted to absolutely continuous ones. In this paper we show that, for a large class of pricing rules used in current literature, the value function of the insider can be finite when…

2018-12-18abs ↗pdf ↗

We characterize those spacetimes which admit a isometric (or conformal) embedding in some Lorentz-Minkowski space L^N. In particular, any globally hyperbolic spacetime can be isometrically embedded in L^N. This is proven by a result of its own interest: the construction of a smooth time function whose gradient is bound…

2008-12-23abs ↗pdf ↗

The conjugacy class of a generic unimodular 2 by 2 complex matrix is determined by its trace, which may be an arbitrary complex number. In the nineteenth century, it was known that a generic pair (X,Y) of such pairs is determined up to conjugacy by the triple of traces (tr(X),tr(Y),tr(XY), which may be an arbitary elem…

2009-01-11abs ↗pdf ↗

It is a folk conjecture that for alpha > 1/2 there is no alpha-Hoelder surface in the subRiemannian Heisenberg group. Namely, it is expected that there is no embedding from an open subset of R^2 into the Heisenberg group that is Hoelder continuous of order strictly greater than 1/2. The Heisenberg group here is equippe…

2012-05-01abs ↗pdf ↗

We prove that each overtwisted contact structure has knot types that are represented by infinitely many distinct transverse knots all with the same self-linking number. In some cases, we can even classify all such knots. We also show similar results for Legendrian knots and prove a "folk" result concerning loose transv…

2010-12-16abs ↗pdf ↗

Local Bayesian optimization shows strong performance and converges well, contrary to folklore.

problem Understanding the behavior and convergence of local Bayesian optimization methods.
method Studied the behavior of local optimization strategies and rigorously analyzed a specific algorithm.
result Local Bayesian optimization algorithms converge well and perform strongly, contrary to the folklore.

New findings suggest non-contrastive learning has many bad minima, not just collapsed ones.

problem The effectiveness of non-contrastive learning in unsupervised feature learning.
method Theoretical analysis and controlled experiments on simple data models.
result Non-contrastive losses have a preponderance of non-collapsed bad minima, and these minima are not avoided during training.

Signed compression progress on a sealed audit is goodhart-resistant.

problem Intrinsic motivation for agents to improve their world models by compressing experience.
method Rewarding agents for the signed decrease of a fixed sealed-audit loss.
result Cumulative reward telescopes exactly to endpoint audit improvement, preventing infinite reward push while true audit performance stagnates.

Music SketchNet generates missing measures in incomplete music pieces, guided by user input.

problem Generating missing measures in incomplete monophonic musical pieces.
method Introducing SketchVAE for factorized representation of rhythm and pitch, and two discriminative architectures for guided music completion.
result Our approach outperforms state-of-the-art models in both objective and subjective evaluations.

FMM fails to accurately determine the number of components even with consistent posterior.

problem Determining the number of subpopulations in a data set using FMM.
method Analysis of FMM component-count posterior under model misspecification.
result FMM component-count posterior diverges under model misspecification, contrary to intuition.

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix MRd×dM \in \mathbb{R}^{d \times d}, an algorithm is allowed to make TT \emph{exact} queries of the form w(i)=Mv(i)w^{(i)} = Mv^{(i)} for i{1,,T}i \in \{1,\dots,T\}, where v(i)v^{(i)}

2017-04-14abs ↗pdf ↗

Stochastic Gradient Descent shows directional bias with moderate learning rates, impacting optimization outcomes.

problem Understanding the bias of SGD with moderate learning rates in practical scenarios.
method Analyzing SGD and GD on an overparameterized linear regression problem.
result SGD converges along large eigenvalue directions, GD along small ones, affecting early stopping outcomes.

Researchers use LLMs to judge other LLMs, but this study provides a new geometric perspective to understand when it works.

problem The challenge of evaluating LLMs using other LLMs as judges, considering both aleatoric and epistemic uncertainties.
method A geometric perspective on ranking LLM candidates using probability simplices, analyzing conditions for identifiable rankings and designing Bayesian priors.
result Geometric analysis reveals that rankings based on LLM judges are robust in many but not all datasets, emphasizing the importance of modeling epistemic uncertainty.

The paper proves three circles theorems and Liouville type theorems for subharmonic and holomorphic functions.

problem Establishing theorems for subharmonic and holomorphic functions on specific geometric structures.
method Using subharmonic and holomorphic functions on Riemannian manifolds and gradient shrinking Ricci solitons.
result Proves Liouville type theorems as applications of the established theorems.

Paper generalizes complex Brunn-Minkowski theory and proves new extension theorems.

problem Complex Brunn-Minkowski theory and extension theorems.
method Hilbert bundle approach to complex Brunn-Minkowski theory.
result Generalizes Guan's sharp strong openness theorem and sharp Ohsawa-Takegoshi extension theorem.

Formulates Index III lemma and Rauch III theorem with applications.

problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.

In LM, we proved a family version of the famous Witten rigidity theorems and several family vanishing theorems for elliptic genera. In this paper, we gerenalize our theorems LM in two directions. First we establish a family rigidity theorem for the Dirac operator on loop space twisted by general positive energy loop gr…

1999-11-05abs ↗pdf ↗

The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.

problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.

INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.

problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.