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

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920182026
48 results for accumulation points

Minimal dilatations found on nonorientable surfaces with two accumulation points.

problem Determining minimal dilatations for nonorientable surfaces.
method Representing dilatations as roots of Alexander polynomials and comparing using skein relation.
result Sequence of minimal Penner dilatations has two accumulation points on nonorientable surfaces.

In this paper, finite type domains with hyperbolic orbit accumulation points are studied. We prove, in case of C2\mathbb{C}^2, it has to be a (global) pseudoconvex domain, after an assumption of boundary regularity. Moreover, one of the applications will realize the classification of domains within this class, precisel…

2013-04-30abs ↗pdf ↗

New method analyzes accumulation precision in deep learning networks.

problem Lack of precision analysis for accumulation in deep learning training.
method Statistical approach to analyze partial sum accumulations and derive equations for minimum required bits.
result Reduced accumulation precision can lead to loss of information and degraded network quality.

Infinite rank surface cluster algebras extend traditional concepts to surfaces with accumulation points.

problem Extending surface cluster algebras to infinite surfaces with accumulation points.
method Consider infinite mutation sequences and hyperbolic structures to define cluster variables as lambda lengths of arcs.
result Established transitivity of infinite mutation sequences on triangulations of infinite surfaces and provided expansion formulas for cluster variables.

In this paper we consider sparse approximation problems, that is, general l0l_0 minimization problems with the l0l_0-"norm" of a vector being a part of constraints or objective function. In particular, we first study the first-order optimality conditions for these problems. We then propose penalty decomposition (PD) me…

2012-05-10abs ↗pdf ↗

Paper excludes the lowest energy level as an accumulation point for harmonic maps into analytic manifolds.

problem Analytic manifolds and their harmonic maps energy spectrum.
method Exclusion of the lowest energy level as an accumulation point using obstructions to the gluing of harmonic spheres and Lojasiewicz-estimates.
result Proves that the lowest energy level is not an accumulation point for generic 3-manifolds.

The aim of the present article is to offer a strictly mathematical, statistical treatment of the current account balances in EU and in the Eurozone. Based on Eurostat data, an overview of the total and annual balances is first made for different collections among the EU countries. Then, using the Mathematica technical …

2013-02-19abs ↗pdf ↗

Optimal control trajectories have limited irregularities.

problem Regularity of time-optimal control trajectories in control-affine systems.
method Generic conditions on drift and controlled vector field are used to prove smoothness out of a countable set of times, up to K-th order iterated singularities.
result Control trajectories are smooth out of a countable set of times, with singularities limited to K-th order iterated.

The study improves bounds on pseudo-Anosov maps and certifies minimum and accumulation points of normalized dilatations.

problem Understanding the set of normalized dilatations of fully-punctured pseudo-Anosov maps.
method Improving bounds on the number of tetrahedra in veering triangulations and using computational means.
result Certified that the minimum element of the set of normalized dilatations is μ2μ^2 and the minimum accumulation point is μ4μ^4.

We show that for a C1C^1 residual subset of diffeomorphisms far away from tangency, every non-trivial chain recurrent class that is accumulated by sources ia a homoclinic class contains periodic points with index 1 and it's the Hausdorff limit of a family of sources.

2007-12-04abs ↗pdf ↗

