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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Continuous Numbers

The study finds new infinite dilogarithm identities related to number sequences and continued fractions.

problem Finding new infinite dilogarithm identities.
method Demonstrating families of identities associated with specific number sequences and continued fractions.
result New infinite dilogarithm identities related to Fibonacci, Lucas numbers, convergents of even period continued fractions, and recurrence relations.

Develops correlation number for specific potentials and Hitchin representations.

problem Analyzing correlation numbers for potentials with entropy gaps and Hitchin representations.
method Defines a correlation number for pairs of cusped Hitchin representations and explores its connection to the Manhattan curve.
result Establishes a connection between the correlation number and the Manhattan curve, revealing rigidity properties.

We present a construction of complete self-dual Einstein metrics of negative scalar curvature on an uncountable family of manifolds of infinite topological type, which are enumerated by continued fraction expansions of irrational numbers. These manifolds may be regarded as limits of the resolutions of cyclic quotient s…

2005-08-30abs ↗pdf ↗

Topic models are probabilistic models for discovering topical themes in collections of documents. In real world applications, these models provide us with the means of organizing what would otherwise be unstructured collections. They can help us cluster a huge collection into different topics or find a subset of the co…

2013-02-28abs ↗pdf ↗

The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.

problem Learning the exact structure of continuous-action games with non-parametric utility functions.
method An 1\ell_1 regularized method that encourages sparsity of the Fourier transform coefficients of the utility functions, accessed via a few Nash equilibria and their noisy utilities.
result The method recovers the exact structure of the utility functions and the game structure with provable theoretical guarantees.

This paper explores how rational numbers on the Stern-Brocot diagram map to lines when terms are extended.

problem Understanding the geometry of rational numbers on the Stern-Brocot diagram.
method Analyzing continued fraction expansions and their geometric implications on the diagram.
result Vertices of the Stern-Brocot diagram corresponding to extended rational numbers lie on two Euclidean lines.

A graph's winding numbers around two non-adjacent vertices differ by ±1.

problem Understanding the winding numbers of a specific graph configuration in the plane.
method Analyzing continuous maps from a graph to the plane, focusing on the winding numbers of specific cycles.
result The difference in winding numbers of a cycle around two non-adjacent vertices is ±1.

Introduces injective category number for continuous maps, linking classical and contemporary research.

problem Understanding conditions for a continuous map to be injective.
method Defines injective category number and examines its behavior under various operations.
result Provides a cohomological lower bound and expressions for injective category numbers in specific cases.

The study calculates average crosscap numbers for 2-bridge knots.

problem Determining the average crosscap number of 2-bridge knots.
method Using continued fraction expansions and recursion, the study provides exact formulas for average crosscap numbers.
result The study shows that the limit of the average crosscap number of 2-bridge knots approaches zero as the crossing number increases.

xVal tokenizes numbers continuously for better scientific model training.

problem Lack of continuous numerical tokenization for scientific datasets in LLMs.
method xVal: Continuous numerical tokenization strategy.
result xVal outperforms other numerical tokenization methods on scientific datasets.

Study shows how to balance memory and learning efficiency in continual learning.

problem Balancing memory and learning efficiency in continual learning.
method Structural regularization with Hessian-based regularization.
result Structural regularization improves statistical performance at the cost of increased memory complexity.

New algorithm reduces regret in online learning for piecewise continuous functions.

problem Exponential loss in efficiency when moving from classical to adversarial learning.
method Introduces generalized bracketing numbers and Follow-the-Perturbed-Leader algorithm.
result Optimal scaling of optimization oracle calls with average regret.

PSRL extension for continuing environments reduces regret.

problem Formalizing and analyzing resampling approach for reinforcement learning.
method Continuing PSRL maintains a model of the environment and replaces it with samples from the posterior distribution.
result Established an ildeO(τSAT) ilde{O}(τS \sqrt{A T}) bound on Bayesian regret.

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an orbifold with another triangulation. This method is used to show that eventually p…

2018-09-25abs ↗pdf ↗

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

A new method for Gaussian Processes handles mixed continuous and categorical inputs.

problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.

A new method optimizes in nonstationary environments with many arms efficiently.

problem Optimizing in nonstationary environments with a large number of arms.
method Gaussian interpolation to learn continuous Lipschitz reward functions in nonstationary environments.
result Efficiently learns continuous Lipschitz reward functions with O(T)\mathcal{O}^*(\sqrt{T}) cumulative regret.

A Bayesian nonparametric approach for continual learning using neural networks.

problem Catastrophic forgetting in neural networks during sequential task settings.
method Indian Buffet Process (IBP) prior for dynamic model expansion and factorization of weight matrices.
result The method promotes positive knowledge transfer between tasks and allows for dynamic model complexity.

We consider a continuous family (fs)(f_s), s[0,1]s\in[0,1] of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or equivalently the sum of the affine Milnor number and the Milnor number at infinity $μ(s)+λ…

2003-05-27abs ↗pdf ↗

Continuous epimorphisms between certain mapping class groups are induced by homeomorphisms.

problem Understanding continuous epimorphisms between specific mapping class groups.
method Analyzing subgroups of mapping class groups of infinite-genus 2-manifolds with no planar ends.
result Continuous epimorphisms are induced by homeomorphisms for the specified subgroups.

Develops a statistical learning framework for personalized asset allocation.

problem Continuous-action decision-making with a large number of characteristics.
method Discretization approach with generalized penalties for penalized regression.
result Improves financial well-being with individualized optimal asset allocation.

The paper designs neural networks with assurance for controlling nonlinear systems.

problem Designing neural networks with assurance for nonlinear system control.
method Bounding the number of affine functions needed for a CPWA function, connecting it to a TLL NN architecture.
result The TLL NN architecture is parameterized by the number of affine functions in the CPWA function it realizes.

We study the Gibbs sampling algorithm for continuous determinantal point processes. We show that, given a warm start, the Gibbs sampler generates a random sample from a continuous kk-DPP defined on a dd-dimensional domain by only taking poly(k)\text{poly}(k) number of steps. As an application, we design an algorithm to ge…

2018-10-20abs ↗pdf ↗

Discrete random variables are natural components of probabilistic clustering models. A number of VAE variants with discrete latent variables have been developed. Training such methods requires marginalizing over the discrete latent variables, causing training time complexity to be linear in the number clusters. By appl…

2019-09-18abs ↗pdf ↗

Continuous time stochastic processes are useful models especially for financial and insurance purposes. The numerical simulation of such models is dependant of the time discrete discretization, of the parametric estimation and of the choice of a random number generator. The aim of this paper is to provide the tools for…

2010-01-12abs ↗pdf ↗

We present a new method of learning a continuous occupancy field for use in robot navigation. Occupancy grid maps, or variants of, are possibly the most widely used and accepted method of building a map of a robot's environment. Various methods have been developed to learn continuous occupancy maps and have successfull…

2019-10-18abs ↗pdf ↗

Simple neural networks approximate any continuous function with fixed neurons.

problem Approximating arbitrary continuous functions with limited neurons.
method Developed simple feed-forward neural networks with a specific activation function.
result Proven that networks with 36d(2d+1) neurons and depth 11 can approximate any continuous function.

We propose a method for tackling catastrophic forgetting in deep reinforcement learning that is \textit{agnostic} to the timescale of changes in the distribution of experiences, does not require knowledge of task boundaries, and can adapt in \textit{continuously} changing environments. In our \textit{policy consolidati…

2019-02-01abs ↗pdf ↗