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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for generating sum

Quantum modularity proved for SU(2) TQFT signature on genus 2 surfaces.

problem Proving quantum modularity of SU(2) TQFT signature for genus 2 surfaces.
method Using quantum modularity of generalized Dedekind sums associated with modular forms and trigonometric sum expressions.
result Quantum modularity of SU(2) TQFT signature on genus 2 surfaces proved.

We propose a generalization of the classical notions of plumbing and Murasugi summing operations to smooth manifolds of arbitrary dimensions, so that in this general context Gabai's credo "the Murasugi sum is a natural geometric operation" holds. In particular, we prove that the sum of the pages of two open books is ag…

2014-12-06abs ↗pdf ↗

Can the Minkowski sum of two compact convex bodies be made smoother by rotating one of them? We construct two infinitely differentiable strictly convex plane bodies such that after any generic rotation (in the Baire category sense) of one of the summands the Minkowski sum is not five times differentiable. On the other …

2016-07-10abs ↗pdf ↗

Classical Dedekind sums are connected to the modular group through the construction of a (Dedekind) symbol on the cusp set of the modular group. In this paper we study generalizations of Dedekind symbols and sums that can be associated to certain Fuchsian groups uniformizing 1-punctured tori.

2004-09-20abs ↗pdf ↗

Summing over 3-manifolds using TQFT partition functions.

problem Summing over all 3-manifolds with fixed boundary.
method Rewriting the sum over 3-manifolds as a sum over homology groups, using TQFT partition functions and topological boundary conditions.
result Existence of a distribution of 2d TQFTs whose ensemble average equals the sum over 3-manifolds.

Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.

problem Understanding dynamics of zero-sum games with hidden structure.
method Gradient Descent Ascent applied to hidden zero-sum games with specific convex-concave structure.
result Gradient Descent Ascent converges to von-Neumann solution in strictly convex-concave hidden games.

New methods optimize sums of bivariate functions on finite domains.

problem Optimizing functions with multiple arguments that are sums of bivariate functions.
method Measure-valued extensions, 2\ell^2-approximation, entropy-regularization, linear programming, coordinate ascent.
result Tractable problem formulations solvable with various methods.

We consider the question, asked by Friedl, Livingston and Zentner, of which sums of torus knots are concordant to alternating knots. After a brief analysis of the problem in its full generality, we focus on sums of two torus knots. We describe some effective obstructions based on Heegaard Floer homology.

2017-12-14abs ↗pdf ↗

ELBO converges to a sum of entropies for many generative models.

problem Understanding the convergence of variational lower bounds in unsupervised learning.
method Analyzing the ELBO for a broad class of generative models, showing it equals a sum of entropies.
result The ELBO is equal to a sum of entropies at stationary points for many generative models.

Proves a formula for a special invariant of 4-manifolds.

problem Calculating the Bauer-Furuta invariant for connected sums of 4-manifolds.
method Uses a finite dimensional approximation of the Seiberg-Witten monopole map to derive a formula for the families Bauer-Furuta invariant of a fibrewise connected sum.
result Derives a general connected sum formula for the families Bauer-Furuta invariant.

The study allows for connected sums in manifolds with positive intermediate Ricci curvature.

problem Performing connected sums in manifolds with positive intermediate Ricci curvature.
method Introducing and utilizing kk-core metrics to show the possibility of connected sums.
result Connected sums are possible under certain conditions involving kk-core metrics.

We study Legendrian singular links up to contact isotopy. Using a special property of the singular points, we define the singular connected sum of Legendrian singular links. This concept is a generalization of the connected sum and can be interpreted as a tangle replacement, which provides a way to classify Legendrian …

2015-03-03abs ↗pdf ↗

High dimensional superposition models characterize observations using parameters which can be written as a sum of multiple component parameters, each with its own structure, e.g., sum of low rank and sparse matrices, sum of sparse and rotated sparse vectors, etc. In this paper, we consider general superposition models …

2017-05-30abs ↗pdf ↗

M-theory on compact eight-manifolds with Spin(7)\mathrm{Spin}(7)-holonomy is a framework for geometric engineering of 3d N=1\mathcal{N}=1 gauge theories coupled to gravity. We propose a new construction of such Spin(7)\mathrm{Spin}(7)-manifolds, based on a generalized connected sum, where the building blocks are a Calabi-Yau four…