We critically review recent claims that financial crashes can be predicted using the idea of log-periodic oscillations or by other methods inspired by the physics of critical phenomena. In particular, the October 1997 `correction' does not appear to be the accumulation point of a geometric series of local minima.

1998-04-09abs ↗pdf ↗

A new method for pricing derivatives using self-exciting dynamics and finite-difference transforms.

problem Pricing derivatives with accumulated marks using a self-exciting marked point process.
method Derive discounted pricing equation as a PIDE, transform to one-dimensional PIDEs, use Laplace/Fourier transform, approximate jump term, solve using finite difference scheme.
result Efficiently price derivatives with accumulated marks using a novel finite-difference and transform approach.

Training deep neural networks with 8-bit floating point numbers is now possible and more efficient.

problem Challenges in training DNNs with reduced precision, especially for gradient computations.
method Introduction of chunk-based accumulation and floating point stochastic rounding to reduce arithmetic precision to 16 bits.
result Successful training of DNNs using 8-bit floating point numbers, maintaining accuracy on various models and datasets.

The paper establishes criteria for spacetime inextendibility using asymptotic volume-distance-ratio analysis.

problem Determining inextendibility of spacetimes near singularities.
method Asymptotic analysis of volume-distance-ratio (VDR) to prove inextendibility criteria.
result Failure of VDR convergence to the Minkowski value implies inextendibility of spacetime.

The level curves of an analytic function germ almost always have bumps at unexpected points near the singularity. This profound discovery of N. A'Campo is fully explored in this paper for $f(z,w)\in \C\{z,w\}$, using the Newton-Puiseux infinitesimals and the notion of gradient canyon. Equally unexpected is the Dirac ph…

2012-06-04abs ↗pdf ↗

Study pseudo-Anosov monodromies' lengths in 3-manifolds' arc complex.

problem Investigate pseudo-Anosov monodromies' asymptotic translation lengths in 3-manifolds' arc complex.
method Define normalized asymptotic translation length functions μ_d and analyze their accumulation points.
result Sets of accumulation points of μ_d graphs are nice and depend only on the slice's shape.

Study finds bifurcation and local rigidity points for solutions to the Yamabe problem on Aloff-Wallach Spaces.

problem Yamabe problem on Aloff-Wallach Spaces
method Constructing 1-parameter families of solutions and examining changes in the Morse index as the parameter varies.
result Identifies bifurcation and local rigidity points for homogeneous solutions to the Yamabe problem.

The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points ac…

2013-09-29abs ↗pdf ↗

Financial investment returns lead to growing wealth inequality.

problem Recent rise in wealth inequality in active financial markets.
method Minimalist modelling strategy combining financial markets, wealth accumulation, and compound interest.
result Accumulated financial investment returns cause ever-increasing wealth concentration and inequality.

New data accumulation prevents model collapse in generative models.

problem Model collapse in generative models trained on their own outputs.
method Empirical study of language models, diffusion models, and variational autoencoders; analytically tractable framework for linear models.
result Accumulating synthetic data alongside real data avoids model collapse, preventing performance degradation.

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks

Study of historic stock returns distributions, highlighting asymmetry and outliers.

problem Understanding the asymmetry in accumulated gains and losses in stock returns over time.
method Analyzing decades-long historic distributions of S&P500 returns, comparing gains and losses, using statistical U-tests and fitting log-log scale linearly.
result The mean of de-trended distributions increases linearly with the number of days of accumulation, and the overall skew is negative, indicating heavier tails of losses.

We study local rigidity and multiplicity of constant scalar curvature metrics in arbitrary products of compact manifolds. Using (equivariant) bifurcation theory we determine the existence of infinitely many metrics that are accumulation points of pairwise non homothetic solutions of the Yamabe problem. Using local rigi…

2010-12-07abs ↗pdf ↗

Income redistribution boosts cooperation in spatial public goods games, but the effect depends on the model of redistribution.

problem The impact of income redistribution on cooperation in spatial public goods games.
method Two models of income redistribution were used: local and global. Spatial public goods games were employed to study the evolution of cooperation.
result The cooperation level is significantly higher with local redistribution of income, but lower with global redistribution.

Accumulator module improves reinforcement learning by delaying decisions based on evidence.

problem Incomplete information, limited sensing, and stochastic environments lead to risky decisions.
method Integrates evidence for each action, delays action until confident, using dynamic competition.
result Accumulator module outperforms traditional reinforcement learning methods in a guessing game.

Proves boundedness of log Fano cone singularities with bounded local volumes.

problem Understanding the boundedness of log Fano cone singularities.
method Analyzes K-semistable log Fano cone singularities with bounded volumes.
result The set of local volumes of klt singularities has zero as the only accumulation point.

We define a generalization of Coxeter graphs and an associated Coxeter system and Coxeter mapping class. These can be used to construct periodic Coxeter mapping classes on surfaces with arbitrarily large genus, preserving lots of symmetries. The periodic mapping classes can in turn be used to construct sequences of pse…

2011-10-05abs ↗pdf ↗

A new method for MARL with partial observations reduces communication overhead.

problem Inefficient MARL algorithms in large-scale problems due to state and action information sharing.
method Distributed zeroth-order policy optimization with local policy gradient estimation using consensus.
result The method converges to a policy that is a stationary point of the global objective function.

A new theory quantifies how societies accumulate and diversify their knowledge.

problem Lack of a unified quantitative formalism for understanding societal knowledge accumulation.
method Combines analytical, numerical, and empirical approaches to quantify and predict societal diversification.
result Measurable quantities to predict future societal developments.

Analyzes multi-day stock returns, showing linear volatility and mean dependence.

problem Linear dependence of volatility and mean in accumulated stock returns.
method Modified Jones-Faddy skew t-distribution analysis.
result Linear dependence of volatility and mean on the number of days of accumulation.

Our study shows that many firms would accumulate at zero output level (namely, Bankruptcy status) if a perfectly competitive market reaches full employment (namely, those people who should obtain employment have obtained employment). As a result, appearance of economic crisis is determined by two points; that is, (a). …

2010-10-22abs ↗pdf ↗

DANCE method improves large-scale learning efficiency via accumulating sample strategy.

problem Efficiently solving large-scale empirical risk minimization problems.
method Distributed Accumulated Newton Conjugate gradient (DANCE) method with multistage approach.
result The method achieves satisfactory statistical accuracy with fewer passes over data.

Study shows limits of volume-constrained sets are finite unions of Wulff shapes.

problem Analyzing the behavior of sets with degenerating ellipticity.
method Proving rigidity of L1L^1-accumulation points of volume-constrained almost-critical sets.
result Limits of volume-constrained sets are finite unions of φφ-Wulff shapes.