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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for Double Counting

New insights into neural network complexity reveal better generalization performance.

problem Mysterious generalization in deep models despite high parameter counts.
method Effective dimensionality as a measure of parameter space complexity.
result Double descent behavior in generalization as a function of parameters explained.

Inspired by results of Eskin and Mirzakhani counting closed geodesics of length L\le L in the moduli space of a fixed closed surface, we consider a similar question in the Out(Fr)Out(F_r) setting. The Eskin-Mirzakhani result can be equivalently stated in terms of counting the number of conjugacy classes (within the mapping…

2018-01-23abs ↗pdf ↗

New findings challenge the traditional U-shaped curve of model complexity and error, revealing a second descent in error as model size increases.

problem The traditional U-shaped curve of model complexity and prediction error is incomplete, with recent work suggesting a second descent in error as model size increases.
method Careful consideration of multiple complexity axes and a nonparametric statistics perspective were used to interpret the observed double descent curves.
result The observed double descent curves in classical statistical machine learning methods fold back into traditional convex shapes, resolving tensions with statistical intuition.

Develops a test for conditional local independence of counting processes.

problem Testing the hypothesis of conditional local independence among continuous time stochastic processes.
method Introduces a new functional parameter, the Local Covariance Measure (LCM), and proposes a test called (X)-LCT using nonparametric estimators and sample splitting or cross-fitting.
result The (X)-LCT test can be controlled uniformly with modest rates, and it works well without restrictive parametric assumptions.

Researchers found all embeddings of Kuratowski graphs on a double torus.

problem Characterizing embeddings of Kuratowski graphs K3,3K_{3,3} and K5K_5 on the double torus.
method Constructive approach using Burnside's Lemma and automorphism groups.
result 14 orientable and 17 non-orientable 2-cell embeddings of K5K_5 on the double torus.

Distance, normals, and double normals for real plane curves with singularities

problem Relation between normals and double normals and critical points of the squared distance function for real algebraic curves with singularities
method Investigate the topological discriminant of the distance function
result The topological discriminant consists of the evolute and distinguished normal lines at algebraic singular points

The study explores cohomological invariants and decomposes them into irreducible parts, focusing on zigzags.

problem Finding cohomological invariants and their decomposition into irreducible parts.
method Investigates various cohomological invariants on double complexes, focusing on the multiplicities of zigzags.
result The multiplicities of zigzags in double complexes are not sufficient to distinguish non-isomorphic double complexes.

The study of double coset growth in specific groups confirms a conjecture about generic 3-manifolds.

problem Understanding the growth of double cosets in specific groups.
method Generalizing previous work on hyperbolic groups, the study proves the growth of double cosets for certain subgroups.
result The double coset growth of certain subgroups is comparable to the orbital growth function.

Given a plane curve γ:S1R2γ: S^1\to \mathbb R^2, we consider the problem of determining the minimal number I(γ)I(γ) of inflections which curves $\mbox{diff}(γ)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms of R2\mathbb R^2. We show that if γγ is an immersed curve with D(γ)D(γ) double points and no othe…

2014-02-23abs ↗pdf ↗

Origami structures are enumerated and shown to be quantum modular.

problem Counting and understanding origami structures with real structures.
method Using combinatorics of zonal polynomials and Schur polynomials, and relating to quantum modular forms and double Hurwitz numbers.
result The generating functions of certain origami structures are quantum modular forms.

The coamoeba of any complex algebraic plane curve VV is its image in the real torus under the argument map. The area counted with multiplicity of the coamoeba of any algebraic curve in (C)2(\mathbb{C}^*)^2 is bounded in terms of the degree of the curve. We show in this Note that up to multiplication by a constant in $(\…

2008-05-19abs ↗pdf ↗

We exhibit new examples of double Kodaira fibrations by using finite Galois covers of a product Σb×ΣbΣ_b \times Σ_b, where ΣbΣ_b is a smooth projective curve of genus b2b \geq 2. Each cover is obtained by providing an explicit group epimorphism from the pure braid group P2(Σb)\mathsf{P}_2(Σ_b) to some finite Heisenberg group.…

2019-05-08abs ↗pdf ↗

Let ρn(V)ρ_n(V) be the number of complete hyperbolic manifolds of dimension n with volume less than VV. Burger, Gelander, Lubotzky, and Moses showed that when n>3 there exist a,b>0 depending on the dimension such that aV log(V) < log(ρ_n(V)) < bV log(V), for V >> 0. In this note, we use their methods to bound the number …

2006-01-23abs ↗pdf ↗

We propose a new algorithm for adversarial multi-armed bandits with unrestricted delays. The algorithm is based on a novel hybrid regularizer applied in the Follow the Regularized Leader (FTRL) framework. It achieves O(kn+Dlog(k))\mathcal{O}(\sqrt{kn}+\sqrt{D\log(k)}) regret guarantee, where kk is the number of arms, nn is the …

2019-10-14abs ↗pdf ↗

The spectral properties of p-forms on the fundamental domains of regular tesselations of the d-dimensional sphere are discussed. The degeneracies for all ranks, p, are organised into a double Poincare series which is explicitly determined. In the particular case of coexact forms of rank (d-1)/2, for odd d, it is shown …

2006-01-13abs ↗pdf ↗

Elastic weight consolidation (EWC, Kirkpatrick et al, 2017) is a novel algorithm designed to safeguard against catastrophic forgetting in neural networks. EWC can be seen as an approximation to Laplace propagation (Eskin et al, 2004), and this view is consistent with the motivation given by Kirkpatrick et al (2017). In…

2017-12-11abs ↗pdf ↗

We construct a spectral sequence from the reduced odd Khovanov homology of a link converging to the framed instanton homology of the double cover branched over the link, with orientation reversed. Framed instanton homology counts certain instantons on the cylinder of a 3-manifold connect-summed with a 3-torus. En route…

2014-01-09abs ↗pdf ↗

We construct a simply connected minimal complex surface of general type with pg=0p_g=0 and K2=2K^2=2 which has an involution such that the minimal resolution of the quotient by the involution is a simply connected minimal complex surface of general type with pg=0p_g=0 and K2=1K^2=1. In order to construct the example, we combin…

2011-08-03abs ↗pdf ↗

The braid axis of a closed 3-braid lifts to a genus one fibered knot in the double cover of S^3 branched over the closed braid. Every (null homologous) genus one fibered knot in a 3-manifold may be obtained in this way. Using this perspective we answer a question of Morimoto about the number of genus one fibered knots …

2005-10-18abs ↗pdf ↗

A rational knot or link can be put into a standard alternating format which has horizontal and vertical twist sites (double helices). The number and type of these twist sites are determined by terms of next-to-highest zz-degree in Kauffman's regular isotopy invariant Λ(a,z)Λ(a,z). In particular, for a knot or link with $c…

2014-10-01abs ↗pdf ↗

New bounds found for vertices of hyperbolic polyhedra in dimensions 5 to 12.

problem Determining minimum number of ideal and finite vertices in hyperbolic polyhedra.
method Geometric method of orthogonal gluings combined with double counting and recurrence relations.
result Improved lower bounds for vertices in all dimensions up to 12.

Positive scalar curvature metrics on cobordisms yield only reducible Seiberg-Witten solutions.

problem Counting solutions to Seiberg-Witten equations on cobordisms.
method Constructing families of metrics with positive scalar curvature.
result Irreducible solutions are absent when positive scalar curvature metrics are used.

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.

problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.

Proposes a method to reconcile count time series forecasts.

problem No formal framework for probabilistic reconciliation of count time series.
method Generalizes Bayes' rule for reconciling real-valued and count variables.
result Improves forecast accuracy for count variables compared to Gaussian reconciliation.

Graph neural networks struggle with counting certain substructures in graphs.

problem Detecting and counting specific substructures in graphs.
method Study of graph neural networks' ability to count attributed graph substructures.
result Graph neural networks like MPNNs, 2-WL, and 2-IGNs have limitations in counting certain substructures.

The paper proposes count echo state networks for forecasting graduate student enrollments.

problem Forecasting graduate student enrollments from historical data.
method Developed hierarchical count echo state networks and compared them to Poisson autoregressions and negative binomial models.
result Hierarchical negative binomial based echo state network is the superior model.

Counted essential surfaces in a knot's exterior, finding a unique pattern.

problem Counting essential surfaces in a knot's exterior.
method Counted essential surfaces by genus, using Euler totient function. Showed normal surfaces are connected by counting their components. Used Agol, Hass, and Thurston's tools to convert component counting into orbit counting.
result Found a unique pattern in the number of essential surfaces by genus.

Counting objects in digital images is a process that should be replaced by machines. This tedious task is time consuming and prone to errors due to fatigue of human annotators. The goal is to have a system that takes as input an image and returns a count of the objects inside and justification for the prediction in the…

2017-03-25abs ↗pdf ↗

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.