2018-03-28abs ↗pdf ↗

Unified framework for stability and generalization of Push-Sum in decentralized learning over directed graphs.

problem Understanding stability and generalization of Push-Sum in decentralized learning over directed networks.
method Developed a unified uniform-stability framework for SGP algorithm, incorporating imbalance-aware consistency bounds.
result Established finite-iteration stability and optimization guarantees for convex and non-convex objectives.

Estimation is the computational task of recovering a hidden parameter xx associated with a distribution DxD_x, given a measurement yy sampled from the distribution. High dimensional estimation problems arise naturally in statistics, machine learning, and complexity theory. Many high dimensional estimation problems ca…

2018-07-30abs ↗pdf ↗

New method for sequential probability assignment reduces regret using contextual Shtarkov sums.

problem Minimizing regret in sequential probability assignment with arbitrary hypothesis classes.
method Introducing contextual Shtarkov sum and contextual Normalized Maximum Likelihood (cNML) algorithm.
result The contextual Shtarkov sum characterizes minimax regret and provides a minimax optimal strategy.

Let A=(aij)n×nA=(a_{ij})_{n\times n} be an invertible matrix and A1=(aij)n×nA^{-1}=(a^{ij})_{n\times n} be the inverse of AA. In this paper, we consider the generalized Liouville system: \label{abeq1} Δ_g u_i+\sum_{j=1}^n a_{ij}ρ_j(\frac{h_j e^{u_j}}{\int h_j e^{u_j}}-1)=0\quad\text{in \,}M, where 0<hjC1(M)0< h_j\in C^1(M) and $ρ_j\in \mathb…

2010-09-01abs ↗pdf ↗

In this paper we determine the integral homology and cohomology groups of a closed 4-manifold X obtained as the generalized fibre sum of two closed 4-manifolds M and N along embedded surfaces of genus g and self-intersection zero. If the homologies of the 4-manifolds are torsion free and the surfaces represent indivisi…

2009-07-15abs ↗pdf ↗

This paper tackles learning Stackelberg equilibrium in asymmetric games efficiently from noisy samples.

problem Learning Stackelberg equilibrium in asymmetric, general-sum games efficiently from noisy samples.
method The paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in bandit feedback setting.
result Sharp positive results on sample-efficient learning of Stackelberg equilibrium with value optimal up to a fundamental gap identified.

Sharp concentration results for sums of heavy-tailed random variables.

problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.

Let M denote the total space of a Lefschetz fibration, obtained by blowing up a Lefschetz pencil on an algebraic surface. We consider the n-fold fibre sum M(n), generalizing the construction of the elliptic surfaces E(n). For a Lefschetz pencil on a simply-connected minimal surface of general type we partially calculat…

2012-09-12abs ↗pdf ↗

We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered. Since a positive L-space knot is tight fibered, a non-trivial band sum never yie…

2015-09-01abs ↗pdf ↗

Solves Demailly's system for direct sums of ample line bundles on Riemann surfaces.

problem Proving the existence of smooth solutions for Demailly's system.
method Used Demailly's system and Leray-Schauder degree theory to reduce the problem.
result Proved existence of smooth solutions for direct sums of ample line bundles.

Sharp bounds for Dirichlet sums lead to improved Bayesian algorithm analysis.

problem Improving Bayesian algorithm performance through precise deviation bounds.
method Novel integral representation of Dirichlet sum density, Gaussian approximation, complex analysis.
result Significantly sharpened regret bounds for Multinomial Thompson Sampling.

In this paper we will show that the generalized connected sum construction for constant scalar curvature metrics can be extended to the zero scalar curvature case. In particular we want to construct solutions to the Yamabe equation on the generalized connected sum M = M_1 (\sharp_K) M_2 of two compact Riemannian manifo…

2006-11-25abs ↗pdf ↗

Proposes a new training algorithm for zero-sum games to avoid convergence issues.

problem Gradient-based training leads to weak convergence and cyclic dynamics in zero-sum architectures.
method Follow the perturbed leader algorithm with neural mediating agent.
result Guarantees convergence to mixed Nash equilibrium without cyclic behaviors.